WorldWideScience

Sample records for rigorous upper bound

  1. Rigorous bounds on the free energy of electron-phonon models

    NARCIS (Netherlands)

    Raedt, Hans De; Michielsen, Kristel

    1997-01-01

    We present a collection of rigorous upper and lower bounds to the free energy of electron-phonon models with linear electron-phonon interaction. These bounds are used to compare different variational approaches. It is shown rigorously that the ground states corresponding to the sharpest bounds do no

  2. Upper Bounds on Numerical Approximation Errors

    DEFF Research Database (Denmark)

    Raahauge, Peter

    2004-01-01

    This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function....... The bounds apply to moregeneral problems than existing bounding methods do. For instance, since strict concavityis not required, linear models and piecewise linear approximations can bedealt with. Despite the generality, the bounds perform well in comparison with existingmethods even when applied...... to approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...

  3. Rigorous Performance Bounds for Quadratic and Nested Dynamical Decoupling

    CERN Document Server

    Xia, Yuhou; Lidar, Daniel A

    2011-01-01

    We present rigorous performance bounds for the quadratic dynamical decoupling (QDD) pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We prove that if the total sequence time is fixed then the trace-norm distance between the unperturbed and protected system states can be made arbitrarily small by increasing the number of applied pulses.

  4. Upper bounds for centerlines

    CERN Document Server

    Bukh, Boris

    2011-01-01

    In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every halfspace that contains f contains at least that many points of S. This claim is true and tight for k=0 (this is Rado's centerpoint theorem), as well as for k = d-1 (trivial). Bukh et al. showed the existence of a (d-2)-flat at depth (d-1) n / (2d-1) - O(1) (the case k = d-2). In this paper we concentrate on the case k=1 (the case of "centerlines"), in which the conjectured value for the leading constant is 2/(d+2). We prove that 2/(d+2) is an *upper bound* for the leading constant. Specifically, we show that for every fixed d and every n there exists an n-point set in R^d for which no line in R^d lies at depth larger than 2n/(d+2) + o(n). This point set is the "stretched grid"---a set which has been previously used by Bukh et al. for other related purposes.

  5. Rigorous bounds on aerosol optical properties from measurement and/or model constraints

    Science.gov (United States)

    McGraw, Robert; Fierce, Laura

    2016-04-01

    Sparse-particle aerosol models are an attractive alternative to sectional and modal methods for representation of complex, generally mixed particle populations. In the quadrature method of moments (QMOM) a small set of abscissas and weights, determined from distributional moments, provides the sparse set. Linear programming (LP) yields a generalization of the QMOM that is especially convenient for sparse particle selection. In this paper we use LP to obtain rigorous, nested upper and lower bounds to aerosol optical properties in terms of a prescribed Bayesian-like sequence of model or simulated measurement constraints. Examples of such constraints include remotely-sensed light extinction at different wavelengths, modeled particulate mass, etc. Successive reduction in bound separation with each added constraint provides a quantitative measure of its contextual information content. The present study is focused on univariate populations as a first step towards development of new simulation algorithms for tracking the physical and optical properties of multivariate particle populations.

  6. Upper Bounds for the Laplacian Graph Eigenvalues

    Institute of Scientific and Technical Information of China (English)

    Jiong Sheng LI; Yong Liang PAN

    2004-01-01

    We first apply non-negative matrix theory to the matrix K = D + A, where D and A are the degree-diagonal and adjacency matrices of a graph G, respectively, to establish a relation on the largest Laplacian eigenvalue λ1 (G) of G and the spectral radius ρ(K) of K. And then by using this relation we present two upper bounds for λ1 (G) and determine the extremal graphs which achieve the upper bounds.

  7. Generalized upper bound for inelastic diffraction

    Science.gov (United States)

    Troshin, S. M.; Tyurin, N. E.

    2017-01-01

    For inelastic diffraction, we obtain an upper bound valid for the whole range of the elastic scattering amplitude variation allowed by unitarity. We discuss the energy dependence of the inelastic diffractive cross-section on the base of this bound and recent Large Hadron Collider (LHC) data.

  8. A generalized upper bound for inelastic diffraction

    CERN Document Server

    Troshin, S M

    2016-01-01

    For the inelastic diffraction, we obtain an upper bound valid in the whole range of the elastic scattering amplitude variation allowed by unitarity. We discuss the energy dependence of the inelastic diffractive cross-section on the base of this bound and recent LHC data.

  9. Effective Height Upper Bounds on Algebraic Tori

    CERN Document Server

    Habegger, Philipp

    2012-01-01

    The main emphasis will be on height upper bounds in the algebraic torus G^{n}_{m}. By height we will mean the absolute logarithmic Weil height. Section 3.2 contains a precise definition of this and other more general height functions. The first appendix gives a short overview of known results in the abelian case. The second appendix contains a few height bounds in Shimura varieties.

  10. Upper bounds on the photon mass

    CERN Document Server

    Accioly, Antonio; Scatena, Eslley; 10.1103/PhysRevD.82.065026

    2010-01-01

    The effects of a nonzero photon rest mass can be incorporated into electromagnetism in a simple way using the Proca equations. In this vein, two interesting implications regarding the possible existence of a massive photon in nature, i.e., tiny alterations in the known values of both the anomalous magnetic moment of the electron and the gravitational deflection of electromagnetic radiation, are utilized to set upper limits on its mass. The bounds obtained are not as stringent as those recently found; nonetheless, they are comparable to other existing bounds and bring new elements to the issue of restricting the photon mass.

  11. Upper bounds on superpartner masses from upper bounds on the Higgs boson mass.

    Science.gov (United States)

    Cabrera, M E; Casas, J A; Delgado, A

    2012-01-13

    The LHC is putting bounds on the Higgs boson mass. In this Letter we use those bounds to constrain the minimal supersymmetric standard model (MSSM) parameter space using the fact that, in supersymmetry, the Higgs mass is a function of the masses of sparticles, and therefore an upper bound on the Higgs mass translates into an upper bound for the masses for superpartners. We show that, although current bounds do not constrain the MSSM parameter space from above, once the Higgs mass bound improves big regions of this parameter space will be excluded, putting upper bounds on supersymmetry (SUSY) masses. On the other hand, for the case of split-SUSY we show that, for moderate or large tanβ, the present bounds on the Higgs mass imply that the common mass for scalars cannot be greater than 10(11)  GeV. We show how these bounds will evolve as LHC continues to improve the limits on the Higgs mass.

  12. Upper and lower bounds on quantum codes

    Science.gov (United States)

    Smith, Graeme Stewart Baird

    This thesis provides bounds on the performance of quantum error correcting codes when used for quantum communication and quantum key distribution. The first two chapters provide a bare-bones introduction to classical and quantum error correcting codes, respectively. The next four chapters present achievable rates for quantum codes in various scenarios. The final chapter is dedicated to an upper bound on the quantum channel capacity. Chapter 3 studies coding for adversarial noise using quantum list codes, showing there exist quantum codes with high rates and short lists. These can be used, together with a very short secret key, to communicate with high fidelity at noise levels for which perfect fidelity is, impossible. Chapter 4 explores the performance of a family of degenerate codes when used to communicate over Pauli channels, showing they can be used to communicate over almost any Pauli channel at rates that are impossible for a nondegenerate code and that exceed those of previously known degenerate codes. By studying the scaling of the optimal block length as a function of the channel's parameters, we develop a heuristic for designing even better codes. Chapter 5 describes an equivalence between a family of noisy preprocessing protocols for quantum key distribution and entanglement distillation protocols whose target state belongs to a class of private states called "twisted states." In Chapter 6, the codes of Chapter 4 are combined with the protocols of Chapter 5 to provide higher key rates for one-way quantum key distribution than were previously thought possible. Finally, Chapter 7 presents a new upper bound on the quantum channel capacity that is both additive and convex, and which can be interpreted as the capacity of the channel for communication given access to side channels from a class of zero capacity "cloning" channels. This "clone assisted capacity" is equal to the unassisted capacity for channels that are degradable, which we use to find new upper

  13. Pre-rigor temperature and the relationship between lamb tenderisation, free water production, bound water and dry matter.

    Science.gov (United States)

    Devine, Carrick; Wells, Robyn; Lowe, Tim; Waller, John

    2014-01-01

    The M. longissimus from lambs electrically stimulated at 15 min post-mortem were removed after grading, wrapped in polythene film and held at 4 (n=6), 7 (n=6), 15 (n=6, n=8) and 35°C (n=6), until rigor mortis then aged at 15°C for 0, 4, 24 and 72 h post-rigor. Centrifuged free water increased exponentially, and bound water, dry matter and shear force decreased exponentially over time. Decreases in shear force and increases in free water were closely related (r(2)=0.52) and were unaffected by pre-rigor temperatures. © 2013.

  14. New upper bounds for kissing numbers from semidefinite programming

    NARCIS (Netherlands)

    C. Bachoc; F. Vallentin (Frank)

    2006-01-01

    htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known)

  15. New upper bounds for kissing numbers from semidefinite programming

    NARCIS (Netherlands)

    C. Bachoc; F. Vallentin (Frank)

    2008-01-01

    htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known)

  16. Upper bounds on the solution of coupled algebraic riccati equation

    Directory of Open Access Journals (Sweden)

    Czornik Adam

    2001-01-01

    Full Text Available Upper bounds for eigenvalues of a solution to continuous time coupled algebraic Riccati equation (CCARE and discrete time coupled algebraic Riccati equation (DCARE are developed as special cases of bounds for the unified coupled algebraic Riccati equation (UCARE. They include bounds of the maximal eigenvalues, the sums of the eigenvalues and the trace.

  17. Upper bounds for reversible circuits based on Young subgroups

    DEFF Research Database (Denmark)

    Abdessaied, Nabila; Soeken, Mathias; Thomsen, Michael Kirkedal;

    2014-01-01

    We present tighter upper bounds on the number of Toffoli gates needed in reversible circuits. Both multiple controlled Toffoli gates and mixed polarity Toffoli gates have been considered for this purpose. The calculation of the bounds is based on a synthesis approach based on Young subgroups that...... that results in circuits using a more generalized gate library. Starting from an upper bound for this library we derive new bounds which improve the existing bound by around 77%. © 2014 Elsevier B.V. All rights reserved....

  18. A sharp upper bound for departure from normality

    Energy Technology Data Exchange (ETDEWEB)

    Lee, S.L.

    1993-08-01

    The departure from normality of a matrix is a real scalar that is impractical to compute if a matrix is large and its eigenvalues are unknown. A simple formula is presented for computing an upper bound for departure from normality in the Frobenius norm. This new upper bound is cheaper to compute than the upper bound derived by Henrici. Moreover, the new bound is sharp for Hermitian matrices, skew-Hermitian matrices and, in general, any matrix with eigenvalues that are horizontally or vertically aligned in the complex plane. In terms of applications, the new bound can be used in computing bounds for the spectral norm of matrix functions or bounds for the sensitivity of eigenvalues to matrix perturbations.

  19. Upper Maxwellian bounds for the spatially homogeneous Boltzmann equation

    OpenAIRE

    Gamba, I. M.; Panferov, V.; Villani, C.

    2007-01-01

    For the spatially homogeneous Boltzmann equation with cutoff hard potentials it is shown that solutions remain bounded from above, uniformly in time, by a Maxwellian distribution, provided the initial data have a Maxwellian upper bound. The main technique is based on a comparison principle that uses a certain dissipative property of the linear Boltzmann equation. Implications of the technique to propagation of upper Maxwellian bounds in the spatially-inhomogeneous case are discussed.

  20. Thermodynamic upper bound on broadband light coupling with photonic structures.

    Science.gov (United States)

    Yu, Zongfu; Raman, Aaswath; Fan, Shanhui

    2012-10-26

    The coupling between free space radiation and optical media critically influences the performance of optical devices. We show that, for any given photonic structure, the sum of the external coupling rates for all its optical modes are subject to an upper bound dictated by the second law of thermodynamics. Such bound limits how efficient light can be coupled to any photonic structure. As one example of application, we use this upper bound to derive the limit of light absorption in broadband solar absorbers.

  1. Inequalities Involving Upper Bounds for Certain Matrix Operators

    Indian Academy of Sciences (India)

    R Lashkaripour; D Foroutannia

    2006-08-01

    In this paper, we considered the problem of finding the upper bound Hausdorff matrix operator from sequence spaces $l_p(v)$ (or $d(v,p)$) into $l_p(w)$ (or $d(w, p)$). Also we considered the upper bound problem for matrix operators from $d(v,1)$ into $d(w,1)$, and matrix operators from $e(w,∞)$ into $e(v,∞)$, and deduce upper bound for Cesaro, Copson and Hilbert matrix operators, which are recently considered in [5] and [6] and similar to that in [10].

  2. Stress-based upper-bound method and convex optimization: case of the Gurson material

    Science.gov (United States)

    Pastor, Franck; Trillat, Malorie; Pastor, Joseph; Loute, Etienne

    2006-04-01

    A nonlinear interior point method associated with the kinematic theorem of limit analysis is proposed. Associating these two tools enables one to determine an upper bound of the limit loading of a Gurson material structure from the knowledge of the sole yield criterion. We present the main features of the interior point algorithm and an original method providing a rigorous kinematic bound from a stress formulation of the problem. This method is tested by solving in plane strain the problem of a Gurson infinite bar compressed between rough rigid plates. To cite this article: F. Pastor et al., C. R. Mecanique 334 (2006).

  3. Upper bounds for domination related parameters in graphs on surfaces

    Directory of Open Access Journals (Sweden)

    Vladimir Samodivkin

    2016-08-01

    Full Text Available In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorientable genus and maximum degree.

  4. Upper bounds on minimum cardinality of exact and approximate reducts

    KAUST Repository

    Chikalov, Igor

    2010-01-01

    In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.

  5. A New Upper Bound on 2D Online Bin Packing

    OpenAIRE

    Han, Xin; Francis Y L Chin; Ting, Hing-Fung; Zhang, Guochuan

    2009-01-01

    The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its asymptotic competitive ratio has attracted great research attention. In a long series of papers, the lower bound of this ratio has been improved from 1.808, 1.856 to 1.907 and its upper bound reduced from 3.25, 3.0625, 2.8596, 2.7834 to 2.66013. In this paper, we rewrite the upper bound record to 2.5545. Our idea for the improvement is as follows. In SODA 2002 \\cite{SS03}, Seiden and van Stee p...

  6. Thermodynamic Upper Bound on Broadband Light Coupling with Photonic Structures

    KAUST Repository

    Yu, Zongfu

    2012-10-01

    The coupling between free space radiation and optical media critically influences the performance of optical devices. We show that, for any given photonic structure, the sum of the external coupling rates for all its optical modes are subject to an upper bound dictated by the second law of thermodynamics. Such bound limits how efficient light can be coupled to any photonic structure. As one example of application, we use this upper bound to derive the limit of light absorption in broadband solar absorbers. © 2012 American Physical Society.

  7. Upper Bounds for Ruin Probability with Stochastic Investment Return

    Institute of Scientific and Technical Information of China (English)

    ZHANG Lihong

    2005-01-01

    Risk models with stochastic investment return are widely held in practice, as well as in more challenging research fields. Risk theory is mainly concerned with ruin probability, and a tight bound for ruin probability is the best for practical use. This paper presents a discrete time risk model with stochastic investment return. Conditional expectation properties and martingale inequalities are used to obtain both exponential and non-exponential upper bounds for the ruin probability.

  8. Upper bounds for prime gaps related to Firoozbakht's conjecture

    OpenAIRE

    Kourbatov, Alexei

    2015-01-01

    We study two kinds of conjectural bounds for the prime gap after the k-th prime $p_k$: (A) $p_{k+1} 9$. The upper bound (A) is equivalent to Firoozbakht's conjecture. We prove that (A) implies (B) with $b=1$; on the other hand, (B) with $b=1.17$ implies (A). We also give other sufficient conditions for (A) that have the form (B) with $b\\to1$ as $p_k\\to\\infty$.

  9. Upper bounds for parabolic equations and the Landau equation

    Science.gov (United States)

    Silvestre, Luis

    2017-02-01

    We consider a parabolic equation in nondivergence form, defined in the full space [ 0 , ∞) ×Rd, with a power nonlinearity as the right-hand side. We obtain an upper bound for the solution in terms of a weighted control in Lp. This upper bound is applied to the homogeneous Landau equation with moderately soft potentials. We obtain an estimate in L∞ (Rd) for the solution of the Landau equation, for positive time, which depends only on the mass, energy and entropy of the initial data.

  10. Upper bounds for Neyman-Pearson cooperative spectrum sensing

    KAUST Repository

    Zahabi, Sayed Jalal

    2011-06-01

    We consider a cooperative spectrum sensing scenario where the local sensors at the secondary users are viewed as one-level quantizers, and the quantized data are to be fused under Neyman-Pearson (N-P) criterion. We demonstrate how the N-P fusion results in a randomized test, which represents the total performance of our spectrum sensing scheme. We further introduce an upper performance bound for the overall primary user signal detection. An analytical procedure towards the upper bound and its relevant quantization setup at the local sensors are proposed and examined through simulations. © 2011 IEEE.

  11. Upper Bound to the Ionization Energy of 85Rb2

    CERN Document Server

    Bellos, M A; Banerjee, J; Ascoli, M; Allouche, A -R; Eyler, E E; Gould, P L; Stwalley, W C

    2013-01-01

    We report an upper bound to the ionization energy of 85Rb2 of 31348.0(6) cm-1, which also provides a lower bound to the dissociation energy D0 of 85Rb2+ of 6307.5(6) cm-1. These bounds were measured by the onset of autoionization of excited states of 85Rb2 below the 5s+7p atomic limit. We form 85Rb2 molecules via photoassociation of ultracold 85Rb atoms, and subsequently excite the molecules by single-photon ultraviolet transitions to states above the ionization threshold.

  12. EQUILIBRIUM PROBLEMS WITH LOWER AND UPPER BOUNDS IN TOPOLOGICAL SPACES

    Institute of Scientific and Technical Information of China (English)

    Ding Xieping

    2005-01-01

    By employing a fixed point theorem due to Ding, Park and Jung, some existence theorems of solutions for equilibrium problems with lower and upper bounds are proved in noncompact topological spaces. These results further answer the open problem raised by Isac, Sehgal and Singh under much weaker assumptions.

  13. A Method for Upper Bounding on Network Access Speed

    DEFF Research Database (Denmark)

    Knudsen, Thomas Phillip; Patel, A.; Pedersen, Jens Myrup;

    2004-01-01

    This paper presents a method for calculating an upper bound on network access speed growth and gives guidelines for further research experiments and simulations. The method is aimed at providing a basis for simulation of long term network development and resource management....

  14. Reexploring the upper bound for the chromatic number of graphs

    Institute of Scientific and Technical Information of China (English)

    LI Shuchao; MAO Jingzhong

    2004-01-01

    The upper bound of the chromatic number of simple graphs is explored. Its original idea comes from Coffman, Hakimi and Schmeichel, who recently studied the chromatic number of graphs with strong conditions. In this paper, corresponding conditions are weakened and the result proves that of Ershov and Kozhukhin's.

  15. Improved semidefinite programming upper bound on distillable entanglement

    Science.gov (United States)

    Wang, Xin; Duan, Runyao

    2016-11-01

    An additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial transpose (PPT). This quantity is always smaller than or equal to the logarithmic negativity, the previously best known SDP bound on distillable entanglement, and the inequality is strict in general. Furthermore, a succinct SDP characterization of the one-copy PPT deterministic distillable entanglement for any given state is also obtained, which provides a simple but useful lower bound on the PPT distillable entanglement. Remarkably, there is a genuinely mixed state of which both bounds coincide with the distillable entanglement, while being strictly less than the logarithmic negativity.

  16. Local orthogonality provides a tight upper bound for Hardy's nonlocality

    Science.gov (United States)

    Das, Subhadipa; Banik, Manik; Gazi, Md. Rajjak; Rai, Ashutosh; Kunkri, Samir

    2013-12-01

    The amount of nonlocality in quantum theory is limited compared to that allowed in generalized no-signaling theory [S. Popescu and D. Rohrlich, Found. Phys.FNDPA40015-901810.1007/BF02058098 24, 379 (1994)]. This feature, for example, gets manifested in the amount of Bell inequality violation as well as in the degree of success probability of Hardy's (Cabello's) nonlocality argument. Physical principles like information causality and macroscopic locality have been proposed for analyzing restricted nonlocality in quantum mechanics, viz. explaining the Cirel'son bound. However, these principles are not very successful in explaining the maximum success probability of Hardy's as well as Cabello's argument in quantum theory. Here we show that a recently proposed physical principle, namely local orthogonality, does better by providing a tighter upper bound on the success probability for Hardy's nonlocality. This bound is relatively closer to the corresponding quantum value compared to the bounds achieved from other principles.

  17. Upper Bounds for Maximally Greedy Binary Search Trees

    CERN Document Server

    Fox, Kyle

    2011-01-01

    At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Derryberry et al. As part of their results, Demaine et al. considered GreedyFuture, an offline BST algorithm that greedily rearranges the search path to minimize the cost of future searches. They showed that GreedyFuture is actually an online algorithm in their geometric view, and that there is a way to turn GreedyFuture into an online BST algorithm with only a constant factor increase in total search cost. Demaine et al. conjectured this algorithm was dynamically optimal, but no upper bounds were given in their paper. We prove the first non-trivial upper bounds for the cost of search operations using GreedyFuture including giving an access lemma similar to that found in Sleator and Tarjan's classic paper on splay trees.

  18. Upper Capacity Bounds of MIMO Wireless Systems Through Fading Channels

    Directory of Open Access Journals (Sweden)

    Rachna Mahey

    2015-01-01

    Full Text Available This paper investigates the upper capacity bounds of MIMO systems with correlation and antenna selection techniques in general fading environments. With Antenna Selection techniques, the increased hardware complexity due to multiple antennas and large number of RF chains can be reduced to a substantial amount, retaining the diversity benefits of MIMO systems. The channel Correlation also affects the capacity of MIMO fading channels. Hence, to evaluate the upper bounds of capacity through fading channels, performance of MIMO systems is exemplified under Nakagami-m and Rayleigh fading channels while considering that the channel characteristics are known at a transmitter. The obtained results give an assessment to the better understanding to the effect of antenna selection and correlation on the capacity of MIMO channels, and how they can be used in different fading environments.

  19. Investigation of the Bimetal Clad Drawing by Upper Bound Method

    Science.gov (United States)

    Malaki, Massoud; Maleki, Hamid; Malaki, Mohsen; Roohani, Hamid Reza

    2013-04-01

    In this research, a mathematical model for the cold drawing of bilayered strip is presented by the upper bound method. In terms of effective process parameters such as drawing power, drawing force, layer reductions, and bonding strength of the bimetal strip, the effect of total relative thickness reduction has been investigated using the upper bound theorem. Also, bonding strength is calculated using the method. In order to verify the theoretical model, a series of experiments on bilayer strip drawing are implemented by aluminum and mild steel material strips. Through the study, it can clearly been concluded that the presented analytical approach is applicable for simulating and estimating the cold drawing process of the bilayer sheets and it is able to offer a good knowledge through producing the bimetal sheets.

  20. Upper bounds on the entropy of radiation systems

    Institute of Scientific and Technical Information of China (English)

    汪定雄

    1997-01-01

    The upper bounds on the entropy of a radiation system confined to a spherical box are calculated in six cases by using the equation of state of radiation in flat spacetime and the equation of state of radiation near black-hole horizon,which was derived by Li and Liu (hereafter the Li-Liu equation).It turns out that the Li-Liu equation does have unique advantage in dealing with the entropy bound of critical self-gravitating radiation systems,while the usual equation of state will result in entropy divergence.In the case of non-self-gravitating radiation systems and non-critical self-gravitating radiation systems,there is no difference in the entropy bounds derived by these two equations of state.

  1. Computing an upper bound on contact stress with surrogate duality

    Science.gov (United States)

    Xuan, Zhaocheng; Papadopoulos, Panayiotis

    2016-07-01

    We present a method for computing an upper bound on the contact stress of elastic bodies. The continuum model of elastic bodies with contact is first modeled as a constrained optimization problem by using finite elements. An explicit formulation of the total contact force, a fraction function with the numerator as a linear function and the denominator as a quadratic convex function, is derived with only the normalized nodal contact forces as the constrained variables in a standard simplex. Then two bounds are obtained for the sum of the nodal contact forces. The first is an explicit formulation of matrices of the finite element model, derived by maximizing the fraction function under the constraint that the sum of the normalized nodal contact forces is one. The second bound is solved by first maximizing the fraction function subject to the standard simplex and then using Dinkelbach's algorithm for fractional programming to find the maximum—since the fraction function is pseudo concave in a neighborhood of the solution. These two bounds are solved with the problem dimensions being only the number of contact nodes or node pairs, which are much smaller than the dimension for the original problem, namely, the number of degrees of freedom. Next, a scheme for constructing an upper bound on the contact stress is proposed that uses the bounds on the sum of the nodal contact forces obtained on a fine finite element mesh and the nodal contact forces obtained on a coarse finite element mesh, which are problems that can be solved at a lower computational cost. Finally, the proposed method is verified through some examples concerning both frictionless and frictional contact to demonstrate the method's feasibility, efficiency, and robustness.

  2. Revisiting the upper bounding process in a safe Branch and Bound algorithm

    CERN Document Server

    Goldsztejn, Alexandre; Michel, Claude; Rueher, Michel

    2008-01-01

    Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equations and inequalities. More precisely, it exploits the optimal solution of a linear relaxation of the problem to compute efficiently a promising upper bound. First experiments on the Coconuts benchmarks demonstrate that this approach is very effective.

  3. Rigorous upper bounds for fluid and plasma transport due to passive advection

    Energy Technology Data Exchange (ETDEWEB)

    Krommes, J.A.; Smith, R.A.; Kim, C.B.

    1987-07-01

    The formulation of variational principles for transport due to passive advection is described. A detailed account of the work has been published elsewhere. In the present paper, the motivations, philosophy, and implications of the method are briefly discussed. 15 refs.

  4. Estimates and Rigorous Bounds on Pore-Fluid Enhanced Shear Modulus in Poroelastic Media with Hard and Soft Anisotropy

    Energy Technology Data Exchange (ETDEWEB)

    Berryman, J G

    2005-01-24

    A general analysis of poroelasticity for hexagonal, tetragonal, and cubic symmetry shows that four eigenvectors are pure shear modes with no coupling to the pore-fluid mechanics. The remaining two eigenvectors are linear combinations of pure compression and uniaxial shear, both of which are coupled to the fluid mechanics. The analysis proceeds by first reducing the problem to a 2 x 2 system. The poroelastic system including both anisotropy in the solid elastic frame (i.e., with ''hard anisotropy''), and also anisotropy of the poroelastic coefficients (''soft anisotropy'') is then studied in some detail. In the presence of anisotropy and spatial heterogeneity, mechanics of the pore fluid produces shear dependence on fluid bulk modulus in the overall poroelastic system. This effect is always present (though sometimes small in magnitude) in the systems studied, and can be comparatively large (up to a maximum increase of about 20 per cent) in some porous media--including porous glass and Schuler-Cotton Valley sandstone. General conclusions about poroelastic shear behavior are also related to some recently derived product formulas that determine overall shear response of these systems. Another method is also introduced based on rigorous Hashin-Shtrikman-style bounds for nonporous random polycrystals, followed by related self-consistent estimates of mineral constants for polycrystals. Then, another self-consistent estimation method is formulated for the porous case, and used to estimate drained and undrained effective constants. These estimates are compared and contrasted with the results of the first method and a consistent picture of the overall behavior is found in three computed examples for polycrystals of grains having tetragonal symmetry.

  5. Upper and Lower Bounds on the Minimum Distance of Expander Codes

    CERN Document Server

    Frolov, Alexey

    2011-01-01

    The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the minimum distance of some families of expander codes are obtained. A lower bound on the minimum distance of low-density parity-check (LDPC) codes with a Reed--Solomon constituent code over GF(q) is obtained. The bound is shown to be very close to the VG bound and to lie above the upper bound for expander codes.

  6. Near theoretical upper bound new loosely synchronous complementary spreading sequences

    Institute of Scientific and Technical Information of China (English)

    YU Zheng; YANG Xing; ZOU Yongzhong; LI Daoben; SUN Yuhao

    2007-01-01

    A new class of loosely synchronous (LS) spreading sequences wlth zero correlation window(ZCW)was presented.It was constructed by making Kronecker product of orthogonal matrix and ZCW complementary sequences.This new LS sequonce increases the number of perfect complementary pairs and extends ZCW within the same group.Moreover,both auto-correlation and cross-correlation of ZCW in the same group remain identical.The minimum ZCW among difierent groups is the same as that of basic LS sequences.The method for constructing these new LS sequences is presented and ZCW properties are also verifled.The number of these new LS sequences is only smaller than theoretical upper bound by one.

  7. Upper Bounds on Performance Measures of Heterogeneous // Queues

    Directory of Open Access Journals (Sweden)

    F. S. Q. Alves

    2011-01-01

    Full Text Available In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion of the state space that is followed by an approximate reduction of the state space, only considering the most probable states. In most cases tested, we were able to approximate the actual behavior of the system with smaller errors than those obtained from traditional homogeneous multiserver Markovian queues, as shown by GPSS simulations. In addition, we have correlated the quality of the approximation with the degree of heterogeneity of the system, which was evaluated using its Gini index. Finally, we have shown that the bounds are robust and still useful, even considering quite different allocation strategies. A large number of simulation results show the accuracy of the proposed method that is better than that of classical homogeneous multiserver Markovian formulae in many situations.

  8. Distributed MIMO receiver - Achievable rates and upper bounds

    CERN Document Server

    Sanderovich, Amichai; Steinberg, Yossef

    2007-01-01

    In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex Gaussian noise. In the nomadic regime, we assume that the agents do not have any decoding ability. These agents process their channel observations and forward them to the final destination through lossless links with a fixed capacity. We propose new achievable rates based on elementary compression and also on a Wyner-Ziv (CEO-like) processing, for both fast fading and block fading channels, as well as for general discrete channels. The simpler two agents scheme is solved, up to an implicit equation with a single variable. Limiting the nomadic transmitter to a circular-symmetric complex Gaussian signalling, new upper bounds are derived for both fast and block fading, based on the vector version of the entropy power inequality. These bounds are then compared to the achievable rate...

  9. An upper bound on the number of independent sets in a tree

    DEFF Research Database (Denmark)

    Vestergaard, Preben Dahl; Pedersen, Anders Sune

    The main result of this paper is an upper bound on the number of independent sets in a tree in terms of the order and diameter of the tree. This new upper bound is a refinement of the bound given by Prodinger and Tichy [Fibonacci Q., 20 (1982), no. 1, 16-21]. Finally, we give a sufficient condition...... for the new upper bound to be better than the upper bound given by Brigham, Chandrasekharan and Dutton [Fibonacci Q., 31 (1993), no. 2, 98-104]....

  10. An upper bound on the number of independent sets in a tree

    DEFF Research Database (Denmark)

    Vestergaard, Preben D.; Pedersen, Anders Sune

    2007-01-01

    The main result of this paper is an upper bound on the number of independent sets in a tree in terms of the order and diameter of the tree. This new upper bound is a refinement of the bound given by Prodinger and Tichy [ Fibonacci Q., 20 (1982), no. 1, 16-21]. Finally, we give a sufficient...... condition for the new upper bound to be better thatn the upper bound given by Brigham, Chandrasekharan and Dutton [ Fibonacci Q., 31 (1993), no. 2, 98-104]....

  11. Upper bounds on the number of errors corrected by a convolutional code

    DEFF Research Database (Denmark)

    Justesen, Jørn

    2004-01-01

    We derive upper bounds on the weights of error patterns that can be corrected by a convolutional code with given parameters, or equivalently we give bounds on the code rate for a given set of error patterns. The bounds parallel the Hamming bound for block codes by relating the number of error pat...

  12. Sharp Upper and Lower Bounds for the Laplacian Spectral Radius and the Spectral Radius of Graphs

    Institute of Scientific and Technical Information of China (English)

    Ji-ming Guo

    2008-01-01

    In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius,respectively.

  13. An upper bound on the size of m-ary t-sEC/AUED codes

    Institute of Scientific and Technical Information of China (English)

    ZHANG Peng-cheng; FU Fang-wei; CHANG Zu-ling

    2006-01-01

    Finding good upper bound for the size of m-ary t-symmetric error correcting codes (t-sEC/AUED codes) codes is the main problem in the coding theory of m-ary t-sEC/AUED codes. Based on the method of Lagrange multipliers, We shall derive an upper bound on the size of m-ary t-sEC/AUED in this paper. Some examples achieved this upper bound are also given in this paper.

  14. Upper Bound for Queue length in Regulated Burst Service Scheduling

    Directory of Open Access Journals (Sweden)

    Mahmood Daneshvar Farzanegan

    2016-01-01

    Full Text Available Quality of Service (QoS provisioning is very important in next computer/communication networks because of increasing multimedia services. Hence, very investigations are performed in this area. Scheduling algorithms effect QoS provisioning. Lately, a scheduling algorithm called Regulated Burst Service Scheduling (RBSS suggested by author in [1] to provide a better service to bursty and delay sensitive services such as video. One of the most significant feature in RBSS is considering burstiness of arrival traffic in scheduling algorithm. In this paper, an upper bound of queue length or buffer size and service curve are calculated by Network Calculus analysis for RBSS. Because in RBSS queue length is a parameter that is considered in scheduling arbitrator, analysis results a differential inequality to obtain service curve. To simplify, arrival traffic is assumed to be linear that is defined in the paper clearly. This paper help to analysis delay in RBSS for different traffic with different specifications. Therefore, QoS provisioning will be evaluated.

  15. Power generation assets. Energy constraints, upper bounds and hedging strategies

    Energy Technology Data Exchange (ETDEWEB)

    Enge, Thomas

    2010-09-20

    The overall topic of this thesis is the valuation of power generation assets under energy and risk constraints. Our focus is on the modeling aspect i.e. to find the right balance between accuracy and computational feasibility. We define a new not yet investigated unit commitment problem that introduces an energy constraint to a thermal power plant. We define a continuous stochastic dynamic program with a nested mixed integer program (MIP). We introduce a fast implementation approach by replacing the MIP with an efficient matrix calculation and use principal component analysis to reduce the number of risk factors. We also provide a fast heuristic valuation approach for comparison. As both models can only provide lower bounds of the asset value, we investigate the theory of upper bounds for a proper validation of our power plant results. We review the primal dual algorithm for swing options by Meinshausen and Hambly and in particular clarify their notation and implementation. Then we provide an extension for swing options with multiple exercises at the same stage that we developed together with Prof. Bender, University of Braunschweig. We outline Prof. Bender's proof and describe the implementation in detail. Finally we provide a risk analysis for our thermal power plant. In particular we investigate strategies to reduce spot price risk to which power plants are significantly exposed. First, we focus on the measurement of spot price risk and propose three appropriate risk figures (Forward delta as opposed to Futures delta, synthetic spot delta and Earnings-at-Risk) and illustrate their application using a business case. Second we suggest risk mitigation strategies for both periods, before and in delivery. The latter tries to alter the dispatch policy i.e. pick less risky hours and accept a (desirably only slightly) smaller return. We introduce a benchmark that weighs risk versus return and that we will call EaR-efficient option value. We propose a mitigation

  16. An upper bound on the number of errors corrected by a convolutional code

    DEFF Research Database (Denmark)

    Justesen, Jørn

    2000-01-01

    The number of errors that a convolutional codes can correct in a segment of the encoded sequence is upper bounded by the number of distinct syndrome sequences of the relevant length.......The number of errors that a convolutional codes can correct in a segment of the encoded sequence is upper bounded by the number of distinct syndrome sequences of the relevant length....

  17. An upper bound for the L-S category of Sp(n)

    CERN Document Server

    Hunziker, Markus

    2009-01-01

    We prove that the (normalized) Lusternik-Schnirelmann category of the symplectic group Sp(n) is less or equal to [(n+2)^2/4]-1. Our techniques are Lie theoretic and can easily be generalized to find upper bounds for the Lusternik-Schnirelmann category of any simply connected compact Lie group. We conjecture that our upper bounds are sharp.

  18. Upper bound on the capacity of constrained three-dimensional codes

    DEFF Research Database (Denmark)

    Forchhammer, Søren

    2000-01-01

    An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order...

  19. Upper bound limit and shakedown analysis of elastic plastic bounded linearly kinematic hardening structures

    OpenAIRE

    2011-01-01

    This thesis develops a new FEM based algorithm for shakedown analysis of structures made of elastic plastic bounded linearly kinematic hardening material. Its concept can be briefly described as: Hardening law is simulated using a two-surface plastic model. One yield surface is the initial surface, defined by yield stress sigma_y, and the other one is the bounding surface, defined by ultimate strength sigma_u. The initial surface can translate inside the bounding surface without changing its ...

  20. The number of terms in the superpositions upper bounds the amount of the coherence change

    Science.gov (United States)

    Liu, Feng; Li, Fei

    2016-10-01

    For the l1 norm of coherence, what is the relation between the coherence of a state and the individual terms that by superposition yield the state? We find upper bounds on the coherence change before and after the superposition. When every term comes from one Hilbert subspace, the upper bound is the number of terms in the superpositions minus one. However, when the terms have support on orthogonal subspaces, the coherence of the superposition cannot be more the double of the above upper bound than the average of the coherence of the all terms being superposed.

  1. Hadamard upper bound on optimum joint decoding capacity of Wyner Gaussian cellular MAC

    KAUST Repository

    Shakir, Muhammad

    2011-09-01

    This article presents an original analytical expression for an upper bound on the optimum joint decoding capacity of Wyner circular Gaussian cellular multiple access channel (C-GCMAC) for uniformly distributed mobile terminals (MTs). This upper bound is referred to as Hadamard upper bound (HUB) and is a novel application of the Hadamard inequality established by exploiting the Hadamard operation between the channel fading matrix G and the channel path gain matrix Ω. This article demonstrates that the actual capacity converges to the theoretical upper bound under the constraints like low signal-to-noise ratios and limiting channel path gain among the MTs and the respective base station of interest. In order to determine the usefulness of the HUB, the behavior of the theoretical upper bound is critically observed specially when the inter-cell and the intra-cell time sharing schemes are employed. In this context, we derive an analytical form of HUB by employing an approximation approach based on the estimation of probability density function of trace of Hadamard product of two matrices, i.e., G and Ω. A closed form of expression has been derived to capture the effect of the MT distribution on the optimum joint decoding capacity of C-GCMAC. This article demonstrates that the analytical HUB based on the proposed approximation approach converges to the theoretical upper bound results in the medium to high signal to noise ratio regime and shows a reasonably tighter bound on optimum joint decoding capacity of Wyner GCMAC.

  2. Some upper and lower bounds on PSD-rank

    NARCIS (Netherlands)

    T. J. Lee (Troy); Z. Wei (Zhaohui); R. M. de Wolf (Ronald)

    2014-01-01

    textabstractPositive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these

  3. Some upper and lower bounds on PSD-rank

    NARCIS (Netherlands)

    Lee, T.; Wei, Z.; de Wolf, R.

    Positive semidefinite rank (PSD-rank) is a relatively new complexity measure on matrices, with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All

  4. The optimal upper bound of the number of generalized Euler configurations

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    Consider a generalized 3-body problem. The attraction force between any two bodies is proportional to the two "masses" and the b-th power of the mutual distance. Albouy and Fu have obtained the optimal upper bound of the number of generalized Euler configurations for the cases b 1 and b = 2, 3. This paper obtains the optimal upper bound for the remaining real values of b in a systematic way.

  5. A Sharp upper bound for the spectral radius of a nonnegative matrix and applications

    OpenAIRE

    You, Lihua; Shu, Yujie; Zhang, Xiao-Dong

    2016-01-01

    In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of a graph or a digraph. These results are new or generalize some known results.

  6. Memory effect in the upper bound of the heat flux induced by quantum fluctuations

    Science.gov (United States)

    Koide, T.

    2016-10-01

    Thermodynamic behaviors in a quantum Brownian motion coupled to a classical heat bath is studied. We then define a heat operator by generalizing the stochastic energetics and show the energy balance (first law) and the upper bound of the expectation value of the heat operator (second law). We further find that this upper bound depends on the memory effect induced by quantum fluctuations and hence the maximum extractable work can be qualitatively modified in quantum thermodynamics.

  7. An upper bound for the Hales-Jewett number HJ(4,2)

    OpenAIRE

    Lavrov, Mikhail

    2015-01-01

    We show that for $n$ at least $10^{11}$, any 2-coloring of the $n$-dimensional grid $[4]^n$ contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett Theorem, to which the best known general upper bound is due to Shelah; Shelah's recursion gives an upper bound between $2 \\uparrow \\uparrow 7$ and $2 \\uparrow \\uparrow 8$ for the case we consider, and no better value was previously known.

  8. Lower and Upper Bounds for Deniable Public-Key Encryption

    DEFF Research Database (Denmark)

    Bendlin, Rikke; Nielsen, Jesper Buus; Nordholt, Peter Sebastian

    2011-01-01

    the parties to change their internal state to make it look like a given ciphertext decrypts to a message different from what it really decrypts to. Deniable encryption was in this way introduced to allow to deny a message exchange and hence combat coercion. Depending on which parties can be coerced......, the security level, the flavor and the number of rounds of the cryptosystem, it is possible to define a number of notions of deniable encryption. In this paper we prove that there does not exist any non-interactive receiver-deniable cryptosystem with better than polynomial security. This also shows...... that it is impossible to construct a non-interactive bi-deniable public-key encryption scheme with better than polynomial security. Specifically, we give an explicit bound relating the security of the scheme to how efficient the scheme is in terms of key size. Our impossibility result establishes a lower bound...

  9. An Upper Bound of Essential Norm of Composition Operator on H2(Bn)

    Institute of Scientific and Technical Information of China (English)

    Zhihua CHEN; Liangying JIANG; Qiming YAN

    2012-01-01

    The authors give an upper bound of the essential norm of a composition operator on H2(Bn),which involves the counting function in the higher dimensional value distribution theory defined by S.S.Chern.A criterion is also given to assure that the composition operator on H2(Bn) is bounded or compact.

  10. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Bouyer, Patricia; Larsen, Kim Guldstrand;

    2005-01-01

    be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability and demonstrate how information about lower and upper bounds can be used to optimise the algorithm for bringing a difference bound matrix into normal form. Finally, we experimentally demonstrate that the new techniques...

  11. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Bouyer, P.; Larsen, Kim Guldstrand;

    2005-01-01

    , significantly coarser abstractions can be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability. We demonstrate how information about lower and upper bounds can be used to optimise the algorithm for bringing a difference bound matrix into normal form. Finally, we...

  12. An Upper Bound on the Entropy of Constrained 2d Fields

    DEFF Research Database (Denmark)

    Forchhammer, Søren; Justesen, Jørn

    1998-01-01

    An upper bound on the entropy of constrained 2D fields is presented. The constraints have to be symmetric in (at least) one of the two directions. The bound generalizes (in a weaker form) the bound of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, p.54-60, 1998) which is valid...... only for processes with symmetric transfer matrices. Results are given for constraints specified by run-length limits and minimum distance between pixels of the same color...

  13. Upper and Lower Bounds of Frequency Interval Gramians for a Class of Perturbed Linear Systems

    DEFF Research Database (Denmark)

    Shaker, Hamid Reza

    2012-01-01

    if the system is controllable or observable, but also it is required to know the degree of controllability or observability of the system. Gramian matrices were introduced to address this issue by providing a quantitative measure for controllability and observability. In many applications, the information...... of uncertain systems. In this paper, we derive upper and lower bounds of frequency interval gramians under perturbations of an A-matrix in the state-space form. These bounds are obtained by solving algebraic Riccati equations. The results are further used to obtain upper and lower bounds of the frequency...

  14. The inverse maximum flow problem with lower and upper bounds for the flow

    Directory of Open Access Journals (Sweden)

    Deaconu Adrian

    2008-01-01

    Full Text Available The general inverse maximum flow problem (denoted GIMF is considered, where lower and upper bounds for the flow are changed so that a given feasible flow becomes a maximum flow and the distance (considering l1 norm between the initial vector of bounds and the modified vector is minimum. Strongly and weakly polynomial algorithms for solving this problem are proposed. In the paper it is also proved that the inverse maximum flow problem where only the upper bound for the flow is changed (IMF is a particular case of the GIMF problem.

  15. Analytical upper bound on optimum joint decoding capacity of Wyner GCMAC using hadamard inequality

    KAUST Repository

    Shakir, Muhammad

    2011-11-01

    This paper presents an original analytical expression for an upper bound on the optimum joint decoding capacity of Wyner circular Gaussian cellular multiple access channel (C-GCMAC) for uniformly distributed mobile terminals (MTs) across the cells. This upper bound is referred to as Hadamard upper bound (HUB) and is a novel application of the Hadamard inequality established by exploiting the Hadamard operation between the channel fading and channel path gain matrices. In this context, we employ an approximation approach based on the estimation of probability density function (PDF) of Hadamard product of two matrices. A closed-form expression has been derived to capture the effect of variable user density in adjacent cells on optimal joint decoding capacity. The results of this paper demonstrate that the analytical HUB based on the proposed approximation approach converges to the theoretical results for medium range of signal to noise ratios and shows a comparable tighter bound on optimum joint decoding capacity. © 2011 IEEE.

  16. Robust Sliding Mode Control of Cucumber Picking Robot Based on the Upper Bound Estimation

    Directory of Open Access Journals (Sweden)

    Wei Liu

    2015-02-01

    Full Text Available In this study, a robust sliding mode control based on upper bound estimation was applied in position trajectory control of the fruit harvesting robot. It decomposes the manipulator dynamics equation into a constant unknown vector parameter and a known dynamic nonlinear (called the regression vector. This study based on regression design new sliding mode control law. The algorithm ensures the stability of the closed-loop system upper based on unknown upper bound estimation parameters. It shows from robustness analysis that when the system has the time-varying uncertainty, the closed loop system can still be stabilized.

  17. The existence and the stability of solutions for equilibrium problems with lower and upper bounds

    Directory of Open Access Journals (Sweden)

    Congjun Zhang

    2012-12-01

    Full Text Available In this paper, we study a class of equilibrium problems with lower and upper bounds. We obtain some existence results of solutions for equilibrium problems with lower and upper bounds by employing some classical fixed-point theorems. We investigate the stability of the solution sets for the problems, and establish sufficient conditions for the upper semicontinuity, lower semicontinuity and continuity of the solution set mapping $S:Lambda_1imesLambda_2o2^{X}$ in a Hausdorff topological vector space, in the case where a set $K$ and a mapping $f$ are perturbed respectively by parameters $lambda$ and $mu.$

  18. Estimating Lower Bound and Upper Bound of a Markov chain over a noisy communication channel with Poisson distribution

    Directory of Open Access Journals (Sweden)

    Vinay Mahajan

    2012-06-01

    Full Text Available Under the assumption that the encoders’ observations are conditionally independent Markov chains given an unobserved time-invariant random variable, results on the structure of optimal real-time encoding and decoding functions are obtained. The problem with noiseless channels and perfect memory at the receiver is then considered. A new methodology to find the structure of optimal real-time encoders is employed. A sufficient statistic with a time-invariant domain is found for this problem. This methodology exploits the presence of common information between the encoders and the receiver when communication is over noiseless channels. In this paper we estimate the lower bond, upper bond and define the encoder. In the previous design approach they follow Markov Chain approach to estimating the upper bound and define the encoder. In this dissertation we follow poison distribution to finding the lower bound and upper bound. Poisson can be viewed as an approximation to the binomial distribution. The approximation is good enough to be useful even when the sample size (N is only moderately large (say N > 50 and the probability (p is only relatively small (p < .2 The advantage of the Poisson distribution, of course, is that if N is large you need only know p to determine the approximate distribution of events. With the binomial distribution you also need to know N.

  19. Membrane-based ethylene/ethane separation: The upper bound and beyond

    KAUST Repository

    Rungta, Meha

    2013-08-02

    Ethylene/ethane separation via cryogenic distillation is extremely energy-intensive, and membrane separation may provide an attractive alternative. In this paper, ethylene/ethane separation performance using polymeric membranes is summarized, and an experimental ethylene/ethane polymeric upper bound based on literature data is presented. A theoretical prediction of the ethylene/ethane upper bound is also presented, and shows good agreement with the experimental upper bound. Further, two ways to overcome the ethylene/ethane upper bound, based on increasing the sorption or diffusion selectivity, is also discussed, and a review on advanced membrane types such as facilitated transport membranes, zeolite and metal organic framework based membranes, and carbon molecular sieve membranes is presented. Of these, carbon membranes have shown the potential to surpass the polymeric ethylene/ethane upper bound performance. Furthermore, a convenient, potentially scalable method for tailoring the performance of carbon membranes for ethylene/ethane separation based on tuning the pyrolysis conditions has also been demonstrated. © 2013 American Institute of Chemical Engineers.

  20. An upper bound on the reheat temperature for short duration inflation

    CERN Document Server

    Lorshbough, Dustin

    2015-01-01

    We calculate the upper bound on the reheating temperature given the non-observation of gravitational waves if the number of efolds during inflation are the minimum number required to address the horizon problem as formulated in terms of entropy. This bound is valid for canonical single field slow roll inflation with a generic potential. Our bound numerically is $T_{\\text{reh}}\\lesssim1.7\\times10^{13}$ GeV, which is a factor of 428 less the usual bound one obtains from the non-observation of gravitational waves alone. If inflation lasted much longer than the minimum number of required efolds, our bound relaxes to coincide with the usual bound. We discuss the relevance for studies of primordial black holes.

  1. Several sharp upper bounds for the largest laplacian eigenvalue of a graph

    Institute of Scientific and Technical Information of China (English)

    Tian-fei; WANG

    2007-01-01

    Let K be the quasi-Laplacian matrix of a graph G and B be the adjacency matrix of the line graph of G, respectively. In this paper, we first present two sharp upper bounds for the largest Laplacian eigenvalue of G by applying the non-negative matrix theory to the similar matrix D-1/2 KD 1/2 and U-1/2 BU 1/2, respectively, where D is the degree diagonal matrix of G and U=diag(dudv: uv ∈ E(G)).And then we give another type of the upper bound in terms of the degree of the vertex and the edge number of G. Moreover, we determine all extremal graphs which achieve these upper bounds. Finally,some examples are given to illustrate that our results are better than the earlier and recent ones in some sense.

  2. Upper bound analysis for deep tunnel face with joined failure mechanism of translation and rotation

    Institute of Scientific and Technical Information of China (English)

    许敬叔; 杜佃春; 杨子汉

    2015-01-01

    A joined failure mechanism of translation and rotation was proposed for the stability analysis of deep tunnel face, and the upper bound solution of supporting force of deep tunnel was calculated under pore water pressure. The calculations were based on limit analysis method of upper bound theory, with the employment of non-associated Mohr-Coulomb flow rule. Nonlinear failure criterion was adopted. Optimized analysis was conducted for the effects of the tunnel depth, pore water pressure coefficient, the initial cohesive force and nonlinear coefficient on supporting force. The upper bound solutions are obtained by optimum method. Results are listed and compared with the previously published solutions for the verification of correctness and effectiveness. The failure shapes are presented, and results are discussed for different pore water pressure coefficients and nonlinear coefficients of tunnel face.

  3. MIMO-OFDM Precoding Technique for Minimizing BER Upper Bound of MLD

    Science.gov (United States)

    Pitakdumrongkija, Boonsarn; Fukawa, Kazuhiko; Suzuki, Hiroshi; Hagiwara, Takashi

    This paper proposes a new MIMO-OFDM precoding technique that aims to minimize a bit error rate (BER) upper bound of the maximum likelihood detection (MLD) in mobile radio communications. Using a steepest descent algorithm, the proposed method estimates linear precoding matrices that can minimize the upper bound of BER under power constraints. Since the upper bound is derived from all the pairwise error probabilities, this method can effectively optimize overall Euclidean distances between signals received by multiple antennas and their replicas. Computer simulations evaluate the BER performance and channel capacity of the proposed scheme for 2×2 and 4×4 MIMO-OFDM systems with BPSK, QPSK, and 16QAM. It is demonstrated that the proposed precoding technique is superior in terms of average BER to conventional precoding methods including a precoder which maximizes only the minimum Euclidean distance as the worst case.

  4. Upper and Lower Bounds on the Stability of Calving Glaciers

    Science.gov (United States)

    Ma, Y.; Bassis, J. N.

    2015-12-01

    Iceberg calving is responsible for nearly half of the mass lost from ice sheets to the oceans. However, a lack of a well-parameterized calving model leaves most numerical ice sheet models incomplete. Previous studies have sought to parameterize iceberg calving assuming that calving occurs when a surface crevasse intersects with a basal one. Although a variety of models have successfully reproduced patterns of glacier retreat, they are frequently tuned by adding melt water into surface crevasses until glacier behavior matches observations, which is puzzling because calving also occurs during winter when no melt water is available. Here we examine crevasse propagation using a 2D full-Stokes finite element model along the center flow of an idealized glacier terminating in ocean to see when water-free surface crevasses intersect with water-filled basal crevasses on a lubricated bed. Crevasse propagation is computed using the Nye zero-stress-model, assuming they have a negligible effect on the stress field of the glacier. We find that for a given water depth, simulated glaciers evolve to a state where either basal and surface crevasses intersect or the glacier begins to float. This allows us to map out a stability threshold that predicts for a given water depth if certain ice thicknesses will result in full thickness failure. Assuming seeds for crevasses are present everywhere, this threshold poses an upper limit on ice thickness: as the thickness decreases full thickness penetration is increasingly likely. Comparing our theoretical stability threshold with observational data deduced from Operation IceBridge, we find that most tidewater glaciers have water depth and ice thickness combinations fall in a narrow region above our predicted threshold and below buoyancy. The agreement between observations and our simulations suggests that glaciers evolve until they approach a critical stability threshold where small perturbations can trigger calving events. The stability

  5. The Upper Bounds of Arbitrary Eigenvalues for Uniformly Elliptic Operators with Higher Orders

    Institute of Scientific and Technical Information of China (English)

    Gao Jia; Xiao-ping Yang

    2006-01-01

    Let Ω(∪)Rm (m≥2) be a bounded domain with piecewise smooth and Lipschitz boundary (e)Ω. Let t and r be two nonnegative integers with t ≥ r + 1. In this paper, we consider the variable-coefficient eigenvalue problems with uniformly elliptic differential operators on the left-hand side and (-△)r on the right-hand side.Some upper bounds of the arbitrary eigenvalue are obtained, and several known results are generalized.

  6. Some Upper Matrix Bounds for the Solution of the Continuous Algebraic Riccati Matrix Equation

    Directory of Open Access Journals (Sweden)

    Zübeyde Ulukök

    2013-01-01

    Full Text Available We propose diverse upper bounds for the solution matrix of the continuous algebraic Riccati matrix equation (CARE by building the equivalent form of the CARE and using some matrix inequalities and linear algebraic techniques. Finally, numerical example is given to demonstrate the effectiveness of the obtained results in this work as compared with some existing results in the literature. These new bounds are less restrictive and provide more efficient results in some cases.

  7. Upper bounds on the number of Steiner triple systems and 1-factorizations

    CERN Document Server

    Linial, Nathan

    2011-01-01

    Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bounds. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <= ((1 + o(1)) (n/e^2))^(n^2/2) Both bounds are conjectured be sharp. Our main tool is the entropy method.

  8. Upper Bounds of the Rates of Decay for Solutions of the Boussinesq Equations

    Institute of Scientific and Technical Information of China (English)

    Ying Liu

    2011-01-01

    In this paper, upper bounds of the L2-decay rate for the Boussinesq equations are considered.Using the L2 decay rate of solutions for the heat equation, and assuming that the solutions of the Boussinesq equations are smooth, we obtain the upper bounds of L2 decay rate for the smooth solutions and difference between the solutions of the Boussinesq equations and those of the heat system with the same initial data. The decay results may then be obtained by passing to the limit of approximating sequences of solutions. The main tool is the Fourier splitting method.

  9. A Method for Upper Bounding Long Term Growth of Network Access Speed

    DEFF Research Database (Denmark)

    Knudsen, Thomas Phillip; Pedersen, Jens Myrup; Madsen, Ole Brun

    2004-01-01

    The development in home Internet access speed has shown an exponential development with growth rates averaging 25% per year. For resource management in network provisioning it becomes an urgent question how long such growth can continue. This paper presents a method for calculating an upper bound...... to visual content driven growth, proceeding from datarate requirements for a full virtual environment. Scenarios and approaches for reducing datarate requirements are considered and discussed. The presented figures for an upper bound on network access speed are discussed and perspectives on further research...

  10. New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes

    CERN Document Server

    Ma, Xiao; Bai, Baoming

    2011-01-01

    In this paper, new techniques are presented to either simplify or improve most existing upper bounds on the maximum-likelihood (ML) decoding performance of the binary linear codes over additive white Gaussian noise (AWGN) channels. Firstly, the recently proposed union bound using truncated weight spectrums by Ma {\\em et al} is re-derived in a detailed way based on Gallager's first bounding technique (GFBT), where the "good region" is specified by a sub-optimal list decoding algorithm. The error probability caused by the bad region can be upper-bounded by the tail-probability of a binomial distribution, while the error probability caused by the good region can be upper-bounded by most existing techniques. Secondly, we propose two techniques to tighten the union bound on the error probability caused by the good region. The first technique is based on pair-wise error probabilities, which can be further tightened by employing the independence between the error events and certain components of the received random ...

  11. New upper solution bounds for perturbed continuous algebraic Riccati equations applied to automatic control

    Energy Technology Data Exchange (ETDEWEB)

    Davies, Richard [School of Technology, University of Glamorgan, Pontypridd, CF37 1DL (United Kingdom)]. E-mail: rkdavies@glam.ac.uk; Peng Shi [School of Technology, University of Glamorgan, Pontypridd, CF37 1DL (United Kingdom)]. E-mail: pshi@glam.ac.uk; Wiltshire, Ron [School of Technology, University of Glamorgan, Pontypridd, CF37 1DL (United Kingdom)]. E-mail: rjwiltsh@glam.ac.uk

    2007-04-15

    In dynamical systems studies, the so-called Riccati and Lyapunov equations play an important role in stability analysis, optimal control and filtering design. In this paper, upper matrix bounds for the perturbation of the stabilizing solution of the continuous algebraic Riccati equation (CARE) are derived for the case when one, or all the coefficient matrices are subject to small perturbations. Comparing with existing works on this topic, the proposed bounds are less restrictive. In addition to these bounds, iterative algorithms are also derived to obtain more precise estimates.

  12. Upper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition

    Science.gov (United States)

    Nasif, Ahmed O.; Mark, Brian L.; Hintz, Kenneth J.; Peixoto, Nathalia

    2010-04-01

    Recently, there has been considerable interest in the development of robust, cost-effective and high performance non-metallic landmine detection systems using ground penetrating radar (GPR). Many of the available solutions try to discriminate landmines from clutter by extracting some form of statistical or geometrical information from the raw GPR data, and oftentimes, it is difficult to assess the performance of such systems without performing extensive field experiments. In our approach, a landmine is characterized by a binary-valued string corresponding to its impedance discontinuity profile in the depth direction. This profile can be detected very quickly utilizing syntactic pattern recognition. Such an approach is expected to be very robust in terms of probability of detection (Pd) and low false alarm rates (FAR), since it exploits the inner structure of a landmine. In this paper, we develop a method to calculate an upper bound on the FAR, which is the probability of false alarm per unit area. First, we parameterize the number of possible mine patterns in terms of the number of impedance discontinuities, dither and noise. Then, a combinatorial enumeration technique is used to quantify the number of admissible strings. The upper bound on FAR is given as the ratio of an upper bound on the number of possible mine pattern strings to the number of admissible strings per unit area. The numerical results show that the upper bound is smaller than the FAR reported in the literature for a wide range of parameter choices.

  13. Comparative Study of Upper Bound Methods for the Calculation of Residual Deformations After Shakedown

    DEFF Research Database (Denmark)

    Lange-Hansen, Preben

    1998-01-01

    Purpose: None of the published formulae for obtaining upper bounds for residual deflections in elastoplastic structures with quasistatically varying loads (shakedown problems) has been able to result in theoretical maximum values of residual deflections. Therefore, the purpose of the report is to...

  14. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies

    Science.gov (United States)

    2011-01-01

    Background Enumeration of chemical graphs satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics since it leads to a variety of useful applications including structure determination of novel chemical compounds and drug design. Results In this paper, we consider the problem of enumerating all tree-like chemical graphs from a given set of feature vectors, which is specified by a pair of upper and lower feature vectors, where a feature vector represents the frequency of prescribed paths in a chemical compound to be constructed. This problem can be solved by applying the algorithm proposed by Ishida et al. to each single feature vector in the given set, but this method may take much computation time because in general there are many feature vectors in a given set. We propose a new exact branch-and-bound algorithm for the problem so that all the feature vectors in a given set are handled directly. Since we cannot use the bounding operation proposed by Ishida et al. due to upper and lower constraints, we introduce new bounding operations based on upper and lower feature vectors, a bond constraint, and a detachment condition. Conclusions Our proposed algorithm is useful for enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. PMID:22373441

  15. An upper bound to the second Hankel determinant for pre-starlike functions of order α

    Directory of Open Access Journals (Sweden)

    Deekonda Vamshee Krishna

    2015-12-01

    Full Text Available The objective of this paper is to obtain an upper bound to the second Hankel determinant  for the function f and its inverse belonging to the class of pre-starlike functions of order alpha (0 ≤ alpha ≤ 1, using Toeplitz determinants.

  16. Upper bound analytical solution for surrounding rock pressure of shallow unsymmetrical loading tunnels

    Institute of Scientific and Technical Information of China (English)

    雷明锋; 彭立敏; 施成华; 谢友均; 谭立新

    2015-01-01

    By combining the results of laboratory model tests with relevant flow rules, the failure mode of shallow unsymmetrical loading tunnels and the corresponding velocity field were established. According to the principle of virtual power, the upper bound solution for surrounding rock pressure of shallow unsymmetrical loading tunnel was derived and verified by an example. The results indicate that the calculated results of the derived upper bound method for surrounding rock pressure of shallow unsymmetrical loading tunnels are relatively close to those of the existing “code method” and test results, which means that the proposed method is feasible. The current code method underestimates the unsymmetrical loading feature of surrounding rock pressure of shallow unsymmetrical loading tunnels, so it is unsafe; when the burial depth is less or greater than two times of the tunnel span and the unsymmetrical loading angle is less than 45°, the upper bound method or the average value of the results calculated by the upper bound method and code method respectively, is comparatively reasonable. When the burial depth is greater than two times of the tunnel span and the unsymmetrical loading angle is greater than 45°, the code method is more suitable.

  17. An upper bound for the norm of a GCD-related matrix

    Directory of Open Access Journals (Sweden)

    Haukkanen Pentti

    2006-01-01

    Full Text Available We find an upper bound for the norm of the matrix whose entry is , where and are the greatest common divisor and the least common multiple of and and where and are real numbers. In fact, we show that if and , then for all positive integers , where is the Riemann zeta function.

  18. Buckling of composite beams with two enveloped delaminations: Lower and upper bounds

    NARCIS (Netherlands)

    Parlapalli, M.S.R.; Shu, Dongwei; Chai, Gin B.

    2008-01-01

    Lower and upper bounds of the buckling load of a composite beam with two enveloped delaminations are obtained from newly developed analytical models. The characteristic equation, governing the delamination buckling is derived by using Euler–Bernoulli beam and classical lamination theory, performing

  19. Upper bound for energy efficiency in multi-cell fibre-wireless access systems

    DEFF Research Database (Denmark)

    Koonen, A.M.J.; Popov, M.; Wessing, Henrik

    2013-01-01

    Bringing radio access points closer to the end-users improves radio energy efficiency. However, taking into account both the radio and the optical parts of a fibre-wireless access system, the overall system energy efficiency has an upper bound determined by the relation between the energy...

  20. Upper Bound for Energy Efficiency in Multi-Cell Fibre-Wireless Access Systems

    DEFF Research Database (Denmark)

    Koonen, A. M. J.; Popov, M.; Wessing, Henrik

    Bringing radio access points closer to the end-users improves radio energy efficiency. However, taking into account both the radio and the optical parts of a fibre-wireless access system, the overall system energy efficiency has an upper bound determined by the relation between the energy...

  1. The Upper Bound for GMRES on Normal Tridiagonal Toeplitz Linear System

    Directory of Open Access Journals (Sweden)

    R. Doostaki∗

    2015-09-01

    Full Text Available The Generalized Minimal Residual method (GMRES is often used to solve a large and sparse system Ax = b. This paper establishes error bound for residuals of GMRES on solving an N × N normal tridiagonal Toeplitz linear system. This problem has been studied previously by Li [R.-C. Li, Convergence of CG and GMRES on a tridiagonal Toeplitz linear system, BIT 47 (3 (2007 577-599.], for two special right-hand sides b = e1, eN . Also, Li and Zhang [R.-C. Li, W. Zhang, The rate of convergence of GMRES on a tridiagonal Toeplitz linear system, Numer. Math. 112 (2009 267-293.] for non-symmetric matrix A, presented upper bound for GMRES residuals. But in this paper we establish the upper bound on normal tridiagonal Toeplitz linear systems for special right-hand sides b = b(lel, for 1  l  N

  2. On Geometric Upper Bounds for Positioning Algorithms in Wireless Sensor Networks

    CERN Document Server

    Gholami, Mohammad Reza; Wymeersch, Henk; Rydström, Mats

    2012-01-01

    This paper studies the possibility of upper bounding the position error of an estimate for range based positioning algorithms in wireless sensor networks. In this study, we argue that in certain situations when the measured distances between sensor nodes are positively biased, e.g., in non-line-of-sight conditions, the target node is confined to a closed bounded convex set (a feasible set) which can be derived from the measurements. Then, we formulate two classes of geometric upper bounds with respect to the feasible set. If an estimate is available, either feasible or infeasible, the worst-case position error can be defined as the maximum distance between the estimate and any point in the feasible set (the first bound). Alternatively, if an estimate given by a positioning algorithm is always feasible, we propose to get the maximum length of the feasible set as the worst-case position error (the second bound). These bounds are formulated as nonconvex optimization problems. To progress, we relax the nonconvex ...

  3. Analysis of upper and lower bounds of the frame noise in linear detector arrays

    Science.gov (United States)

    Jaggi, S.

    1991-01-01

    This paper estimates the upper and lower bounds of the frame noise of a linear detector array that uses a one-dimensional scan pattern. Using chi-square distribution, it is analytically shown why it is necessary to use the average of the variances and not the average of the standard deviations to estimate these bounds. Also, a criteria for determining whether any excessively noisy lines exist among the detectors is derived from these bounds. Using a Gaussian standard random variable generator, these bounds are demonstrated to be accurate within the specified confidence interval. A silicon detector array is then used for actual dark current measurements. The criterion developed for determination of noisy detectors is checked on the experimentally obtained data.

  4. Upper bound on the modal material loss rate in plasmonic and metamaterial systems.

    Science.gov (United States)

    Raman, Aaswath; Shin, Wonseok; Fan, Shanhui

    2013-05-01

    A better understanding of optical loss in plasmonic and metamaterial systems is of increasing importance for both basic and applied research in a broad range of topics including sensors, antennas, optical interconnects, and photovoltaics. In this Letter, we use a photonic band formalism for plasmonics to exactly derive a fundamental upper bound on the nonradiative material loss rate of modes in plasmonic, polaritonic, and metamaterial systems. This bound is purely defined by material properties and cannot be overcome by device design. Moreover it is frequency dependent in the presence of multiple Lorentz poles. We numerically verify this bound through direct calculations for a range of plasmonic systems, including optical antennas where the bound places fundamental performance constraints.

  5. Upper bound for the average entropy production based on stochastic entropy extrema

    Science.gov (United States)

    Limkumnerd, Surachate

    2017-03-01

    The second law of thermodynamics, which asserts the non-negativity of the average total entropy production of a combined system and its environment, is a direct consequence of applying Jensen's inequality to a fluctuation relation. It is also possible, through this inequality, to determine an upper bound of the average total entropy production based on the entropies along the most extreme stochastic trajectories. In this work, we construct an upper bound inequality of the average of a convex function over a domain whose average is known. When applied to the various fluctuation relations, the upper bounds of the average total entropy production are established. Finally, by employing the result of Neri, Roldán, and Jülicher [Phys. Rev. X 7, 011019 (2017)], 10.1103/PhysRevX.7.011019, we are able to show that the average total entropy production is bounded only by the total entropy production supremum, and vice versa, for a general nonequilibrium stationary system.

  6. Quantum Dynamics via Complex Analysis Methods: General Upper Bounds Without Time-Averaging and Tight Lower Bounds for the Strongly Coupled Fibonacci Hamiltonian

    CERN Document Server

    Damanik, David

    2008-01-01

    We develop further the approach to upper and lower bounds in quantum dynamics via complex analysis methods which was introduced by us in a sequence of earlier papers. Here we derive upper bounds for non-time averaged outside probabilities and moments of the position operator from lower bounds for transfer matrices at complex energies. Moreover, for the time-averaged transport exponents, we present improved lower bounds in the special case of the Fibonacci Hamiltonian. These bounds lead to an optimal description of the time-averaged spreading rate of the fast part of the wavepacket in the large coupling limit. This provides the first example which demonstrates that the time-averaged spreading rates may exceed the upper box-counting dimension of the spectrum.

  7. Upper Bound and Lower Bound Estimate of Monotone Increasing Fractal Function%单调递增分形函数上、下界的估计

    Institute of Scientific and Technical Information of China (English)

    马冠忠; 袁瑰霞; 崔振文

    2008-01-01

    Mass distribution principle is one of important tools in studying Hausdorff dimension and Hausdorff measure.In this paper we will give a numerical approximate method of upper bound and lower bound of mass distribution function f(x)(it is a monotone increasing fractal function)and its some applications.

  8. A New Upper Bound for A-1 of a Strictly α-Diagonally Dominant M-Matrix

    Directory of Open Access Journals (Sweden)

    Zhanshan Yang

    2013-01-01

    Full Text Available A new upper bound for A-1 of a real strictly diagonally dominant M-matrix A is present, and a new lower bound of the smallest eigenvalue λminA of A is given, which improved the results in the literature. Furthermore, an upper bound for A-1 of a real strictly α-diagonally dominant M-matrix is shown.

  9. Effects of a potential fourth fermion generation on the upper and lower Higgs boson mass bounds

    CERN Document Server

    Gerhold, Philipp; Kallarackal, Jim

    2010-01-01

    We study the effect of a potential fourth fermion generation on the upper and lower Higgs boson mass bounds. This investigation is based on the numerical evaluation of a chirally invariant lattice Higgs-Yukawa model emulating the same Higgs-fermion coupling structure as in the Higgs sector of the electroweak Standard Model. In particular, the considered model obeys a Ginsparg-Wilson version of the underlying ${SU}(2)_L\\times {U}(1)_Y$ symmetry, being a global symmetry here due to the neglection of gauge fields in this model. We present our results on the modification of the upper and lower Higgs boson mass bounds induced by the presence of a hypothetical very heavy fourth quark doublet. Finally, we compare these findings to the standard scenario of three fermion generations.

  10. Upper Bounds for Ruin Probabilities under Stochastic Interest Rate and Optimal Investment Strategies

    Institute of Scientific and Technical Information of China (English)

    Jin Zhu LI; Rong WU

    2012-01-01

    In this paper,we study the upper bounds for ruin probabilities of an insurance company which invests its wealth in a stock and a bond.We assume that the interest rate of the bond is stochastic and it is described by a Cox-Ingersoll-Ross (CIR) model.For the stock price process,we consider both the case of constant volatility (driven by an O-U process) and the case of stochastic volatility (driven by a CIR model).In each case,under certain conditions,we obtain the minimal upper bound for ruin probability as well as the corresponding optimal investment strategy by a pure probabilistic method.

  11. Upper and lower bounds of ground-motion variabilities: implication for source properties

    Science.gov (United States)

    Cotton, Fabrice; Reddy-Kotha, Sreeram; Bora, Sanjay; Bindi, Dino

    2017-04-01

    One of the key challenges of seismology is to be able to analyse the physical factors that control earthquakes and ground-motion variabilities. Such analysis is particularly important to calibrate physics-based simulations and seismic hazard estimations at high frequencies. Within the framework of the development of ground-motion prediction equation (GMPE) developments, ground-motions residuals (differences between recorded ground motions and the values predicted by a GMPE) are computed. The exponential growth of seismological near-source records and modern GMPE analysis technics allow to partition these residuals into between- and a within-event components. In particular, the between-event term quantifies all those repeatable source effects (e.g. related to stress-drop or kappa-source variability) which have not been accounted by the magnitude-dependent term of the model. In this presentation, we first discuss the between-event variabilities computed both in the Fourier and Response Spectra domains, using recent high-quality global accelerometric datasets (e.g. NGA-west2, Resorce, Kiknet). These analysis lead to the assessment of upper bounds for the ground-motion variability. Then, we compare these upper bounds with lower bounds estimated by analysing seismic sequences which occurred on specific fault systems (e.g., located in Central Italy or in Japan). We show that the lower bounds of between-event variabilities are surprisingly large which indicates a large variability of earthquake dynamic properties even within the same fault system. Finally, these upper and lower bounds of ground-shaking variability are discussed in term of variability of earthquake physical properties (e.g., stress-drop and kappa_source).

  12. Upper Bound on the Proton Lifetime and the Minimal Non-SUSY Grand Unified Theory

    CERN Document Server

    Pérez, P F

    2007-01-01

    In this talk we show that it is possible to find an upper bound on the total proton lifetime. We conclude that the minimal realistic non-supersymmetric grand unified theory is the modified Georgi-Glashow model with a Higgs sector composed of 5_H, 24_H, and 15_H. We discuss the possibility to test this scenario at the next generation of proton decay experiments and future colliders through the production of light scalar leptoquarks.

  13. Upper Bounds on the Degeneracy of the Ground State in Quantum Field Models

    Directory of Open Access Journals (Sweden)

    Asao Arai

    2016-01-01

    Full Text Available Axiomatic abstract formulations are presented to derive upper bounds on the degeneracy of the ground state in quantum field models including massless ones. In particular, given is a sufficient condition under which the degeneracy of the ground state of the perturbed Hamiltonian is less than or equal to the degeneracy of the ground state of the unperturbed one. Applications of the abstract theory to models in quantum field theory are outlined.

  14. The upper bound of the optimal number of clusters in fuzzy clustering

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The upper bound of the optimal number of clusters in clustering algorithm is studied in this paper. A new method is proposed to solve this issue. This method shows that the rule cmax≤n, which is popular in current papers, is reasonable in some sense. The above conclusion is tested and analyzed by some typical examples in the literature, which demonstrates the validity of the new method.

  15. Upper bound and formula for class numbers of abelian function fields

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    For any abelian function field K ( i. e. any subfield of a cyclotomic function field L = k (AP) over the rational function field k ) with conductor being an irreducible polynomial over a finite field of odd characteristic, by studying the Carlitz-module structure and the character group of K, an explicit upper bound and a calculating formula of the relative divisor class number h - (K) of K are given. Our calculated results of K develop Rosen's recent results of L.

  16. Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

    DEFF Research Database (Denmark)

    Atamtürk, Alper; Muller, Laurent Flindt; Pisinger, David

    2013-01-01

    Motivated by addressing probabilistic 0-1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can....... These experiments show that a judicious application of the extended GUB cover cuts can reduce the solution time of conic quadratic 0-1 programs with GUB constraints substantially. © 2013 INFORMS....

  17. Lower and Upper Bounds for the Node, Edge, and Arc Routing Problem

    DEFF Research Database (Denmark)

    Bach, Lukas; Wøhlk, Sanne; Hasle, Geir

    The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004. They also proposed a memetic algorithm procedure and defined a set of test instances: the so-called CBMix benchmark. The NEARP generalizes the classical CVRP, the CARP, and the General Routing Problem....... It captures important aspects of real-life routing problems that were not adequately modeled in previous VRP variants. Hence, its definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound for the NEARP. It is a further development of lower bounds...... for the CARP. We also define two novel sets of test instances to complement the CBMix benchmark. The first is based on well-known CARP instances; the second consists of real life cases of newspaper delivery routing. We provide numerical results in the form 1 of lower and best known upper bounds for all...

  18. Upper bound on hot dark matter density from SO(10) Yukawa unification

    CERN Document Server

    Brignole, A; Rattazzi, Riccardo; Andrea Brignole; Hitoshi Murayama; Riccardo Rattazzi

    1994-01-01

    We study low-energy consequences of supersymmetric SO(10) models with Yukawa unification h_t = h_N and h_b = h_\\tau. We find that it is difficult to reproduce the observed m_b/m_\\tau ratio when the third-generation right-handed neutrino is at an intermediate scale, especially for small \\tan \\beta. We obtain a conservative lower bound on the mass of the right-handed neutrino M_N > 6 \\times 10^{13}~GeV for \\tan \\beta < 10. This bound translates into an upper bound on the \\tau-neutrino mass, and therefore on its contribution to the hot dark matter density of the present universe, \\Omega_\

  19. Adaptive correction method for an OCXO and investigation of analytical cumulative time error upper bound.

    Science.gov (United States)

    Zhou, Hui; Kunz, Thomas; Schwartz, Howard

    2011-01-01

    Traditional oscillators used in timing modules of CDMA and WiMAX base stations are large and expensive. Applying cheaper and smaller, albeit more inaccurate, oscillators in timing modules is an interesting research challenge. An adaptive control algorithm is presented to enhance the oscillators to meet the requirements of base stations during holdover mode. An oscillator frequency stability model is developed for the adaptive control algorithm. This model takes into account the control loop which creates the correction signal when the timing module is in locked mode. A recursive prediction error method is used to identify the system model parameters. Simulation results show that an oscillator enhanced by our adaptive control algorithm improves the oscillator performance significantly, compared with uncorrected oscillators. Our results also show the benefit of explicitly modeling the control loop. Finally, the cumulative time error upper bound of such enhanced oscillators is investigated analytically and comparison results between the analytical and simulated upper bound are provided. The results show that the analytical upper bound can serve as a practical guide for system designers.

  20. Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers

    Energy Technology Data Exchange (ETDEWEB)

    Plenio, M B [Institut fuer Theoretische Physik, Albert-Einstein-Allee 11, Universitaet Ulm, D-89069 Ulm (Germany); Virmani, S [Department of Physics SUPA, University of Strathclyde, John Anderson Building, 107 Rottenrow, Glasgow G4 0NG (United Kingdom)], E-mail: shashank.virmani@strath.ac.uk

    2010-03-15

    We consider the possibility of adding noise to a quantum circuit to make it efficiently simulatable classically. In previous works, this approach has been used to derive upper bounds to fault tolerance thresholds-usually by identifying a privileged resource, such as an entangling gate or a non-Clifford operation, and then deriving the noise levels required to make it 'unprivileged'. In this work, we consider extensions of this approach where noise is added to Clifford gates too and then 'commuted' around until it concentrates on attacking the non-Clifford resource. While commuting noise around is not always straightforward, we find that easy instances can be identified in popular fault tolerance proposals, thereby enabling sharper upper bounds to be derived in these cases. For instance we find that if we take Knill's (2005 Nature 434 39) fault tolerance proposal together with the ability to prepare any possible state in the XY plane of the Bloch sphere, then not more than 3.69% error-per-gate noise is sufficient to make it classical, and 13.71% of Knill's {gamma} noise model is sufficient. These bounds have been derived without noise being added to the decoding parts of the circuits. Introducing such noise in a toy example suggests that the present approach can be optimized further to yield tighter bounds.

  1. Exact lower and upper bounds on stationary moments in stochastic biochemical systems

    Science.gov (United States)

    Ghusinga, Khem Raj; Vargas-Garcia, Cesar A.; Lamperski, Andrew; Singh, Abhyudai

    2017-08-01

    In the stochastic description of biochemical reaction systems, the time evolution of statistical moments for species population counts is described by a linear dynamical system. However, except for some ideal cases (such as zero- and first-order reaction kinetics), the moment dynamics is underdetermined as lower-order moments depend upon higher-order moments. Here, we propose a novel method to find exact lower and upper bounds on stationary moments for a given arbitrary system of biochemical reactions. The method exploits the fact that statistical moments of any positive-valued random variable must satisfy some constraints that are compactly represented through the positive semidefiniteness of moment matrices. Our analysis shows that solving moment equations at steady state in conjunction with constraints on moment matrices provides exact lower and upper bounds on the moments. These results are illustrated by three different examples—the commonly used logistic growth model, stochastic gene expression with auto-regulation and an activator-repressor gene network motif. Interestingly, in all cases the accuracy of the bounds is shown to improve as moment equations are expanded to include higher-order moments. Our results provide avenues for development of approximation methods that provide explicit bounds on moments for nonlinear stochastic systems that are otherwise analytically intractable.

  2. Upper-bounds on qubit coherence set by master clock instabilities

    CERN Document Server

    Ball, H; Biercuk, M J

    2016-01-01

    Experimentalists seeking to improve the coherent lifetimes of quantum bits have generally focused on improvements to qubit designs, materials, and system isolation from environmental perturbations. In the case of the phase degree of freedom in a quantum superposition, however, the coherence that must be preserved is ultimately that of the qubit relative to the system clock, rather than that of the qubit in isolation. In this manuscript we clarify the impact of clock instability on qubit dephasing and provide quantitative estimates of fidelity upper-bounds set by noisy phase fluctuations in the clock. We first indicate analytically that such phase fluctuations in the clock - typically referred to as the "local oscillator" (LO) - are indistinguishable from a pure dephasing field arising from other environmental mechanisms. Using these results, we apply commonly quoted LO phase-noise specifications to calculate the resultant performance bounds on qubit operational fidelities. We find that laboratory grade LOs co...

  3. Upper bounds for the bondage number of graphs on topological surfaces

    CERN Document Server

    Gagarin, Andrei

    2010-01-01

    The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree $\\Delta(G)$ and embeddable on an orientable surface of genus h and a non-orientable surface of genus k, $b(G)\\le \\min\\{\\Delta(G)+h+2, \\Delta(G)+k+1\\}$. This generalizes known upper bounds for planar and toroidal graphs.

  4. Application of the upper bound element technique with triangular rigid blocks in indentation

    Science.gov (United States)

    Bermudo, C.; Martín, F.; Sevilla, L.

    2012-04-01

    Present work develops the Triangular Rigid Blocks method (TRB) by means of the Upper Bound Element Technique (UBET) on indentation, a plastic deformation process. Boundary conditions of this process does not limit the vertical material flow in the opposite direction to the applied load, and the die-block has not effect on the entire top surface part, in contrast to previous studies developed on forging processes. The application of this method by studying the behaviour of different geometrical-kinematic alternatives allows obtaining a minimum load value that ensures the deformation of the part, with the possibility of inclusion of different parameters that govern and determine the deformation process.

  5. Improved upper bounds on Kaluza-Klein gravity with current Solar System experiments and observations

    CERN Document Server

    Deng, Xue-Mei

    2015-01-01

    As an extension of previous works on classical tests of Kaluza-Klein (KK) gravity and as an attempt to find more stringent constraints on this theory, its effects on physical experiments and astronomical observations conducted in the Solar System are studied. We investigate the gravitational time delay at inferior conjunction caused by KK gravity, and use new Solar System ephemerides and the observation of \\textit{Cassini} to strengthen constraints on KK gravity by up to two orders of magnitude. These improved upper bounds mean that the fifth-dimensional space in the soliton case is a very flat extra dimension in the Solar System, even in the vicinity of the Sun.

  6. Improved upper bounds on Kaluza-Klein gravity with current Solar System experiments and observations

    Energy Technology Data Exchange (ETDEWEB)

    Deng, Xue-Mei [Chinese Academy of Sciences, Purple Mountain Observatory, Nanjing (China); Xie, Yi [Nanjing University, School of Astronomy and Space Science, Nanjing (China); Shanghai Key Laboratory of Space Navigation and Position Techniques, Shanghai (China); Nanjing University, Ministry of Education, Key Laboratory of Modern Astronomy and Astrophysics, Nanjing (China)

    2015-11-15

    As an extension of previous works on classical tests of Kaluza-Klein (KK) gravity and as an attempt to find more stringent constraints on this theory, its effects on physical experiments and astronomical observations conducted in the Solar System are studied. We investigate the gravitational time delay at inferior conjunction caused by KK gravity, and use new Solar System ephemerides and the observation of Cassini to strengthen constraints on KK gravity by up to two orders of magnitude. These improved upper bounds mean that the fifth-dimensional space in the soliton case is a very flat extra dimension in the Solar System, even in the vicinity of the Sun. (orig.)

  7. An upper bound solution for closed die sinter forging of hexagonal shapes

    Indian Academy of Sciences (India)

    R K Ranjan; S Kumar

    2004-06-01

    The paper reports on an investigation into the various aspects of closed die cold forging of hexagonal powder preforms, which have been compacted and sintered from atomized powder. It is found that for certain dimensional ratios of the preform, the die pressure is minimum. An attempt has been made determine the die pressures developed during the closed die forging of the hexagonal powder preform by using an upper bound approach. The results so obtained are discussed critically to illustrate the interaction of various process parameters involved and are presented graphically.

  8. Upper solution bounds of the continuous coupled algebraic Riccati matrix equation

    Science.gov (United States)

    Liu, Jianzhou; Zhang, Juan

    2011-04-01

    In this article, by using some matrix identities, we construct the equivalent form of the continuous coupled algebraic Riccati equation (CCARE). Further, with the aid of the eigenvalue inequalities of matrix's product, by solving the linear inequalities utilising the properties of M-matrix and its inverse matrix, new upper matrix bounds for the solutions of the CCARE are established, which improve and extend some of the recent results. Finally, a corresponding numerical example is proposed to illustrate the effectiveness of the derived results.

  9. Memory Effect in Upper Bound of Heat Flux Induced by Quantum Fluctuations

    CERN Document Server

    Koide, T

    2016-01-01

    We develop a model of quantum open systems as a quantum Brownian motion coupled to a classical heat bath by introducing a mathematical definition of operator differentials. We then define a heat operator by extending the stochastic energetics and show that this operator satisfies properties corresponding to the first and second laws in thermodynamics. We further find that the upper bound of the heat flux depends on the memory effect induced by quantum fluctuations and hence the maximum extractable work can be qualitatively modified in quantum thermodynamics.

  10. Upper Bound of the Generalized p Value for the Population Variances of Lognormal Distributions with Known Coefficients of Variation

    Directory of Open Access Journals (Sweden)

    Rada Somkhuean

    2017-01-01

    Full Text Available This paper presents an upper bound for each of the generalized p values for testing the one population variance, the difference between two population variances, and the ratio of population variances for lognormal distribution when coefficients of variation are known. For each of the proposed generalized p values, we derive a closed form expression of the upper bound of the generalized p value. Numerical computations illustrate the theoretical results.

  11. Vehicle Sliding Mode Control with Adaptive Upper Bounds: Static versus Dynamic Allocation to Saturated Tire Forces

    Directory of Open Access Journals (Sweden)

    Ali Tavasoli

    2012-01-01

    Full Text Available Nonlinear vehicle control allocation is achieved through distributing the task of vehicle control among individual tire forces, which are constrained to nonlinear saturation conditions. A high-level sliding mode control with adaptive upper bounds is considered to assess the body yaw moment and lateral force for the vehicle motion. The proposed controller only requires the online adaptation of control gains without acquiring the knowledge of upper bounds on system uncertainties. Static and dynamic control allocation approaches have been formulated to distribute high-level control objectives among the system inputs. For static control allocation, the interior-point method is applied to solve the formulated nonlinear optimization problem. Based on the dynamic control allocation method, a dynamic update law is derived to allocate vehicle control to tire forces. The allocated tire forces are fed into a low-level control module, where the applied torque and active steering angle at each wheel are determined through a slip-ratio controller and an inverse tire model. Computer simulations are used to prove the significant effects of the proposed control allocation methods on improving the stability and handling performance. The advantages and limitations of each method have been discussed, and conclusions have been derived.

  12. A geometric characterization of the upper bound for the span of the Jones polynomial

    CERN Document Server

    González-Meneses, J

    2009-01-01

    Let D be a link diagram with n crossings, s_A and s_B its extreme states and |s_AD| (resp. |s_BD|) the number of simple closed curves that appear when smoothing D according to s_A (resp. s_B). We give a general formula for the sum |s_AD|+|s_BD| for a k-almost alternating diagram D, for any k, characterising this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, obtaining that |s_AD|+|s_BD|=n+2-2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu in 1997. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al in 1992, is obtained as a corollary.

  13. Upper-bound limit analysis based on the natural element method

    Institute of Scientific and Technical Information of China (English)

    Shu-Tao Zhou; Ying-Hua Liu

    2012-01-01

    The natural element method (NEM) is a newlydeveloped numerical method based on Voronoi diagram and Delaunay triangulation of scattered points,which adopts natural neighbour interpolation to construct trial functions in the framework of Galerkin method.Owing to its distinctive advantages,the NEM is used widely in many problems of computational mechanics.Utilizing the NEM,this paper deals with numerical limit analysis of structures made up of perfectly rigid-plastic material.According to kinematic theorem of plastic limit analysis,a mathematical programming natural element formulation is established for determining the upper bound multiplier of plane problems,and a direct iteration algorithm is proposed accordingly to solve it.In this algorithm,the plastic incompressibility condition is handled by two different treatments,and the nonlinearity and nonsmoothness of the goal function are overcome by distinguishing the rigid zones from the plastic zones at each iteration.The procedure implementation of iterative process is quite simple and effective because each iteration is equivalent to solving an associated elastic problem.The obtained limit load multiplier is proved to monotonically converge to the upper bound of true solution.Several benchmark examples are investigated to validate the significant performance of the NEM in the application field of limit analysis.

  14. Upper Bound Solution for the Face Stability of Shield Tunnel below the Water Table

    Directory of Open Access Journals (Sweden)

    Xilin Lu

    2014-01-01

    Full Text Available By FE simulation with Mohr-Coulomb perfect elastoplasticity model, the relationship between the support pressure and displacement of the shield tunnel face was obtained. According to the plastic strain distribution at collapse state, an appropriate failure mechanism was proposed for upper bound limit analysis, and the formula to calculate the limit support pressure was deduced. The limit support pressure was rearranged to be the summation of soil cohesion c, surcharge load q, and soil gravity γ multiplied by their corresponding coefficients Nc, Nq, and Nγ, and parametric studies were carried out on these coefficients. In order to consider the influence of seepage on the face stability, the pore water pressure distribution and the seepage force on the tunnel face were obtained by FE simulation. After adding the power of seepage force into the equation of the upper bound limit analysis, the total limit support pressure for stabilizing the tunnel face under seepage condition was obtained. The total limit support pressure was shown to increase almost linearly with the water table.

  15. Upper bound for SL-invariant entanglement measures of mixed states

    Science.gov (United States)

    Osterloh, Andreas

    2016-05-01

    An algorithm is proposed that serves to handle full-rank density matrices when coming from a lower-rank method to compute the convex roof. This is in order to calculate an upper bound for any polynomial SL-invariant multipartite entanglement measure E . This study exemplifies how this algorithm works based on a method for calculating convex roofs of rank-2 density matrices. It iteratively considers the decompositions of the density matrix into two states each, exploiting the knowledge for the rank-2 case. The algorithm is therefore quasiexact as far as the rank-2 case is concerned, and it also hints where it should include more states in the decomposition of the density matrix. Focusing on the measure of three-way entanglement of qubits (called three-tangle), I show the results the algorithm gives for two states, one of which is the Greenberger-Horne-Zeilinger-Werner (GHZ-W ) state, for which the exact convex roof is known. It overestimates the three-tangle in the state, thereby giving insight into the optimal decomposition the GHZ-W state has. As a proof of principle, I have run the algorithm for the three-tangle on the transverse quantum Ising model. I give qualitative and quantitative arguments why the convex roof should be close to the upper bound found here.

  16. Accurate upper-lower bounds on homogenized matrix by FFT-based Galerkin method

    CERN Document Server

    Vondřejc, Jaroslav; Marek, Ivo

    2014-01-01

    Accurate upper-lower bounds on homogenized matrix, arising from the unit cell problem for periodic media, are calculated for a scalar elliptic setting. Our approach builds on the recent variational reformulation of the Moulinec-Suquet (1994) Fast Fourier Transform (FFT) homogenization scheme by Vond\\v{r}ejc et al. (2014), which is based on the conforming Galerkin approximation with trigonometric polynomials. Upper-lower bounds are obtained by adjusting the primal-dual finite element framework developed independently by Dvo\\v{r}\\'{a}k (1993) and Wi\\c{e}ckowski (1995) to the FFT-based Galerkin setting. We show that the discretization procedure differs for odd and non-odd number of discretization points. In particular, thanks to the Helmholtz decomposition inherited from the continuous formulation, the duality structure is fully recovered for odd discretization. In the latter case, the more complex primal-dual structure is observed due to the trigonometric polynomials associated with the Nyquist frequencies. The...

  17. A new upper bound on the query complexity for testing generalized Reed-Muller codes

    CERN Document Server

    Ron-Zewi, Noga

    2012-01-01

    Over a finite field $\\F_q$ the $(n,d,q)$-Reed-Muller code is the code given by evaluations of $n$-variate polynomials of total degree at most $d$ on all points (of $\\F_q^n$). The task of testing if a function $f:\\F_q^n \\to \\F_q$ is close to a codeword of an $(n,d,q)$-Reed-Muller code has been of central interest in complexity theory and property testing. The query complexity of this task is the minimal number of queries that a tester can make (minimum over all testers of the maximum number of queries over all random choices) while accepting all Reed-Muller codewords and rejecting words that are $\\delta$-far from the code with probability $\\Omega(\\delta)$. (In this work we allow the constant in the $\\Omega$ to depend on $d$.) In this work we give a new upper bound of $(c q)^{(d+1)/q}$ on the query complexity, where $c$ is a universal constant. In the process we also give new upper bounds on the "spanning weight" of the dual of the Reed-Muller code (which is also a Reed-Muller code). The spanning weight of a co...

  18. Safe Upper-Bounds Inference of Energy Consumption for Java Bytecode Applications

    Science.gov (United States)

    Navas, Jorge; Mendez-Lojo, Mario; Hermenegildo, Manuel V.

    2008-01-01

    Many space applications such as sensor networks, on-board satellite-based platforms, on-board vehicle monitoring systems, etc. handle large amounts of data and analysis of such data is often critical for the scientific mission. Transmitting such large amounts of data to the remote control station for analysis is usually too expensive for time-critical applications. Instead, modern space applications are increasingly relying on autonomous on-board data analysis. All these applications face many resource constraints. A key requirement is to minimize energy consumption. Several approaches have been developed for estimating the energy consumption of such applications (e.g. [3, 1]) based on measuring actual consumption at run-time for large sets of random inputs. However, this approach has the limitation that it is in general not possible to cover all possible inputs. Using formal techniques offers the potential for inferring safe energy consumption bounds, thus being specially interesting for space exploration and safety-critical systems. We have proposed and implemented a general frame- work for resource usage analysis of Java bytecode [2]. The user defines a set of resource(s) of interest to be tracked and some annotations that describe the cost of some elementary elements of the program for those resources. These values can be constants or, more generally, functions of the input data sizes. The analysis then statically derives an upper bound on the amount of those resources that the program as a whole will consume or provide, also as functions of the input data sizes. This article develops a novel application of the analysis of [2] to inferring safe upper bounds on the energy consumption of Java bytecode applications. We first use a resource model that describes the cost of each bytecode instruction in terms of the joules it consumes. With this resource model, we then generate energy consumption cost relations, which are then used to infer safe upper bounds. How

  19. An Upper Bound to the Marginal PDF of the Ordered Eigenvalues of Wishart Matrices

    CERN Document Server

    Park, Hong Ju

    2012-01-01

    Diversity analysis of a number of Multiple-Input Multiple-Output (MIMO) applications requires the calculation of the expectation of a function whose variables are the ordered multiple eigenvalues of a Wishart matrix. In order to carry out this calculation, we need the marginal pdf of an arbitrary subset of the ordered eigenvalues. In this letter, we derive an upper bound to the marginal pdf of the eigenvalues. The derivation is based on the multiple integration of the well-known joint pdf, which is very complicated due to the exponential factors of the joint pdf. We suggest an alternative function that provides simpler calculation of the multiple integration. As a result, the marginal pdf is shown to be bounded by a multivariate polynomial with a given degree. After a standard bounding procedure in a Pairwise Error Probability (PEP) analysis, by applying the marginal pdf to the calculation of the expectation, the diversity order for a number of MIMO systems can be obtained in a simple manner. Simulation resul...

  20. Rare attributes in finite universe: Hypotheses testing specification and exact randomized upper confidence bounds

    Energy Technology Data Exchange (ETDEWEB)

    Wright, T.

    1993-03-01

    When attributes are rare and few or none are observed in the selected sample from a finite universe, sampling statisticians are increasingly being challenged to use whatever methods are available to declare with high probability or confidence that the universe is near or completely attribute-free. This is especially true when the attribute is undesirable. Approximations such as those based on normal theory are frequently inadequate with rare attributes. For simple random sampling without replacement, an appropriate probability distribution for statistical inference is the hypergeometric distribution. But even with the hypergeometric distribution, the investigator is limited from making claims of attribute-free with high confidence unless the sample size is quite large using nonrandomized techniques. In the hypergeometric setting with rare attributes, exact randomized tests of hypothesis a,re investigated to determine the effect on power of how one specifies the null hypothesis. In particular, specifying the null hypothesis as zero attributes does not always yield maximum possible power. We also consider the hypothesis specification question under complex sampling designs including stratified random sampling and two-stage cluster sampling (one case involves random selection at first stage and another case involves probability proportional to size without replacement selection at first stage). Also under simple random sampling, this article defines and presents a simple algorithm for the construction of exact ``randomized`` upper confidence bounds which permit one to possibly report tighter bounds than those exact bounds obtained using ``nonrandomized`` methods.

  1. Rare attributes in finite universe: Hypotheses testing specification and exact randomized upper confidence bounds

    Energy Technology Data Exchange (ETDEWEB)

    Wright, T.

    1993-03-01

    When attributes are rare and few or none are observed in the selected sample from a finite universe, sampling statisticians are increasingly being challenged to use whatever methods are available to declare with high probability or confidence that the universe is near or completely attribute-free. This is especially true when the attribute is undesirable. Approximations such as those based on normal theory are frequently inadequate with rare attributes. For simple random sampling without replacement, an appropriate probability distribution for statistical inference is the hypergeometric distribution. But even with the hypergeometric distribution, the investigator is limited from making claims of attribute-free with high confidence unless the sample size is quite large using nonrandomized techniques. In the hypergeometric setting with rare attributes, exact randomized tests of hypothesis a,re investigated to determine the effect on power of how one specifies the null hypothesis. In particular, specifying the null hypothesis as zero attributes does not always yield maximum possible power. We also consider the hypothesis specification question under complex sampling designs including stratified random sampling and two-stage cluster sampling (one case involves random selection at first stage and another case involves probability proportional to size without replacement selection at first stage). Also under simple random sampling, this article defines and presents a simple algorithm for the construction of exact randomized'' upper confidence bounds which permit one to possibly report tighter bounds than those exact bounds obtained using nonrandomized'' methods.

  2. Using a Water Balance Model to Bound Potential Irrigation Development in the Upper Blue Nile Basin

    Science.gov (United States)

    Jain Figueroa, A.; McLaughlin, D.

    2016-12-01

    The Grand Ethiopian Renaissance Dam (GERD), on the Blue Nile is an example of water resource management underpinning food, water and energy security. Downstream countries have long expressed concern about water projects in Ethiopia because of possible diversions to agricultural uses that could reduce flow in the Nile. Such diversions are attractive to Ethiopia as a partial solution to its food security problems but they could also conflict with hydropower revenue from GERD. This research estimates an upper bound on diversions above the GERD project by considering the potential for irrigated agriculture expansion and, in particular, the availability of water and land resources for crop production. Although many studies have aimed to simulate downstream flows for various Nile basin management plans, few have taken the perspective of bounding the likely impacts of upstream agricultural development. The approach is to construct an optimization model to establish a bound on Upper Blue Nile (UBN) agricultural development, paying particular attention to soil suitability and seasonal variability in climate. The results show that land and climate constraints impose significant limitations on crop production. Only 25% of the land area is suitable for irrigation due to the soil, slope and temperature constraints. When precipitation is also considered only 11% of current land area could be used in a way that increases water consumption. The results suggest that Ethiopia could consume an additional 3.75 billion cubic meters (bcm) of water per year, through changes in land use and storage capacity. By exploiting this irrigation potential, Ethiopia could potentially decrease the annual flow downstream of the UBN by 8 percent from the current 46 bcm/y to the modeled 42 bcm/y.

  3. Rigorous computer analysis of the Chow-Robbins game

    CERN Document Server

    Häggström, Olle

    2012-01-01

    Flip a coin repeatedly, and stop whenever you want. Your payoff is the proportion of heads, and you wish to maximize this payoff in expectation. This so-called Chow-Robbins game is amenable to computer analysis, but while simple-minded number crunching can show that it is best to continue in a given position, establishing rigorously that stopping is optimal seems at first sight to require "backward induction from infinity". We establish a simple upper bound on the expected payoff in a given position, allowing efficient and rigorous computer analysis of positions early in the game. In particular we confirm that with 5 heads and 3 tails, stopping is optimal.

  4. Exponentially small splitting for whiskered tori in Hamiltonian systems: Flow-box coordinates and upper bounds

    CERN Document Server

    Delshams, A; Seara, T M

    2003-01-01

    We consider a singular or weakly hyperbolic Hamiltonian, with $n+1$ degrees of freedom, as a model for the behaviour of a nearly-integrable Hamiltonian near a simple resonance. The model consists of an integrable Hamiltonian possessing an $n$-dimensional hyperbolic invariant torus with fast frequencies $\\omega/\\sqrt\\varepsilon$ and coincident whiskers, plus a perturbation of order $\\mu=\\varepsilon^p$. The vector $\\omega$ is assumed to satisfy a Diophantine condition. We provide a tool to study, in this singular case, the splitting of the perturbed whiskers for $\\varepsilon$ small enough, as well as their homoclinic intersections, using the Poincar\\'e--Melnikov method. Due to the exponential smallness of the Melnikov function, the size of the error term has to be carefully controlled. So we introduce flow-box coordinates in order to take advantage of the quasiperiodicity properties of the splitting. As a direct application of this approach, we obtain quite general upper bounds for the splitting.

  5. Exponentially small splitting for whiskered tori in Hamiltonian systems Flow-box coordinates and upper bounds

    CERN Document Server

    Delshams, A

    2003-01-01

    We consider a singular or weakly hyperbolic Hamiltonian, with $n+1$ degrees of freedom, as a model for the behaviour of a nearly-integrable Hamiltonian near a simple resonance. The model consists of an integrable Hamiltonian possessing an $n$-dimensional hyperbolic invariant torus with fast frequencies $\\omega/\\sqrt\\varepsilon$ and coincident whiskers, plus a perturbation of order $\\mu=\\varepsilon^p$. The vector $\\omega$ is assumed to satisfy a Diophantine condition. We provide a tool to study, in this singular case, the splitting of the perturbed whiskers for $\\varepsilon$ small enough, as well as their homoclinic intersections, using the Poincar\\'e--Melnikov method. Due to the exponential smallness of the Melnikov function, the size of the error term has to be carefully controlled. So we introduce flow-box coordinates in order to take advantage of the quasiperiodicity properties of the splitting. As a direct application of this approach, we obtain quite general upper bounds for the splitting.

  6. Upper bound seismic rotational stability analysis of gravity retaining walls considering embedment depth

    Institute of Scientific and Technical Information of China (English)

    刘杰; 黄达; 杨超; 孙莎

    2015-01-01

    Stability analysis of gravity retaining wall was currently based on the assumption that the wall had no embedment depth. The effect of earth berm was usually neglected. The present work highlighted the importance of embedment depth when assessing the seismic stability of gravity retaining walls with the pattern of pure rotation. In the framework of upper bound theorem of limit analysis, pseudo-static method was applied into two groups of parallel rigid soil slices methods in order to account for the effect of embedment depth on evaluating the critical acceleration of wall-soil system. The present analytical solution is identical to the results obtained from using limit equilibrium method, and the two methods are based on different theory backgrounds. Parameter analysis indicates that the critical acceleration increases slowly when the ratio of the embedment depth to the total height of the wall is from 0 to 0.15 and increases drastically when the ratio exceeds 0.15.

  7. An Upper Bound on the Hadronic Light-by-Light Contribution to the Muon g-2

    CERN Document Server

    Erler, J; Erler, Jens; Sanchez, Genaro Toledo

    2006-01-01

    There are indications that hadronic loops in some electroweak observables are almost saturated by parton level effects. Taking this as the hypothesis for this work, we propose a genuine parton level estimate of the hadronic light-by-light contribution to the anomalous magnetic moment of the muon, a_mu (LBL,had). Our quark mass definitions and values are motivated in detail, and the simplicity of our approach allows for a transparent error estimate. For infinitely heavy quarks our treatment is exact, while for asymptotically small quark masses a_mu (LBL,had) is overestimated. Interpolating, this suggests to quote an upper bound. We obtain a_mu (LBL,had) < 1.59 10^-9 (95% CL).

  8. Local Model Checking of Weighted CTL with Upper-Bound Constraints

    DEFF Research Database (Denmark)

    Jensen, Jonas Finnemann; Larsen, Kim Guldstrand; Srba, Jiri

    2013-01-01

    graphs. We implement all algorithms in a publicly available tool prototype and evaluate them on several experiments. The principal conclusion is that our local algorithm is the most efficient one with an order of magnitude improvement for model checking problems with a high number of “witnesses”.......We present a symbolic extension of dependency graphs by Liu and Smolka in order to model-check weighted Kripke structures against the logic CTL with upper-bound weight constraints. Our extension introduces a new type of edges into dependency graphs and lifts the computation of fixed-points from...... boolean domain to nonnegative integers in order to cope with the weights. We present both global and local algorithms for the fixed-point computation on symbolic dependency graphs and argue for the advantages of our approach compared to the direct encoding of the model checking problem into dependency...

  9. Upper Bounds on the BER Performance of MTCM-STBC Schemes over Shadowed Rician Fading Channels

    Directory of Open Access Journals (Sweden)

    M. Uysal

    2004-08-01

    Full Text Available Space-time block coding (STBC provides substantial diversity advantages with a low decoding complexity. However, these codes are not designed to achieve coding gains. Outer codes should be concatenated with STBC to provide additional coding gain. In this paper, we analyze the performance of concatenated trellis-coded STBC schemes over shadowed Rician frequency-flat fading channels. We derive an exact pairwise error probability (PEP expression that reveals the dominant factors affecting performance. Based on the derived PEP, in conjunction with the transfer function technique, we also present upper bounds on the bit error rate (BER, which are further shown to be tight through a Monte-Carlo simulation study.

  10. An upper-bound assessment of the benefits of reducing perchlorate in drinking water.

    Science.gov (United States)

    Lutter, Randall

    2014-10-01

    The Environmental Protection Agency plans to issue new federal regulations to limit drinking water concentrations of perchlorate, which occurs naturally and results from the combustion of rocket fuel. This article presents an upper-bound estimate of the potential benefits of alternative maximum contaminant levels for perchlorate in drinking water. The results suggest that the economic benefits of reducing perchlorate concentrations in drinking water are likely to be low, i.e., under $2.9 million per year nationally, for several reasons. First, the prevalence of detectable perchlorate in public drinking water systems is low. Second, the population especially sensitive to effects of perchlorate, pregnant women who are moderately iodide deficient, represents a minority of all pregnant women. Third, and perhaps most importantly, reducing exposure to perchlorate in drinking water is a relatively ineffective way of increasing iodide uptake, a crucial step linking perchlorate to health effects of concern.

  11. Upper Bound of Proton Life-Time in Product-Group Unification

    CERN Document Server

    Ibe, M; Ibe, Masahiro

    2003-01-01

    Models of supersymmetric grand unified theories based on SU(5)_GUT \\times U(N)_H gauge group (N = 2,3) have a symmetry that guarantees light two Higgs doublets and absence of dimension-five proton decay operators. We analysed the proton decay induced by gauge-boson exchange in the models. Upper bounds of proton life-time are obtained; \\tau(p\\to \\pi^0e^+) \\lsim 6.0 \\times 10^{33} yrs. in the SU(5)_GUT \\times U(2)_H model and \\tau(p\\to \\pi^0e^+) \\lsim 5.3 \\times 10^{35} yrs. in the SU(5)_GUT \\times U(3)_H model. Various uncertainties in the predictions are also discussed.

  12. Estimation of Upper Bound for Order of Filters used in Perfect Reconstruction Filter Banks

    Directory of Open Access Journals (Sweden)

    B. R. Nagendra

    2014-07-01

    Full Text Available Filter banks are widely used in variety of applications such as signal compression, multi-channel transmission, conditioning of power supply, coding and decoding of signals, etc. Perfect reconstruction filter banks are used in the applications where it is essential to reconstruct the original signal with minimum errors. Compression of satellite vibration test data is one such application where perfect reconstruction filter banks can be used to design wavelets. These wavelets are used in transform coding stage of compression algorithm. It is required to have higher order for filters used in perfect reconstruction filter banks, to ensure better filter characteristics. The study carried out in this work, estimates the upper bound for order that can be assigned to filters used in perfect reconstruction filter banks

  13. An upper bound for the ℒ P norm of a GCD-related matrix

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available We find an upper bound for the ℓ p norm of the n × n matrix whose ij entry is ( i , j s / [ i , j ] r , where ( i , j and [ i , j ] are the greatest common divisor and the least common multiple of i and j and where r and s are real numbers. In fact, we show that if 1/p$"> r > 1 / p and s < r − 1 / p , then ‖ ( ( i , j s / [ i , j ] r n × n ‖ p < ζ ( r p 2 / p ζ ( r p − s p 1 / p / ζ ( 2 r p 1 / p for all positive integers n , where ζ is the Riemann zeta function.

  14. Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning

    Directory of Open Access Journals (Sweden)

    Guangyi Liu

    2014-01-01

    Full Text Available Bayesian network is an important theoretical model in artificial intelligence field and also a powerful tool for processing uncertainty issues. Considering the slow convergence speed of current Bayesian network structure learning algorithms, a fast hybrid learning method is proposed in this paper. We start with further analysis of information provided by low-order conditional independence testing, and then two methods are given for constructing graph model of network, which is theoretically proved to be upper and lower bounds of the structure space of target network, so that candidate sets are given as a result; after that a search and scoring algorithm is operated based on the candidate sets to find the final structure of the network. Simulation results show that the algorithm proposed in this paper is more efficient than similar algorithms with the same learning precision.

  15. An upper bound on the number of high-dimensional permutations

    CERN Document Server

    Linial, Nathan

    2011-01-01

    What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and ones in which every "line" contains a unique 1 entry. A line here is a set of entries of the form {(x_1,...,x_{i-1},y,x_{i+1},...,x_{d+1})}, for y between 1 and n, some index i between 1 and d+1 and some choice of x_j in [n] for all j except i. It is easy to observe that a one-dimensional permutation is simply a permutation matrix and that a two-dimensional permutation is synonymous with an order-n Latin square. We seek an estimate for the number of d-dimensional permutations. Our main result is the following upper bound on their number: ((1+o(1))(n/e^d))^(n^d). We tend to believe that this is actually the correct number, but the problem of proving the complementary lower bound remains open. Our main tool is an adaptation of Bregman's proof of the Minc conjecture on permane...

  16. A new upper bound for the norm of interval matrices with application to robust stability analysis of delayed neural networks.

    Science.gov (United States)

    Faydasicok, Ozlem; Arik, Sabri

    2013-08-01

    The main problem with the analysis of robust stability of neural networks is to find the upper bound norm for the intervalized interconnection matrices of neural networks. In the previous literature, the major three upper bound norms for the intervalized interconnection matrices have been reported and they have been successfully applied to derive new sufficient conditions for robust stability of delayed neural networks. One of the main contributions of this paper will be the derivation of a new upper bound for the norm of the intervalized interconnection matrices of neural networks. Then, by exploiting this new upper bound norm of interval matrices and using stability theory of Lyapunov functionals and the theory of homomorphic mapping, we will obtain new sufficient conditions for the existence, uniqueness and global asymptotic stability of the equilibrium point for the class of neural networks with discrete time delays under parameter uncertainties and with respect to continuous and slope-bounded activation functions. The results obtained in this paper will be shown to be new and they can be considered alternative results to previously published corresponding results. We also give some illustrative and comparative numerical examples to demonstrate the effectiveness and applicability of the proposed robust stability condition.

  17. An Upper Bound on High Speed Satellite Collision Probability When Only One Object has Position Uncertainty Information

    Science.gov (United States)

    Frisbee, Joseph H., Jr.

    2015-01-01

    Upper bounds on high speed satellite collision probability, PC †, have been investigated. Previous methods assume an individual position error covariance matrix is available for each object. The two matrices being combined into a single, relative position error covariance matrix. Components of the combined error covariance are then varied to obtain a maximum PC. If error covariance information for only one of the two objects was available, either some default shape has been used or nothing could be done. An alternative is presented that uses the known covariance information along with a critical value of the missing covariance to obtain an approximate but potentially useful Pc upper bound.

  18. Analytical Lower and Upper Bounds for the Threshold Surfaces of Quantum Error Correcting Codes

    Science.gov (United States)

    Takagi, Ryuji; Yoder, Theodore; Chuang, Isaac

    If all the physical gates in a fault tolerant code construction have a failure probability below a certain value, the failure probability of the construction approaches zero after many concatenations. This value is called the threshold value of the code and lower bounds for it for various codes have been reported in the literature. However, these approaches do not take into account that the failure probability of each species of logical gate depends on that of many different species of physical gates, and that the distribution of logical failure probability depends on that of many different physical gates. How can we reconcile the interdependency of the failure probabilities of all the various species of gates? Direct simulation would be one of the possible ways to attack this question, but it would be difficult to be done at high concatenation levels because of the exponential growth of simulation time. Here, we deal with this question by instead considering a multidimensional space of the failure probabilities of the physical gates and study the set of points that approach zero error after a large number of concatenations. We present a way to obtain lower and upper bounds for the boundary of this set, what we call the threshold surface, given a particular code and constructions of logical gates. Our method uses only the logical failure probabilities after one concatenation, and moreover the running time of the algorithm scales linearly with respect to concatenation levels. We hope this will establish a reasonable goal for experiments to work towards a scalable quantum computer.

  19. Study of the Tool Geometry Influence in Indentation for the Analysis and Validation of the New Modular Upper Bound Technique

    Directory of Open Access Journals (Sweden)

    Carolina Bermudo

    2016-07-01

    Full Text Available Focusing on incremental bulk metal forming processes, the indentation process is gaining interest as a fundamental part of these kinds of processes. This paper presents the analysis of the pressure obtained in indentation under the influence of different punch geometries. To this end, an innovative Upper Bound Theorem (UBT based solution is introduced. This new solution can be easily applied to estimate the necessary force that guarantees plastic deformation by an indentation process. In this work, we propose an accurate analytical approach to analyse indentation under different punches. The new Modular Upper Bound (MUB method presents a simpler and faster application. Additionally, its complexity is not considerably increased by the addition of more Triangular Rigid Zones. In addition, a two-dimensional indentation model is designed and implemented using the Finite Element Method (FEM. The comparison of the two methods applied to the indentation process analysed—the new Modular Upper Bound technique and the Finite Element Method—reveal close similarities, the new Modular Upper Bound being more computationally efficient.

  20. An improved upper bound for bondage number of graphs on surfaces

    CERN Document Server

    Huang, Jia

    2011-01-01

    The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich [ArXiv: 1012.4117] showed that, for a graph $G$ with maximum degree $\\Delta(G)$ and embeddable on an orientable surface of genus $h$ and a non-orientable surface of genus $k$, $b(G)\\leq\\min\\{\\Delta(G)+h+2,\\Delta+k+1\\}$. Using the Euler characteristic $\\chi$ instead of the genera, with the relations $\\chi=2-2h$ and $\\chi=2-k$, we establish an improved upper bound $b(G)\\leq\\Delta(G)+\\lfloor r\\rfloor$ for the case $\\chi\\leq0$ (i.e. $h\\geq1$ or $k\\geq2$), where $r$ is the largest real root of the cubic equation $z^3+2z^2+(6\\chi-7)z+18\\chi-24=0$. Our proof is based on the technique developed by Carlson-Develin and Gagarin-Zverovich, and includes some elementary calculus as a new ingredient. We also find an asymptotically equivalent result $b(G)\\leq\\Delta(G)+\\lceil\\sqrt{12-6\\chi\\,}-1/2\\rceil$ for $\\chi\\leq0$.

  1. Upper Bounds on the Capacity of Binary Channels with Causal Adversaries

    CERN Document Server

    Dey, Bikash Kumar; Langberg, Michael; Sarwate, Anand D

    2012-01-01

    In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword $\\mathbf{x}=(x_1,...,x_n)$ bit-by-bit over a communication channel. The sender and receiver do not share common randomness. The adversarial jammer can view the transmitted bits $x_i$ one at a time, and can change up to a $p$-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit $x_i$ the jammer's decision on whether to corrupt it or not (and on how to change it) must depend only on $x_j$ for $j \\leq i$. This is in contrast to the "classical" adversarial jamming situations in which the jammer has no knowledge of $\\mathbf{x}$ or complete knowledge of $\\mathbf{x}$. In this work, we present upper bounds on the capacity which hold for both deterministic and stochastic encoding schemes.

  2. Upper and lower Higgs boson mass bounds from a chirally invariant lattice Higgs-Yukawa model

    CERN Document Server

    Gerhold, P

    2010-01-01

    Motivated by the advent of the Large Hadron Collider the aim of the present work is the non-perturbative determination of the cutoff-dependent upper and lower mass bounds of the Standard Model Higgs boson based on first principle calculations, in particular not relying on additional information such as the triviality property of the Higgs-Yukawa sector or indirect arguments like vacuum stability considerations. For that purpose the lattice approach is employed to allow for a non-perturbative investigation of a chirally invariant lattice Higgs-Yukawa model, serving here as a reasonable simplification of the full Standard Model, containing only those fields and interactions which are most essential for the intended Higgs boson mass determination. These are the complex Higgs doublet as well as the top and bottom quark fields and their mutual interactions. To maintain the chiral character of the Standard Model Higgs-fermion coupling also on the lattice, the latter model is constructed on the basis of the Neuberge...

  3. An efficient algorithm for upper bound on the partition function of nucleic acids.

    Science.gov (United States)

    Chitsaz, Hamidreza; Forouzmand, Elmirasadat; Haffari, Gholamreza

    2013-07-01

    It has been shown that minimum free-energy structure for RNAs and RNA-RNA interaction is often incorrect due to inaccuracies in the energy parameters and inherent limitations of the energy model. In contrast, ensemble-based quantities such as melting temperature and equilibrium concentrations can be more reliably predicted. Even structure prediction by sampling from the ensemble and clustering those structures by Sfold has proven to be more reliable than minimum free energy structure prediction. The main obstacle for ensemble-based approaches is the computational complexity of the partition function and base-pairing probabilities. For instance, the space complexity of the partition function for RNA-RNA interaction is O(n4) and the time complexity is O(n6), which is prohibitively large. Our goal in this article is to present a fast algorithm, based on sparse folding, to calculate an upper bound on the partition function. Our work is based on the recent algorithm of Hazan and Jaakkola (2012). The space complexity of our algorithm is the same as that of sparse folding algorithms, and the time complexity of our algorithm is O(MFE(n)ℓ) for single RNA and O(MFE(m, n)ℓ) for RNA-RNA interaction in practice, in which MFE is the running time of sparse folding and ℓ≤n (ℓ≤n+m) is a sequence-dependent parameter.

  4. Regional Variations of the ω-upper Bound Magnitude of GIII Distribution in the Iranian Plateau

    Science.gov (United States)

    Mohammadi, Hiwa; Bayrak, Yusuf

    2016-08-01

    The Iranian Plateau does not appear to be a single crustal block, but an assemblage of zones comprising the Alborz—Azerbaijan, Zagros, Kopeh—Dagh, Makran, and Central and East Iran. The Gumbel's III asymptotic distribution method (GIII) and maximum magnitude expected by Kijko—Sellevoll method is applied in order to check the potentiality of the each seismogenic zone in the Iranian Plateau for the future occurrence of maximum magnitude ( M max). For this purpose, a homogeneous and complete seismicity database of the instrumental period during 1900-2012 is used in 29 seismogenic zones of the examined region. The spatial mapping of hazard parameters (upper bound magnitude ( ω), most probable earthquake magnitude in next 100 years ( M 100) and maximum magnitude expected by maximum magnitude estimated by Kijko—Sellevoll method (max M K - S max) reveals that Central and East Iran, Alborz and Azerbaijan, Kopeh—Dagh and SE Zagros are a dangerous place for the next occurrence of a large earthquake.

  5. Force analysis of pile foundation in rock slope based on upper-bound theorem of limit

    Institute of Scientific and Technical Information of China (English)

    ZHAO Ming-hua; LIU Jian-hua; LIU Dai-quan; WANG You

    2008-01-01

    Based on the characteristic that the potential sliding surfaces of rock slope are commonly in the shape of either line or fold line, analysis thought of conventional pile foundation in the flat ground under complex load condition was applied and the upper-bound theorem of limit analysis was used to compute thrust of rock layers with all possible distribution shapes. The interaction of slope and pile was considered design load in terms of slope thrust, and the finite difference method was derived to calculate inner-force and displacement of bridge pile foundation in rock slope under complex load condition. The result of example shows that the distribution model of slope thrust has certain impact on displacement and inner-force of bridge pile foundation. The maximum displacement growth rate reaches 54% and the maximum moment and shear growth rates reach only 15% and 20%, respectively, but the trends of inner-force and displacement of bridge pile foundation are basically the same as those of the conventional pile foundation in the flat ground. When the piles bear the same level lateral thrust, the distribution shapes of slope thrust have different influence on inner-force of pile foundation, especially the rectangle distribution, and the triangle thrust has the smallest displacement and inner-force of pile foundation.

  6. Chromatic polynomials of planar triangulations, the Tutte upper bound and chromatic zeros

    Science.gov (United States)

    Shrock, Robert; Xu, Yan

    2012-02-01

    Tutte proved that if Gpt is a planar triangulation and P(Gpt, q) is its chromatic polynomial, then |P(Gpt, τ + 1)| ⩽ (τ - 1)n - 5, where \\tau =(1+\\sqrt{5} \\, )/2 and n is the number of vertices in Gpt. Here we study the ratio r(Gpt) = |P(Gpt, τ + 1)|/(τ - 1)n - 5 for a variety of planar triangulations. We construct infinite recursive families of planar triangulations Gpt, m depending on a parameter m linearly related to n and show that if P(Gpt, m, q) only involves a single power of a polynomial, then r(Gpt, m) approaches zero exponentially fast as n → ∞. We also construct infinite recursive families for which P(Gpt, m, q) is a sum of powers of certain functions and show that for these, r(Gpt, m) may approach a finite nonzero constant as n → ∞. The connection between the Tutte upper bound and the observed chromatic zero(s) near to τ + 1 is investigated. We report the first known graph for which the zero(s) closest to τ + 1 is not real, but instead is a complex-conjugate pair. Finally, we discuss connections with the nonzero ground-state entropy of the Potts antiferromagnet on these families of graphs.

  7. An upper-bound estimate for the accuracy of volume-area scaling

    Science.gov (United States)

    Farinotti, D.; Huss, M.

    2013-06-01

    Volume-area scaling is the most popular method for estimating the ice volume of large glacier samples. Here, a series of resampling experiments based on different sets of synthetic data are presented in order to derive an upper-bound estimate (i.e. a level achieved only with ideal conditions) for the accuracy of its application. We also quantify the maximum accuracy expected when scaling is used for determining the glacier volume change, and area change of a given glacier population. A comprehensive set of measured glacier areas, volumes, area and volume changes is evaluated to investigate the impact of real-world data quality on the so assessed accuracies. For populations larger than a few thousand glaciers, the total ice volume can be recovered within 30% if all measurements available worldwide are used for estimating the scaling coefficients. Assuming no systematic biases in ice volume measurements, their uncertainty is of secondary importance. Knowing the individual areas of a glacier sample for two points in time allows recovering the corresponding ice volume change within 40% for populations larger than a few hundred glaciers, both for steady-state and transient geometries. If ice volume changes can be estimated without bias, glacier area changes derived from volume-area scaling show similar uncertainties as for the volume changes. This paper does not aim at making a final judgement about the suitability of volume-area scaling, but provides the means for assessing the accuracy expected from its application.

  8. SAS and SPSS macros to calculate standardized Cronbach's alpha using the upper bound of the phi coefficient for dichotomous items.

    Science.gov (United States)

    Sun, Wei; Chou, Chih-Ping; Stacy, Alan W; Ma, Huiyan; Unger, Jennifer; Gallaher, Peggy

    2007-02-01

    Cronbach's a is widely used in social science research to estimate the internal consistency of reliability of a measurement scale. However, when items are not strictly parallel, the Cronbach's a coefficient provides a lower-bound estimate of true reliability, and this estimate may be further biased downward when items are dichotomous. The estimation of standardized Cronbach's a for a scale with dichotomous items can be improved by using the upper bound of coefficient phi. SAS and SPSS macros have been developed in this article to obtain standardized Cronbach's a via this method. The simulation analysis showed that Cronbach's a from upper-bound phi might be appropriate for estimating the real reliability when standardized Cronbach's a is problematic.

  9. An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

    Directory of Open Access Journals (Sweden)

    Angela Hsiang-Ling Chen

    2014-09-01

    Full Text Available Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP, a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC—an effective and powerful meta-heuristic—to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every

  10. Sources, transport, and mixing of particle-bound PAHs fluxes in the upper Neckar River basin

    Science.gov (United States)

    Schwientek, Marc; Rügner, Hermann; Qin, Xintong; Scherer, Ulrike; Grathwohl, Peter

    2016-04-01

    Transport of many urban pollutants in rivers is coupled to transport of suspended particles. The degree of contamination of these suspended particles depends on the mixture of "polluted" urban and "clean" background particles. Recent results have shown that, in several meso-scale catchments studied in southwestern and eastern Germany, the loading of particles with polycyclic aromatic hydrocarbons (PAHs) was stable over time and characteristic for each catchment. The absence of significant long-term trends or pronounced changes of the catchment-specific loadings indicate that either input and output of PAHs into the stream networks are largely at steady state or that storage of PAHs in the sediments within the stream network are sufficient to smooth out larger fluctuations. Moreover, it was shown that the contamination of sediments and suspended particles with PAHs is proportional to the number of inhabitants per suspended sediment flux in a catchment. These processes are being further studied at larger scale in the upper Neckar River basin (2300 km²) in southwestern Germany. This basin, located between the mountain ranges of the Black Forest and the Swabian Alb, comprises sub-catchments that are diverse in terms of urban impact, geology (ranging from gypsum and limetstones to siliceous sandstones) and hydrology (dynamics driven either by summerly convective events or by winterly frontal systems and snow melt). Accordingly, quality and quantity of particles being released in the sub-catchments as potential vectors for hydrophobic pollutants differ; and so do the events that mobilize the particles. These settings enable the investigation of how particle-bound pollutant fluxes generated at the meso-scale are mixed and transported at larger scales when introduced into a higher order river. A prominent research question is whether varying contributions from contrasting sub-catchments lead to changing contamination patterns in the main stem or if the sediment storage in

  11. An upper-bound estimate for the accuracy of glacier volume-area scaling

    Science.gov (United States)

    Farinotti, D.; Huss, M.

    2013-11-01

    Volume-area scaling is the most popular method for estimating the ice volume of large glacier samples. Here, a series of resampling experiments based on different sets of synthetic data is presented in order to derive an upper-bound estimate (i.e. a level achieved only within ideal conditions) for its accuracy. For real-world applications, a lower accuracy has to be expected. We also quantify the maximum accuracy expected when scaling is used for determining the glacier volume change, and area change of a given glacier population. A comprehensive set of measured glacier areas, volumes, area and volume changes is evaluated to investigate the impact of real-world data quality on the so-assessed accuracies. For populations larger than a few thousand glaciers, the total ice volume can be recovered within 30% if all data currently available worldwide are used for estimating the scaling parameters. Assuming no systematic bias in ice volume measurements, their uncertainty is of secondary importance. Knowing the individual areas of a glacier sample for two points in time allows recovering the corresponding ice volume change within 40% for populations larger than a few hundred glaciers, both for steady-state and transient geometries. If ice volume changes can be estimated without bias, glacier area changes derived from volume-area scaling show similar uncertainties to those of the volume changes. This paper does not aim at making a final judgement on the suitability of volume-area scaling as such, but provides the means for assessing the accuracy expected from its application.

  12. Calculation of upper confidence bounds on not-sampled vegetation types using a systematic grid sample: An application to map unit definition for existing vegetation maps

    Science.gov (United States)

    Paul L. Patterson; Mark Finco

    2009-01-01

    This paper explores the information FIA data can produce regarding forest types that were not sampled and develops the equations necessary to define the upper confidence bounds on not-sampled forest types. The problem is reduced to a Bernoulli variable. This simplification allows the upper confidence bounds to be calculated based on Cochran (1977). Examples are...

  13. Calculation of upper confidence bounds on proportion of area containing not-sampled vegetation types: An application to map unit definition for existing vegetation maps

    Science.gov (United States)

    Paul L. Patterson; Mark Finco

    2011-01-01

    This paper explores the information forest inventory data can produce regarding forest types that were not sampled and develops the equations necessary to define the upper confidence bounds on not-sampled forest types. The problem is reduced to a Bernoulli variable. This simplification allows the upper confidence bounds to be calculated based on Cochran (1977)....

  14. On the Sharp Upper Bound of Spectral Radius of Weighted Trees%关于赋权树的谱半径的精确上界

    Institute of Scientific and Technical Information of China (English)

    谭尚旺

    2009-01-01

    The spectrum of weighted graphs are often used to solve the problems in the design of networks and electronic circuits.In this paper,we derive the sharp upper bound of spectral radius of all weighted trees on given order and edge independence number,and obtain all such trees that their spectral radius reach the upper bound.

  15. Upper Bounds for the Distance between a Controllable Switched Linear System and the Set of Uncontrollable Ones

    Directory of Open Access Journals (Sweden)

    Josep Clotet

    2013-01-01

    Full Text Available The set of controllable switched linear systems is an open and dense set in the space of all switched linear systems. Therefore it makes sense to compute the distance from a controllable system to the nearest uncontrollable one. In the case of a standard system, x˙t=Axt+But, R. Eising, D. Boley, and W. S. Lu obtain some results for this distance, both in the complex and real cases. In this work we explore this distance, for switched linear systems in the real case, obtaining upper bounds for it. The main contribution of the paper is to prove that a natural generalization of the upper bound obtained by D. Boley and W. S. Lu is true in the case of switched linear systems.

  16. Effect of time delay on the upper bound of the time derivative of information entropy in a stochastic dynamical system

    Institute of Scientific and Technical Information of China (English)

    Zhang Min-Min; Wang Can-Jun; Mei Dong-Cheng

    2011-01-01

    The effects of the time delay on the upper bound of the time derivative of information entropy are investigated in a time-delayed dynamical system driven by correlated noise.Using the Markov approximation of the stochastic delay differential equations and the Schwartz inequality principle,we obtain an analytical expression for the upper bound UB(t) of the time derivative of the information entropy.The results show that there is a critical value of T (delay time),and UB(t) presents opposite behaviours on difference sides of the critical value.For the case of the weak additive noise,T can induce a reentrance transition.Delay time T also causes a reversal behaviour in UB(t)-λ plot,where λ denotes the decree of the correlation between the two noises.

  17. A Sharp Upper Bound for the First Eigenvalue of the Laplacian of Compact Hypersurfaces in Rank-1 Symmetric Spaces

    Indian Academy of Sciences (India)

    G Santhanum

    2007-08-01

    Let be a closed hypersurface in a simply connected rank-1 symmetric space $\\overline{M}$. In this paper, we give an upper bound for the first eigenvalue of the Laplacian of in terms of the Ricci curvature of $\\overline{M}$ and the square of the length of the second fundamental form of the geodesic spheres with center at the center-of-mass of .

  18. Pre-Test Assessment of the Upper Bound of the Drag Coefficient Repeatability of a Wind Tunnel Model

    Science.gov (United States)

    Ulbrich, N.; L'Esperance, A.

    2017-01-01

    A new method is presented that computes a pre{test estimate of the upper bound of the drag coefficient repeatability of a wind tunnel model. This upper bound is a conservative estimate of the precision error of the drag coefficient. For clarity, precision error contributions associated with the measurement of the dynamic pressure are analyzed separately from those that are associated with the measurement of the aerodynamic loads. The upper bound is computed by using information about the model, the tunnel conditions, and the balance in combination with an estimate of the expected output variations as input. The model information consists of the reference area and an assumed angle of attack. The tunnel conditions are described by the Mach number and the total pressure or unit Reynolds number. The balance inputs are the partial derivatives of the axial and normal force with respect to all balance outputs. Finally, an empirical output variation of 1.0 microV/V is used to relate both random instrumentation and angle measurement errors to the precision error of the drag coefficient. Results of the analysis are reported by plotting the upper bound of the precision error versus the tunnel conditions. The analysis shows that the influence of the dynamic pressure measurement error on the precision error of the drag coefficient is often small when compared with the influence of errors that are associated with the load measurements. Consequently, the sensitivities of the axial and normal force gages of the balance have a significant influence on the overall magnitude of the drag coefficient's precision error. Therefore, results of the error analysis can be used for balance selection purposes as the drag prediction characteristics of balances of similar size and capacities can objectively be compared. Data from two wind tunnel models and three balances are used to illustrate the assessment of the precision error of the drag coefficient.

  19. Lower and Upper Bounds for the Node, Edge, and Arc Routing Problem

    DEFF Research Database (Denmark)

    Bach, Lukas; Wøhlk, Sanne; Hasle, Geir

    . It captures important aspects of real-life routing problems that were not adequately modeled in previous VRP variants. Hence, its definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound for the NEARP. It is a further development of lower bounds...

  20. Developing an Upper Bound and Heuristic Solution Algorithm for Order Scheduling Problem with Machines Idle Time Minimization

    Directory of Open Access Journals (Sweden)

    Hadi Mokhtari

    2013-01-01

    Full Text Available In this paper, the problem of received order scheduling by a manufacturer, with the measure of maximum completion times of orders, has been formulated and then an analytical approach has been devised for its solution. At the beginning of a planning period, the manufacturer receives a number of orders from customers, each of which requires two different stages for processing. In order to minimize the work in process inventories, the no-wait condition between two operations of each order is regarded. Then, the equality of obtained schedules is proved by machine idle time minimization, as objective, with the schedules obtained by maximum completion time minimization. A concept entitled “Order pairing” has been defined and an algorithm for achieving optimal order pairs which is based on symmetric assignment problem has been presented. Using the established order pairs, an upper bound has been developed based on contribution of every order pair out of total machines idle time. Out of different states of improving upper bound, 12 potential situations of order pairs sequencing have been also evaluated and then the upper bound improvement has been proved in each situation, separately. Finally, a heuristic algorithm has been developed based on attained results of pair improvement and a case study in printing industry has been investigated and analyzed to approve its applicability.

  1. A Posteriori Error Estimates with Computable Upper Bound for the Nonconforming Rotated Q1 Finite Element Approximation of the Eigenvalue Problems

    Directory of Open Access Journals (Sweden)

    Jie Liu

    2014-01-01

    discusses the nonconforming rotated Q1 finite element computable upper bound a posteriori error estimate of the boundary value problem established by M. Ainsworth and obtains efficient computable upper bound a posteriori error indicators for the eigenvalue problem associated with the boundary value problem. We extend the a posteriori error estimate to the Steklov eigenvalue problem and also derive efficient computable upper bound a posteriori error indicators. Finally, through numerical experiments, we verify the validity of the a posteriori error estimate of the boundary value problem; meanwhile, the numerical results show that the a posteriori error indicators of the eigenvalue problem and the Steklov eigenvalue problem are effective.

  2. Decentralised robust stabilisation of uncertain large-scale interconnected time-delay systems with unknown upper bounds of uncertainties

    Science.gov (United States)

    Wu, Hansheng

    2016-09-01

    The problem of decentralised robust stabilisation is considered for a class of uncertain large-scale time-delay interconnected dynamical systems. In the paper, the upper bounds of delayed state perturbations, uncertainties, interconnection terms, and external disturbances are assumed to be completely unknown, and the delays are assumed to be any non-negative constants. For such a class of uncertain large-scale time-delay interconnected systems, a new method is presented whereby a class of adaptation-free decentralised local robust state feedback controllers can be constructed. In addition, it is also shown that the solutions of uncertain large-scale time-delay interconnected systems can be guaranteed to be uniformly ultimately bounded. Finally, as an application to the practical mechanical systems, some simulations of a numerical example are provided to demonstrate the validity of the theoretical results.

  3. Lower and upper bounds on the mass of light quark-antiquark scalar resonance in the SVZ sum rules

    CERN Document Server

    Afonin, S S

    2016-01-01

    The calculation of the mass of light scalar isosinglet meson within the Shifman--Vainshtein--Zakharov (SVZ) sum rules is revisited. We develop simple analytical methods for estimation of hadron masses in the SVZ approach and try to reveal the origin of their numerical values. The calculations of hadron parameters in the SVZ sum rules are known to be heavily based on a choice of the perturbative threshold. This choice requires some important ad hoc information. We show analytically that the scalar mass under consideration has a lower and upper bound which are independent of this choice. The lower limit lies around the $\\omega$-meson mass and the upper one does near the $f_1$-meson mass. Our analysis seems to finally exclude the interpretation of the $f_0(500)$ (called also $\\sigma$) meson as a quark-antiquark state in the SVZ sum rules.

  4. Determination of a Drawing Die's Cone Angle at a Small Compression Ratio Based on the Upper Bound Theory

    Institute of Scientific and Technical Information of China (English)

    YANG Xu-dong; JIN Liang-liang

    2011-01-01

    The value of a drawing die's cone angle has great influence on wire drawing. In order to determine the optimum value of a drawing die' s cone angle, the plastic deformation power Wi, shear deformation power Wi and friction power of contact surface Wf were calculated using the upper bound theory with a reasonable and movement permitted velocity field according to the related characteristics. Then the relation between half cone angle and unit drawing force was obtained and it was compared with the result with the spherical velocity field. The relative error of the two near the optimal value is only about 0. 26% through comparing with existing calculated results. Finally, in an ABAQUS environment the finite element modal of the wire rod with 12. 5 mm diameter in first drawing pass was established and the axial drawing force in different cone angles was obtained using the ABAQUS/Explicit explicit integration method. The finite element method (FEM) results verify the results using the upper bound theory and this indicated that the velocity field and the relation between half cone angle and unit drawing force reasonable.

  5. Upper bound solution of supporting pressure for a shallow square tunnel based on the Hoek-Brown failure criterion

    Institute of Scientific and Technical Information of China (English)

    Fu HUANG; Xiao-li YANG; Lian-heng ZHAO

    2012-01-01

    To analyze the stability of a shallow square tunnel,a new curved failure mechanism,representing the mechanical characteristics and collapsing form of this type of tunnel,is constructed.Based on the upper bound theorem of limit analysis and the Hoek-Brown nonlinear failure criterion,the supporting pressure derived from the virtual work rate equation is regarded as an objective function to achieve optimal calculation.By employing variational calculation to optimize the objective function,an upper bound solution for the supporting pressure and the collapsing block shape of a shallow square tunnel are obtained.To evaluate the validity of the failure mechanism proposed in this paper,the solutions computed by the curved failure mechanism are compared with the results calculated by the linear multiple blocks failure mechanism when the Hoek-Brown nonlinear failure criterion is converted into the Mohr-Coulomb linear criterion.The influences of rock mass parameters on the supporting pressure and collapsing block shape are discussed.

  6. Anisotropic inflation reexamined: upper bound on broken rotational invariance during inflation

    CERN Document Server

    Naruko, Atsushi; Yamaguchi, Masahide

    2014-01-01

    The presence of a light vector field coupled to a scalar field during inflation makes a distinct prediction: the observed correlation functions of the cosmic microwave background (CMB) become statistically anisotropic. We study the implications of the current bound on statistical anisotropy derived from the Planck 2013 CMB temperature data for such a model. The previous calculations based on the attractor solution indicate that the magnitude of anisotropy in the power spectrum is proportional to $N^2$, where $N$ is the number of $e$-folds of inflation counted from the end of inflation. In this paper, we show that the attractor solution is not compatible with the current bound, and derive new predictions using another branch of anisotropic inflation. In addition, we improve upon the calculation of the mode function of perturbations by including the leading-order slow-roll corrections. We find that the anisotropy is roughly proportional to $[2(\\varepsilon_H+4\\eta_H)/3-4(c-1)]^{-2}$, where $\\varepsilon_H$ and $\\...

  7. Lower and upper bounds for the two-echelon capacitated location-routing problem

    Science.gov (United States)

    Contardo, Claudio; Hemmelmayr, Vera; Crainic, Teodor Gabriel

    2012-01-01

    In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times. PMID:24511176

  8. Lower and upper bounds for the two-echelon capacitated location-routing problem.

    Science.gov (United States)

    Contardo, Claudio; Hemmelmayr, Vera; Crainic, Teodor Gabriel

    2012-12-01

    In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times.

  9. An Upper Bound on Neutron Star Masses from Models of Short Gamma-ray Bursts

    CERN Document Server

    Lawrence, Scott; Bedaque, Paulo F; Miller, M Coleman

    2015-01-01

    The discovery of two neutron stars with gravitational masses $\\approx 2~M_\\odot$ has placed a strong lower limit on the maximum mass of a slowly rotating neutron star, and with it a strong constraint on the properties of cold matter beyond nuclear density. Current upper mass limits are much looser. Here we note that, if most short gamma-ray bursts are produced by the coalescence of two neutron stars, and if the merger remnant collapses quickly, then the upper mass limit is constrained tightly. We find that if the rotation of the merger remnant is limited only by mass-shedding (which seems plausible based on current numerical studies), then the maximum gravitational mass of a slowly rotating neutron star is between $\\approx 2~M_\\odot$ and $\\approx 2.2~M_\\odot$ if the masses of neutron stars that coalesce to produce gamma-ray bursts are in the range seen in Galactic double neutron star systems. These limits are increased by $\\sim 4$% if the rotation is slowed by $\\sim 30$%, and by $\\sim 15$% if the merger remna...

  10. Upper bound on the center-of-mass energy of the collisional Penrose process

    CERN Document Server

    Hod, Shahar

    2016-01-01

    Following the interesting work of Ba\\~nados, Silk, and West [Phys. Rev. Lett. {\\bf 103}, 111102 (2009)], it is repeatedly stated in the physics literature that the center-of-mass energy, ${\\cal E}_{\\text{c.m}}$, of two colliding particles in a maximally rotating black-hole spacetime can grow unboundedly. For this extreme scenario to happen, the particles have to collide at the black-hole horizon. In this paper we show that Thorne's famous hoop conjecture precludes this extreme scenario from occurring in realistic black-hole spacetimes. In particular, it is shown that a new (and larger) horizon is formed {\\it before} the infalling particles reach the horizon of the original black hole. As a consequence, the center-of-mass energy of the collisional Penrose process is {\\it bounded} from above by the simple scaling relation ${\\cal E}^{\\text{max}}_{\\text{c.m}}/2\\mu\\propto(M/\\mu)^{1/4}$, where $M$ and $\\mu$ are respectively the mass of the central black hole and the proper mass of the colliding particles.

  11. Refinement of the Upper and Lower Bounds of Effective Heat Conductivity Coefficients of Rib-Reinforced Composite Media

    Science.gov (United States)

    Yankovskii, A. P.

    2016-07-01

    We propose two refined structural models of the thermal behavior of a rib-reinforced composite medium at general anisotropy of the materials of compound components. For the criterion of equivalence of the rib-reinforced composite to the fictitious homogeneous anisotropic material, equality of the specific heat dissipation in them was used, which permits determining the upper and lower bounds of the effective heat conductivity coefficients of the composite material. The design values of the effective heat conductivity coefficients of a honeycomb structure with cavities filled and not filled with foam plastic have been determined. It has been shown that the refinement of certain thermal characteristics of 12%, and the refined "fork" of values of these quantities, does not exceed 2.5%. Indirect comparison has been made between the calculated and experimental values of the effective heat conductivity coefficients of such compounds, which has shown that the results obtained in the work are qualitatively reliable.

  12. Upper Bounds on Parity Violating Gamma-Ray Asymmetries in Compound Nuclei from Polarized Cold Neutron Capture

    CERN Document Server

    Gericke, M T; Carlini, R D; Chupp, T E; Coulter, K P; Dabaghyan, M; Dawkins, M; Desai, D; Freedman, S J; Gentile, T R; Gillis, R C; Greene, G L; Hersman, F W; Ino, T; Jones, G L; Kandes, M; Lauss, B; Leuschner, M; Lozowski, W R; Mahurin, R; Mason, M; Masuda, Y; Mitchell, G S; Muto, S; Nann, H; Page, S A; Penttila, S I; Ramsay, W D; Santra, S; Seo, P N; Sharapov, E I; Smith, T B; Snow, W M; Wilburn, W S; Yuan, V; Zhu, H

    2006-01-01

    Parity-odd asymmetries in the electromagnetic decays of compound nuclei can sometimes be amplified above values expected from simple dimensional estimates by the complexity of compound nuclear states. In this work we use a statistical approach to estimate the root mean square (RMS) of the distribution of expected parity-odd correlations $\\vec{s_{n}} \\cdot \\vec{k_{\\gamma}}$, where $\\vec {s_{n}}$ is the neutron spin and $\\vec{k_{\\gamma}}$ is the momentum of the gamma, in the integrated gamma spectrum from the capture of cold polarized neutrons on Al, Cu, and In and we present measurements of the asymmetries in these and other nuclei. Based on our calculations, large enhancements of asymmetries were not predicted for the studied nuclei and the statistical estimates are consistent with our measured upper bounds on the asymmetries.

  13. Potential radiological impacts of upper-bound operational accidents during proposed waste disposal alternatives for Hanford defense waste

    Energy Technology Data Exchange (ETDEWEB)

    Mishima, J.; Sutter, S.L.; Hawley, K.A.; Jenkins, C.E.; Napier, B.A.

    1986-02-01

    The Geologic Disposal Alternative, the In-Place Stabilization and Disposal Alternative, and the Reference Disposal Alternative are being evaluated for disposal of Hanford defense high-level, transuranic, and tank wastes. Environmental impacts associated with disposal of these wastes according to the alternatives listed above include potential doses to the downwind population from operation during the application of the handling and processing techniques comprising each disposal alternative. Scenarios for operational accident and abnormal operational events are postulated, on the basis of the currently available information, for the application of the techniques employed for each waste class for each disposal alternative. From these scenarios, an upper-bound airborne release of radioactive material was postulated for each waste class and disposal alternative. Potential downwind radiologic impacts were calculated from these upper-bound events. In all three alternatives, the single postulated event with the largest calculated radiologic impact for any waste class is an explosion of a mixture of ferri/ferro cyanide precipitates during the mechanical retrieval or microwave drying of the salt cake in single shell waste tanks. The anticipated downwind dose (70-year dose commitment) to the maximally exposed individual is 3 rem with a total population dose of 7000 man-rem. The same individual would receive 7 rem from natural background radiation during the same time period, and the same population would receive 3,000,000 man-rem. Radiological impacts to the public from all other postulated accidents would be less than that from this accident; furthermore, the radiological impacts resulting from this accident would be less than one-half that from the natural background radiation dose.

  14. About lamination upper and convexification lower bounds on the free energy of monoclinic shape memory alloys in the context of T 3-configurations and R-phase formation

    Science.gov (United States)

    Fechte-Heinen, R.; Schlömerkemper, A.

    2016-11-01

    This work is concerned with different estimates of the quasiconvexification of multi-well energy landscapes of NiTi shape memory alloys, which models the overall behavior of the material. Within the setting of the geometrically linear theory of elasticity, we consider a formula of the quasiconvexification which involves the so-called energy of mixing.We are interested in lower and upper bounds on the energy of mixing in order to get a better understanding of the quasiconvexification. The lower bound on the energy of mixing is obtained by convexification; it is also called Sachs or Reuß lower bound. The upper bound on the energy of mixing is based on second-order lamination. In particular, we are interested in the difference between the lower and upper bounds. Our numerical simulations show that the difference is in fact of the order of 1% and less in martensitic NiTi, even though both bounds on the energy of mixing were rather expected to differ more significantly. Hence, in various circumstances it may be justified to simply work with the convexification of the multi-well energy, which is relatively easy to deal with, or with the lamination upper bound, which always corresponds to a physically realistic microstructure, as an estimate of the quasiconvexification. In order to obtain a potentially large difference between upper and lower bound, we consider the bounds along paths in strain space which involve incompatible strains. In monoclinic shape memory alloys, three-tuples of pairwise incompatible strains play a special role since they form so-called T 3-configurations, originally discussed in a stress-free setting. In this work, we therefore consider in particular numerical simulations along paths in strain space which are related to these T 3-configurations. Interestingly, we observe that the second-order lamination upper bound along such paths is related to the geometry of the T 3-configurations. In addition to the purely martensitic regime, we also consider

  15. How much can Greenland melt? An upper bound on mass loss from the Greenland Ice Sheet through surface melting

    Science.gov (United States)

    Liu, X.; Bassis, J. N.

    2015-12-01

    With observations showing accelerated mass loss from the Greenland Ice Sheet due to surface melt, the Greenland Ice Sheet is becoming one of the most significant contributors to sea level rise. The contribution of the Greenland Ice Sheet o sea level rise is likely to accelerate in the coming decade and centuries as atmospheric temperatures continue to rise, potentially triggering ever larger surface melt rates. However, at present considerable uncertainty remains in projecting the contribution to sea level of the Greenland Ice Sheet both due to uncertainty in atmospheric forcing and the ice sheet response to climate forcing. Here we seek an upper bound on the contribution of surface melt from the Greenland to sea level rise in the coming century using a surface energy balance model coupled to an englacial model. We use IPCC Representative Concentration Pathways (RCP8.5, RCP6, RCP4.5, RCP2.6) climate scenarios from an ensemble of global climate models in our simulations to project the maximum rate of ice volume loss and related sea-level rise associated with surface melting. To estimate the upper bound, we assume the Greenland Ice Sheet is perpetually covered in thick clouds, which maximize longwave radiation to the ice sheet. We further assume that deposition of black carbon darkens the ice substantially turning it nearly black, substantially reducing its albedo. Although assuming that all melt water not stored in the snow/firn is instantaneously transported off the ice sheet increases mass loss in the short term, refreezing of retained water warms the ice and may lead to more melt in the long term. Hence we examine both assumptions and use the scenario that leads to the most surface melt by 2100. Preliminary models results suggest that under the most aggressive climate forcing, surface melt from the Greenland Ice Sheet contributes ~1 m to sea level by the year 2100. This is a significant contribution and ignores dynamic effects. We also examined a lower bound

  16. A geometric proof of the upper bound on the size of partial spreads in H(4n+1, q²)

    OpenAIRE

    Vanhove, Frédéric

    2011-01-01

    We give a geometric proof of the upper bound of q(2n+1) + 1 on the size of partial spreads in the polar space H(4n + 1, q(2)). This bound is tight and has already been proved in an algebraic way. Our alternative proof also yields a characterization of the partial spreads of maximum size in H(4n + 1, q(2)).

  17. Scientific rigor through videogames.

    Science.gov (United States)

    Treuille, Adrien; Das, Rhiju

    2014-11-01

    Hypothesis-driven experimentation - the scientific method - can be subverted by fraud, irreproducibility, and lack of rigorous predictive tests. A robust solution to these problems may be the 'massive open laboratory' model, recently embodied in the internet-scale videogame EteRNA. Deploying similar platforms throughout biology could enforce the scientific method more broadly.

  18. Design of a light confining concentrator for a solar photochemical reactor and upper bound to the method

    Science.gov (United States)

    Karamata, Boris; Andersen, Marilyne

    2016-09-01

    Optical concentration obtained by light confinement bears unique features that can increase the efficiency of a photochemical reactor. A suitable implementation of this method for a solar reactor is a series of parallel tubular receivers sealed in a slab-shape reflective cavity, in which light is trapped thanks to a self-adaptive optical filtering mechanism. To predict the concentration in such a generic configuration, we had previously established an analytical model based on idealistic assumptions, which are not valid in our real configuration. Here, we use analytical calculations and numerical ray-trace simulations to investigate how the finite size of the latter impacts the prediction of our model and extrapolate design guidelines for minimal departure from ideality. We apply these guidelines to design an optical concentrator maximizing flux density on tubular receivers and discuss the upper bound to the method, as well as the benefits from its unique features. Accounting for practical and technological limitations, this method can provide optical concentration in the order of ten suns in our generic configuration.

  19. A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry

    Directory of Open Access Journals (Sweden)

    Daniel Khoshnoudirad

    2015-09-01

    Full Text Available The aim of the paper is to bring new combinatorial analytical properties of the Farey diagrams of order $(m,n$, which are associated to the $(m,n$-cubes. The latter are the pieces of discrete planes occurring in discrete geometry, theoretical computer sciences, and combinatorial number theory. We give a new upper bound for the number of Farey vertices $FV(m,n$ obtained as intersections points of Farey lines ([14]: $$\\exists C>0, \\forall (m,n\\in\\mathbb{N}^{*2},\\quad \\Big|FV(m,n\\Big| \\leq C m^2 n^2 (m+n \\ln^2 (mn$$ Using it, in particular, we show that the number of $(m,n$-cubes $\\mathcal{U}_{m,n}$ verifies: $$\\exists C>0, \\forall (m,n\\in\\mathbb{N}^{*2},\\quad \\Big|\\mathcal{U}_{m,n}\\Big| \\leq C m^3 n^3 (m+n \\ln^2 (mn$$ which is an important improvement of the result previously obtained in [6], which was a polynomial of degree 8. This work uses combinatorics, graph theory, and elementary and analytical number theory.

  20. The study of slip line field and upper bound method based on associated flow and non-associated flow rules

    Institute of Scientific and Technical Information of China (English)

    Zheng Yingren; Deng Chujian; Wang Jinglin

    2010-01-01

    At present,associated flow rule of traditional plastic theory is adopted in the slip line field theory and upper bound method of geotechnical materials.So the stress characteristic line conforms to the velocity line.It is proved that geotechnical materials do not abide by the associated flow rule.It is impossible for the stress characteristic line to conform to the velocity line.Generalized plastic mechanics theoretically proved that plastic potential surface intersects the Mohr-Coulomb yield surface with an angle,so that the velocity line must be studied by non-associated flow rule.According to limit analysis theory,the theory of slip line field is put forward in this paper,and then the ultimate boating capacity of strip footing is obtained based on the associated flow rule and the non-associated flow rule individually.These two results are identical since the ultimate bearing capacity is independent of flow rule.On the contrary,the velocity fields of associated and non-associated flow rules are different which shows the velocity field based on the associated flow rule is incorrect.

  1. Upper bound on the mass anomalous dimension in many-flavor gauge theories -- a conformal bootstrap approach

    CERN Document Server

    Iha, Hisashi; Suzuki, Hiroshi

    2016-01-01

    We study four-dimensional conformal field theories with an $SU(N)$ global symmetry by employing the numerical conformal bootstrap. We consider the crossing relation associated with a four-point function of a spin~$0$ operator~$\\phi_i^{\\Bar{k}}$ which belongs to the adjoint representation of~$SU(N)$. For~$N=12$ for example, we found that the theory contains a spin~$0$ $SU(12)$-breaking relevant operator if the scaling dimension of~$\\phi_i^{\\Bar{k}}$, $\\Delta_{\\phi_i^{\\Bar{k}}}$, is smaller than~$1.63$. Considering the lattice simulation of the many-flavor QCD with $12$~flavors on the basis of the staggered fermion, the above $SU(12)$-breaking relevant operator, if it exists, would be induced by the flavor breaking effect of the staggered fermion and would prevent an approach to an infrared fixed point. Actual lattice simulations do not show such signs. Thus, assuming the absence of the above $SU(12)$-breaking relevant operator, we have an upper bound on the mass anomalous dimension at the fixed point~$\\gamma_m...

  2. An upper bound on the Higgs boson mass from Yukawa unification and a comment on vacuum stability constraints

    CERN Document Server

    Polonsky, N

    1994-01-01

    Only small regions in the m_{t} - \\tan\\beta plane are allowed when considering simultaneously (assuming the MSSM) coupling constant unification and (minimal) GUT relations among Yukawa couplings (i.e., h_{b} = h_{\\tau} at the unification point). In particular, if m_{t} \\simle 175 GeV we find that only 1 \\simle \\tan\\beta \\simle 1.5 or \\tan\\beta \\simgr 40 \\pm 10 is allowed. The former implies that the light Higgs boson is \\simle 110 GeV and, in principle, visible to LEPII. The prediction for the Higgs boson mass in the \\tan\\beta \\approx 1 scenario is discussed and uncertainties related to (i) vacuum stability constraints, (ii) different methods for calculating the Higgs boson mass, (iii) two-loop calculations and (iv) GUT corrections are briefly reviewed. It is shown that large left-right mixing between the t-scalars can significantly enhance the Higgs boson mass. That and an ambiguity in the size of the two-loop correction lead to our conservative upper bound of 110 GeV. Vacuum stability considerations constra...

  3. New upper bound on the scattering cross section of slow neutrons on liquid parahydrogen from neutron transmission

    CERN Document Server

    Grammer, K B; Barrón-Palos, L; Blyth, D; Bowman, J D; Calarco, J; Crawford, C; Craycraft, K; Evans, D; Fomin, N; Fry, J; Gericke, M; Gillis, R C; Greene, G L; Hamblen, J; Hayes, C; Kucuker, S; Mahurin, R; Maldonado-Velázquez, M; Martin, E; McCrea, M; Mueller, P E; Musgrave, M; Nann, H; Penttilä, S I; Snow, W M; Tang, Z; Wilburn, W S

    2014-01-01

    The scattering of slow neutron beams provides unique, non-destructive, quantitative information on the structure and dynamics of materials of interest in physics, chemistry, materials science, biology, geology, and other fields. Liquid hydrogen is a widely-used neutron moderator medium, and an accurate knowledge of its slow neutron cross section is essential for the design and optimization of intense slow neutron sources. In particular the rapid drop of the slow neutron scattering cross section of liquid parahydrogen below 15 meV, which renders the moderator volume transparent to the neutron energies of most interest for scattering studies, is therefore especially interesting and important. We have placed an upper bound on the total cross section and the scattering cross section for slow neutrons with energies between 0.43 meV and 16.1 meV on liquid hydrogen at 15.6 K using neutron transmission measurements on the hydrogen target of the NPDGamma collaboration at the Spallation Neutron Source at Oak Ridge Nati...

  4. Rigorous Newtonian cosmology

    Science.gov (United States)

    Tipler, Frank J.

    1996-10-01

    It is generally believed that it is not possible to rigorously analyze a homogeneous and isotropic cosmological model in Newtonian mechanics. I show on the contrary that if Newtonian gravity theory is rewritten in geometrical language in the manner outlined in 1923-1924 by Élie Cartan [Ann. Ecole Norm. Sup. 40, 325-412 (1923); 41, 1-25 (1924)], then Newtonian cosmology is as rigorous as Friedmann cosmology. In particular, I show that the equation of geodesic deviation in Newtonian cosmology is exactly the same as equation of geodesic deviation in the Friedmann universe, and that this equation can be integrated to yield a constraint equation formally identical to the Friedmann equation. However, Newtonian cosmology is more general than Friedmann cosmology: Ever-expanding and recollapsing universes are allowed in any noncompact homogeneous and isotropic spatial topology. I shall give a brief history of attempts to do cosmology in the framework of Newtonian mechanics.

  5. Upper-Bound Radiation Dose Assessment for Military Personnel at McMurdo Station, Antarctica, between 1962 and 1979, Revision 1

    Science.gov (United States)

    2016-07-29

    existing methods used to evaluate the probability of radiation exposure at McMurdo Station causing an existing cancer (probability of causation) in...estimate upper-bound radiation doses for McMurdo Station military support personnel that includes an evaluation of potential exposures while working...Furthermore, the potential health effects due to radiation exposures at the McMurdo Station were evaluated . It is important to note that the present dose

  6. 生长曲线模型中参数估计误差的上界%Upper Bound on the Estimation Error in a Growth Curve Model

    Institute of Scientific and Technical Information of China (English)

    左卫兵; 时文芳

    2015-01-01

    研究了生长曲线模型中利用lasso所得到的参数估计B^ L 的误差。在设计矩阵X1分别满足RE条件、兼容性条件和UDP条件时,依次得到估计误差‖^B L -B‖1的上界,并且该上界与协调参数成正比。%The upper bound of the estimation error in a growth curve model was discussed. Based on the lasso in the linear regression, the lasso estimation was obtained in the growth curve model. When the de-sign matrix X1 satisfies RE condition ( restricted eigenvalue condition) , compatibility condition, and UDP ( universal distortion property ) condition, the corresponding upper bound on estimation error‖B^L-B‖1 was successively identified. And the upper bounds were proportion to the tuning parameter.

  7. Parameter sets for upper and lower bounds on soil-to-indoor-air contaminant attenuation predicted by the Johnson and Ettinger vapor intrusion model

    Science.gov (United States)

    Tillman, Fred D.; Weaver, James W.

    Migration of volatile chemicals from the subsurface into overlying buildings is known as vapor intrusion (VI). Under certain circumstances, people living in homes above contaminated soil or ground water may be exposed to harmful levels of these vapors. A popular VI screening-level algorithm widely used in the United States, Canada and the UK to assess this potential risk is the "Johnson and Ettinger" (J&E) model. Concern exists over using the J&E model for deciding whether or not further action is necessary at sites, as many parameters are not routinely measured (or are un-measurable). Using EPA-recommended ranges of parameter values for nine soil-type/source depth combinations, input parameter sets were identified that correspond to bounding results of the J&E model. The results established the existence of generic upper and lower bound parameter sets for maximum and minimum exposure for all soil types and depths investigated. Using the generic upper and lower bound parameter sets, an analysis can be performed that, given the limitations of the input ranges and the model, bounds the attenuation factor in a VI investigation.

  8. An analytical upper bound on the number of loci required for all splits of a species tree to appear in a set of gene trees.

    Science.gov (United States)

    Uricchio, Lawrence H; Warnow, Tandy; Rosenberg, Noah A

    2016-11-11

    Many methods for species tree inference require data from a sufficiently large sample of genomic loci in order to produce accurate estimates. However, few studies have attempted to use analytical theory to quantify "sufficiently large". Using the multispecies coalescent model, we report a general analytical upper bound on the number of gene trees n required such that with probability q, each bipartition of a species tree is represented at least once in a set of n random gene trees. This bound employs a formula that is straightforward to compute, depends only on the minimum internal branch length of the species tree and the number of taxa, and applies irrespective of the species tree topology. Using simulations, we investigate numerical properties of the bound as well as its accuracy under the multispecies coalescent. Our results are helpful for conservatively bounding the number of gene trees required by the ASTRAL inference method, and the approach has potential to be extended to bound other properties of gene tree sets under the model.

  9. 关于随机MAX k-SAT模型的上界研究%The Upper Bound Research for Random MAX k-SAT

    Institute of Scientific and Technical Information of China (English)

    高宗升; 许学琳

    2011-01-01

    Given a CNF formula with n variables and m = αn k -clauses, it is interesting to study the maximum number max Fk of clauses satisfied by all the assignments of the variables (MAX k -SAT). When α is large, the upper bound of fk(n,αn)= IE(maxFk) for random MAX k -SAT had been derived by the first-moment argument.A tighter upper bound (1-1/2k)αn + h(α,t)· αn is proved, which is finished also by the first-moment argument and the precision of amplification is improved. At the same time, it is found that the upper bound becomes tighter with the increase of t.%对于包含n个变量和m=αn个长度为k的子句的CNF公式,人们比较关注公式中最大可满足子句的个数max Fk(MAX k-SAT).当子句密度α比较大时,随机MAX k-SAT模型中的变量fk(n,αn)(=)(E)(max Fk)的上界可以用一阶矩方法给出.通过对一阶矩方法放缩精度的改进,得到了它的一个更紧的上界(1-1/2k)αn+h(α,t)·αn.同时,可以证明这个新的上界随着t的增大而变得更紧.

  10. New upper bounds of perturbation for eigenvalues of arbitrary matrices%新的矩阵特征值扰动上界

    Institute of Scientific and Technical Information of China (English)

    孔祥强

    2012-01-01

    通过引入正规性偏离度的概念,利用矩阵的分解和矩阵的计算技巧,得到了全新的任意矩阵特征值的扰动上界,所得结果推广了Wielandt-Hoffman定理.%Using the decomposition of matrix, we obtained the new upper bounds of perturbation for eigenval ues of arbitrary matrices which extend the Wielandt-Hoffman theorem.

  11. Upper and Lower Bound Calculations of the Bearing Capacity of Strip Footings near Slopes in Cohesionless Soil

    DEFF Research Database (Denmark)

    Krabbenhøft, Sven; Damkilde, Lars; Krabbenhøft, Kristian

    2013-01-01

    . These factors only take into account the inclination of the slope, whereas other parameters, which may play a role, such as the distance from the footing to the slope, the width of the footing and the strength of the soil are ignored. The present work comprises finite element based upper- and lower...

  12. Bounds on the overall properties of composites with ellipsoidal inclusions

    Institute of Scientific and Technical Information of China (English)

    Lin-Zhi Wu; Shi-Dong Pan

    2012-01-01

    A new model is put forward to bound the effective elastic moduli of composites with ellipsoidal inclusions.In the present paper,transition layer for each eilipsoidal inclusion is introduced to make the trial displacement field for the upper bound and the trial stress field for the lower bound satisfy the continuous interface conditions which are absolutely necessary for the application of variational principles.According to the principles of minimum potential energy and minimum complementary energy,the upper and lower bounds on the effective elastic moduli of composites with ellipsoidal inclusions are rigorously derived.The effects of the distribution and geometric parameters of ellipsoidal inclusions on the bounds of the effective elastic moduli are analyzed in details.The present upper and lower bounds are still finite when the bulk and shear moduli of ellipsoidal inclusions tend to infinity and zero,respectively.It should be mentioned that the present method is simple and needs not calculate the complex integrals of multi-point correlation functions.Meanwhile,the present paper provides an entirely different way to bound the effective elastic moduli of composites with ellipsoidal inclusions,which can be developed to obtain a series of bounds by taking different trial displacement and stress fields.

  13. Positive Root Bounds and Root Separation Bounds

    Science.gov (United States)

    Herman, Aaron Paul

    In this thesis, we study two classes of bounds on the roots of a polynomial (or polynomial system). A positive root bound of a polynomial is an upper bound on the largest positive root. A root separation bound of a polynomial is a lower bound on the distance between the roots. Both classes of bounds are fundamental tools in computer algebra and computational real algebraic geometry, with numerous applications. In the first part of the thesis, we study the quality of positive root bounds. Higher quality means that the relative over-estimation (the ratio of the bound and the largest positive root) is smaller. We find that all known positive root bounds can be arbitrarily bad. We then show that a particular positive root bound is tight for certain important classes of polynomials. In the remainder of the thesis, we turn to root separation bounds. We observe that known root separation bounds are usually very pessimistic. To our surprise, we also find that known root separation bounds are not compatible with the geometry of the roots (unlike positive root bounds). This motivates us to derive new root separation bounds. In the second part of this thesis, we derive a new root separation for univariate polynomials by transforming a known bound into a new improved bound. In the third part of this thesis, we use a similar strategy to derive a new improved root separation bound for polynomial systems.

  14. Acceleration of Type 2 Spicules in the Solar Chromosphere - 2: Viscous Braking and Upper Bounds on Coronal Energy Input

    CERN Document Server

    Goodman, Michael L

    2014-01-01

    A magnetohydrodynamic model is used to determine conditions under which the Lorentz force accelerates plasma to type 2 spicule speeds in the chromosphere. The model generalizes a previous model to include a more realistic pre-spicule state, and the vertical viscous force. Two cases of acceleration under upper chromospheric conditions are considered. The magnetic field strength for these cases is ~ this energy. Compressive heating dominates during the early phase of acceleration. The maximum energy injected into the corona by type 2 spicules, defined as the energy flux in the upper chromosphere, may largely balance total coronal energy losses in quiet regions, possibly also in coronal holes, but not in active regions. It is proposed that magnetic flux emergence in inter-granular regions drives type 2 spicules.

  15. Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs

    CERN Document Server

    Butera, P; Pernici, M

    2015-01-01

    Using a relation between the virial expansion coefficients of the pressure and the entropy expansion coefficients in the case of the monomer-dimer model on infinite regular lattices, we have shown that, on hypercubic lattices of any dimension, the virial coefficients are positive through the 20th order. We have observed that all virial coefficients so far known for this system are positive also on infinite regular lattices with different structure. We are thus led to conjecture that the virial expansion coefficients $m_k $ are always positive. These considerations can be extended to the study of related bounds on finite graphs generalizing the infinite regular lattices, namely the finite grids and the regular biconnected graphs. The validity of the bounds $\\Delta^k {\\rm ln}(i! N(i)) \\le 0$ for $k \\ge 2$, where $N(i)$ is the number of configurations of $i$ dimers on the graph and $\\Delta$ is the forward difference operator, is shown to correspond to the positivity of the virial coefficients. Our tests on many ...

  16. Data envelopment analysis with upper bound on output to measure efficiency performance of departments in Malaikulsaleh University

    Science.gov (United States)

    Abdullah, Dahlan; Suwilo, Saib; Tulus; Mawengkang, Herman; Efendi, Syahril

    2017-09-01

    The higher education system in Indonesia can be considered not only as an important source of developing knowledge in the country, but also could create positive living conditions for the country. Therefore it is not surprising that enrollments in higher education continue to expand. However, the implication of this situation, the Indonesian government is necessarily to support more funds. In the interest of accountability, it is essential to measure the efficiency for this higher institution. Data envelopment analysis (DEA) is a method to evaluate the technical efficiency of production units which have multiple input and output. The higher learning institution considered in this paper is Malikussaleh University located in Lhokseumawe, a city in Aceh province of Indonesia. This paper develops a method to evaluate efficiency for all departments in Malikussaleh University using DEA with bounded output. Accordingly, we present some important differences in efficiency of those departments. Finally we discuss the effort should be done by these departments in order to become efficient.

  17. Acceleration of type 2 spicules in the solar chromosphere. II. Viscous braking and upper bounds on coronal energy input

    Energy Technology Data Exchange (ETDEWEB)

    Goodman, Michael L., E-mail: mgoodman@wvhtf.org [Advanced Technologies Group, West Virginia High Technology Consortium Foundation, 1000 Galliher Drive, Fairmont, WV 26554 (United States)

    2014-04-20

    A magnetohydrodynamic model is used to determine conditions under which the Lorentz force accelerates plasma to type 2 spicule speeds in the chromosphere. The model generalizes a previous model to include a more realistic pre-spicule state, and the vertical viscous force. Two cases of acceleration under upper chromospheric conditions are considered. The magnetic field strength for these cases is ≤12.5 and 25 G. Plasma is accelerated to terminal vertical speeds of 66 and 78 km s{sup –1} in 100 s, compared with 124 and 397 km s{sup –1} for the case of zero viscosity. The flows are localized within horizontal diameters ∼80 and 50 km. The total thermal energy generated by viscous dissipation is ∼10 times larger than that due to Joule dissipation, but the magnitude of the total cooling due to rarefaction is ≳ this energy. Compressive heating dominates during the early phase of acceleration. The maximum energy injected into the corona by type 2 spicules, defined as the energy flux in the upper chromosphere, may largely balance total coronal energy losses in quiet regions, possibly also in coronal holes, but not in active regions. It is proposed that magnetic flux emergence in intergranular regions drives type 2 spicules.

  18. Upper Bounds on r-Mode Amplitudes from Observations of Low-Mass X-Ray Binary Neutron Stars

    Science.gov (United States)

    Mahmoodifar, Simin; Strohmayer, Tod

    2013-01-01

    We present upper limits on the amplitude of r-mode oscillations and gravitational-radiation-induced spin-down rates in low-mass X-ray binary neutron stars, under the assumption that the quiescent neutron star luminosity is powered by dissipation from a steady-state r-mode. For masses <2M solar mass we find dimensionless r-mode amplitudes in the range from about 1×10(exp-8) to 1.5×10(exp-6). For the accreting millisecond X-ray pulsar sources with known quiescent spin-down rates, these limits suggest that approx. less than 1% of the observed rate can be due to an unstable r-mode. Interestingly, the source with the highest amplitude limit, NGC 6440, could have an r-mode spin-down rate comparable to the observed, quiescent rate for SAX J1808-3658. Thus, quiescent spin-down measurements for this source would be particularly interesting. For all sources considered here, our amplitude limits suggest that gravitational wave signals are likely too weak for detection with Advanced LIGO. Our highest mass model (2.21M solar mass) can support enhanced, direct Urca neutrino emission in the core and thus can have higher r-mode amplitudes. Indeed, the inferred r-mode spin-down rates at these higher amplitudes are inconsistent with the observed spin-down rates for some of the sources, such as IGR J00291+5934 and XTE J1751-305. In the absence of other significant sources of internal heat, these results could be used to place an upper limit on the masses of these sources if they were made of hadronic matter, or alternatively it could be used to probe the existence of exotic matter in them if their masses were known.

  19. 关于反平均数的2个上界%Two Upper Bounds for the Antiaverage Numbers

    Institute of Scientific and Technical Information of China (English)

    姚明; 姚兵; 谢建民; 陈文静

    2012-01-01

    对于整数k,θ≥3,β≥1,称k个元素集合S为(k;β,θ)0自由集,如果S的最小元素为0且它没有互不相同的元素aij∈S(1≤j≤θ)使得∑(θ-)(j=1)aij=βaiθ成立,S的最大元素记为max(S).反平均数定义为λ(k;β,θ)=min{max(S):S是(k;β,θ)0自由集}.给出反平均数λ(k;β,θ)的2个界.%For integers k, θ≥ 3 and, β ≥ 1, we say a k-set S as a (k; β,θ)0-free set if the smallest number of S is 0, and S does not contain distinct elements aij G S(l ≤ j ≤ θ) such that ∑(θ-1)(j=1)aij=βaiθ.The maximum number of S is denoted as max(S). The generalized antiaverage number is defined as λ(k;β,θ)=min{max(S):S is (k;β,θ)0-free set}. Two bounds of antiaverage numbers λ(k;β,θ) are shown here.

  20. Kinetic instability, symmetry breaking and role of geometric constraints on the upper bounds of disorder in two dimensional packings

    Science.gov (United States)

    Kishore, Raj; Das, Shreeja; Nussinov, Zohar; Sahu, Kisor K.

    2016-06-01

    Although the energetics of grain boundaries are more or less understood, their mechanical description remains challenging primarily because of very fast dynamics in the atomic length scale. By contrast, granular dynamics are extraordinarily sluggish. In this study, two dimensional centripetal packings of macroscopic granular particles are employed to investigate the role of geometric aspects of grain boundary formation. Using a novel sampling scheme, the extensive configuration space is well represented by a few prominent structures. Our results suggest that cohesive effects “iron out” any disorder present and enforce a transition towards a “fixed point” basin associated with a universal high density jammed hexagonal structure. Two main conjectures are advanced: (i) the appearance of grain boundary like structures is the manifestation of the kinetic instabilities of the densification process and has its origin in the structural rearrangement and (ii) the departure from six-fold coordination in the final packing is bounded from above by a sixth of the angular dispersion present in the initial configuration. If similar predictive consequences are further developed for three dimensional cases, this may have far reaching consequences in many areas of science and technology.

  1. Wielandt-type absolute perturbation upper bound for eigenvalues of normal matrices%正规矩阵特征值的Wielandt型绝对扰动上界

    Institute of Scientific and Technical Information of China (English)

    孔祥强

    2011-01-01

    研究了一类特殊矩阵特征值的绝对扰动上界问题,利用矩阵的奇异值分解和矩阵计算方面的技巧,探讨了正规矩阵特征值的扰动问题,得到了正规矩阵特征值的Wielandt型绝对扰动上界。本文得到的结论还进一步推广了Wielandt-Hoffman定理.是比Wielandt-Hoffman定理更一般的形式。%This paper studies the absolute perturbation upper bounds for a class of special matrix eigenvalues. By using the techniques of singular value decomposition and matrix calculation, it discusses the perturbation for eigenvalues of normal matrices and obtai

  2. An Upper Bound on the Strongly Forbidden $6S_{1/2} \\leftrightarrow 5D_{3/2}$ Magnetic Dipole Transition Moment in {Ba}$^{+}$

    CERN Document Server

    Williams, Spencer R; Hoffman, Matthew R; Blinov, Boris B; Fortson, E N

    2016-01-01

    We report the results from our first-generation experiment to measure the magnetic-dipole transition moment (M1) between the $6S_{1/2}$ and $5D_{3/2}$ manifolds in Ba$^{+}$. Knowledge of M1 is crucial for the proposed parity-nonconservation experiment in the ion \\cite{Fortson93}, where M1 will be a leading source of systematic error. To date, no measurement of M1 has been made in Ba$^{+}$, and moreover, the sensitivity of the moment to electron-electron correlations has confounded accurate theoretical predictions. A precise measurement may help to resolve the theoretical discrepancies while providing essential information for planning a future PNC measurement in Ba$^{+}$. We demonstrate our technique for measuring M1 - including a method for calibrating for stress-induced birefringence introduced by the scientific apparatus - and place an upper bound of $\\mathrm{M1} < 93 \\pm 39 \\times 10^{-5} \\mu_{B}$.

  3. Lower and upper bounds for the absolute free energy by the hypothetical scanning Monte Carlo method: application to liquid argon and water.

    Science.gov (United States)

    White, Ronald P; Meirovitch, Hagai

    2004-12-08

    The hypothetical scanning (HS) method is a general approach for calculating the absolute entropy S and free energy F by analyzing Boltzmann samples obtained by Monte Carlo or molecular dynamics techniques. With HS applied to a fluid, each configuration i of the sample is reconstructed by gradually placing the molecules in their positions at i using transition probabilities (TPs). At each step of the process the system is divided into two parts, the already treated molecules (the "past"), which are fixed, and the as yet unspecified (mobile) "future" molecules. Obtaining the TP exactly requires calculating partition functions over all positions of the future molecules in the presence of the frozen past, thus it is customary to invoke various approximations to best represent these quantities. In a recent publication [Proc. Natl. Acad. Sci. USA 101, 9235 (2004)] we developed a version of HS called complete HSMC, where each TP is calculated from an MC simulation involving all of the future molecules (the complete future); the method was applied very successfully to Lennard-Jones systems (liquid argon) and a box of TIP3P water molecules. In its basic implementation the method provides lower and upper bounds for F, where the latter can be evaluated only for relatively small systems. Here we introduce a new expression for an upper bound, which can be evaluated for larger systems. We also propose a new exact expression for F and verify its effectiveness. These free energy functionals lead to significantly improved accuracy (as applied to the liquid systems above) which is comparable to our thermodynamic integration results. We formalize and discuss theoretical aspects of HSMC that have not been addressed in previous studies. Additionally, several functionals are developed and shown to provide the free energy through the analysis of a single configuration.

  4. Mutual Information Rate and Bounds for It

    Science.gov (United States)

    Baptista, Murilo S.; Rubinger, Rero M.; Viana, Emilson R.; Sartorelli, José C.; Parlitz, Ulrich; Grebogi, Celso

    2012-01-01

    The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators. PMID:23112809

  5. Mutual information rate and bounds for it.

    Directory of Open Access Journals (Sweden)

    Murilo S Baptista

    Full Text Available The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR, is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic networks or between two time series (not fully deterministic, and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.

  6. Mutual information rate and bounds for it.

    Science.gov (United States)

    Baptista, Murilo S; Rubinger, Rero M; Viana, Emilson R; Sartorelli, José C; Parlitz, Ulrich; Grebogi, Celso

    2012-01-01

    The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.

  7. Upper Bounds on epsilon'/epsilon Parameters B_6^{(1/2)} and B_8^{(3/2)} from Large N QCD and other News

    CERN Document Server

    Buras, Andrzej J

    2015-01-01

    We demonstrate that in the large N approach developed by the authors in collaboration with Bardeen, the parameters B_6^{(1/2)} and B_8^{(3/2)} parametrizing the K\\to\\pi\\pi matrix elements _0 and _2 of the dominant QCD and electroweak operators receive both negative O(1/N) corrections such that B_6^{(1/2)} _0 implies for the corresponding parameter B_8^{(1/2)}=1.01\\pm 0.03 to be compared with large N value B_8^{(1/2)}=1.1\\pm 0.1. We discuss briefly the implications of these findings for the ratio epsilon'/epsilon. In fact, with the precise value for B_8^{(3/2)} from RBC-UKQCD collaboration, our upper bound on B_6^{(1/2)} implies epsilon'/epsilon in the SM roughly by a factor of two below its experimental value (16.6\\pm 2.3)\\times 10^{-4}. We also briefly comment on the parameter \\hat B_K and the \\Delta I=1/2$ rule.

  8. Special relativity as classical kinematics of a particle with the upper bound on its speed. Part II. The general Lorentz transforrmation and the generalized velocity composition theorem

    CERN Document Server

    Granik, Alex

    2014-01-01

    The kinematics of a particle with the upper bound on the particle's speed (a modification of classical kinematics where such a restriction is absent) has been developed in [arXiv:1204.5740]. It was based solely on classical mechanics without employing any concepts , associated with the time dilatation or/and length contraction. It yielded the 1-D Lorentz transformation (LT), free of inconsistencies (inherent in the canonical derivation and interpretations of the LT). Here we apply the same approach to derive the LT for the 3-dimensional motion of a particle and the attendant law of velocity composition. As a result, the infinite set of four-parameter transformations is obtained. The requirement of linearity of these transformations selects out of this set the two-parameter subset . The values of the remaining two parameters ,dictated by physics of the motion, is explicitly determined , yielding the canonical form of the 3-dimensional LT. The generalized law of velocity composition and the attendant invariant ...

  9. OBSERVATIONAL UPPER BOUND ON THE COSMIC ABUNDANCES OF NEGATIVE-MASS COMPACT OBJECTS AND ELLIS WORMHOLES FROM THE SLOAN DIGITAL SKY SURVEY QUASAR LENS SEARCH

    Energy Technology Data Exchange (ETDEWEB)

    Takahashi, Ryuichi; Asada, Hideki [Faculty of Science and Technology, Hirosaki University, Hirosaki 036-8561 (Japan)

    2013-05-01

    The latest result in the Sloan Digital Sky Survey Quasar Lens Search (SQLS) has set the first cosmological constraints on negative-mass compact objects and Ellis wormholes. There are no multiple images lensed by the above two exotic objects for {approx}50, 000 distant quasars in the SQLS data. Therefore, an upper bound is put on the cosmic abundances of these lenses. The number density of negative-mass compact objects is n < 10{sup -8}(10{sup -4}) h {sup 3} Mpc{sup -3} at the mass scale |M| > 10{sup 15}(10{sup 12}) M{sub Sun }, which corresponds to the cosmological density parameter |{Omega}| < 10{sup -4} at the galaxy and cluster mass range |M| = 10{sup 12-15} M{sub Sun }. The number density of the Ellis wormhole is n < 10{sup -4} h {sup 3} Mpc{sup -3} for a range of the throat radius a = 10-10{sup 4} pc, which is much smaller than the Einstein ring radius.

  10. Bounds on the recoverable deformations of polycrystalline SMAs at finite strain

    Directory of Open Access Journals (Sweden)

    Peigney Michaël

    2015-01-01

    Full Text Available This communication is concerned with the theoretical prediction of the recoverable strains (i.e. the strains that can be recovered by the shape memory effect in polycrystalline SMAs. The analysis is carried out in the finite strain setting, considering a nonlinear elasticity model of phase transformation. The main results are some rigorous upper bounds on the set of recoverable strains. Those bounds depend on the polycrystalline texture through the volume fractions of the different orientations. A two-orientation polycrystal of tetragonal martensite is studied as an illustration. In that case, analytical expressions of the upper bounds are derived and the results are compared with lower bounds obtained by considering laminate textures. The issue of applying the proposed method to complex polycrystalline textures is commented on.

  11. Optimal bounds with semidefinite programming: an application to stress driven shear flows

    CERN Document Server

    Fantuzzi, G

    2015-01-01

    We introduce an innovative numerical technique based on convex optimization to solve a range of infinite dimensional variational problems arising from the application of the background method to fluid flows. In contrast to most existing schemes, we do not consider the Euler-Lagrange equations for the minimizer. Instead, we use series expansions to formulate a finite dimensional semidefinite program (SDP) whose solution converges to that of the original variational problem. The formulation is rigorous, meaning that a solution of the SDP gives a certifiably feasible solution for the infinite dimensional problem. Moreover, SDPs can be easily formulated when the fluid is subject to imposed boundary fluxes, which pose a challenge for the traditional methods. We apply this technique to compute rigorous and near-optimal upper bounds on the dissipation coefficient for flows driven by a surface stress. We improve previous analytical bounds by more than 10 times, and show that the bounds become independent of the domai...

  12. Upper bound method for seismic stability limit analysis of earth-rock dams%土石坝坡抗震极限分析上限法

    Institute of Scientific and Technical Information of China (English)

    杨昕光; 迟世春

    2013-01-01

    A new approach based on the limit analysis upper bound theorem is proposed to study the seismic stability of earth-rock dams. First, according to the upper bound analysis, a perfectly plastic soil model is assumed with an associated flow rule. Then, the dam slope is divided into horizontal slices with regarding the sliding surface as an arbitrary surface. In order to obtain the maximum anti-seismic capability of dams and the corresponding sliding surface, the multivariate function is established by the energy-work balance equation and optimized by intelligent algorithm. For the study of the influences of shear strength parameters and horizontal slice number on the maximum anti-seismic capability and the sliding surface, the new approach is applied to a typical earth-rock dam with core wall. It is shown by the results that the horizontal slice number has a great influence on the sliding surface but a small influence on the maximum anti-seismic capability. When the horizontal slices achieve a certain number, the maximum anti-seismic capability of dams is ultimately a stable value. Meanwhile, the shear strength parameters of the rockfill materials have a great influence on the maximum anti-seismic capability. Compared with the limit equilibrium method the result illustrates the correctness and feasibility of the proposed method.%基于极限分析的上限定理,提出一种土石坝极限抗震分析的新方法.该方法假定土体为理想刚塑性材料且满足相关联流动准则,将土石坝坡滑动体划分为若干水平土条,计算各滑动土条的外功率与内能耗散,然后通过能量平衡条件,利用优化算法确定土石坝的极限抗震能力.运用所提方法,对一典型心墙土石坝进行极限抗震能力分析,研究了水平条分数以及抗剪强度参数对极限抗震能力影响.计算结果表明,水平条分数对滑裂面形状影响较大而对大坝极限抗震能力影响较小.当水平条分数增加到一定数目

  13. 基于自然单元法的极限上限分析%UPPER-BOUND LIMIT ANALYSES BASED ON NATURAL ELEMENT METHOD

    Institute of Scientific and Technical Information of China (English)

    周书涛; 刘应华; 陈莘莘

    2012-01-01

    The natural element method (NEM) is a novel numerical method based on voronoi diagram and delaunay triangulation of the scattered points in problem domain,and its shape function is built upon the notion of natural neighbor interpolation. Compared with the moving least square (MLS) approximation used widely in many meshless methods,natural neighbor interpolation does not involve the complex matrix inversion,needs no artificial parameter but can improve the computational efficiency. The obtained shape function satisfies the property of Kronecker delta function, and this character results in the consequence that the essential boundary condition can be easily imposed as in finite element method (FEM). Meanwhile, the problems with discontinuous field functions likewise their discontinuous derivatives can be conveniently treated. According to the kinematic theorem of plastic limit analysis,this article applies the natural element method to upper bound limit analysis. The corresponding mathematical programming formulations are established and the computational codes are implemented to solve them. Several classical examples of limit analysis are adopted to verify the performance of these codes. Furthermore,the smoothing operations are also provided to calculate plastic dissipation work on the nodes by the similar treatment of stress smoothing operation,and the contours of plastic dissipation work at the limit states are displayed. The computational results show that utilizing natural element method to solve upper bound limit analysis problems possesses the advantage of good stability,high accuracy and fast convergence.%自然单元法是一种基于离散点集的Voronoi图和Delaunay三角化几何信息,以自然邻近插值为试函数的新型数值方法.相对于一般无网格法中常采用的移动最小二乘近似而言,自然邻近插值不涉及到复杂的矩阵求逆运算,更不需要任何人为的参数,可以提高计算效率.采用该方法构造的

  14. Physical Uncertainty Bounds (PUB)

    Energy Technology Data Exchange (ETDEWEB)

    Vaughan, Diane Elizabeth [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Preston, Dean L. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-03-19

    This paper introduces and motivates the need for a new methodology for determining upper bounds on the uncertainties in simulations of engineered systems due to limited fidelity in the composite continuum-level physics models needed to simulate the systems. We show that traditional uncertainty quantification methods provide, at best, a lower bound on this uncertainty. We propose to obtain bounds on the simulation uncertainties by first determining bounds on the physical quantities or processes relevant to system performance. By bounding these physics processes, as opposed to carrying out statistical analyses of the parameter sets of specific physics models or simply switching out the available physics models, one can obtain upper bounds on the uncertainties in simulated quantities of interest.

  15. A rigorous implementation of the Jeans-Landau-Teller approximation

    CERN Document Server

    Benettin, G; Gallavotti, G

    1995-01-01

    Rigorous bounds on the rate of energy exchanges between vibrational and translational degrees of freedom are established in simple classical models of diatomic molecules. The results are in agreement with an elementary approximation introduced by Landau and Teller. The method is perturbative theory ``beyond all orders'', with diagrammatic techniques (tree expansions) to organize and manipulate terms, and look for compensations, like in recent studies on KAM theorem homoclinic splitting.

  16. 对于轮和完全图的Ramsey函数的渐近上界%Asymptotic upper bounds for wheel:complete graph Ramsey numbers

    Institute of Scientific and Technical Information of China (English)

    宋洪雪

    2004-01-01

    It is shown that r(Wm, Kn)≤(1+o(1))C1(n)/(logn)/(2m-2)/(m-2) for fixed even m≥4 and n→∞, and r(Wm, Kn)≤(1+o(1))C2(n(2m)/(m+1))/(logn) (m+1)/(m-1) for fixed odd m≥5 and n→∞, where C1=C1(m)>0 and C2=C2(m)>0, in particular, C2=12 if m=5. It is obtained by the analytic method and using the function fm(x)=∫10((1-t) (1)/(m)dt)/(m+(x-m)t), x≥0, m≥1 on the base of the asymptotic upper bounds for r(Cm, Kn) which were given by Caro, et al. Also, c(n)/(logn)(5)/(2)≤r(K4, Kn)≤(1+o(1)) (n3)/((logn)2) (as n→∞). Moreover, we give r(Kk+Cm, Kn)≤(1+o(1))C5(m)(n)/(logn) k+(m)/(m-2) for fixed even m≥4 and r(Kk+Cm, Kn)≤(1+o(1))C6(m)(n (2+(k+1)(m-1))/(2+k(m-1)))/(logn)k+(2)/(m-1) for fixed odd m≥3 (as n→∞).%给出了当n趋向于无穷时, 对于不小于4的偶数m, 有r(Wm, Kn)≤(1+o(1))C1·(n)/(logn)(2m-2)/(m-2); 对于不小于5的奇数m, 有r(Wm, Kn)≤(1+o(1))C2(n(2m)/(m+1))/(logn)(m+1)/(m-1). 这里C1=C1(m)>0, C2=C2(m)>0. 特别地, C2(5)=12. 该定理是在Caro等给出的r(Cm, Kn)的渐近上界的基础上利用函数fm(x)=∫10((1-t)(1)/(m)dt)/(m+(x-m)t) 得到的. 当n趋向于无穷时, c(n)/(logn)(5)/(2)≤r(K4, Kn)≤(1+o(1))(n3)/((logn)2). 本文还给出了r(Kk+Cm, Kn)的渐近上界.

  17. Adaptive Control of Networked Systems in the Presence of Bounded Disturbances

    Directory of Open Access Journals (Sweden)

    A. H. Tahoun

    2007-01-01

    Full Text Available The insertion of data network in the feedback adaptive control loops makes the analysis and design of networked control systems more complex than traditional control systems. This paper addresses the adaptive stabilization problem of linear time-invariant networked control systems when the measurements of the plant states are corrupted by bounded disturbances. The case of state feedback is treated in which only an upper bound on the norm of matrix A is needed. The problem is to find an upper bound on the transmission period h that guarantees the stability of the overall adaptive networked control system under an ideal transmission process, i.e. no transmission delay or packet dropout. Rigorous mathematical proofs are established, that relies heavily on Lyapunov's stability criterion and dead-zone Technique. Simulation results are given to illustrate the efficacy of our design approach.

  18. Realizing rigor in the mathematics classroom

    CERN Document Server

    Hull, Ted H (Henry); Balka, Don S

    2014-01-01

    Rigor put within reach! Rigor: The Common Core has made it policy-and this first-of-its-kind guide takes math teachers and leaders through the process of making it reality. Using the Proficiency Matrix as a framework, the authors offer proven strategies and practical tools for successful implementation of the CCSS mathematical practices-with rigor as a central objective. You'll learn how to Define rigor in the context of each mathematical practice Identify and overcome potential issues, including differentiating instruction and using data

  19. New bounds for multi-dimensional packing

    OpenAIRE

    Seiden, S.; Stee, van, Rob

    2001-01-01

    New upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The main results, stated for d=2, are as follows: A new upper bound of 2.66013 for online box packing, a new $14/9 + varepsilon$ polynomial time offline approximation algorithm for square packing, a new upper bound ...

  20. Rigor and Responsiveness in Classroom Activity

    Science.gov (United States)

    Thomspon, Jessica; Hagenah, Sara; Kang, Hosun; Stroupe, David; Braaten, Melissa; Colley, Carolyn; Windschitl, Mark

    2016-01-01

    Background/Context: There are few examples from classrooms or the literature that provide a clear vision of teaching that simultaneously promotes rigorous disciplinary activity and is responsive to all students. Maintaining rigorous and equitable classroom discourse is a worthy goal, yet there is no clear consensus of how this actually works in a…

  1. Analysis on modeling and performance upper bound of tree type wireless sensor networks%树形无线传感器网络的建模与性能上界分析

    Institute of Scientific and Technical Information of China (English)

    威力斯; 李振波; 张大伟; 张铮; 陈佳品

    2013-01-01

    探究无线传感器网络的性能上限,对于理解网络在最不理想情形下的行为非常重要,而且能够提供合适的设计参考.基于此,提出了一种对树形无线传感器网络建模,并对网络性能确定性上界进行分析的方法.该方法通过树形拓扑的深度、最大子路由节点数和最大子终端节点数来确定模型,并借助网络演算的相关知识,推导出了由拓扑结构和传输特性决定的节点缓存上界、节点带宽需求及端到端数据流延迟上界的递推公式,并且还示范了如何将推导出的公式应用到IEEE 802.15.4/Zig Bee树形无线传感器网络中.%Exploring performance upper bound of wireless sensor networks (WSNs) is very important for understanding the worst-case behavior of the network,and may provide proper design reference.Based on this,a tree WSNs modeling and network,methodology of analysis on performance upper bound is proposed.This method confirm model through depth,the maximum number of child routing node and the maximum number of child end nodes of tree topology.Using network calculus knowledge,recurrence expressions for node buffering upper bound and node bandwidth requirements as well as end-to-end data flow delay upper bounds as a function of topology structure and transmission specifications are derived,how to apply the derived expression to IEEE 802.15.4/Zig Bee tree WSNs is demonstrated.

  2. Graviton Mass Bounds

    CERN Document Server

    de Rham, Claudia; Tolley, Andrew J; Zhou, Shuang-Yong

    2016-01-01

    Recently, aLIGO has announced the first direct detections of gravitational waves, a direct manifestation of the propagating degrees of freedom of gravity. The detected signals GW150914 and GW151226 have been used to examine the basic properties of these gravitational degrees of freedom, particularly setting an upper bound on their mass. It is timely to review what the mass of these gravitational degrees of freedom means from the theoretical point of view, particularly taking into account the recent developments in constructing consistent massive gravity theories. Apart from the GW150914 mass bound, a few other observational bounds have been established from the effects of the Yukawa potential, modified dispersion relation and fifth force that are all induced when the fundamental gravitational degrees of freedom are massive. We review these different mass bounds and examine how they stand in the wake of recent theoretical developments and how they compare to the bound from GW150914.

  3. Rigorous Science: a How-To Guide

    Directory of Open Access Journals (Sweden)

    Arturo Casadevall

    2016-11-01

    Full Text Available Proposals to improve the reproducibility of biomedical research have emphasized scientific rigor. Although the word “rigor” is widely used, there has been little specific discussion as to what it means and how it can be achieved. We suggest that scientific rigor combines elements of mathematics, logic, philosophy, and ethics. We propose a framework for rigor that includes redundant experimental design, sound statistical analysis, recognition of error, avoidance of logical fallacies, and intellectual honesty. These elements lead to five actionable recommendations for research education.

  4. Estimating upper bounds for occupancy and number of manatees in areas potentially affected by oil from the Deepwater Horizon oil spill.

    Science.gov (United States)

    Martin, Julien; Edwards, Holly H; Bled, Florent; Fonnesbeck, Christopher J; Dupuis, Jérôme A; Gardner, Beth; Koslovsky, Stacie M; Aven, Allen M; Ward-Geiger, Leslie I; Carmichael, Ruth H; Fagan, Daniel E; Ross, Monica A; Reinert, Thomas R

    2014-01-01

    The explosion of the Deepwater Horizon drilling platform created the largest marine oil spill in U.S. history. As part of the Natural Resource Damage Assessment process, we applied an innovative modeling approach to obtain upper estimates for occupancy and for number of manatees in areas potentially affected by the oil spill. Our data consisted of aerial survey counts in waters of the Florida Panhandle, Alabama and Mississippi. Our method, which uses a Bayesian approach, allows for the propagation of uncertainty associated with estimates from empirical data and from the published literature. We illustrate that it is possible to derive estimates of occupancy rate and upper estimates of the number of manatees present at the time of sampling, even when no manatees were observed in our sampled plots during surveys. We estimated that fewer than 2.4% of potentially affected manatee habitat in our Florida study area may have been occupied by manatees. The upper estimate for the number of manatees present in potentially impacted areas (within our study area) was estimated with our model to be 74 (95%CI 46 to 107). This upper estimate for the number of manatees was conditioned on the upper 95%CI value of the occupancy rate. In other words, based on our estimates, it is highly probable that there were 107 or fewer manatees in our study area during the time of our surveys. Because our analyses apply to habitats considered likely manatee habitats, our inference is restricted to these sites and to the time frame of our surveys. Given that manatees may be hard to see during aerial surveys, it was important to account for imperfect detection. The approach that we described can be useful for determining the best allocation of resources for monitoring and conservation.

  5. Estimating upper bounds for occupancy and number of manatees in areas potentially affected by oil from the Deepwater Horizon oil spill.

    Directory of Open Access Journals (Sweden)

    Julien Martin

    Full Text Available The explosion of the Deepwater Horizon drilling platform created the largest marine oil spill in U.S. history. As part of the Natural Resource Damage Assessment process, we applied an innovative modeling approach to obtain upper estimates for occupancy and for number of manatees in areas potentially affected by the oil spill. Our data consisted of aerial survey counts in waters of the Florida Panhandle, Alabama and Mississippi. Our method, which uses a Bayesian approach, allows for the propagation of uncertainty associated with estimates from empirical data and from the published literature. We illustrate that it is possible to derive estimates of occupancy rate and upper estimates of the number of manatees present at the time of sampling, even when no manatees were observed in our sampled plots during surveys. We estimated that fewer than 2.4% of potentially affected manatee habitat in our Florida study area may have been occupied by manatees. The upper estimate for the number of manatees present in potentially impacted areas (within our study area was estimated with our model to be 74 (95%CI 46 to 107. This upper estimate for the number of manatees was conditioned on the upper 95%CI value of the occupancy rate. In other words, based on our estimates, it is highly probable that there were 107 or fewer manatees in our study area during the time of our surveys. Because our analyses apply to habitats considered likely manatee habitats, our inference is restricted to these sites and to the time frame of our surveys. Given that manatees may be hard to see during aerial surveys, it was important to account for imperfect detection. The approach that we described can be useful for determining the best allocation of resources for monitoring and conservation.

  6. Estimate of the Upper Bound of Second Eigenvalue with Weight for Mixed Differential System%混合微分系统带权第二特征值的上界

    Institute of Scientific and Technical Information of China (English)

    卢亦平; 钱椿林

    2014-01-01

    考虑混合微分系统带权第二特征值的上界估计。利用试验函数,Rayleigh定理,分部积分和Schwartz 不等式等估计方法与技巧,获得了用第一特征值来估计第二特征值的上界的不等式,其估计系数与区间的度量无关。其结果在物理学和力学中有着广泛的应用,在常微分方程的研究中起着重要的作用。%Considering the estimate of the upper bound of second eigenvalue for mixed differential system, this paper obtains the ine-quality of the upper bound of second eigenvalue from the first eigenvalue by using testing function, Rayleigh theorem, integration by parts and Schwartz inequality. The estimate coefficients do not depend on the measure of the domain. This kind of problem is signifi-cant both in theory of differential equations and in application to mechanics and physics.

  7. Bound entanglement and entanglement bounds

    Energy Technology Data Exchange (ETDEWEB)

    Sauer, Simeon [Physikalisch-Astronomische Fakultaet, Friedrich-Schiller-Univesitaet Jena (Germany)]|[Physikalisches Institut, Albert-Ludwigs-Universitaet Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg (Germany); Melo, Fernando de; Mintert, Florian; Buchleitner, Andreas [Physikalisches Institut, Albert-Ludwigs-Universitaet Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg (Germany)]|[Max-Planck-Institut fuer Physik komplexer Systeme, Noethnitzer Str.38, D-01187 Dresden (Germany); Bae, Joonwoo [School of Computational Sciences, Korea Institute for Advanced Study, Seoul 130-012 (Korea); Hiesmayr, Beatrix [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)

    2008-07-01

    We investigate the separability of Bell-diagonal states of two qutrits. By using lower bounds to algebraically estimate concurrence, we find convex regions of bound entangled states. Some of these regions exactly coincide with the obtained results when employing optimal entanglement witnesses, what shows that the lower bound can serve as a precise detector of entanglement. Some hitherto unknown regions of bound entangled states were discovered with this approach, and delimited efficiently.

  8. 同轴不连续性等效网络中变分电容上、下限值的物理实质%Essence of the Upper and Lower Bound to the Variational Capacitances in the Equivalent Networks of Coaxial Discontinuities

    Institute of Scientific and Technical Information of China (English)

    张文政; 张晓娟

    2011-01-01

    The lower bound to the equivalent variational capacitance of a coaxial step discontinuity was solved with Functional Approximation Methods;the identity between the upper bound and lower bound to the equivalent networks' variational capacitances was proved for several common coaxial discontinuities, basing upon the identity essence of the upper bound and lower bound to the variational capacitance was obtained from the standpoint of eigen mode function.%应用泛函近似方法求解了一类同轴阶梯不连续性结构等效变分电容下限值;证明了几类常见同轴不连续性等效网络中变分电容上、下限值的同一性,并据此从本征模式函数的角度给出了该上、下限值的物理解释.

  9. Negatively Biased Relevant Subsets Induced by the Most-Powerful One-Sided Upper Confidence Limits for a Bounded Physical Parameter

    CERN Document Server

    Cousins, Robert D

    2011-01-01

    Suppose an observable x is the measured value (negative or non-negative) of a true mean mu (physically non-negative) in an experiment with a Gaussian resolution function with known fixed rms deviation s. The most powerful one-sided upper confidence limit at 95% C.L. is UL = x+1.64s, which I refer to as the "original diagonal line". Perceived problems in HEP with small or non-physical upper limits for x<0 historically led, for example, to substitution of max(0,x) for x, and eventually to abandonment in the Particle Data Group's Review of Particle Physics of this diagonal line relationship between UL and x. Recently Cowan, Cranmer, Gross, and Vitells (CCGV) have advocated a concept of "power constraint" that when applied to this problem yields variants of diagonal line, including UL = max(-1,x)+1.64s. Thus it is timely to consider again what is problematic about the original diagonal line, and whether or not modifications cure these defects. In a 2002 Comment, statistician Leon Jay Gleser pointed to the lite...

  10. Distinguishability Revisited: Depth Dependent Bounds on Reconstruction Quality in Electrical Impedance Tomography

    DEFF Research Database (Denmark)

    Garde, Henrik; Knudsen, Kim

    2017-01-01

    The reconstruction problem in electrical impedance tomography is highly ill-posed, and it is often observed numerically that reconstructions have poor resolution far away from the measurement boundary but better resolution near the measurement boundary. The observation can be quantified...... by the concept of distinguishability of inclusions. This paper provides mathematically rigorous results supporting the intuition. Indeed, for a model problem lower and upper bounds on the distinguishability of an inclusion are derived in terms of the boundary data. These bounds depend explicitly on the distance...... of the inclusion to the boundary, i.e. the depth of the inclusion. The results are obtained for disk inclusions in a homogeneous background in the unit disk. The theoretical bounds are veried numerically using a novel, exact characterization of the forward map as a tridiagonal matrix....

  11. The TAOS Project: Upper Bounds on the Population of Small KBOs and Tests of Models of Formation and Evolution of the Outer Solar System

    CERN Document Server

    Bianco, F B; Lehner, M J; Mondal, S; King, S -K; Giammarco, J; Holman, M J; Coehlo, N K; Wang, J -H; Alcock, C; Axelrod, T; Byun, Y -I; Chen, W P; Cook, K H; Dave, R; de Pater, I; Kim, D -W; Lee, T; Lin, H -C; Lissauer, J J; Marshall, S L; Protopapas, P; Rice, J A; Schwamb, M E; Wang, S -Y; Wen, C -Y

    2010-01-01

    We have analyzed the first 3.75 years of data from TAOS, the Taiwanese American Occultation Survey. TAOS monitors bright stars to search for occultations by Kuiper Belt Objects (KBOs). This dataset comprises 5e5 star-hours of multi-telescope photometric data taken at 4 or 5 Hz. No events consistent with KBO occultations were found in this dataset. We compute the number of events expected for the Kuiper Belt formation and evolution models of Pan & Sari (2005), Kenyon & Bromley (2004), Benavidez & Campo Bagatin (2009), and Fraser (2009). A comparison with the upper limits we derive from our data constrains the parameter space of these models. This is the first detailed comparison of models of the KBO size distribution with data from an occultation survey. Our results suggest that the KBO population is comprised of objects with low internal strength and that planetary migration played a role in the shaping of the size distribution.

  12. On synthesis of relevance and rigor

    OpenAIRE

    2009-01-01

    This paper presents a critique of Freek Vermeulen’s synthesis of rigor and relevance in management research, and argues (1) at the first glance, Vermeulen’s papers are very appealing; (2) but with a closer scrutiny, we can unveil the weak and shaky foundations of his argument; (3) as a consequence, his solution of ‘adding a second loop’ to make management research meet dual needs of rigor and relevance is illusory and merely an applied science fiction; (4) and finally, there ar...

  13. Theory of phase transitions rigorous results

    CERN Document Server

    Sinai, Ya G

    1982-01-01

    Theory of Phase Transitions: Rigorous Results is inspired by lectures on mathematical problems of statistical physics presented in the Mathematical Institute of the Hungarian Academy of Sciences, Budapest. The aim of the book is to expound a series of rigorous results about the theory of phase transitions. The book consists of four chapters, wherein the first chapter discusses the Hamiltonian, its symmetry group, and the limit Gibbs distributions corresponding to a given Hamiltonian. The second chapter studies the phase diagrams of lattice models that are considered at low temperatures. The no

  14. Fixed Points and Generalized Equilibrium Problems with Lower and Upper Bounds in Topological Spaces%拓扑空间上的不动点和具有上下界的广义平衡问题

    Institute of Scientific and Technical Information of China (English)

    朴勇杰

    2012-01-01

    The definition of a weak Φ-map was introduced and some fixed point theorems for a weak Φ-map denned on topological spaces with ω-connected structure and without any compact setting were obtained. As applications of the above results, several existence of solutions for generalized equilibrium problems with lower and upper bounds were discussed in non-compact topological spaces.%引进了弱Φ-映射的定义并得到了具有ω-连通结构但没有紧致结构的拓扑空间上定义的弱Φ-映射的不动点定理.作为上述结果的应用,在非紧致的拓扑空间上讨论了若干的具有上下界的广义平衡问题的解的存在性问题.

  15. Bounds for Certain Character Sums

    Institute of Scientific and Technical Information of China (English)

    杨锦; 郑志勇

    2003-01-01

    This paper shows a connection between exponential sums and character sums. In particular, we introduce a character sum that is an analog of the classical Kloosterman sums and establish the analogous Weil-Estermann's upper bound for it. The paper also analyzes a generalized Hardy-Littlewood example for character sums, which shows that the upper bounds given here are the best possible. The analysis makes use of local bounds for the exponential sums and character sums. The basic theorems have been previously established.

  16. Fine-Tuned Intrinsically Ultramicroporous Polymers Redefine the Permeability/Selectivity Upper Bounds of Membrane-Based Air and Hydrogen Separations

    KAUST Repository

    Swaidan, Raja

    2015-08-20

    Intrinsically ultramicroporous (<7 Å) polymers represent a new paradigm in materials development for membrane-based gas separation. In particular, they demonstrate that uniting intrachain “rigidity”, the traditional design metric of highly permeable polymers of intrinsic microporosity (PIMs), with gas-sieving ultramicroporosity yields high-performance gas separation membranes. Highly ultramicroporous PIMs have redefined the state-of-the-art in large-scale air (e.g., O2/N2) and hydrogen recovery (e.g., H2/N2, H2/CH4) applications with unprecedented molecular sieving gas transport properties. Accordingly, presented herein are new 2015 permeability/selectivity “upper bounds” for large-scale commercial membrane-based air and hydrogen applications that accommodate the substantial performance enhancements of recent PIMs over preceding polymers. A subtle balance between intrachain rigidity and interchain spacing has been achieved in the amorphous microstructures of PIMs, fine-tuned using unique bridged-bicyclic building blocks (i.e., triptycene, ethanoanthracene and Tröger’s base) in both ladder and semiladder (e.g., polyimide) structures.

  17. A rigorous framework for interactive robot control

    NARCIS (Netherlands)

    Stramigioli, S; Fasse, ED; Willems, JC

    2002-01-01

    This paper presents a rigorous, analytical framework for interactive control methods such as stiffness and impedance control. This paper does not present a novel synthesis method for robot control design. Rather, it presents a proper framework to analyse controllers for robots whose purpose is to in

  18. Academic Rigor: The Core of the Core

    Science.gov (United States)

    Brunner, Judy

    2013-01-01

    Some educators see the Common Core State Standards as reason for stress, most recognize the positive possibilities associated with them and are willing to make the professional commitment to implementing them so that academic rigor for all students will increase. But business leaders, parents, and the authors of the Common Core are not the only…

  19. Finite state projection based bounds to compare chemical master equation models using single-cell data

    Science.gov (United States)

    Fox, Zachary; Neuert, Gregor; Munsky, Brian

    2016-08-01

    Emerging techniques now allow for precise quantification of distributions of biological molecules in single cells. These rapidly advancing experimental methods have created a need for more rigorous and efficient modeling tools. Here, we derive new bounds on the likelihood that observations of single-cell, single-molecule responses come from a discrete stochastic model, posed in the form of the chemical master equation. These strict upper and lower bounds are based on a finite state projection approach, and they converge monotonically to the exact likelihood value. These bounds allow one to discriminate rigorously between models and with a minimum level of computational effort. In practice, these bounds can be incorporated into stochastic model identification and parameter inference routines, which improve the accuracy and efficiency of endeavors to analyze and predict single-cell behavior. We demonstrate the applicability of our approach using simulated data for three example models as well as for experimental measurements of a time-varying stochastic transcriptional response in yeast.

  20. Bounds for Asian basket options

    Science.gov (United States)

    Deelstra, Griselda; Diallo, Ibrahima; Vanmaele, Michèle

    2008-09-01

    In this paper we propose pricing bounds for European-style discrete arithmetic Asian basket options in a Black and Scholes framework. We start from methods used for basket options and Asian options. First, we use the general approach for deriving upper and lower bounds for stop-loss premia of sums of non-independent random variables as in Kaas et al. [Upper and lower bounds for sums of random variables, Insurance Math. Econom. 27 (2000) 151-168] or Dhaene et al. [The concept of comonotonicity in actuarial science and finance: theory, Insurance Math. Econom. 31(1) (2002) 3-33]. We generalize the methods in Deelstra et al. [Pricing of arithmetic basket options by conditioning, Insurance Math. Econom. 34 (2004) 55-57] and Vanmaele et al. [Bounds for the price of discrete sampled arithmetic Asian options, J. Comput. Appl. Math. 185(1) (2006) 51-90]. Afterwards we show how to derive an analytical closed-form expression for a lower bound in the non-comonotonic case. Finally, we derive upper bounds for Asian basket options by applying techniques as in Thompson [Fast narrow bounds on the value of Asian options, Working Paper, University of Cambridge, 1999] and Lord [Partially exact and bounded approximations for arithmetic Asian options, J. Comput. Finance 10 (2) (2006) 1-52]. Numerical results are included and on the basis of our numerical tests, we explain which method we recommend depending on moneyness and time-to-maturity.

  1. 同时考虑张拉及剪切破坏的边坡上限原理有限元法%LINEARIZED UPPER BOUND LIMIT ANALYSIS CONSIDERING TENSION AND SHEAR FAILURES FOR SLOPE STABILITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    孙聪; 李春光; 郑宏; 孙冠华; 刘治军

    2015-01-01

    The upper bound finite element method is one of the commonly used methods for slope stability analysis. Since the Mohr-Coulomb shear yield criterion which is widely used overrates the tension strength,the tensile cracks cannot be get at the rear of the slope when using it for slope stability analysis. In order to solve this problem,the yield surface approximation method of the upper bound finite element method was remolded. From the viewpoint of discrete spatial orientation the plastic flow constraint equation on the discrete directions can be built easily,and by introducing the tension damage to the upper limit method,each azimuth plane was satisfied the tensile failure criteria,and then the linearized upper bound finite element method considering both tension and shear failures can be established. This method can be used to calculate the safety factor of slope and get the critical velocity field with tensile crack. A few of examples prove the effectiveness of this method.%上限有限元法是一种常用的边坡稳定性分析方法,目前被广泛采用的仅考虑剪切破坏的 Mohr-Coulomb 屈服准则过高地估计了边坡的抗拉强度,因此在用其进行边坡稳定性分析时,无法得到实际工程中常遇到的位于坡体后缘的拉裂缝。针对这一问题,从空间方位离散的角度出发,对上限法中的 Mohr-Coulomb 屈服面逼近方式进行改造,建立基于方位离散的线性化剪切屈服准则;同时引入张拉破坏准则,保证在每一个离散方位平面上不违背张拉破坏准则,从而形成既考虑张拉破坏,又考虑剪切破坏的线性化上限原理有限元法。该方法可以准确地求出边坡的安全系数和带有拉裂缝的临界失稳速度场。算例证明方法的有效性,同时还表明不考虑拉伸破坏会过高地估计边坡的安全性。

  2. On Bounded Weight Codes

    CERN Document Server

    Bachoc, Christine; Cohen, Gerard; Sole, Patrick; Tchamkerten, Aslan

    2010-01-01

    The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters.

  3. Rigorous modal analysis of metallic nanowire chains.

    Science.gov (United States)

    Hochman, Amit; Leviatan, Yehuda

    2009-08-03

    Nanowire chains (NCs) are analyzed by use of a rigorous, full-wave, Source-Model Technique (SMT). The technique employs a proper periodic Green's function which converges regardless of whether the structure is lossless or lossy. By use of this Green's function, it is possible to determine the complex propagation constants of the NC modes directly and accurately, as solutions of a dispersion equation. To demonstrate the method, dispersion curves and mode profiles for a few NCs are calculated.

  4. Determining Normal-Distribution Tolerance Bounds Graphically

    Science.gov (United States)

    Mezzacappa, M. A.

    1983-01-01

    Graphical method requires calculations and table lookup. Distribution established from only three points: mean upper and lower confidence bounds and lower confidence bound of standard deviation. Method requires only few calculations with simple equations. Graphical procedure establishes best-fit line for measured data and bounds for selected confidence level and any distribution percentile.

  5. Scalable Capacity Bounding Models for Wireless Networks

    OpenAIRE

    Du, Jinfeng; Medard, Muriel; Xiao, Ming; Skoglund, Mikael

    2014-01-01

    The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper (resp. lower) bounding models, which can be used to calculate the outer (resp. inner) bounds for the capacity region of the original noisy network. Based on the network equivalence framework, this paper presents scalable upper and lower bounding models for wireless networks with potentially many nodes. A channel decoupling method is proposed...

  6. Rigorous time slicing approach to Feynman path integrals

    CERN Document Server

    Fujiwara, Daisuke

    2017-01-01

    This book proves that Feynman's original definition of the path integral actually converges to the fundamental solution of the Schrödinger equation at least in the short term if the potential is differentiable sufficiently many times and its derivatives of order equal to or higher than two are bounded. The semi-classical asymptotic formula up to the second term of the fundamental solution is also proved by a method different from that of Birkhoff. A bound of the remainder term is also proved. The Feynman path integral is a method of quantization using the Lagrangian function, whereas Schrödinger's quantization uses the Hamiltonian function. These two methods are believed to be equivalent. But equivalence is not fully proved mathematically, because, compared with Schrödinger's method, there is still much to be done concerning rigorous mathematical treatment of Feynman's method. Feynman himself defined a path integral as the limit of a sequence of integrals over finite-dimensional spaces which is obtained by...

  7. Rigorous analytical approximation of tritronquée solution to Painlevé-I and the first singularity

    Science.gov (United States)

    Adali, A.; Tanveer, S.

    2016-10-01

    We use a recently developed method [1,2] to determine approximate expression for tritronquée solution for P-1: y″ + 6y2 - x = 0 in a domain D with rigorous bounds. In particular we rigorously confirm the location of the closest singularity from the origin to be at x = -770766/323285 = - 2.3841687675 ⋯ to within 5 ×10-6 accuracy, in agreement with previous numerical calculations [6].

  8. Software metrics a rigorous and practical approach

    CERN Document Server

    Fenton, Norman

    2014-01-01

    A Framework for Managing, Measuring, and Predicting Attributes of Software Development Products and ProcessesReflecting the immense progress in the development and use of software metrics in the past decades, Software Metrics: A Rigorous and Practical Approach, Third Edition provides an up-to-date, accessible, and comprehensive introduction to software metrics. Like its popular predecessors, this third edition discusses important issues, explains essential concepts, and offers new approaches for tackling long-standing problems.New to the Third EditionThis edition contains new material relevant

  9. Griffith Edwards' rigorous sympathy with Alcoholics Anonymous.

    Science.gov (United States)

    Humphreys, Keith

    2015-07-01

    Griffith Edwards made empirical contributions early in his career to the literature on Alcoholics Anonymous (AA), but the attitude he adopted towards AA and other peer-led mutual help initiatives constitutes an even more important legacy. Unlike many treatment professionals who dismissed the value of AA or were threatened by its non-professional approach, Edwards was consistently respectful of the organization. However, he never became an uncritical booster of AA or overgeneralized what could be learnt from it. Future scholarly and clinical endeavors concerning addiction-related mutual help initiatives will benefit by continuing Edwards' tradition of 'rigorous sympathy'. © 2015 Society for the Study of Addiction.

  10. Design and rigorous analysis of generalized axially- symmetric dual-reflector antennas

    Science.gov (United States)

    Moreira, Fernando J. S.

    1997-10-01

    The development of reflector antennas is continuously driven by ever increasing performance requirements, creating a demand for improved design and analysis tools. Ideally, the antenna synthesis should rely on general closed-form design equations (to establish the initial geometry and performance), as well as on accurate analysis techniques (to tune up the antenna performance by accounting for all pertinent electrical effects). Driven by these motivations, this dissertation provides the required formulation for the rigorous (in a numerical sense) analysis of axially-symmetric dual-reflector antennas and for their effective design. The rigorous analysis is performed using integral-equation techniques, which permit the inclusion of all relevant antenna components (i.e., reflector surfaces and feed structure), with the exception of the supporting struts and radomes. These techniques allow the electrical performance of a designed antenna to be accurately determined, hence minimizing the use of hardware models. The design portion starts with a unified investigation of generalized classical axially-symmetric dual-reflector antennas- conic-section generated configurations that minimize the main-reflector scattering towards the subreflector while providing a uniform-phase aperture illumination. It is shown that all possible configurations can be grouped in four basic categories. Using Geometrical Optics principles, useful closed-form design expressions are obtained, allowing a straightforward determination of the initial geometry and its upper-bound high-frequency performance. The improvement of the antenna radiation characteristics through the reflector shaping is also explored. An amplitude distribution is proposed for the shaped-antenna aperture field (with constant phase), providing high efficiency while controlling the sidelobe envelope. The diffraction and spillover effects are also investigated using Geometrical Theory of Diffraction, yielding useful formulas and

  11. Upper Bound Method of Plastic Limit Analysis Using Finite Elements for Layered Rock Slope Stability%层状岩质边坡稳定性有限元塑性极限分析上限法研究

    Institute of Scientific and Technical Information of China (English)

    陈康

    2014-01-01

    本文基于有限元上限法,研究了不同层理面参数、岩体容重和边坡坡高对边坡稳定性的影响,研究结果表明:随着层理面强度的增加,边坡稳定性越高;岩体容重和边坡坡高的增加,边坡越不稳定。本文研究成果可为类似工程起借鉴作用。%It researched on the different layer plane parameters,bulk density of rock and the slope height for slope stability based on the finite element of upper bound method,the results showed:With the increase of bedding surface strength,the slope stability higher;The increase of rock of bulk density and the slope height,the slope more unstable.The results of this article can be a reference for similar projects.

  12. Upper bound of Ⅱb region in clinical target volume for intensity-modulated radiotherapy for nasopharyngeal carcinoma%鼻咽癌IMRT的CTV中Ⅱb区上界的探讨

    Institute of Scientific and Technical Information of China (English)

    王丽君; 郭业松; 张兰芳; 黄生富; 何侠; 张宜勤

    2016-01-01

    目的:探讨鼻咽癌IMRT的CTV中Ⅱb 区的上界,并寻找个体化缩减Ⅱb 区范围的标准。方法回顾分析2012—2014年收治的142例( AJCC 2010分期标准Ⅰ、Ⅱ、Ⅲ、Ⅳ期分别为8、37、41、56例)初治鼻咽癌患者采用IMRT情况。根据影像阅片研究鼻咽癌颈部淋巴结分布规律。比较缩减Ⅱb 区范围者与未缩减者腮腺剂量参数差异并t检验及t'检验。结果咽后外侧淋巴结和Ⅱb 区淋巴结是最常见受累淋巴结,转移率分别为75�4%和67�6%。在Ⅱb 区受累患者中51�0%出现了高位阳性淋巴结,6�3%阳性淋巴结上界超过了RTOG分区定义的Ⅱb 区上界。对符合拟定标准患者缩减Ⅱb 区范围是安全的,优化靶区后可显著降低腮腺D50、V26( P=0�000)。结论在勾画鼻咽癌颈部CTV时,原则上Ⅱb 区上界应至侧颅底,但对符合拟定标准者可个体化缩减Ⅱb 区上界,以更好地保护腮腺。%Objective To explore the upper bound of Ⅱb region in the clinical target volume ( CTV ) for intensity⁃modulated radiotherapy ( IMRT ) for nasopharyngeal carcinoma ( NPC ) , and to establish a standard for personalized reduction in the range ofⅡb region. Methods A retrospective analysis was performed on the IMRT results of 142 patients newly diagnosed with NPC who were admitted to our hospital from 2012 to 2014. According to the American Joint Committee on Cancer 2010 staging system, there were 8 patients with stageⅠ disease, 37 stage Ⅱ, 41 stage Ⅲ, and 56 stage Ⅳ. The distribution pattern of cervical lymph nodes in NPC was studied based on the imaging results. Comparison of the dose to parotid glands between patients with and without reduction in the range ofⅡb region was made by t test and t'test. Results The metastasis rates of the most common diseased lymph nodes, lateral retropharyngeal lymph node and Ⅱb lymph node, were 75�4% and 67�6%, respectively. In the patients

  13. Erratum to “A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry” [J. Algebra Comb. Discrete Appl. 2(3 (2015 169-190

    Directory of Open Access Journals (Sweden)

    Daniel Khoshnoudirad

    2016-05-01

    Full Text Available The equation (4 on the page 178 of the paper previously published has to be corrected. We had only handled the case of the Farey vertices for which $\\min\\left(\\left\\lfloor\\dfrac{2m}{sr'}\\right\\rfloor,\\left\\lfloor\\dfrac{n}{s'r}\\right\\rfloor \\right\\in\\mathbb{N}^{*}$. In fact we had to distinguish two cases: $\\min\\left(\\left\\lfloor\\dfrac{2m {sr'}\\right\\rfloor,\\left\\lfloor\\dfrac{n}{s'r}\\right\\rfloor \\right\\in\\mathbb{N}^{*}$ and $\\min\\left(\\left\\lfloor\\dfrac{2m}{sr'}\\right\\rfloor,\\left\\lfloor\\dfrac{n}{s'r}\\right\\rfloor \\right=0$. However, we highlight the correct results of the original paper and its applications. We underline that in this work, we still brought several contributions. These contributions are: applying the fundamental formulas of Graph Theory to the Farey diagram of order $(m,n$, finding a good upper bound for the degree of a Farey vertex and the relations between the Farey diagrams and the linear diophantine equations.

  14. Upper and lower bounds for stop-loss premiums in the discrete time risk process%一类离散时间风险过程停止损失保费的上下界估计

    Institute of Scientific and Technical Information of China (English)

    包振华; 梁媛; 赵洁

    2014-01-01

    Reinsurance is a prime activity of almost all insurers ,w hen faced with excessively large claims ,the insurance company may depend on the reinsurance to deal with risk diversification and sta-ble operation .Stop-loss reinsurance is an important form of reinsurance w hich is determined by the retention level and the reinsured amount is equal to the excess of the retention level .In this paper we derive three different kinds of upper and lower bounds for the stop-loss premiums in a discrete time renewal risk process .Numerical examples are also given .%再保险对于所有的保险人而言都是极为重要的,当面临巨额索赔时,保险公司需要通过再保险进行分散风险、稳定经营。停止损失再保险是一种重要的再保险形式,它承保损失超出指定免赔额的超额部分。针对一类离散时间更新风险过程,给出了停止损失保费的3种不同形式的上下界估计,并通过实例做了数值分析。

  15. Upper bound solutions of ring compression test

    OpenAIRE

    Martín, Francisco; Sevilla, Lorenzo; Camacho, Ana; Sebastián, Miguel Ángel

    2013-01-01

    El presente trabajo aborda una particularización del proceso de forja, estudiando la deformación de un anillo. El conformado plástico se realiza mediante el empleo del Teorema del Límite Superior y siguiendo el modelo de Bloques Rígidos Triangulares para calcular la carga mínima necesaria para deformar plásticamente la pieza. Se establece la pieza a deformar como un anillo de geometría determinada por el denominado Ensayo de Compresión de Anillo (Ring Compression Test) bajo su configuración c...

  16. Upper bound for R(a,l)

    CERN Document Server

    Rumyantsev, Andrey

    2010-01-01

    Let $A$ be an $a$-letter alphabet. We consider fractional powers of $A$-strings: if $x$ is a $n$-letter string, $x^r$ is a prefix of $xxxx\\...$ having length $nr$. Let $l$ be a positive integer. Ilie, Ochem and Shallit defined $R(a,l)$ as the infimum of reals $r>1$ such that there exist a sequence $\\omega$ (of $A$-letters) without factors $y$ that are fractional powers $x^{r'}$ where $x$ has length at least $l$ and $r'\\ge r$. We prove that $1+\\frac{1}{la}\\le R(a,l)\\le 1+\\frac{c}{la}$ for some constant $c$.

  17. Invariant Measures and Asymptotic Gaussian Bounds for Normal Forms of Stochastic Climate Model

    Institute of Scientific and Technical Information of China (English)

    Yuan YUAN; Andrew J.MAJDA

    2011-01-01

    The systematic development of reduced low-dimensional stochastic climate models from observations or comprehensive high dimensional climate models is an important topic for atmospheric low-frequency variability, climate sensitivity, and improved extended range forecasting. Recently, techniques from applied mathematics have been utilized to systematically derive normal forms for reduced stochastic climate models for low-frequency variables. It was shown that dyad and multiplicative triad interactions combine with the climatological linear operator interactions to produce a normal form with both strong nonlinear cubic dissipation and Correlated Additive and Multiplicative (CAM) stochastic noise. The probability distribution functions (PDFs) of low frequency climate variables exhibit small but significant departure from Gaussianity but have asymptotic tails which decay at most like a Gaussian. Here, rigorous upper bounds with Gaussian decay are proved for the invariant measure of general normal form stochastic models. Asymptotic Gaussian lower bounds are also established under suitable hypotheses.

  18. Communicating the rigor behind science results

    Science.gov (United States)

    Jackson, R.; Callery, S.

    2015-12-01

    Communicating the rigor behind science resultsNASA's Global Climate Change website and companion Facebook page have an exceptionally large reach. Moderating the vast quantity of questions, feedback and comments from these public platforms has provided a unique perspective on the way the public views science, the scientific method and how science is funded. Email feedback and social media interactions reveal widespread misperceptions about how science is carried out: There is considerable criticism and suspicion surrounding methods of funding, and the difficulty of obtaining grants is underestimated. There appears to be limited public awareness of the peer review process. This talk will highlight the need for better communication not only of science results, but the process of science--from proposal writing and getting funded to peer-review and fundamental science terminology. As a community of science communicators, we also need to highlight the inaccuracies sometimes introduced by media reports of peer-reviewed science papers.

  19. Rigor in Qualitative Supply Chain Management Research

    DEFF Research Database (Denmark)

    Goffin, Keith; Raja, Jawwad; Claes, Björn

    2012-01-01

    Purpose – The purpose of this paper is to share the authors' experiences of using the repertory grid technique in two supply chain management studies. The paper aims to demonstrate how the two studies provided insights into how qualitative techniques such as the repertory grid can be made more...... rigorous than in the past, and how results can be generated that are inaccessible using quantitative methods. Design/methodology/approach – This paper presents two studies undertaken using the repertory grid technique to illustrate its application in supply chain management research. Findings – The paper......, reliability, and theoretical saturation. Originality/value – It is the authors' contention that the addition of the repertory grid technique to the toolset of methods used by logistics and supply chain management researchers can only enhance insights and the building of robust theories. Qualitative studies...

  20. Statistics for mathematicians a rigorous first course

    CERN Document Server

    Panaretos, Victor M

    2016-01-01

    This textbook provides a coherent introduction to the main concepts and methods of one-parameter statistical inference. Intended for students of Mathematics taking their first course in Statistics, the focus is on Statistics for Mathematicians rather than on Mathematical Statistics. The goal is not to focus on the mathematical/theoretical aspects of the subject, but rather to provide an introduction to the subject tailored to the mindset and tastes of Mathematics students, who are sometimes turned off by the informal nature of Statistics courses. This book can be used as the basis for an elementary semester-long first course on Statistics with a firm sense of direction that does not sacrifice rigor. The deeper goal of the text is to attract the attention of promising Mathematics students.

  1. Using Fun to Teach Rigorous Content

    Directory of Open Access Journals (Sweden)

    Mary Francis

    2013-02-01

    Full Text Available This paper will offer a position on the place of fun within education and learning. It will place fun as an important component of learning. The intent is not to espouse the belief that it is the duty of teachers and instructors to entertain students. Unlike a movie or TV show that provides passive entertainment, fun in this context relates to actions and techniques that aid students in learning new material. So rather than fun being associated with ease, fun is associated with rigor. In drawing together research on the successful impact of fun in education, this paper hopes to be an impetus for librarians to consider fun within their pedagogical approach to instruction and to spur conversation on how information literacy instruction is formatted.

  2. Advancing Rigorous Methodologies: A Review of "Towards Rigor in Reviews of Multivocal Literatures ...."

    Science.gov (United States)

    Yin, Robert K.

    1991-01-01

    R. T. Ogawa and B. Malen's article does not meet its own recommended standards for rigorous testing and presentation of its own conclusions. Use of the exploratory case study to analyze multivocal literatures is not supported, and the claim of grounded theory to analyze multivocal literatures may be stronger. (SLD)

  3. Advancing Rigorous Methodologies: A Review of "Towards Rigor in Reviews of Multivocal Literatures ...."

    Science.gov (United States)

    Yin, Robert K.

    1991-01-01

    R. T. Ogawa and B. Malen's article does not meet its own recommended standards for rigorous testing and presentation of its own conclusions. Use of the exploratory case study to analyze multivocal literatures is not supported, and the claim of grounded theory to analyze multivocal literatures may be stronger. (SLD)

  4. Capacity Bounds for Parallel Optical Wireless Channels

    KAUST Repository

    Chaaban, Anas

    2016-01-01

    A system consisting of parallel optical wireless channels with a total average intensity constraint is studied. Capacity upper and lower bounds for this system are derived. Under perfect channel-state information at the transmitter (CSIT), the bounds have to be optimized with respect to the power allocation over the parallel channels. The optimization of the lower bound is non-convex, however, the KKT conditions can be used to find a list of possible solutions one of which is optimal. The optimal solution can then be found by an exhaustive search algorithm, which is computationally expensive. To overcome this, we propose low-complexity power allocation algorithms which are nearly optimal. The optimized capacity lower bound nearly coincides with the capacity at high SNR. Without CSIT, our capacity bounds lead to upper and lower bounds on the outage probability. The outage probability bounds meet at high SNR. The system with average and peak intensity constraints is also discussed.

  5. Conductivity bounds in probe brane models

    CERN Document Server

    Ikeda, Tatsuhiko N; Nakai, Yuichiro

    2016-01-01

    We discuss upper and lower bounds on the electrical conductivity of finite temperature strongly coupled quantum field theories, holographically dual to probe brane models, within linear response. In a probe limit where disorder is introduced entirely through an inhomogeneous background charge density, we find simple lower and upper bounds on the electrical conductivity in arbitrary dimensions. In field theories in two spatial dimensions, we show that both bounds persist even when disorder is included in the bulk metric. We discuss the challenges with finding sharp lower bounds on conductivity in three or more spatial dimensions when the metric is inhomogeneous.

  6. A BOSE-EINSTEIN CONDENSATE WITH PT-SYMMETRIC DOUBLE-DELTA FUNCTION LOSS AND GAIN IN A HARMONIC TRAP: A TEST OF RIGOROUS ESTIMATES

    Directory of Open Access Journals (Sweden)

    Daniel Haag

    2014-04-01

    Full Text Available We consider the linear and nonlinear Schrödinger equation for a Bose-Einstein condensate in a harmonic trap with PT-symmetric double-delta function loss and gain terms. We verify that the conditions for the applicability of a recent proposition by Mityagin and Siegl on singular perturbations of harmonic oscillator type self-adjoint operators are fulfilled. In both the linear and nonlinear case we calculate numerically the shifts of the unperturbed levels with quantum numbers n of up to 89 in dependence on the strength of the non-Hermiticity and compare with rigorous estimates derived by those authors. We confirm that the predicted 1/n1/2 estimate provides a valid upper bound on the shrink rate of the numerical eigenvalues. Moreover, we find that a more recent estimate of log(n/n3/2 is in excellent agreement with the numerical results. With nonlinearity the shrink rates are found to be smaller than without nonlinearity, and the rigorous estimates, derived only for the linear case, are no longer applicable.

  7. Appliancation of plastic limit analysis upper bound method on the calculation of safety factor on slope%塑性极限分析上限法在边坡安全系数求解中的应用

    Institute of Scientific and Technical Information of China (English)

    王江营; 文世新; 曹文贵; 尚守平; 曹喜仁

    2009-01-01

    基于塑性极限分析上限法在边坡中建立一个合理的速度场,取滑动面为对数螺旋曲面,分别求得边坡滑动体、外荷载所做外功率和滑动面上内能消散率的计算表达式.然后定义材料强度储备安全系数为边坡的稳定安全系数,即边坡中岩土体的c和φ按同一比例折减后边坡达到极限平衡状态,由此可求得边坡处于极限状态时的外功率与内能消散率.再结合虚功率方程得出边坡安全系数的表达式,进而求得其最小上限解,便能确定边坡最不利滑动面的位置以及其最小安全系数.最后,以一个边坡安全系数求解为算例,把本文的计算结果与多种传统方法的计算结果比较,证明本文所提出的方法合理可行.%A reasonable velocity fields in the slope on the base of plastic limit analysis upper bound method was established,and the sliding surface was supposed as logarithmic spiral surface,the computation expression of work rate was calculated by the body forces and surface loads as well as rate of internal energy dissipations of slope can be obtained; then the material safety margin factor was defined as the safety factor of slope,that is c and φ of soil and rock in the slope reduced by the same percentage,and the slope reaches the state of limit balance,the rate of external energy and internal energy dissipations can be gotten while the slope is in the limit state. The expression of safety factor can be obtained via virtual work-rate equation,and its smallest upper bound solution is derived,and the most disadvantageous sliding surface's position and smallest safety factor of the slope are presented. Finally,taking a slope's safety factor solution as an example,the comparisons among the analytical results of various traditional methods were made,then the method proposed by this paper was proved reasonable and feasible.

  8. Concrete ensemble Kalman filters with rigorous catastrophic filter divergence.

    Science.gov (United States)

    Kelly, David; Majda, Andrew J; Tong, Xin T

    2015-08-25

    The ensemble Kalman filter and ensemble square root filters are data assimilation methods used to combine high-dimensional, nonlinear dynamical models with observed data. Ensemble methods are indispensable tools in science and engineering and have enjoyed great success in geophysical sciences, because they allow for computationally cheap low-ensemble-state approximation for extremely high-dimensional turbulent forecast models. From a theoretical perspective, the dynamical properties of these methods are poorly understood. One of the central mysteries is the numerical phenomenon known as catastrophic filter divergence, whereby ensemble-state estimates explode to machine infinity, despite the true state remaining in a bounded region. In this article we provide a breakthrough insight into the phenomenon, by introducing a simple and natural forecast model that transparently exhibits catastrophic filter divergence under all ensemble methods and a large set of initializations. For this model, catastrophic filter divergence is not an artifact of numerical instability, but rather a true dynamical property of the filter. The divergence is not only validated numerically but also proven rigorously. The model cleanly illustrates mechanisms that give rise to catastrophic divergence and confirms intuitive accounts of the phenomena given in past literature.

  9. Concrete ensemble Kalman filters with rigorous catastrophic filter divergence

    Science.gov (United States)

    Kelly, David; Majda, Andrew J.; Tong, Xin T.

    2015-01-01

    The ensemble Kalman filter and ensemble square root filters are data assimilation methods used to combine high-dimensional, nonlinear dynamical models with observed data. Ensemble methods are indispensable tools in science and engineering and have enjoyed great success in geophysical sciences, because they allow for computationally cheap low-ensemble-state approximation for extremely high-dimensional turbulent forecast models. From a theoretical perspective, the dynamical properties of these methods are poorly understood. One of the central mysteries is the numerical phenomenon known as catastrophic filter divergence, whereby ensemble-state estimates explode to machine infinity, despite the true state remaining in a bounded region. In this article we provide a breakthrough insight into the phenomenon, by introducing a simple and natural forecast model that transparently exhibits catastrophic filter divergence under all ensemble methods and a large set of initializations. For this model, catastrophic filter divergence is not an artifact of numerical instability, but rather a true dynamical property of the filter. The divergence is not only validated numerically but also proven rigorously. The model cleanly illustrates mechanisms that give rise to catastrophic divergence and confirms intuitive accounts of the phenomena given in past literature. PMID:26261335

  10. Sharp Bounds for Symmetric and Asymmetric Diophantine Approximation

    Institute of Scientific and Technical Information of China (English)

    Cornelis KRAAIKAMP; Ionica SMEETS

    2011-01-01

    In 2004,Tong found bounds for the approximation quality of a regular continued fraction convergent to a rational number,expressed in bounds for both the previous and next approximation.The authors sharpen his results with a geometric method and give both sharp upper and lower bounds.The asymptotic frequencies that these bounds occur are also calculated.

  11. Rigorous theory of molecular orientational nonlinear optics

    Directory of Open Access Journals (Sweden)

    Chong Hoon Kwak

    2015-01-01

    Full Text Available Classical statistical mechanics of the molecular optics theory proposed by Buckingham [A. D. Buckingham and J. A. Pople, Proc. Phys. Soc. A 68, 905 (1955] has been extended to describe the field induced molecular orientational polarization effects on nonlinear optics. In this paper, we present the generalized molecular orientational nonlinear optical processes (MONLO through the calculation of the classical orientational averaging using the Boltzmann type time-averaged orientational interaction energy in the randomly oriented molecular system under the influence of applied electric fields. The focal points of the calculation are (1 the derivation of rigorous tensorial components of the effective molecular hyperpolarizabilities, (2 the molecular orientational polarizations and the electronic polarizations including the well-known third-order dc polarization, dc electric field induced Kerr effect (dc Kerr effect, optical Kerr effect (OKE, dc electric field induced second harmonic generation (EFISH, degenerate four wave mixing (DFWM and third harmonic generation (THG. We also present some of the new predictive MONLO processes. For second-order MONLO, second-order optical rectification (SOR, Pockels effect and difference frequency generation (DFG are described in terms of the anisotropic coefficients of first hyperpolarizability. And, for third-order MONLO, third-order optical rectification (TOR, dc electric field induced difference frequency generation (EFIDFG and pump-probe transmission are presented.

  12. Reaching Fleming's dicrimination bound

    CERN Document Server

    Gruebl, Gebhard

    2012-01-01

    Any rule for identifying a quantum system's state within a set of two non-orthogonal pure states by a single measurement is flawed. It has a non-zero probability of either yielding the wrong result or leaving the query undecided. This also holds if the measurement of an observable $A$ is repeated on a finite sample of $n$ state copies. We formulate a state identification rule for such a sample. This rule's probability of giving the wrong result turns out to be bounded from above by $1/n\\delta_{A}^{2}$ with $\\delta_{A}=|_{1}-_{2}|/(\\Delta_{1}A+\\Delta_{2}A).$ A larger $\\delta_{A}$ results in a smaller upper bound. Yet, according to Fleming, $\\delta_{A}$ cannot exceed $\\tan\\theta$ with $\\theta\\in(0,\\pi/2) $ being the angle between the pure states under consideration. We demonstrate that there exist observables $A$ which reach the bound $\\tan\\theta$ and we determine all of them.

  13. A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

    CERN Document Server

    Ueno, Kenya

    2009-01-01

    We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and prove their formula size lower bounds improved from the classical result of Khrapchenko [13]. Moreover, we introduce a notion of unbalanced recursive ternary majority functions motivated by a decomposition theory of monotone self-dual functions and give integrally matching upper and lower bounds of their formula size. We also show monotone formula size lower bounds of balanced recursive ternary majority functions improved from the quantum adversary bound of Laplante, Lee and Szegedy [15].

  14. Nonadditivity of Rains' bound for distillable entanglement

    Science.gov (United States)

    Wang, Xin; Duan, Runyao

    2017-06-01

    Rains' bound is arguably the best known upper bound of the distillable entanglement by operations completely preserving positivity of partial transpose (PPT) and was conjectured to be additive and coincide with the asymptotic relative entropy of entanglement. We disprove both conjectures by explicitly constructing a special class of mixed two-qubit states. We then introduce an additive semidefinite programming lower bound (EM) for the asymptotic Rains' bound, and it immediately becomes a computable lower bound for entanglement cost of bipartite states. Furthermore, EM is also proved to be the best known upper bound of the PPT-assisted deterministic distillable entanglement and gives the asymptotic rates for all pure states and some class of genuinely mixed states.

  15. Bounded Rationality

    Directory of Open Access Journals (Sweden)

    Ballester Pla, Coralio

    2012-03-01

    Full Text Available The observation of the actual behavior by economic decision makers in the lab and in the field justifies that bounded rationality has been a generally accepted assumption in many socio-economic models. The goal of this paper is to illustrate the difficulties involved in providing a correct definition of what a rational (or irrational agent is. In this paper we describe two frameworks that employ different approaches for analyzing bounded rationality. The first is a spatial segregation set-up that encompasses two optimization methodologies: backward induction and forward induction. The main result is that, even under the same state of knowledge, rational and non-rational agents may match their actions. The second framework elaborates on the relationship between irrationality and informational restrictions. We use the beauty contest (Nagel, 1995 as a device to explain this relationship.

    La observación del comportamiento de los agentes económicos tanto en el laboratorio como en la vida real justifica que la racionalidad acotada sea un supuesto aceptado en numerosos modelos socio-económicos. El objetivo de este artículo es ilustrar las dificultades que conlleva una correcta definición de qué es un agente racional (irracional. En este artículo se describen dos marcos que emplean diferentes metodologías para analizar la racionalidad acotada. El primero es un modelo de segregación espacial donde se contrastan dos metodologías de optimización: inducción hacia atrás y hacia adelante. El resultado principal es que, incluso con el mismo nivel de conocimiento, tanto agentes racionales como irracionales podrían coincidir en sus acciones. El segundo marco trabaja sobre la relación entre irracionalidad y restricción de información. Se utiliza el juego llamado “beauty contest” (Nagel 1995 como mecanismo para explicar dicha relación.

  16. L-凸空间中一个新的GLKKM定理及其对带上下界的广义平衡问题的应用(英文)%A New GLKKM Theorem in L-Convex Spaces with Application to Generalized Equilibrium Problems with Lower and Upper Bounds

    Institute of Scientific and Technical Information of China (English)

    文开庭

    2012-01-01

    A new GLKKM theorem is established in noncompact L-convex spaces. As applications, existence theorems of the solution for generalized equilibrium problems with lower and upper bounds are obtained.%在非紧L-凸空间中建立了一个新的GLKKM定理。作为应用,获得了带上下界的广义平衡问题的解的存在定理.

  17. New bounds for multi-dimensional packing

    NARCIS (Netherlands)

    S. Seiden; R. van Stee (Rob)

    2001-01-01

    textabstractNew upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The

  18. New bounds for multi-dimensional packing

    NARCIS (Netherlands)

    Seiden, S.; Stee, R. van

    2001-01-01

    New upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The main results,

  19. Threshold Circuit Lower Bounds on Cryptographic Functions

    NARCIS (Netherlands)

    Kiltz, E.; Simon, H.U.

    2005-01-01

    In this work, we are interested in non-trivial upper bounds on the spectral norm of binary matrices $M$ from {-1, 1} $^{N × N}$. It is known that the distributed Boolean function represented by $M$ is hard to compute in various restricted models of computation if the spectral norm is bounded from ab

  20. Conditionally bounding analytic ranks of elliptic curves

    CERN Document Server

    Bober, Jonathan W

    2011-01-01

    We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds for curves which are known to have rank at least as large as 20, 21, 22, 23, and 24. For the known curve of rank at least 28, we get a bound of 30.

  1. Bounds on Heat Transport in Rapidly Rotating Rayleigh-B\\'{e}nard Convection

    CERN Document Server

    Grooms, Ian

    2014-01-01

    The heat transport in rotating Rayleigh-B\\'enard convection is considered in the limit of rapid rotation (small Ekman number $E$) and strong thermal forcing (large Rayleigh number $Ra$). The analysis proceeds from a set of asymptotically reduced equations appropriate for rotationally constrained dynamics; the conjectured range of validity for these equations is $Ra \\lesssim E^{-8/5}$. A rigorous bound on heat transport of $Nu \\le 20.56Ra^3E^4$ is derived in the limit of infinite Prandtl number using the background method. We demonstrate that the exponent in this bound cannot be improved on using a piece-wise monotonic background temperature profile like the one used here. This is true for finite Prandtl numbers as well, i.e. $Nu \\lesssim Ra^3$ is the best upper bound for this particular setup of the background method. The feature that obstructs the availability of a better bound in this case is the appearance of small-scale thermal plumes emanating from (or entering) the thermal boundary layer.

  2. Bounds on List Decoding Gabidulin Codes

    CERN Document Server

    Wachter-Zeh, Antonia

    2012-01-01

    An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in a ball around the received word. The lower bound shows that if the radius of this ball is greater than the Johnson radius, this list size can be exponential and hence, no polynomial-time list decoding is possible. The upper bound on the list size uses subspace properties.

  3. Variables Bounding Based Retiming Algorithm

    Institute of Scientific and Technical Information of China (English)

    宫宗伟; 林争辉; 陈后鹏

    2002-01-01

    Retiming is a technique for optimizing sequential circuits. In this paper, wediscuss this problem and propose an improved retiming algorithm based on variables bounding.Through the computation of the lower and upper bounds on variables, the algorithm can signi-ficantly reduce the number of constraints and speed up the execution of retiming. Furthermore,the elements of matrixes D and W are computed in a demand-driven way, which can reducethe capacity of memory. It is shown through the experimental results on ISCAS89 benchmarksthat our algorithm is very effective for large-scale sequential circuits.

  4. Bounds for Completely Decomposable Jacobians

    CERN Document Server

    Duursma, Iwan

    2010-01-01

    A curve over the field of two elements with completely decomposable Jacobian is shown to have at most six rational points and genus at most 26. The bounds are sharp. The previous upper bound for the genus was 145. We also show that a curve over the field of $q$ elements with more than $q^{m/2}+1$ rational points has at least one Frobenius angle in the open interval $(\\pi/m,3\\pi/m)$. The proofs make use of the explicit formula method.

  5. Evaluating Rigor in Qualitative Methodology and Research Dissemination

    Science.gov (United States)

    Trainor, Audrey A.; Graue, Elizabeth

    2014-01-01

    Despite previous and successful attempts to outline general criteria for rigor, researchers in special education have debated the application of rigor criteria, the significance or importance of small n research, the purpose of interpretivist approaches, and the generalizability of qualitative empirical results. Adding to these complications, the…

  6. Evaluating Rigor in Qualitative Methodology and Research Dissemination

    Science.gov (United States)

    Trainor, Audrey A.; Graue, Elizabeth

    2014-01-01

    Despite previous and successful attempts to outline general criteria for rigor, researchers in special education have debated the application of rigor criteria, the significance or importance of small n research, the purpose of interpretivist approaches, and the generalizability of qualitative empirical results. Adding to these complications, the…

  7. Using grounded theory as a method for rigorously reviewing literature

    NARCIS (Netherlands)

    Wolfswinkel, J.; Furtmueller, E.; Wilderom, C.P.M.

    2013-01-01

    This paper offers guidance to conducting a rigorous literature review. We present this in the form of a five-stage process in which we use Grounded Theory as a method. We first probe the guidelines explicated by Webster and Watson, and then we show the added value of Grounded Theory for rigorously a

  8. The Role of Rigor in the Teaching of Mechanics.

    Science.gov (United States)

    Langhaar, Henry L.

    This paper is addressed to the importance of maintaining rigor (a strict adherence to certain principles of reasoning) in the teaching of mechanics. The importance of a strict interpretation of mathematical formulae and the necessity of rigorous definitions of time, mass, and force are shown through a series of examples. Implications of this idea…

  9. Structural Bounds on the Dyadic Effect

    CERN Document Server

    Cinelli, Matteo; Iovanella, Antonio

    2016-01-01

    In this paper we consider the dyadic effect introduced in complex networks when nodes are distinguished by a binary characteristic. Under these circumstances two independent parameters, namely dyadicity and heterophilicity, are able to measure how much the assigned characteristic affects the network topology. All possible configurations can be represented in a phase diagram lying in a two-dimensional space that represents the feasible region of the dyadic effect, which is bound by two upper bounds on dyadicity and heterophilicity. Using some network's structural arguments, we are able to improve such upper bounds and introduce two new lower bounds, providing a reduction of the feasible region of the dyadic effect as well as constraining dyadicity and heterophilicity within a specific range. Some computational experiences show the bounds' effectiveness and their usefulness with regards to different classes of networks.

  10. Dependence Uncertainty Bounds for the Expectile of a Portfolio

    Directory of Open Access Journals (Sweden)

    Edgars Jakobsons

    2015-12-01

    Full Text Available We study upper and lower bounds on the expectile risk measure of risky portfolios when the joint distribution of the risky components is not fully specified. First, we summarize methods for obtaining bounds when only the marginal distributions of the components are known, but not their interdependence (unconstrained bounds. In particular, we provide the best-possible upper bound and the best-possible lower bound (under some conditions, as well as numerical procedures to compute them. We also derive simple analytic bounds that appear adequate in various situations of interest. Second, we study bounds when some information on interdependence is available (constrained bounds. When the variance of the portfolio is known, a simple-to-compute upper bound is provided, and we illustrate that it may significantly improve the unconstrained upper bound. We also show that the unconstrained lower bound cannot be readily improved using variance information. Next, we derive improved bounds when the bivariate distributions of each of the risky components and a risk factor are known. When the factor induces a positive dependence among the components, it is typically possible to improve the unconstrained lower bound. Finally, the unconstrained dependence uncertainty spreads of expected shortfall, value-at-risk and the expectile are compared.

  11. Bound state techniques to solve the multiparticle scattering problem

    CERN Document Server

    Carbonell, J; Fonseca, A C; Lazauskas, R

    2013-01-01

    Solution of the scattering problem turns to be very difficult task both from the formal as well as from the computational point of view. If the last two decades have witnessed decisive progress in ab initio bound state calculations, rigorous solution of the scattering problem remains limited to A$\\leq$4 case. Therefore there is a rising interest to apply bound-state-like methods to handle non-relativistic scattering problems. In this article the latest theoretical developments in this field are reviewed. Five fully rigorous methods will be discussed, which address the problem of nuclear collisions in full extent (including the break-up problem) at the same time avoiding treatment of the complicate boundary conditions or integral kernel singularities. These new developments allows to use modern bound-state techniques to advance significantly rigorous solution of the scattering problem.

  12. Entropy Bounds for Constrained Two-Dimensional Fields

    DEFF Research Database (Denmark)

    Forchhammer, Søren Otto; Justesen, Jørn

    1999-01-01

    The maximum entropy and thereby the capacity of 2-D fields given by certain constraints on configurations are considered. Upper and lower bounds are derived.......The maximum entropy and thereby the capacity of 2-D fields given by certain constraints on configurations are considered. Upper and lower bounds are derived....

  13. Bounding the number of rational places using Weierstrass semigroups

    DEFF Research Database (Denmark)

    Geil, Hans Olav; Matsumoto, Ryutaroh

    2007-01-01

    Let Lambda be a numerical semigroup. Assume there exists an algebraic function field over Fq in one variable which possesses a rational place that has Lambda as its Weierstrass semigroup. We ask the question as to how many rational places such a function field can possibly have and we derive...... an upper bound in terms of the generators of Lambda and q. Our bound is an improvement to Lewittes' bound in [6] which takes into account only the multiplicity of Lambda and q. From the new bound we derive significant improvements to Serre's upper bound in the cases q = 2, 3 and 4. We finally show...

  14. Upper Endoscopy

    Medline Plus

    Full Text Available ... Clinical Topics / Procedures F - Z / Upper Endoscopy (EGD) Upper Endoscopy (EGD) The Latest Practice Guidelines Technology Reviews ... the Safety of Your Endoscopic Procedure Brochure Understanding Upper Endoscopy Brochure Make the Best Choice for Your ...

  15. Optimal bounds with semidefinite programming: An application to stress-driven shear flows.

    Science.gov (United States)

    Fantuzzi, G; Wynn, A

    2016-04-01

    We introduce an innovative numerical technique based on convex optimization to solve a range of infinite-dimensional variational problems arising from the application of the background method to fluid flows. In contrast to most existing schemes, we do not consider the Euler-Lagrange equations for the minimizer. Instead, we use series expansions to formulate a finite-dimensional semidefinite program (SDP) whose solution converges to that of the original variational problem. Our formulation accounts for the influence of all modes in the expansion, and the feasible set of the SDP corresponds to a subset of the feasible set of the original problem. Moreover, SDPs can be easily formulated when the fluid is subject to imposed boundary fluxes, which pose a challenge for the traditional methods. We apply this technique to compute rigorous and near-optimal upper bounds on the dissipation coefficient for flows driven by a surface stress. We improve previous analytical bounds by more than 10 times and show that the bounds become independent of the domain aspect ratio in the limit of vanishing viscosity. We also confirm that the dissipation properties of stress-driven flows are similar to those of flows subject to a body force localized in a narrow layer near the surface. Finally, we show that SDP relaxations are an efficient method to investigate the energy stability of laminar flows driven by a surface stress.

  16. Bounds for the connective constant of the hexagonal lattice

    Energy Technology Data Exchange (ETDEWEB)

    Alm, S E; Parviainen, R [Department of Mathematics, Uppsala University, Box 480, 75106 Uppsala (Sweden)

    2004-01-23

    We give improved bounds for the connective constant of the hexagonal lattice. The lower bound is found by using Kesten's method of irreducible bridges and by determining generating functions for bridges on one-dimensional lattices. The upper bound is obtained as the largest eigenvalue of a certain transfer matrix. Using a relation between the hexagonal and the (3.12{sup 2}) lattices, we also give bounds for the connective constant of the latter lattice.

  17. Herbal medicine development: a plea for a rigorous scientific foundation.

    Science.gov (United States)

    Lietman, Paul S

    2012-09-01

    Science, including rigorous basic scientific research and rigorous clinical research, must underlie both the development and the clinical use of herbal medicines. Yet almost none of the hundreds or thousands of articles that are published each year on some aspect of herbal medicines, adheres to 3 simple but profound scientific principles must underlie all of herbal drug development or clinical use. Three fundamental principles that should underlie everyone's thinking about the development and/or clinical use of any herbal medicine. (1) There must be standardization and regulation (rigorously enforced) of the product being studied or being used clinically. (2) There must be scientific proof of a beneficial clinical effect for something of value to the patient and established by rigorous clinical research. (3) There must be scientific proof of safety (acceptable toxicity) for the patient and established by rigorous clinical research. These fundamental principles of science have ramifications for both the scientist and the clinician. It is critically important that both the investigator and the prescriber know exactly what is in the studied or recommended product and how effective and toxic it is. We will find new and useful drugs from natural sources. However, we will have to learn how to study herbal medicines rigorously, and we will have to try to convince the believers in herbal medicines of the wisdom and even the necessity of a rigorous scientific approach to herbal medicine development. Both biomedical science and practicing physicians must enthusiastically accept the responsibility for searching for truth in the discovery and development of new herbal medicines, in the truthful teaching about herbal medicines from a scientific perspective, and in the scientifically proven clinical use of herbal medicines.

  18. Bounds on Generalized Huffman Codes

    CERN Document Server

    Baer, Michael B

    2007-01-01

    New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding - which concern the traditional linear code objective of minimizing average codeword length -- these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman coding, some upper bounds can be found using sufficient conditions for the codeword corresponding to the most probable symbol being one bit long. Whereas having probability no less than 0.4 is a tight sufficient condition for this to be the case in Huffman coding, other penalties differ, some having a tighter condition, some a looser condition, and others having no such sufficient condition. The objectives explored here are ones for which optimal codes can be found using a generalized form of Huffman coding. These objectives include one related to queueing (an increasing exponential average), one related to single-shot c...

  19. A Note on Computable Upper Bound a Posteriori Error Estimates for the Non-Conforming Rotated Q1 Finite Element%关于非协调Qrot1元可计算上界后验误差估计的一个注记

    Institute of Scientific and Technical Information of China (English)

    刘杰; 杨一都; 闭海

    2012-01-01

    This paper discovers the reliability and validity of the non-conforming rotated Ql finite element computable upper bound a posteriori error estimate indicator established by M. Ainsworth are bad from the numerical experiments. Consulting the revelent paper and according to the property of the rotated Ql element, this paper makes an modification for the construction of the interpolation post-processing and makes a replacement for the selection of the interpolation post-processing function under the framework established by M. Ainsworth, respectively, and obtains the reliable and effective computable upper bound a posteriori error estimates accordingly, and gives three different types of examples with experimental results.%通过数值试验发现Ainsworth建立的非协调Qrot1元可计算上界后误差估计指示子的可靠、有效性差.参照相关文献以及根据Qrot1元的性质,在Ainsworth建立的可计算上界后验误差估计框架下对插值后处理函数的构造和选取分别作了修改和更换,并相应获得可靠且有效的可计算上界后验误差估计,给出了三个不同类型的例子及其实验结果.

  20. Amos-type bounds for modified Bessel function ratios.

    Science.gov (United States)

    Hornik, Kurt; Grün, Bettina

    2013-12-01

    We systematically investigate lower and upper bounds for the modified Bessel function ratio [Formula: see text] by functions of the form [Formula: see text] in case [Formula: see text] is positive for all [Formula: see text], or equivalently, where [Formula: see text] or [Formula: see text] is a negative integer. For [Formula: see text], we give an explicit description of the set of lower bounds and show that it has a greatest element. We also characterize the set of upper bounds and its minimal elements. If [Formula: see text], the minimal elements are tangent to [Formula: see text] in exactly one point [Formula: see text], and have [Formula: see text] as their lower envelope. We also provide a new family of explicitly computable upper bounds. Finally, if [Formula: see text] is a negative integer, we explicitly describe the sets of lower and upper bounds, and give their greatest and least elements, respectively.

  1. Positivity bounds on double parton distributions

    Energy Technology Data Exchange (ETDEWEB)

    Diehl, Markus; Kasemets, Tomas

    2013-03-15

    Double hard scattering in proton-proton collisions is described in terms of double parton distributions. We derive bounds on these distributions that follow from their interpretation as probability densities, taking into account all possible spin correlations between two partons in an unpolarized proton. These bounds constrain the size of the polarized distributions and can for instance be used to set upper limits on the effects of spin correlations in double hard scattering. We show that the bounds are stable under leading-order DGLAP evolution to higher scales.

  2. Bounds for convection between rough boundaries

    CERN Document Server

    Goluskin, David

    2016-01-01

    We consider Rayleigh-B\\'enard convection in a layer of fluid between no-slip rough boundaries, where the top and bottom boundary heights are functions of the horizontal coordinates with bounded gradients. We use the background method to derive an upper bound on mean heat flux across the layer for all admissible boundary geometries. This flux, normalized by the temperature difference between the boundaries, can grow with the Rayleigh number ($Ra$) no faster than $Ra^{1/2}$ as $Ra \\rightarrow \\infty$. Coefficients of the bound are given explicitly in terms of the geometry, and evaluation of the coefficients is illustrated for sinusoidal boundaries.

  3. Automatic analysis of distance bounding protocols

    CERN Document Server

    Malladi, Sreekanth; Kothapalli, Kishore

    2010-01-01

    Distance bounding protocols are used by nodes in wireless networks to calculate upper bounds on their distances to other nodes. However, dishonest nodes in the network can turn the calculations both illegitimate and inaccurate when they participate in protocol executions. It is important to analyze protocols for the possibility of such violations. Past efforts to analyze distance bounding protocols have only been manual. However, automated approaches are important since they are quite likely to find flaws that manual approaches cannot, as witnessed in literature for analysis pertaining to key establishment protocols. In this paper, we use the constraint solver tool to automatically analyze distance bounding protocols. We first formulate a new trace property called Secure Distance Bounding (SDB) that protocol executions must satisfy. We then classify the scenarios in which these protocols can operate considering the (dis)honesty of nodes and location of the attacker in the network. Finally, we extend the const...

  4. A Rigorous Architectural Approach to Adaptive Software Engineering

    Institute of Scientific and Technical Information of China (English)

    Jeff Kramer; Jeff Magee

    2009-01-01

    The engineering of distributed adaptive software is a complex task which requires a rigorous approach. Software architectural (structural) concepts and principles are highly beneficial in specifying, designing, analysing, constructing and evolving distributed software. A rigorous architectural approach dictates formalisms and techniques that are compositional,components that are context independent and systems that can be constructed and evolved incrementally. This paper overviews some of the underlying reasons for adopting an architectural approach, including a brief "rational history" of our research work, and indicates how an architectural model can potentially facilitate the provision of self-managed adaptive software system.

  5. Viscosity bound versus the universal relaxation bound

    Science.gov (United States)

    Hod, Shahar

    2017-10-01

    For gauge theories with an Einstein gravity dual, the AdS/CFT correspondence predicts a universal value for the ratio of the shear viscosity to the entropy density, η / s = 1 / 4 π. The holographic calculations have motivated the formulation of the celebrated KSS conjecture, according to which all fluids conform to the lower bound η / s ≥ 1 / 4 π. The bound on η / s may be regarded as a lower bound on the relaxation properties of perturbed fluids and it has been the focus of much recent attention. In particular, it was argued that for a class of field theories with Gauss-Bonnet gravity dual, the shear viscosity to entropy density ratio, η / s, could violate the conjectured KSS bound. In the present paper we argue that the proposed violations of the KSS bound are strongly constrained by Bekenstein's generalized second law (GSL) of thermodynamics. In particular, it is shown that physical consistency of the Gauss-Bonnet theory with the GSL requires its coupling constant to be bounded by λGB ≲ 0 . 063. We further argue that the genuine physical bound on the relaxation properties of physically consistent fluids is ℑω(k > 2 πT) > πT, where ω and k are respectively the proper frequency and the wavenumber of a perturbation mode in the fluid.

  6. ELEMENTARY DENSITY BOUNDS FOR SELF-SIMILAR SETS AND APPLICATION

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Falconer[1] used the relationship between upper convex density and upper spherical density to obtain elementary density bounds for s-sets at HS-almost all points of the sets. In this paper, following Falconer[1], we first provide a basic method to estimate the lower bounds of these two classes of set densities for the self-similar s-sets satisfying the open set condition (OSC), and then obtain elementary density bounds for such fractals at all of their points. In addition, we apply the main results to the famous classical fractals and get some new density bounds.

  7. Functions of bounded variation

    OpenAIRE

    Lind, Martin

    2006-01-01

    The paper begins with a short survey of monotone functions. The functions of bounded variation are introduced and some basic properties of these functions are given. Finally the jump function of a function of bounded variation is defined.

  8. Upward Bound alum honored

    OpenAIRE

    Felker, Susan B.

    2005-01-01

    Robert Cobb Jr., of Greensboro, N.C., a 1986-89 participant in the Virginia Tech Upward Bound program, was recently named Virginia's TRIO Achiever for 2004. Federal TRIO programs include Upward Bound and Educational Talent Search.

  9. Upper Endoscopy

    Medline Plus

    Full Text Available ... Procedure Brochure Understanding Upper Endoscopy Brochure Make the Best Choice for Your Endoscopic Procedure Brochure Members-only ... Procedure Brochure Understanding Upper Endoscopy Brochure Make the Best Choice for Your Endoscopic Procedure Brochure View more ...

  10. Upper Endoscopy

    Medline Plus

    Full Text Available ... Endoscopic Submucosal Dissection (ESD) Endoscopic Ultrasound (EUS) Procedures F - Z GI Bleeding Manometry Photodynamic Therapy (PDT) Polypectomy ... Gastrointestinal Glossary of Terms Home / Clinical Topics / Procedures F - Z / Upper Endoscopy (EGD) Upper Endoscopy (EGD) The ...

  11. Upper Endoscopy

    Medline Plus

    Full Text Available ... Upper Endoscopy (EGD) Upper Endoscopy (EGD) The Latest Practice Guidelines Technology Reviews Articles Videos Events & Products Ensuring the Safety of Your Endoscopic Procedure Brochure Understanding Upper Endoscopy Brochure Make the Best Choice for Your Endoscopic Procedure Brochure Members-only ...

  12. But is it Rigorous? Trustworthiness and Authenticity in Naturalistic Evaluation.

    Science.gov (United States)

    Lincoln, Yvonna S.; Guba, Egon G.

    1986-01-01

    The emergence of a new, naturalistic, paradigm of inquiry has led to a demand for rigorous criteria that meet traditional standards of inquiry. Two sets are suggested, one of which, the "trustworthiness" criteria, parallels conventional criteria, while the second, "authenticity" criteria, is implied directly by new paradigm…

  13. Mathematics Induction in School; An Illusion of Rigor.

    Science.gov (United States)

    Lowenthal, Francis; Eisenberg, Theodore

    1992-01-01

    Discusses the mathematical, philosophical, and pedagogical problems in the theorem of mathematical induction. Argues that mathematical induction is a meta-theorem, that is a theorem within a theorem, whose pitfalls and illusions of rigor should be discussed before implementation into the school curriculum. (MDH)

  14. Folk Belief Theory, the Rigor Gap, and the Achievement Gap

    Science.gov (United States)

    Torff, Bruce

    2014-01-01

    Folk belief theory is suggested as a primary cause for the persistence of the achievement gap. In this research-supported theory, culturally specified folk beliefs about learning and teaching prompt educators to direct more rigorous curriculum to high-advantage students but not to low-advantage students, resulting in impoverished pedagogy in…

  15. Application of Crossover Design for Conducting Rigorous Extension Evaluations

    Science.gov (United States)

    Jayaratne, K. S. U.; Bird, Carolyn L.; McClelland, Jacquelyn W.

    2013-01-01

    With the increasing demand for accountability of Extension programming, Extension professionals need to apply rigorous evaluation designs. Randomized designs are useful to eliminate selection biases of program participants and to improve the accuracy of evaluation. However, randomized control designs are not practical to apply in Extension program…

  16. A rigorous proof of the Landauer-Buttiker formula

    DEFF Research Database (Denmark)

    Cornean, Horia Decebal; Jensen, Arne; Moldoveanu, Valeriu

    2005-01-01

    Recently, Avron et al. in a series of papers shed new light on the question of quantum transport in mesoscopic samples coupled to particle reservoirs by semi-infinite leads. They rigorously treat the case, when the sample undergoes an adiabatic evolution thus generating a current through the leads...

  17. A rigorous proof for the Landauer-Büttiker formula

    DEFF Research Database (Denmark)

    Cornean, Horia Decebal; Jensen, Arne; Moldoveanu, V.

    Recently, Avron et al. shed new light on the question of quantum transport in mesoscopic samples coupled to particle reservoirs by semi-infinite leads. They rigorously treat the case when the sample undergoes an adiabatic evolution thus generating a current through th leads, and prove the so called...

  18. 3D Rigorous simulation of mask induced polarization

    NARCIS (Netherlands)

    Wei, X.; Urbach, H.P.; Wachters, A.; Aksenov, Y.

    2005-01-01

    The polarization induced by the mask is studied by using a 3D rigorous model, wich solves Maxwell equations using the finite element method. Teh aerial image depends strongly on the change of polarization induced by the materials, thickness of the layer and pitch of the periodic masks.

  19. Folk Belief Theory, the Rigor Gap, and the Achievement Gap

    Science.gov (United States)

    Torff, Bruce

    2014-01-01

    Folk belief theory is suggested as a primary cause for the persistence of the achievement gap. In this research-supported theory, culturally specified folk beliefs about learning and teaching prompt educators to direct more rigorous curriculum to high-advantage students but not to low-advantage students, resulting in impoverished pedagogy in…

  20. Mathematical Rigor vs. Conceptual Change: Some Early Results

    Science.gov (United States)

    Alexander, W. R.

    2003-05-01

    Results from two different pedagogical approaches to teaching introductory astronomy at the college level will be presented. The first of these approaches is a descriptive, conceptually based approach that emphasizes conceptual change. This descriptive class is typically an elective for non-science majors. The other approach is a mathematically rigorous treatment that emphasizes problem solving and is designed to prepare students for further study in astronomy. The mathematically rigorous class is typically taken by science majors. It also fulfills an elective science requirement for these science majors. The Astronomy Diagnostic Test version 2 (ADT 2.0) was used as an assessment instrument since the validity and reliability have been investigated by previous researchers. The ADT 2.0 was administered as both a pre-test and post-test to both groups. Initial results show no significant difference between the two groups in the post-test. However, there is a slightly greater improvement for the descriptive class between the pre and post testing compared to the mathematically rigorous course. There was great care to account for variables. These variables included: selection of text, class format as well as instructor differences. Results indicate that the mathematically rigorous model, doesn't improve conceptual understanding any better than the conceptual change model. Additional results indicate that there is a similar gender bias in favor of males that has been measured by previous investigators. This research has been funded by the College of Science and Mathematics at James Madison University.

  1. Paper 3: Content and Rigor of Algebra Credit Recovery Courses

    Science.gov (United States)

    Walters, Kirk; Stachel, Suzanne

    2014-01-01

    This paper describes the content, organization and rigor of the f2f and online summer algebra courses that were delivered in summers 2011 and 2012. Examining the content of both types of courses is important because research suggests that algebra courses with certain features may be better than others in promoting success for struggling students.…

  2. Bounding the bias of contrastive divergence learning

    DEFF Research Database (Denmark)

    Fischer, Anja; Igel, Christian

    2011-01-01

    Optimization based on k-step contrastive divergence (CD) has become a common way to train restricted Boltzmann machines (RBMs). The k-step CD is a biased estimator of the log-likelihood gradient relying on Gibbs sampling. We derive a new upper bound for this bias. Its magnitude depends on k...

  3. Rigorous simulation: a tool to enhance decision making

    Energy Technology Data Exchange (ETDEWEB)

    Neiva, Raquel; Larson, Mel; Baks, Arjan [KBC Advanced Technologies plc, Surrey (United Kingdom)

    2012-07-01

    The world refining industries continue to be challenged by population growth (increased demand), regional market changes and the pressure of regulatory requirements to operate a 'green' refinery. Environmental regulations are reducing the value and use of heavy fuel oils, and leading to convert more of the heavier products or even heavier crude into lighter products while meeting increasingly stringent transportation fuel specifications. As a result actions are required for establishing a sustainable advantage for future success. Rigorous simulation provides a key advantage improving the time and efficient use of capital investment and maximizing profitability. Sustainably maximizing profit through rigorous modeling is achieved through enhanced performance monitoring and improved Linear Programme (LP) model accuracy. This paper contains examples on these two items. The combination of both increases overall rates of return. As refiners consider optimizing existing assets and expanding projects, the process agreed to achieve these goals is key for a successful profit improvement. The benefit of rigorous kinetic simulation with detailed fractionation allows for optimizing existing asset utilization while focusing the capital investment in the new unit(s), and therefore optimizing the overall strategic plan and return on investment. Individual process unit's monitoring works as a mechanism for validating and optimizing the plant performance. Unit monitoring is important to rectify poor performance and increase profitability. The key to a good LP relies upon the accuracy of the data used to generate the LP sub-model data. The value of rigorous unit monitoring are that the results are heat and mass balanced consistently, and are unique for a refiners unit / refinery. With the improved match of the refinery operation, the rigorous simulation models will allow capturing more accurately the non linearity of those process units and therefore provide correct

  4. Third Hankel determinant for the inverse of reciprocal of bounded turning functions

    Directory of Open Access Journals (Sweden)

    B. Venkateswarlu

    2016-04-01

    Full Text Available In this paper we obtain the best possible upper bound to the third Hankel determinants for the functions belonging to the class of reciprocal of bounded turning functions using Toeplitz determinants.

  5. Growth of Fundamental Group for Finsler Manifolds with Integral Ricci Curvature Bound

    Indian Academy of Sciences (India)

    Bing Ye Wu

    2014-08-01

    In this paper, an upper bound on the growth of fundamental group for a class of Finsler manifolds with integral Ricci curvature bound is given. This generalizes the corresponding results with pointwise Ricci curvature in literature.

  6. Transfer function bounds on the performance of turbo codes

    Science.gov (United States)

    Divsalar, D.; Dolinar, S.; Pollara, F.; Mceliece, R. J.

    1995-01-01

    In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-error rate for maximum likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation results. The bounds are useful in estimating the 'error floor' that is difficult to measure by simulation, and they provide insight on how to lower this floor. More refined bounds are needed for accurate performance measures at lower signal-to-noise ratios.

  7. 基于非线性破坏准则的挡土墙被动土压力上限分析%Upper Bound Solutions for Passive Earth Pressure of Retaining Wall Basedon Nonlinear Failure Criterion

    Institute of Scientific and Technical Information of China (English)

    李丽民; 张国祥; 王恭兴

    2011-01-01

    effects on the passive earth pressures. Compared with the single-tangential technique method,the multi-tangential technique method is more rigorous in theory and is closer to real values in practice; so it is of high practical applicability.

  8. Deep ocean influence on upper ocean baroclinic instability saturation

    CERN Document Server

    Olascoaga, M J; Sheinbaum, J

    2003-01-01

    In this paper we extend earlier results regarding the effects of the lower layer of the ocean (below the thermocline) on the baroclinic instability within the upper layer (above the thermocline). We confront quasigeostrophic baroclinic instability properties of a 2.5-layer model with those of a 3-layer model with a very thick deep layer, which has been shown to predict spectral instability for basic state parameters for which the 2.5-layer model predicts nonlinear stability. We compute and compare maximum normal-mode perturbation growth rates, as well as rigorous upper bounds on the nonlinear growth of perturbations to unstable basic states, paying particular attention to the region of basic state parameters where the stability properties of the 2.5- and 3-layer model differ substantially. We found that normal-mode perturbation growth rates in the 3-layer model tend to maximize in this region. We also found that the size of state space available for eddy-amplitude growth tends to minimize in this same region....

  9. UML statechart based rigorous modeling of real-time system

    Institute of Scientific and Technical Information of China (English)

    LAI Ming-zhi; YOU Jin-yuan

    2005-01-01

    Rigorous modeling could ensure correctness and could verify a reduced cost in embedded real-time system development for models. Software methods are needed for rigorous modeling of embedded real-time systems. PVS is a formal method with precise syntax and semantics defined. System modeled by PVS specification could be verified by tools. Combining the widely used UML with PVS, this paper provides a novel modeling and verification approach for embedded real-time systems. In this approach, we provide 1 ) a time-extended UML statechart for modeling dynamic behavior of an embedded real-time system; 2) an approach to capture timed automata based semantics from a timed statechart; and 3) an algorithm to generate a finite state model expressed in PVS specification for model checking. The benefits of our approach include flexibility and user friendliness in modeling, extendability in formalization and verification content, and better performance. Time constraints are modeled and verified and is a highlight of this paper.

  10. Vulnerable Derivatives and Good Deal Bounds

    DEFF Research Database (Denmark)

    Murgoci, Agatha

    2013-01-01

    can be obtained. We provide a link between the objective probability measure and the range of potential risk-neutral measures, which has an intuitive economic meaning. We also provide tight pricing bounds for European calls and show how to extend the call formula to pricing other financial products......We price vulnerable derivatives – i.e. derivatives where the counterparty may default. These are basically the derivatives traded on the over-the-counter (OTC) markets. Default is modelled in a structural framework. The technique employed for pricing is good deal bounds (GDBs). The method imposes...... a new restriction in the arbitrage free model by setting upper bounds on the Sharpe ratios (SRs) of the assets. The potential prices that are eliminated represent unreasonably good deals. The constraint on the SR translates into a constraint on the stochastic discount factor. Thus, tight pricing bounds...

  11. A Rigorous Methodology for Analyzing and Designing Plug-Ins

    DEFF Research Database (Denmark)

    Fasie, Marieta V.; Haxthausen, Anne Elisabeth; Kiniry, Joseph

    2013-01-01

    . This paper addresses these problems by describing a rigorous methodology for analyzing and designing plug-ins. The methodology is grounded in the Extended Business Object Notation (EBON) and covers informal analysis and design of features, GUI, actions, and scenarios, formal architecture design, including...... behavioral semantics, and validation. The methodology is illustrated via a case study whose focus is an Eclipse environment for the RAISE formal method's tool suite....

  12. Rigorously Assessing Whether the Data Backs the Back School

    OpenAIRE

    2003-01-01

    A rigorous between-subjects methodology employing independent random samples and having broad clinical applicability was designed and implemented to evaluate the effectiveness of back safety and patient transfer training interventions for both hospital nurses and nursing assistants. Effects upon self-efficacy, cognitive, and affective measures are assessed for each of three back safety procedures. The design solves the problem of obtaining randomly assigned independent controls where all expe...

  13. Rigorous results of nonequilibrium statistical physics and their experimental verification

    Science.gov (United States)

    Pitaevskii, Lev P.

    2011-06-01

    Rigorous relations of nonequilibrium statistical physics are discussed. An arbitrary system brought into a strongly nonequilibrium state by an external time-dependent impact is considered. Based on the Hamiltonian formalism of classical mechanics, the Bochkov-Kuzovlev equality, the Jarzynski equality, and Crooks reversal relations valid for fluctuations in the work done on a system are derived. Verification of these equalities in mechanical experiments with a torsion pendulum and biological objects (folded ribonucleic acids) is described.

  14. Critical Analysis of Strategies for Determining Rigor in Qualitative Inquiry.

    Science.gov (United States)

    Morse, Janice M

    2015-09-01

    Criteria for determining the trustworthiness of qualitative research were introduced by Guba and Lincoln in the 1980s when they replaced terminology for achieving rigor, reliability, validity, and generalizability with dependability, credibility, and transferability. Strategies for achieving trustworthiness were also introduced. This landmark contribution to qualitative research remains in use today, with only minor modifications in format. Despite the significance of this contribution over the past four decades, the strategies recommended to achieve trustworthiness have not been critically examined. Recommendations for where, why, and how to use these strategies have not been developed, and how well they achieve their intended goal has not been examined. We do not know, for example, what impact these strategies have on the completed research. In this article, I critique these strategies. I recommend that qualitative researchers return to the terminology of social sciences, using rigor, reliability, validity, and generalizability. I then make recommendations for the appropriate use of the strategies recommended to achieve rigor: prolonged engagement, persistent observation, and thick, rich description; inter-rater reliability, negative case analysis; peer review or debriefing; clarifying researcher bias; member checking; external audits; and triangulation. © The Author(s) 2015.

  15. Upper Endoscopy

    Medline Plus

    Full Text Available ... Upper Endoscopy (EGD) Quality & Safety GIQuIC Registry Infection Control Privileging & Credentialing Quality Indicators Education & Meetings Advanced Education & Training ARIA Industry ...

  16. Lower bound for the regularity index of fat points

    OpenAIRE

    Van Thien, Phan

    2016-01-01

    The problem to find an upper bound for the regularity index of fat points has been dealt with by many authors. In this paper we give a lower bound for the regularity index of fat points. It is useful for determining the regularity index.

  17. Bounds for the eigenvalues of the continuous algebraic Riccati equation

    Science.gov (United States)

    Liu, Jianzhou; Zhang, Juan

    2011-10-01

    By using singular value decomposition and majorisation inequalities, we propose new upper and lower bounds for summations of eigenvalues (including the trace) of the solution of the continuous algebraic Riccati equation. These bounds improve and extend some of the previous results. Finally, we give corresponding numerical examples to illustrate the effectiveness of our results.

  18. Model Independent Naturalness Bounds on Magnetic Moments of Majorana Neutrinos

    OpenAIRE

    Gorchtein, Mikhail; Bell, Nicole F.; Ramsey-Musolf, Michael J.; Vogel, Petr; Wang, Peng

    2007-01-01

    We analyze the implications of neutrino masses for the magnitude of neutrino magnetic moments. By considering electroweak radiative corrections to the neutrino mass, we derive model-independent naturalness upper bounds on neutrino magnetic moments, generated by physics above the electroweak scale. For Majorana neutrinos, these bounds are weaker than present experimental limits if $\\mu_\

  19. Epineurial Window Is More Efficient in Attracting Axons than Simple Coaptation in a Sutureless (Cyanoacrylate-Bound) Model of End-to-Side Nerve Repair in the Rat Upper Limb: Functional and Morphometric Evidences and Review of the Literature.

    Science.gov (United States)

    Papalia, Igor; Magaudda, Ludovico; Righi, Maria; Ronchi, Giulia; Viano, Nicoletta; Geuna, Stefano; Colonna, Michele Rosario

    2016-01-01

    End-to-side nerve coaptation brings regenerating axons from the donor to the recipient nerve. Several techniques have been used to perform coaptation: microsurgical sutures with and without opening a window into the epi(peri)neurial connective tissue; among these, window techniques have been proven more effective in inducing axonal regeneration. The authors developed a sutureless model of end-to-side coaptation in the rat upper limb. In 19 adult Wistar rats, the median and the ulnar nerves of the left arm were approached from the axillary region, the median nerve transected and the proximal stump sutured to the pectoral muscle to prevent regeneration. Animals were then randomly divided in two experimental groups (7 animals each, 5 animals acting as control): Group 1: the distal stump of the transected median nerve was fixed to the ulnar nerve by applying cyanoacrylate solution; Group 2: a small epineurial window was opened into the epineurium of the ulnar nerve, caring to avoid damage to the nerve fibres; the distal stump of the transected median nerve was then fixed to the ulnar nerve by applying cyanoacrylate solution. The grasping test for functional evaluation was repeated every 10-11 weeks starting from week-15, up to the sacrifice (week 36). At week 36, the animals were sacrificed and the regenerated nerves harvested and processed for morphological investigations (high-resolution light microscopy as well as stereological and morphometrical analysis). This study shows that a) cyanoacrylate in end-to-side coaptation produces scarless axon regeneration without toxic effects; b) axonal regeneration and myelination occur even without opening an epineurial window, but c) the window is related to a larger number of regenerating fibres, especially myelinated and mature, and better functional outcomes.

  20. Epineurial Window Is More Efficient in Attracting Axons than Simple Coaptation in a Sutureless (Cyanoacrylate-Bound Model of End-to-Side Nerve Repair in the Rat Upper Limb: Functional and Morphometric Evidences and Review of the Literature.

    Directory of Open Access Journals (Sweden)

    Igor Papalia

    Full Text Available End-to-side nerve coaptation brings regenerating axons from the donor to the recipient nerve. Several techniques have been used to perform coaptation: microsurgical sutures with and without opening a window into the epi(perineurial connective tissue; among these, window techniques have been proven more effective in inducing axonal regeneration. The authors developed a sutureless model of end-to-side coaptation in the rat upper limb. In 19 adult Wistar rats, the median and the ulnar nerves of the left arm were approached from the axillary region, the median nerve transected and the proximal stump sutured to the pectoral muscle to prevent regeneration. Animals were then randomly divided in two experimental groups (7 animals each, 5 animals acting as control: Group 1: the distal stump of the transected median nerve was fixed to the ulnar nerve by applying cyanoacrylate solution; Group 2: a small epineurial window was opened into the epineurium of the ulnar nerve, caring to avoid damage to the nerve fibres; the distal stump of the transected median nerve was then fixed to the ulnar nerve by applying cyanoacrylate solution. The grasping test for functional evaluation was repeated every 10-11 weeks starting from week-15, up to the sacrifice (week 36. At week 36, the animals were sacrificed and the regenerated nerves harvested and processed for morphological investigations (high-resolution light microscopy as well as stereological and morphometrical analysis. This study shows that a cyanoacrylate in end-to-side coaptation produces scarless axon regeneration without toxic effects; b axonal regeneration and myelination occur even without opening an epineurial window, but c the window is related to a larger number of regenerating fibres, especially myelinated and mature, and better functional outcomes.

  1. Bounding species distribution models

    Directory of Open Access Journals (Sweden)

    Thomas J. STOHLGREN, Catherine S. JARNEVICH, Wayne E. ESAIAS,Jeffrey T. MORISETTE

    2011-10-01

    Full Text Available Species distribution models are increasing in popularity for mapping suitable habitat for species of management concern. Many investigators now recognize that extrapolations of these models with geographic information systems (GIS might be sensitive to the environmental bounds of the data used in their development, yet there is no recommended best practice for “clamping” model extrapolations. We relied on two commonly used modeling approaches: classification and regression tree (CART and maximum entropy (Maxent models, and we tested a simple alteration of the model extrapolations, bounding extrapolations to the maximum and minimum values of primary environmental predictors, to provide a more realistic map of suitable habitat of hybridized Africanized honey bees in the southwestern United States. Findings suggest that multiple models of bounding, and the most conservative bounding of species distribution models, like those presented here, should probably replace the unbounded or loosely bounded techniques currently used [Current Zoology 57 (5: 642–647, 2011].

  2. Bounding Species Distribution Models

    Science.gov (United States)

    Stohlgren, Thomas J.; Jarnevich, Cahterine S.; Morisette, Jeffrey T.; Esaias, Wayne E.

    2011-01-01

    Species distribution models are increasing in popularity for mapping suitable habitat for species of management concern. Many investigators now recognize that extrapolations of these models with geographic information systems (GIS) might be sensitive to the environmental bounds of the data used in their development, yet there is no recommended best practice for "clamping" model extrapolations. We relied on two commonly used modeling approaches: classification and regression tree (CART) and maximum entropy (Maxent) models, and we tested a simple alteration of the model extrapolations, bounding extrapolations to the maximum and minimum values of primary environmental predictors, to provide a more realistic map of suitable habitat of hybridized Africanized honey bees in the southwestern United States. Findings suggest that multiple models of bounding, and the most conservative bounding of species distribution models, like those presented here, should probably replace the unbounded or loosely bounded techniques currently used [Current Zoology 57 (5): 642-647, 2011].

  3. Simulation of AIMS measurements using rigorous mask 3D modeling

    Science.gov (United States)

    Chou, Chih-Shiang; Huang, Hsu-Ting; Chu, Fu-Sheng; Chu, Yuan-Chih; Huang, Wen-Chun; Liu, Ru-Gun; Gau, Tsai-Sheng

    2015-03-01

    Aerial image measurement system (AIMSTM) has been widely used for wafer level inspection of mask defects. Reported inspection flows include die-to-die (D2D) and die-to-database (D2DB) methods. For patterns that do not repeat in another die, only the D2DB approach is applicable. The D2DB method requires accurate simulation of AIMS measurements for a mask pattern. An optical vectorial model is needed to depict the mask diffraction effect in this simulation. To accurately simulate the imaging results, a rigorous electro-magnetic field (EMF) model is essential to correctly take account of the EMF scattering induced by the mask topography, which is usually called the mask 3D effect. In this study, the mask 3D model we use is rigorous coupled-wave analysis (RCWA), which calculates the diffraction fields from a single plane wave incidence. A hybrid Hopkins-Abbe method with RCWA is used to calculate the EMF diffraction at a desired accuracy level while keeping the computation time practical. We will compare the speed of the hybrid Hopkins-Abbe method to the rigorous Abbe method. The matching between simulation and experiment is more challenging for AIMS than CD-SEM because its measurements provide full intensity information. Parameters in the mask 3D model such as film stack thickness or film optical properties, is optimized during the fitting process. We will report the fitting results of AIMS images for twodimensional structures with various pitches. By accurately simulating the AIMS measurements, it provides a necessary tool to perform the mask inspection using the D2DB approach and to accurately predict the mask defects.

  4. Cloud Computing for Rigorous Coupled-Wave Analysis

    Directory of Open Access Journals (Sweden)

    N. L. Kazanskiy

    2012-01-01

    Full Text Available Design and analysis of complex nanophotonic and nanoelectronic structures require significant computing resources. Cloud computing infrastructure allows distributed parallel applications to achieve greater scalability and fault tolerance. The problems of effective use of high-performance computing systems for modeling and simulation of subwavelength diffraction gratings are considered. Rigorous coupled-wave analysis (RCWA is adapted to cloud computing environment. In order to accomplish this, data flow of the RCWA is analyzed and CPU-intensive operations are converted to data-intensive operations. The generated data sets are structured in accordance with the requirements of MapReduce technology.

  5. Instantaneous Formulation for Transitions Between Two Instantaneous Bound States and Its Gauge Invariance

    Institute of Scientific and Technical Information of China (English)

    CHANG Chao-Hsi; CHEN Jiao-Kai; WANG Guo-Li

    2006-01-01

    We have precisely derived a "rigorous instantaneous formulation" for transitions between two bound states when the bound states are well-described by instantaneous Bethe-Salpeter (BS) equation (i.e. the kernel of the equation is instantaneous"occasionally"). The obtained rigorous instantaneous formulation, in fact, is expressed as an operator sandwiched by two "reduced BS wave functions" properly, while the reduced BS wave functions appearing in the formulation are the rigorous solutions of the instantaneous BS equation, and they may relate to Schr(o)dinger wave functions straightforwardly. We also show that the rigorous instantaneous formulation is gauge-invariant with respect to the Uem(1) transformation precisely, if the concerned transitions are radiative. Some applications of the formulation are outlined.

  6. Upper Endoscopy

    Medline Plus

    Full Text Available ... Upper Endoscopy (EGD) The Latest Practice Guidelines Technology Reviews Articles Videos Events & Products Ensuring the Safety of ... S0016-5107(98)70268-8 View more Technology Reviews Members-only content Document Link: ASGE Leading Edge: ...

  7. Upper Endoscopy

    Medline Plus

    Full Text Available ... Upper Endoscopy (EGD) The Latest Practice Guidelines Technology Reviews Articles Videos Events & Products Ensuring the Safety of ... S0016-5107(98)70268-8 View more Technology Reviews Members-only content Document Link: ASGE Leading Edge: ...

  8. Upper Endoscopy

    Medline Plus

    Full Text Available ... EGD) Upper Endoscopy (EGD) The Latest Practice Guidelines Technology Reviews Articles Videos Events & Products Ensuring the Safety ... 1016/S0016-5107(98)70268-8 View more Technology Reviews Members-only content Document Link: ASGE Leading ...

  9. Upper Endoscopy

    Medline Plus

    Full Text Available ... EGD) Upper Endoscopy (EGD) The Latest Practice Guidelines Technology Reviews Articles Videos Events & Products Ensuring the Safety ... 1016/S0016-5107(98)70268-8 View more Technology Reviews Members-only content Document Link: ASGE Leading ...

  10. Upper Endoscopy

    Medline Plus

    Full Text Available ... Staff Rent IT&T Facility Gastrointestinal Glossary of Terms Home / Clinical Topics / Procedures F - Z / Upper Endoscopy ( ... Facebook ASGE on Youtube ASGE on Twitter Privacy | Terms of Use | © 2017 American Society for Gastrointestinal Endoscopy

  11. Using cancer to make cellular reproduction rigorous and relevant

    Science.gov (United States)

    Duncan, Cynthia F.

    The 1983 report Nation at Risk highlighted the fact that test scores of American students were far below that of competing nations and educational standards were being lowered. This trend has continued and studies have also shown that students are not entering college ready for success. This trend can be reversed. Students can better understand and retain biology content expectations if they are taught in a way that is both rigorous and relevant. In the past, students have learned the details of cellular reproduction with little knowledge of why it is important to their everyday lives. This material is learned only for the test. Knowing the details of cellular reproduction is crucial for understanding cancer. Cancer is a topic that will likely affect all of my students at some point in their lives. Students used hands on activities, including simulations, labs, and models to learn about cellular reproduction with cancer as a theme throughout. Students were challenged to learn how to use the rigorous biology content expectations to think about cancer, including stem cell research. Students that will some day be college students, voting citizens, and parents, will become better learners. Students were assessed before and after the completion of the unit to determine if learning occurs. Students did learn the material and became more critical thinkers. Statistical analysis was completed to insure confidence in the results.

  12. Meat toughening does not occur when rigor shortening is prevented.

    Science.gov (United States)

    Koohmaraie, M; Doumit, M E; Wheeler, T L

    1996-12-01

    The objective of this experiment was to test the hypothesis that meat toughening during the first 24 h postmortem results from sarcomere shortening during rigor mortis development. Eleven market-weight lambs were used to measure changes in shear force of clamped longissimus during rigor development. Within 15 min of exsanguination, while attached at both ends, each longissimus was separated from the vertebrae body and clamped between three sets of metal plates to prevent muscle shortening (six clamped sections per lamb). Five of the clamped sections were placed at -1.1 degrees C for 0, 3, 6, 12, or 24 h. After storage at their respective times at -1.1 degrees C, the samples were placed at -30 degrees C for 90 min and then at -5 degrees C for 8 d. The sixth section (168-h section) was stored at -1.1 degrees C for the first 24 h, at 4 degrees C for 144 h, and then treated the same as other sampling times. Sections were sampled for pH, sarcomere length, shear force, and Western blot analyses before and after storage at -5 degrees C. Shear force values were the same (P > .05) from 0 to 24 h (4.5 kg at 0 h to 4.9 kg at 24 h) then declined (P slaughter is most likely due to sarcomere shortening.

  13. A methodology for the rigorous verification of plasma simulation codes

    Science.gov (United States)

    Riva, Fabio

    2016-10-01

    The methodology used to assess the reliability of numerical simulation codes constitutes the Verification and Validation (V&V) procedure. V&V is composed by two separate tasks: the verification, which is a mathematical issue targeted to assess that the physical model is correctly solved, and the validation, which determines the consistency of the code results, and therefore of the physical model, with experimental data. In the present talk we focus our attention on the verification, which in turn is composed by the code verification, targeted to assess that a physical model is correctly implemented in a simulation code, and the solution verification, that quantifies the numerical error affecting a simulation. Bridging the gap between plasma physics and other scientific domains, we introduced for the first time in our domain a rigorous methodology for the code verification, based on the method of manufactured solutions, as well as a solution verification based on the Richardson extrapolation. This methodology was applied to GBS, a three-dimensional fluid code based on a finite difference scheme, used to investigate the plasma turbulence in basic plasma physics experiments and in the tokamak scrape-off layer. Overcoming the difficulty of dealing with a numerical method intrinsically affected by statistical noise, we have now generalized the rigorous verification methodology to simulation codes based on the particle-in-cell algorithm, which are employed to solve Vlasov equation in the investigation of a number of plasma physics phenomena.

  14. Volume Holograms in Photopolymers: Comparison between Analytical and Rigorous Theories

    Directory of Open Access Journals (Sweden)

    Augusto Beléndez

    2012-08-01

    Full Text Available There is no doubt that the concept of volume holography has led to an incredibly great amount of scientific research and technological applications. One of these applications is the use of volume holograms as optical memories, and in particular, the use of a photosensitive medium like a photopolymeric material to record information in all its volume. In this work we analyze the applicability of Kogelnik’s Coupled Wave theory to the study of volume holograms recorded in photopolymers. Some of the theoretical models in the literature describing the mechanism of hologram formation in photopolymer materials use Kogelnik’s theory to analyze the gratings recorded in photopolymeric materials. If Kogelnik’s theory cannot be applied is necessary to use a more general Coupled Wave theory (CW or the Rigorous Coupled Wave theory (RCW. The RCW does not incorporate any approximation and thus, since it is rigorous, permits judging the accurateness of the approximations included in Kogelnik’s and CW theories. In this article, a comparison between the predictions of the three theories for phase transmission diffraction gratings is carried out. We have demonstrated the agreement in the prediction of CW and RCW and the validity of Kogelnik’s theory only for gratings with spatial frequencies higher than 500 lines/mm for the usual values of the refractive index modulations obtained in photopolymers.

  15. Multicolor Bound Soliton Molecule

    CERN Document Server

    Luo, Rui; Lin, Qiang

    2015-01-01

    We show a new class of bound soliton molecule that exists in a parametrically driven nonlinear optical cavity with appropriate dispersion characteristics. The composed solitons exhibit distinctive colors but coincide in time and share a common phase, bound together via strong inter-soliton four-wave mixing and Cherenkov radiation. The multicolor bound soliton molecule shows intriguing spectral locking characteristics and remarkable capability of spectrum management to tailor soliton frequencies, which may open up a great avenue towards versatile generation and manipulation of multi-octave spanning phase-locked Kerr frequency combs, with great potential for applications in frequency metrology, optical frequency synthesis, and spectroscopy.

  16. Probability bounds analysis for nonlinear population ecology models.

    Science.gov (United States)

    Enszer, Joshua A; Andrei Măceș, D; Stadtherr, Mark A

    2015-09-01

    Mathematical models in population ecology often involve parameters that are empirically determined and inherently uncertain, with probability distributions for the uncertainties not known precisely. Propagating such imprecise uncertainties rigorously through a model to determine their effect on model outputs can be a challenging problem. We illustrate here a method for the direct propagation of uncertainties represented by probability bounds though nonlinear, continuous-time, dynamic models in population ecology. This makes it possible to determine rigorous bounds on the probability that some specified outcome for a population is achieved, which can be a core problem in ecosystem modeling for risk assessment and management. Results can be obtained at a computational cost that is considerably less than that required by statistical sampling methods such as Monte Carlo analysis. The method is demonstrated using three example systems, with focus on a model of an experimental aquatic food web subject to the effects of contamination by ionic liquids, a new class of potentially important industrial chemicals.

  17. Linear-scaling atomic orbital-based second-order Møller-Plesset perturbation theory by rigorous integral screening criteria.

    Science.gov (United States)

    Doser, Bernd; Lambrecht, Daniel S; Kussmann, Jörg; Ochsenfeld, Christian

    2009-02-14

    A Laplace-transformed second-order Moller-Plesset perturbation theory (MP2) method is presented, which allows to achieve linear scaling of the computational effort with molecular size for electronically local structures. Also for systems with a delocalized electronic structure, a cubic or even quadratic scaling behavior is achieved. Numerically significant contributions to the atomic orbital (AO)-MP2 energy are preselected using the so-called multipole-based integral estimates (MBIE) introduced earlier by us [J. Chem. Phys. 123, 184102 (2005)]. Since MBIE provides rigorous upper bounds, numerical accuracy is fully controlled and the exact MP2 result is attained. While the choice of thresholds for a specific accuracy is only weakly dependent upon the molecular system, our AO-MP2 scheme offers the possibility for incremental thresholding: for only little additional computational expense, the numerical accuracy can be systematically converged. We illustrate this dependence upon numerical thresholds for the calculation of intermolecular interaction energies for the S22 test set. The efficiency and accuracy of our AO-MP2 method is demonstrated for linear alkanes, stacked DNA base pairs, and carbon nanotubes: e.g., for DNA systems the crossover toward conventional MP2 schemes occurs between one and two base pairs. In this way, it is for the first time possible to compute wave function-based correlation energies for systems containing more than 1000 atoms with 10 000 basis functions as illustrated for a 16 base pair DNA system on a single-core computer, where no empirical restrictions are introduced and numerical accuracy is fully preserved.

  18. Kodiak: An Implementation Framework for Branch and Bound Algorithms

    Science.gov (United States)

    Smith, Andrew P.; Munoz, Cesar A.; Narkawicz, Anthony J.; Markevicius, Mantas

    2015-01-01

    Recursive branch and bound algorithms are often used to refine and isolate solutions to several classes of global optimization problems. A rigorous computation framework for the solution of systems of equations and inequalities involving nonlinear real arithmetic over hyper-rectangular variable and parameter domains is presented. It is derived from a generic branch and bound algorithm that has been formally verified, and utilizes self-validating enclosure methods, namely interval arithmetic and, for polynomials and rational functions, Bernstein expansion. Since bounds computed by these enclosure methods are sound, this approach may be used reliably in software verification tools. Advantage is taken of the partial derivatives of the constraint functions involved in the system, firstly to reduce the branching factor by the use of bisection heuristics and secondly to permit the computation of bifurcation sets for systems of ordinary differential equations. The associated software development, Kodiak, is presented, along with examples of three different branch and bound problem types it implements.

  19. Two-body bound states in quantum electrodynamics. [Rate

    Energy Technology Data Exchange (ETDEWEB)

    Lepage, G.P.

    1978-07-01

    Novel formulations of the two-body bound state problem in quantum field theory are examined. While equal in rigor, these have several calculational advantages over the traditional Bethe-Salpeter formalism. In particular there exist exact solutions of the bound state equations for a Coulomb-like interaction in quantum electrodynamics. The corrections to such zeroth-order solutions can be systematically computed in a simple perturbation theory. These methods are illustrated by computing corrections to the orthopositronium decay rate and to the ground state splittings in positronium and muonium.

  20. Bounds for Bilinear Complexity of Noncommutative Group Algebras

    CERN Document Server

    Pospelov, Alexey

    2010-01-01

    We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show nontrivial lower bounds for the rest of the group algebras. These lower bounds are built on the top of Bl\\"aser's results for semisimple algebras and algebras with large radical and the lower bound for arbitrary associative algebras due to Alder and Strassen. We also show subquadratic upper bounds for all group algebras turning into "almost linear" provided the exponent of matrix multiplication equals 2.

  1. Bounds on the Capacity of Weakly constrained two-dimensional Codes

    DEFF Research Database (Denmark)

    Forchhammer, Søren

    2002-01-01

    Upper and lower bounds are presented for the capacity of weakly constrained two-dimensional codes. The maximum entropy is calculated for two simple models of 2-D codes constraining the probability of neighboring 1s as an example. For given models of the coded data, upper and lower bounds...

  2. Bounding the number of points on a curve using a generalization of Weierstrass semigroups

    DEFF Research Database (Denmark)

    Beelen, Peter; Ruano, Diego

    2013-01-01

    In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the (generalized) Weierstrass semigroup (J Pure Appl Algebra 207(2), 243...

  3. Bounds on the Weight Hierarchies of a Kind of Linear Codes Satisfying Non-Chain Condition

    Institute of Scientific and Technical Information of China (English)

    LIUZihui; CHENWende

    2005-01-01

    The upper bound of weight hierarchies of codes with a divided-chain of arbitrary continuous break points are studied and the codes satisfying the upperbound are constructed by finite projective geometry, in particular, the geometrical construction is tight for the upper-bound weight hierarchies.

  4. Bounds on localisable information via semidefinite programming

    CERN Document Server

    Synak, B; Horodecki, M; Synak, Barbara; Horodecki, Karol; Horodecki, Michal

    2004-01-01

    We investigate so-called localisable information of bipartite states and a parallel notion of information deficit. Localisable information is defined as the amount of information that can be concentrated by means of classical communication and local operations where only maximally mixed states can be added for free. The information deficit is defined as difference between total information contents of the state and localisable information. We consider a larger class of operations: the so called PPT operations, which in addition preserve maximally mixed state (PPT-PMM operations). We formulate the related optimization problem as sedmidefnite program with suitable constraints. We then provide bound for fidelity of transition of a given state into product pure state on Hilbert space of dimension d. This allows to obtain general upper bound for localisable information (and also for information deficit). We calculated the bounds exactly for Werner states and isotropic states in any dimension. Surprisingly it turns...

  5. Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes

    CERN Document Server

    Fong, Wai Han

    2011-01-01

    In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction (SBC), is shown to be the Abramson bound when the cyclic burst length is less than half the block length. The second MPBC bound is developed without the minimum error free gap constraint and is used as a comparison to the first bound.

  6. Covariant Entropy Bound and Padmanabhan's Emergent Paradigm

    CERN Document Server

    Hadi, H; Darabi, F

    2016-01-01

    The covariant entropy conjecture is invariant under time reversal and consequently its origin must be statistical rather than thermodynamical. This may impose a fundamental constraint on the number of degrees of freedom in nature. Indeed, the covariant entropy bound imposes an upper entropy bound for any physical system. Considering a cosmological system, we show that Padmanabhan's emergent paradigm, which indicates that the emergence of cosmic space is due to the discrepancy between the surface and bulk degrees of freedom, leads to a lower entropy bound. The lower and upper entropy bounds may coincide on the apparent horizon for the radiation field and dark energy with the equations of state $\\omega=\\frac{1}{3}$ and $\\omega=-1$, respectively. Moreover, the maximal entropy inside the apparent horizon occurs when it is filled completely by the radiation field or dark energy. It turns out that for dark energy case (pure de Sitter space)\\ the holographic principle is satisfied in the sense that the number of deg...

  7. A Rigorous Framework for Optimization of Expensive Functions by Surrogates

    Science.gov (United States)

    Booker, Andrew J.; Dennis, J. E., Jr.; Frank, Paul D.; Serafini, David B.; Torczon, Virginia; Trosset, Michael W.

    1998-01-01

    The goal of the research reported here is to develop rigorous optimization algorithms to apply to some engineering design problems for which design application of traditional optimization approaches is not practical. This paper presents and analyzes a framework for generating a sequence of approximations to the objective function and managing the use of these approximations as surrogates for optimization. The result is to obtain convergence to a minimizer of an expensive objective function subject to simple constraints. The approach is widely applicable because it does not require, or even explicitly approximate, derivatives of the objective. Numerical results are presented for a 31-variable helicopter rotor blade design example and for a standard optimization test example.

  8. Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation

    Directory of Open Access Journals (Sweden)

    Ümit Çiftçi

    2010-03-01

    Full Text Available The goal of paper is to develop an algorithm that evaluates students then places them depending on their desired choices according to dependant preferences. The developed algorithm is also used to implement software. The success and accuracy of the software as well as the algorithm are tested by applying it to ability test at Beykent University. This ability test is repeated several times in order to fill all available places at Fine Art Faculty departments in every academic year. It has been shown that this algorithm is very fast and rigorous after application of 2008-2009 and 2009-20010 academic years.Key Words: Assignment algorithm, student placement, ability test

  9. Double-hybrid density-functional theory made rigorous

    CERN Document Server

    Sharkas, Kamal; Savin, Andreas

    2010-01-01

    We provide a rigorous derivation of a class of double-hybrid approximations, combining Hartree-Fock exchange and second-order Moller-Plesset correlation with a semilocal exchange-correlation density functional. These double-hybrid approximations contain only one empirical parameter and use a density-scaled correlation energy functional. Neglecting density scaling leads to an one-parameter version of the standard double-hybrid approximations. We assess the performance of these double-hybrid schemes on representative test sets of atomization energies and reaction barrier heights, and we compare to other hybrid approximations, including range-separated hybrids. Our best one-parameter double-hybrid approximation, called 1DH-BLYP, roughly reproduces the two parameters of the standard B2-PLYP or B2GP-PLYP double-hybrid approximations, which shows that these methods are not only empirically close to an optimum for general chemical applications but are also theoretically supported.

  10. A rigorous and simpler method of image charges

    Science.gov (United States)

    Ladera, C. L.; Donoso, G.

    2016-07-01

    The method of image charges relies on the proven uniqueness of the solution of the Laplace differential equation for an electrostatic potential which satisfies some specified boundary conditions. Granted by that uniqueness, the method of images is rightly described as nothing but shrewdly guessing which and where image charges are to be placed to solve the given electrostatics problem. Here we present an alternative image charges method that is based not on guessing but on rigorous and simpler theoretical grounds, namely the constant potential inside any conductor and the application of powerful geometric symmetries. The aforementioned required uniqueness and, more importantly, guessing are therefore both altogether dispensed with. Our two new theoretical fundaments also allow the image charges method to be introduced in earlier physics courses for engineering and sciences students, instead of its present and usual introduction in electromagnetic theory courses that demand familiarity with the Laplace differential equation and its boundary conditions.

  11. A tighter bound for the self-stabilization time in Hermanʼs algorithm

    DEFF Research Database (Denmark)

    Feng, Yuan; Zhang, Lijun

    2013-01-01

    We study the expected self-stabilization time of Hermanʼs algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V.......We study the expected self-stabilization time of Hermanʼs algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V....

  12. Bounds for entanglement of formation of two mode squeezed thermal states

    CERN Document Server

    Chen, X Y; Chen, Xiao-Yu; Qiu, Pei-liang

    2003-01-01

    The upper and lower bounds of entanglement of formation are given for two mode squeezed thermal state. The bounds are compared with other entanglement measure or bounds. The entanglement distillation and the relative entropy of entanglement of infinitive squeezed state are obtained at the postulation of hashing inequality.

  13. Upper Bounds on Asymmetric Dark Matter Self Annihilation Cross Sections

    CERN Document Server

    Ellwanger, Ulrich

    2012-01-01

    Most models for asymmetric dark matter allow for dark matter self annihilation processes, which can wash out the asymmetry at temperatures near and below the dark matter mass. We study the coupled set of Boltzmann equations for the symmetric and antisymmetric dark matter number densities, and derive conditions applicable to a large class of models for the absence of a significant wash-out of an asymmetry. These constraints are applied to various existing scenarios. In the case of left- or right-handed sneutrinos, very large electroweak gaugino masses, or very small mixing angles are required.

  14. Rate adaptation using acknowledgement feedback: Throughput upper bounds

    NARCIS (Netherlands)

    Ho, C.K.; Oostveen, J.; Linnartz, J.-P.

    2008-01-01

    We consider packet-by-packet rate adaptation to maximize the throughput over a finite-state Markov channel. To limit the amount of feedback data, we use past packet acknowledgements (ACKs) and past rates as channel state information. It is known that the maximum achievable throughput is computationa

  15. New Upper Bounds on Linear Coloring of Planar Graphs

    Institute of Scientific and Technical Information of China (English)

    Bin LIU; Gui Zhen LIU

    2012-01-01

    A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths.The linear chromatic number lc(G) of the graph G is the smallest number of colors in a linear coloring of G.In this paper,it is proved that every planar graph G with girth g and maximum degree △ has (1) lc(G) ≤ △ + 21 if △ ≥ 9; (2) lc(G) ≤ [△/2] + 7 if g ≥ 5; (3) lc(G) ≤[△/2]+2 if g ≥ 7 and △ ≥ 7.

  16. Upper Bounds on Character Sums with Rational Function Entries

    Institute of Scientific and Technical Information of China (English)

    Todd COCHRANE; Chun Lei LIU; Zhi Yong ZHENG

    2003-01-01

    We obtain formulae and estimates for character sums of the type (x, f,P )=∑pmx=1x(f(x)),where pm is a prime power with m ≥ 2, x is a mnultiplicative character (mod pm), and f = f1/f2 is a rational function over Z. In particular, ifp is odd, d = deg(f1)+deg(f2) and d* = max(deg(f1), deg(f2)) then we obtain |S(x, f, pm)|≤ (d- 1)pm(1 -1/dx) for any non-constant f (mod p) and primitive character x. For p = 2 an extra factor of 2√2 is needed.

  17. Upper bounds on a two-term exponential sum

    Institute of Scientific and Technical Information of China (English)

    Todd; Cochrane

    2001-01-01

    [1]Davenport, H. , Heibronn, H., On an exponential sum, Proc. Lond. Math. Soc., 1936, 41(2): 449-453.[2]Hua, L. K., On exponential sums, Sci. Record (Peking) (N.S.), 1957, 1: 1-4.[3]Vaughan, R. C. , The Hardy-Littlewood Method, 2nd ed. , Cambridge Tracts in Math. , Cambridge: Cambridge Univ. Press, 1997, 125.[4]Weil, A., On some exponential sums, Proc. Nat. Acad. Sci. USA, 1948, 34: 204-207.[5]Cochrane, T., Zheng, Z., Pure and mixed exponential sums, Acta Arith. , 1999, 91(3): 249-278.[6]Chalk, J. H. H., On Hua's estimate for exponential sums, Mathematika, 1987, 34: 115-123.[7]Loh, W. K. A. , Hua's Lemma, Bull. Australian Math. Soc., 1994, 50(3): 451-458.[8]Ding, P., An improvement to Chalk's estimation of exponential sums, Acta Arith. , 1991, 59(2): 149-155.

  18. Upper Bound Performance Estimation for Copper Based Broadband Access

    DEFF Research Database (Denmark)

    Jensen, Michael; Gutierrez Lopez, Jose Manuel

    2012-01-01

    of copper based access connections at a household level by using Geographical Information System data. This can be combined with different configurations of DSLAMs distributions, in order to calculate the required number of active equipment points to guarantee certain QoS levels. This method can be used...

  19. The Balloon Popping Problem Revisited: Lower and Upper Bounds

    Science.gov (United States)

    Jung, Hyunwoo; Chwa, Kyung-Yong

    We consider the balloon popping problem introduced by Immorlica et al. in 2007 [13]. This problem is directly related to the problem of profit maximization in online auctions, where an auctioneer is selling a collection of identical items to anonymous unit-demand bidders. The auctioneer has the full knowledge of bidders’ private valuations for the items and tries to maximize his profit. Compared with the profit of fixed price schemes, the competitive ratio of Immorlica et al.’s algorithm was in the range [1.64, 4.33]. In this paper, we narrow the gap to [1.659, 2].

  20. Lectures on Bound states

    CERN Document Server

    Hoyer, Paul

    2016-01-01

    Even a first approximation of bound states requires contributions of all powers in the coupling. This means that the concept of "lowest order bound state" needs to be defined. In these lectures I discuss the "Born" (no loop, lowest order in $\\hbar$) approximation. Born level states are bound by gauge fields which satisfy the classical field equations. As a check of the method, Positronium states of any momentum are determined as eigenstates of the QED Hamiltonian, quantized at equal time. Analogously, states bound by a strong external field $A^\\mu(\\xv)$ are found as eigenstates of the Dirac Hamiltonian. Their Fock states have dynamically created $e^+e^-$ pairs, whose distribution is determined by the Dirac wave function. The linear potential of $D=1+1$ dimensions confines electrons but repels positrons. As a result, the mass spectrum is continuous and the wave functions have features of both bound states and plane waves. The classical solutions of Gauss' law are explored for hadrons in QCD. A non-vanishing bo...

  1. Bounding species distribution models

    Institute of Scientific and Technical Information of China (English)

    Thomas J. STOHLGREN; Catherine S. JARNEVICH; Wayne E. ESAIAS; Jeffrey T. MORISETTE

    2011-01-01

    Species distribution models are increasing in popularity for mapping suitable habitat for species of management concern.Many investigators now recognize that extrapolations of these models with geographic information systems (GIS) might be sensitive to the environmental bounds of the data used in their development,yet there is no recommended best practice for “clamping” model extrapolations.We relied on two commonly used modeling approaches:classification and regression tree (CART) and maximum entropy (Maxent) models,and we tested a simple alteration of the model extrapolations,bounding extrapolations to the maximum and minimum values of primary environmental predictors,to provide a more realistic map of suitable habitat of hybridized Africanized honey bees in the southwestern United States.Findings suggest that multiple models of bounding,and the most conservative bounding of species distribution models,like those presented here,should probably replace the unbounded or loosely bounded techniques currently used [Current Zoology 57 (5):642-647,2011].

  2. Information, Utility & Bounded Rationality

    CERN Document Server

    Ortega, Pedro A

    2011-01-01

    Perfectly rational decision-makers maximize expected utility, but crucially ignore the resource costs incurred when determining optimal actions. Here we employ an axiomatic framework for bounded rational decision-making based on a thermodynamic interpretation of resource costs as information costs. This leads to a variational "free utility" principle akin to thermodynamical free energy that trades off utility and information costs. We show that bounded optimal control solutions can be derived from this variational principle, which leads in general to stochastic policies. Furthermore, we show that risk-sensitive and robust (minimax) control schemes fall out naturally from this framework if the environment is considered as a bounded rational and perfectly rational opponent, respectively. When resource costs are ignored, the maximum expected utility principle is recovered.

  3. Bounded Computational Capacity Equilibrium

    CERN Document Server

    Hernandez, Penelope

    2010-01-01

    We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded computational power.

  4. A Bound on Equipartition of Energy

    CERN Document Server

    Masi, Nicolo'

    2011-01-01

    In this article I want to demonstrate that the time-scale constraints for a thermodynamic system imply the new concept of equipartition of energy bound (EEB) or, more generally, a thermodynamical bound for the partition of energy. This means that I theorize and discuss the possibility to put an upper limit to the equipartition factor for a gas of particles. This could be interpreted as a sort of transcription of the entropy bounds from quantum-holographic sector. The number 4.93, i.e. the EEB, obtained from a comparison between the Margolus-Levitin quantum theorem and the TTT bound for relaxation times by Hod, seems like a special value for the thermodynamics of particle systems. This bound has been related to the idea of an extremal statistics and independently traced in a statistical mechanics framework. In fact, I identified a type of fluid that is capable of reaching to saturate the limit value I obtained for the equipartition factor. This was done by analyzing the mathematical behavior of the distributio...

  5. Johnson Type Bounds on Constant Dimension Codes

    CERN Document Server

    Xia, Shu-Tao

    2007-01-01

    Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a fam...

  6. Bounding Noncommutative QCD

    CERN Document Server

    Carlson, C E; Lebed, R F; Carlson, Carl E.; Carone, Christopher D.; Lebed, Richard F.

    2001-01-01

    Jurco, Moller, Schraml, Schupp, and Wess have shown how to construct noncommutative SU(N) gauge theories from a consistency relation. Within this framework, we present the Feynman rules for noncommutative QCD and compute explicitly the most dangerous Lorentz-violating operator generated through radiative corrections. We find that interesting effects appear at the one-loop level, in contrast to conventional noncommutative U(N) gauge theories, leading to a stringent bound. Our results are consistent with others appearing recently in the literature that suggest collider limits are not competitive with low-energy tests of Lorentz violation for bounding the scale of spacetime noncommutativity.

  7. Emergency cricothyrotomy for trismus caused by instantaneous rigor in cardiac arrest patients.

    Science.gov (United States)

    Lee, Jae Hee; Jung, Koo Young

    2012-07-01

    Instantaneous rigor as muscle stiffening occurring in the moment of death (or cardiac arrest) can be confused with rigor mortis. If trismus is caused by instantaneous rigor, orotracheal intubation is impossible and a surgical airway should be secured. Here, we report 2 patients who had emergency cricothyrotomy for trismus caused by instantaneous rigor. This case report aims to help physicians understand instantaneous rigor and to emphasize the importance of securing a surgical airway quickly on the occurrence of trismus. Copyright © 2012 Elsevier Inc. All rights reserved.

  8. Force-producing ADP state of myosin bound to actin.

    Science.gov (United States)

    Wulf, Sarah F; Ropars, Virginie; Fujita-Becker, Setsuko; Oster, Marco; Hofhaus, Goetz; Trabuco, Leonardo G; Pylypenko, Olena; Sweeney, H Lee; Houdusse, Anne M; Schröder, Rasmus R

    2016-03-29

    Molecular motors produce force when they interact with their cellular tracks. For myosin motors, the primary force-generating state has MgADP tightly bound, whereas myosin is strongly bound to actin. We have generated an 8-Å cryoEM reconstruction of this state for myosin V and used molecular dynamics flexed fitting for model building. We compare this state to the subsequent state on actin (Rigor). The ADP-bound structure reveals that the actin-binding cleft is closed, even though MgADP is tightly bound. This state is accomplished by a previously unseen conformation of the β-sheet underlying the nucleotide pocket. The transition from the force-generating ADP state to Rigor requires a 9.5° rotation of the myosin lever arm, coupled to a β-sheet rearrangement. Thus, the structure reveals the detailed rearrangements underlying myosin force generation as well as the basis of strain-dependent ADP release that is essential for processive myosins, such as myosin V.

  9. Bounded variation and around

    CERN Document Server

    Appell, Jürgen; Merentes Díaz, Nelson José

    2013-01-01

    This monographis a self-contained exposition of the definition and properties of functionsof bounded variation and their various generalizations; the analytical properties of nonlinear composition operators in spaces of such functions; applications to Fourier analysis, nonlinear integral equations, and boundary value problems. The book is written for non-specialists. Every chapter closes with a list of exercises and open problems.

  10. The DMM Bound

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Mourrain, Bernard; Tsigaridas, Elias

    2010-01-01

    of variables. One application is to the bitsize of the eigenvalues and eigenvectors of an integer matrix, which also yields a new proof that the problem is polynomial. We also compare against recent lower bounds on the absolute value of the root coordinates by Brownawell and Yap [5], obtained under...

  11. PRO development: rigorous qualitative research as the crucial foundation.

    Science.gov (United States)

    Lasch, Kathryn Eilene; Marquis, Patrick; Vigneux, Marc; Abetz, Linda; Arnould, Benoit; Bayliss, Martha; Crawford, Bruce; Rosa, Kathleen

    2010-10-01

    Recently published articles have described criteria to assess qualitative research in the health field in general, but very few articles have delineated qualitative methods to be used in the development of Patient-Reported Outcomes (PROs). In fact, how PROs are developed with subject input through focus groups and interviews has been given relatively short shrift in the PRO literature when compared to the plethora of quantitative articles on the psychometric properties of PROs. If documented at all, most PRO validation articles give little for the reader to evaluate the content validity of the measures and the credibility and trustworthiness of the methods used to develop them. Increasingly, however, scientists and authorities want to be assured that PRO items and scales have meaning and relevance to subjects. This article was developed by an international, interdisciplinary group of psychologists, psychometricians, regulatory experts, a physician, and a sociologist. It presents rigorous and appropriate qualitative research methods for developing PROs with content validity. The approach described combines an overarching phenomenological theoretical framework with grounded theory data collection and analysis methods to yield PRO items and scales that have content validity.

  12. Toward Rigorous Data Harmonization in Cancer Epidemiology Research: One Approach.

    Science.gov (United States)

    Rolland, Betsy; Reid, Suzanna; Stelling, Deanna; Warnick, Greg; Thornquist, Mark; Feng, Ziding; Potter, John D

    2015-12-15

    Cancer epidemiologists have a long history of combining data sets in pooled analyses, often harmonizing heterogeneous data from multiple studies into 1 large data set. Although there are useful websites on data harmonization with recommendations and support, there is little research on best practices in data harmonization; each project conducts harmonization according to its own internal standards. The field would be greatly served by charting the process of data harmonization to enhance the quality of the harmonized data. Here, we describe the data harmonization process utilized at the Fred Hutchinson Cancer Research Center (Seattle, Washington) by the coordinating centers of several research projects. We describe a 6-step harmonization process, including: 1) identification of questions the harmonized data set is required to answer; 2) identification of high-level data concepts to answer those questions; 3) assessment of data availability for data concepts; 4) development of common data elements for each data concept; 5) mapping and transformation of individual data points to common data elements; and 6) quality-control procedures. Our aim here is not to claim a "correct" way of doing data harmonization but to encourage others to describe their processes in order that we can begin to create rigorous approaches. We also propose a research agenda around this issue. © The Author 2015. Published by Oxford University Press on behalf of the Johns Hopkins Bloomberg School of Public Health. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

  13. Information flow and causality as rigorous notions ab initio

    Science.gov (United States)

    Liang, X. San

    2016-11-01

    Information flow or information transfer the widely applicable general physics notion can be rigorously derived from first principles, rather than axiomatically proposed as an ansatz. Its logical association with causality is firmly rooted in the dynamical system that lies beneath. The principle of nil causality that reads, an event is not causal to another if the evolution of the latter is independent of the former, which transfer entropy analysis and Granger causality test fail to verify in many situations, turns out to be a proven theorem here. Established in this study are the information flows among the components of time-discrete mappings and time-continuous dynamical systems, both deterministic and stochastic. They have been obtained explicitly in closed form, and put to applications with the benchmark systems such as the Kaplan-Yorke map, Rössler system, baker transformation, Hénon map, and stochastic potential flow. Besides unraveling the causal relations as expected from the respective systems, some of the applications show that the information flow structure underlying a complex trajectory pattern could be tractable. For linear systems, the resulting remarkably concise formula asserts analytically that causation implies correlation, while correlation does not imply causation, providing a mathematical basis for the long-standing philosophical debate over causation versus correlation.

  14. PRO development: rigorous qualitative research as the crucial foundation

    Science.gov (United States)

    Marquis, Patrick; Vigneux, Marc; Abetz, Linda; Arnould, Benoit; Bayliss, Martha; Crawford, Bruce; Rosa, Kathleen

    2010-01-01

    Recently published articles have described criteria to assess qualitative research in the health field in general, but very few articles have delineated qualitative methods to be used in the development of Patient-Reported Outcomes (PROs). In fact, how PROs are developed with subject input through focus groups and interviews has been given relatively short shrift in the PRO literature when compared to the plethora of quantitative articles on the psychometric properties of PROs. If documented at all, most PRO validation articles give little for the reader to evaluate the content validity of the measures and the credibility and trustworthiness of the methods used to develop them. Increasingly, however, scientists and authorities want to be assured that PRO items and scales have meaning and relevance to subjects. This article was developed by an international, interdisciplinary group of psychologists, psychometricians, regulatory experts, a physician, and a sociologist. It presents rigorous and appropriate qualitative research methods for developing PROs with content validity. The approach described combines an overarching phenomenological theoretical framework with grounded theory data collection and analysis methods to yield PRO items and scales that have content validity. PMID:20512662

  15. Bounds for the harmonious chromatic number of a graph

    OpenAIRE

    Krasikov, I.; Y. Roditty

    1994-01-01

    The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (Journal of Graph Theory, 1991, pp. 345-347 and 629-636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (Journal of Graph Theory, 1989, pp. 291-298) are improved.

  16. On Entropy Bounds and Holography

    CERN Document Server

    Halyo, Edi

    2009-01-01

    We show that the holographic entropy bound for gravitational systems and the Bekenstein entropy bound for nongravitational systems are holographically related. Using the AdS/CFT correspondence, we find that the Bekenstein bound on the boundary is obtained from the holographic bound in the bulk by minimizing the boundary energy with respect the AdS radius or the cosmological constant. This relation may also ameliorate some problems associated with the Bekenstein bound.

  17. Bounds on tau neutrino magnetic moment and charge radius from Super-K and SNO observations

    CERN Document Server

    Joshipura, A S; Joshipura, Anjan S.; Mohanty, Subhendra

    2001-01-01

    Neutrinos can scatter electrons in water detectors through their magnetic moments and charge radii in addition to the charged and neutral currents channels. The recent solar neutrino charged current event rates announced by SNO with the earlier solar and atmospheric neutrino observations from Super-Kamiokande allows us to put upper bounds of $\\mu < 10^{-31} cm^2$ on the neutrino charge radii. For the electron and muon neutrinos these bounds are comparable with existing bounds but for tau neutrinos these bounds are three orders of magnitude more stringent than earlier terrestrial bounds. These bounds are independent of any specific model of neutrino oscillations.

  18. Bounded Satisfiability for PCTL

    CERN Document Server

    Bertrand, Nathalie; Schewe, Sven

    2012-01-01

    While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. While general satisfiability is an intriguing challenge from a purely theoretical point of view, we argue that general solutions would not be of interest to practitioners: such solutions could be too big to be implementable or even infinite. Inspired by bounded synthesis techniques, we turn to the more applied problem of seeking models of a bounded size: we restrict our search to implementable -- and therefore reasonably simple -- models. We propose a procedure to decide whether or not a given PCTL formula has an implementable model by reducing it to an SMT problem. We have implemented our techniques and found that they can be applied to the practical problem of sanity checking -- a procedure that allows a system designer to check whether their formula has an unexpectedly small model.

  19. Bounds for departure from normality and the Frobenius norm of matrix eigenvalues

    Energy Technology Data Exchange (ETDEWEB)

    Lee, S.L.

    1994-12-01

    New lower and upper bounds for the departure from normality and the Frobenius norm of the eigenvalues of a matrix axe given. The significant properties of these bounds axe also described. For example, the upper bound for matrix eigenvalues improves upon the one derived by Kress, de Vries and Wegmann in [Lin. Alg. Appl., 8 (1974), pp. 109-120]. The upper bound for departure from normality is sharp for any matrix whose eigenvalues are collinear in the complex plane. Moreover, the latter formula is a practical estimate that costs (at most) 2m multiplications, where m is the number of nonzeros in the matrix. In terms of applications, the results can be used to bound from above the sensitivity of eigenvalues to matrix perturbations or bound from below the condition number of the eigenbasis of a matrix.

  20. Gilmore-Lawler bound of quadratic assignment problem

    Institute of Scientific and Technical Information of China (English)

    Yong XIA

    2008-01-01

    The Gilmore-Lawler bound (GLB) is one of the well-known lower bound of quadratic assignment problem (QAP). Checking whether GLB is tight is an NP-complete problem. In this article, based on Xia and Yuan linearization technique, we provide an upper bound of the complexity of this problem, which makes it pseudo-polynomial solvable. We also pseudo-polynomially solve a class of QAP whose GLB is equal to the optimal objec-tive function value, which was shown to remain NP-hard.

  1. Vulnerable Derivatives and Good Deal Bounds: A Structural Model

    DEFF Research Database (Denmark)

    Murgoci, Agatha

    2013-01-01

    a new restriction in the arbitrage free model by setting upper bounds on the Sharpe ratios (SRs) of the assets. The potential prices that are eliminated represent unreasonably good deals. The constraint on the SR translates into a constraint on the stochastic discount factor. Thus, tight pricing bounds...... can be obtained. We provide a link between the objective probability measure and the range of potential risk-neutral measures, which has an intuitive economic meaning. We also provide tight pricing bounds for European calls and show how to extend the call formula to pricing other financial products...

  2. OPRA capacity bounds for selection diversity over generalized fading channels

    KAUST Repository

    Hanif, Muhammad Fainan

    2014-05-01

    Channel side information at the transmitter can increase the average capacity by enabling optimal power and rate adaptation. The resulting optimal power and rate adaptation (OPRA) capacity rarely has a closed-form analytic expression. In this paper, lower and upper bounds on OPRA capacity for selection diversity scheme are presented. These bounds hold for variety of fading channels including log-normal and generalized Gamma distributed models and have very simple analytic expressions for easy evaluation even for kth best path selection. Some selected numerical results show that the newly proposed bounds closely approximate the actual OPRA capacity. © 2014 IEEE.

  3. Bogomolnyi-type bounds in unconventional superconductors without external magnetic fields

    NARCIS (Netherlands)

    Achucarro, A; Manes, JL

    1996-01-01

    Following Bogomolnyi's classical. treatment of vortices, we develop a method for finding rigorous lower bounds to the Landau-Ginzburg free energy, describing unconventional superconductors in the absence of external magnetic fields. This allows a more precise description of the magnetic instabilitie

  4. A cosmological bound on radiative neutrino lifetime

    Science.gov (United States)

    Mirizzi, A.; Montanino, D.; Serpico, P. D.

    2008-07-01

    Neutrino oscillation experiments and direct bounds on absolute masses constrain neutrino mass differences to fall into the microwave energy range, for most of the allowed parameter space. As a consequence of these recent phenomenological advances, older constraints on radiative neutrino decays based on diffuse background radiations and assuming strongly hierarchical masses in the eV range are now outdated. We thus derive new bounds on the radiative neutrino lifetime using the high precision cosmic microwave background spectral data collected by the FIRAS instrument on board of COBE. The lower bound on neutrino lifetime is between a few ×1019 s and ~ 5 × 1020 s, depending on the neutrino mass ordering and on the absolute neutrino mass scale. However, due to phase space limitations, the upper bound on the effective magnetic moment mediating the decay is not better than ~10-8 μB. We also comment about possible improvements of these limits, by means of recent diffuse infrared photon background data.

  5. Revisiting cosmological bounds on radiative neutrino lifetime

    CERN Document Server

    Mirizzi, A; Serpico, Pasquale Dario

    2007-01-01

    Neutrino oscillation experiments and direct bounds on absolute masses constrain neutrino mass differences to fall into the microwave energy range, for most of the allowed parameter space. As a consequence of these recent phenomenological advances, older constraints on radiative neutrino decays based on diffuse background radiations and assuming strongly hierarchical masses in the eV range are now outdated. We thus derive new bounds on the radiative neutrino lifetime using the high precision cosmic microwave background spectral data collected by the FIRAS instrument on board of COBE. The lower bound on the lifetime is between a few x 10^19 s and 5 x 10^20 s, depending on the neutrino mass ordering and on the absolute mass scale. However, due to phase space limitations, the upper bound in terms of the effective magnetic moment mediating the decay is not better than ~ 10^-8 Bohr magnetons. We also comment about possible improvements of these limits, by means of recent diffuse infrared photon background data. We ...

  6. Bounds of memory strength for power-law series

    Science.gov (United States)

    Guo, Fangjian; Yang, Dan; Yang, Zimo; Zhao, Zhi-Dan; Zhou, Tao

    2017-05-01

    Many time series produced by complex systems are empirically found to follow power-law distributions with different exponents α . By permuting the independently drawn samples from a power-law distribution, we present nontrivial bounds on the memory strength (first-order autocorrelation) as a function of α , which are markedly different from the ordinary ±1 bounds for Gaussian or uniform distributions. When 1 remains 0; when α >3 , the upper bound remains +1 while the lower bound descends below 0. Theoretical bounds agree well with numerical simulations. Based on the posts on Twitter, ratings of MovieLens, calling records of the mobile operator Orange, and the browsing behavior of Taobao, we find that empirical power-law-distributed data produced by human activities obey such constraints. The present findings explain some observed constraints in bursty time series and scale-free networks and challenge the validity of measures such as autocorrelation and assortativity coefficient in heterogeneous systems.

  7. Cramér-Rao-Type Bounds for Localization

    Directory of Open Access Journals (Sweden)

    Chang Cheng

    2006-01-01

    Full Text Available The localization problem is fundamentally important for sensor networks. This paper, based on "Estimation bounds for localization" by the authors (2004 © IEEE, studies the Cramér-Rao lower bound (CRB for two kinds of localization based on noisy range measurements. The first is anchored localization in which the estimated positions of at least nodes are known in global coordinates. We show some basic invariances of the CRB in this case and derive lower and upper bounds on the CRB which can be computed using only local information. The second is anchor-free localization where no absolute positions are known. Although the Fisher information matrix is singular, a CRB-like bound exists on the total estimation variance. Finally, for both cases we discuss how the bounds scale to large networks under different models of wireless signal propagation.

  8. Asymptotic Sharpness of Bounds on Hypertrees

    Directory of Open Access Journals (Sweden)

    Lin Yi

    2017-08-01

    Full Text Available The hypertree can be defined in many different ways. Katona and Szabó introduced a new, natural definition of hypertrees in uniform hypergraphs and investigated bounds on the number of edges of the hypertrees. They showed that a k-uniform hypertree on n vertices has at most (nk−1$\\left( {\\matrix{n \\cr {k - 1} } } \\right$ edges and they conjectured that the upper bound is asymptotically sharp. Recently, Szabó verified that the conjecture holds by recursively constructing an infinite sequence of k-uniform hypertrees and making complicated analyses for it. In this note we give a short proof of the conjecture by directly constructing a sequence of k-uniform k-hypertrees.

  9. A Holographic Bound on Cosmic Magnetic Fields

    CERN Document Server

    McInnes, Brett

    2015-01-01

    Magnetic fields large enough to be observable are ubiquitous in astrophysics, even at extremely large length scales. This has led to the suggestion that such fields are seeded at very early (inflationary) times, and subsequently amplified by various processes involving, for example, dynamo effects. Many such mechanisms give rise to extremely large magnetic fields at the end of inflationary reheating, and therefore also during the quark-gluon plasma epoch of the early universe. Such plasmas have a well-known holographic description. We show that holography imposes an upper bound on the intensity of magnetic fields (scaled by the squared temperature) in these circumstances, and that the values expected in some models of cosmic magnetism come close to attaining that bound.

  10. Performance bound for quantum absorption refrigerators

    Science.gov (United States)

    Correa, Luis A.; Palao, José P.; Adesso, Gerardo; Alonso, Daniel

    2013-04-01

    An implementation of quantum absorption chillers with three qubits has been recently proposed that is ideally able to reach the Carnot performance regime. Here we study the working efficiency of such self-contained refrigerators, adopting a consistent treatment of dissipation effects. We demonstrate that the coefficient of performance at maximum cooling power is upper bounded by 3/4 of the Carnot performance. The result is independent of the details of the system and the equilibrium temperatures of the external baths. We provide design prescriptions that saturate the bound in the limit of a large difference between the operating temperatures. Our study suggests that delocalized dissipation, which must be taken into account for a proper modeling of the machine-baths interaction, is a fundamental source of irreversibility which prevents the refrigerator from approaching the Carnot performance arbitrarily closely in practice. The potential role of quantum correlations in the operation of these machines is also investigated.

  11. Is there nursing phenomenology after Paley? Essay on rigorous reading.

    Science.gov (United States)

    Petrovskaya, Olga

    2014-01-01

    At the bedside, nurses are expected to be precise when they read indications on screens and on the bodies of patients and decide on the meaning of words framed by the context of acute care. In academia, although there is no incident report to fill when we misread or misrepresent complex philosophical ideas, the consequences of inaccurate reading include misplaced epistemological claims and poor scholarship. A long and broad convention of nursing phenomenological research, in its various forms, claims a philosophical grounding in the ideas of Husserl, Heidegger, and other thinkers. But for nearly two decades, nurse phenomenologists' knowledge claims have been challenged by well-informed criticisms, most notably by John Paley. At the heart of criticism lies an observation that Continental phenomenological thought is misrepresented in many nursing sources and that nursing phenomenology, both descriptive and interpretive, cannot appeal to the authority of either Husserl or Heidegger. Taking these criticisms seriously, I am asking, Is phenomenology after Paley possible? If misreading seems to be an issue, how can - or should - we read rigorously? My thinking through these questions is influenced by the ideas of Jacques Derrida. Under a condition of a play of language, of Derridian différance, when meaning is never self-identical and never fully arrives, I suggest that one has to negotiate meanings through reading for differences. I develop this idea in relation to the methodological conventions of phenomenological nursing research and argue for a careful rereading of the whole field of phenomenological nursing research. Such rereading presupposes and necessitates interdisciplinary engagement between nursing and the humanities and interpretive social sciences. Greater familiarity with research practices of those disciplines that stress theoretical and writing rigour might make visible the limits of nursing research approaches and their quality criteria. An understanding

  12. BOUNDING PYRAMIDS AND BOUNDING CONES FOR TRIANGULAR BEZIER SURFACES

    Institute of Scientific and Technical Information of China (English)

    Jian-song Deng; Fa-lai Chen; Li-li Wang

    2000-01-01

    This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bézier surfaces. Examples are provided to illustrate the process of construction and comparison is made between various surface bounding volumes. Furthermore, as a starting point for the construction,we provide a way to compute hodographs of triangular Bézier surfaces and improve the algorithm for computing the bounding cone of a set of vectors.

  13. RIGOR MORTIS AND THE INFLUENCE OF CALCIUM AND MAGNESIUM SALTS UPON ITS DEVELOPMENT.

    Science.gov (United States)

    Meltzer, S J; Auer, J

    1908-01-01

    Calcium salts hasten and magnesium salts retard the development of rigor mortis, that is, when these salts are administered subcutaneously or intravenously. When injected intra-arterially, concentrated solutions of both kinds of salts cause nearly an immediate onset of a strong stiffness of the muscles which is apparently a contraction, brought on by a stimulation caused by these salts and due to osmosis. This contraction, if strong, passes over without a relaxation into a real rigor. This form of rigor may be classed as work-rigor (Arbeitsstarre). In animals, at least in frogs, with intact cords, the early contraction and the following rigor are stronger than in animals with destroyed cord. If M/8 solutions-nearly equimolecular to "physiological" solutions of sodium chloride-are used, even when injected intra-arterially, calcium salts hasten and magnesium salts retard the onset of rigor. The hastening and retardation in this case as well as in the cases of subcutaneous and intravenous injections, are ion effects and essentially due to the cations, calcium and magnesium. In the rigor hastened by calcium the effects of the extensor muscles mostly prevail; in the rigor following magnesium injection, on the other hand, either the flexor muscles prevail or the muscles become stiff in the original position of the animal at death. There seems to be no difference in the degree of stiffness in the final rigor, only the onset and development of the rigor is hastened in the case of the one salt and retarded in the other. Calcium hastens also the development of heat rigor. No positive facts were obtained with regard to the effect of magnesium upon heat vigor. Calcium also hastens and magnesium retards the onset of rigor in the left ventricle of the heart. No definite data were gathered with regard to the effects of these salts upon the right ventricle.

  14. Fitness levels with tail bounds for the analysis of randomized search heuristics

    DEFF Research Database (Denmark)

    Witt, Carsten

    2014-01-01

    The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were...... added to the technique; however, these tail bounds only apply to running times that are at least twice as large as the expectation.We remove this restriction and supplement the fitness-level method with sharp tail bounds, including lower tails. As an exemplary application, we prove that the running time...

  15. Critical SQG in bounded domains

    OpenAIRE

    Constantin, Peter; Ignatova, Mihaela

    2016-01-01

    We consider the critical dissipative SQG equation in bounded domains, with the square root of the Dirichlet Laplacian dissipation. We prove global a priori interior $C^{\\alpha}$ and Lipschitz bounds for large data.

  16. A bound on chaos

    Energy Technology Data Exchange (ETDEWEB)

    Maldacena, Juan [School of Natural Sciences, Institute for Advanced Study,1 Einstein Drive, Princeton, NJ (United States); Shenker, Stephen H. [Stanford Institute for Theoretical Physics and Department of Physics, Stanford University,382 Via Pueblo Mall, Stanford, CA (United States); Stanford, Douglas [School of Natural Sciences, Institute for Advanced Study,1 Einstein Drive, Princeton, NJ (United States)

    2016-08-17

    We conjecture a sharp bound on the rate of growth of chaos in thermal quantum systems with a large number of degrees of freedom. Chaos can be diagnosed using an out-of-time-order correlation function closely related to the commutator of operators separated in time. We conjecture that the influence of chaos on this correlator can develop no faster than exponentially, with Lyapunov exponent λ{sub L}≤2πk{sub B}T/ℏ. We give a precise mathematical argument, based on plausible physical assumptions, establishing this conjecture.

  17. Regularity of Bound States

    DEFF Research Database (Denmark)

    Faupin, Jeremy; Møller, Jacob Schach; Skibsted, Erik

    2011-01-01

    We study regularity of bound states pertaining to embedded eigenvalues of a self-adjoint operator H, with respect to an auxiliary operator A that is conjugate to H in the sense of Mourre. We work within the framework of singular Mourre theory which enables us to deal with confined massless Pauli–......–Fierz models, our primary example, and many-body AC-Stark Hamiltonians. In the simpler context of regular Mourre theory, our results boil down to an improvement of results obtained recently in [8, 9]....

  18. A bound on chaos

    CERN Document Server

    Maldacena, Juan; Stanford, Douglas

    2015-01-01

    We conjecture a sharp bound on the rate of growth of chaos in thermal quantum systems with a large number of degrees of freedom. Chaos can be diagnosed using an out-of-time-order correlation function closely related to the commutator of operators separated in time. We conjecture that the influence of chaos on this correlator can develop no faster than exponentially, with Lyapunov exponent $\\lambda_L \\le 2 \\pi k_B T/\\hbar$. We give a precise mathematical argument, based on plausible physical assumptions, establishing this conjecture.

  19. Delay Bounds for Multiclass FIFO

    OpenAIRE

    Jiang, Yuming; Misra, Vishal

    2016-01-01

    FIFO is perhaps the simplest scheduling discipline. For single-class FIFO, its delay guarantee performance has been extensively studied: The well-known results include a stochastic delay bound for $GI/GI/1$ by Kingman and a deterministic delay bound for $D/D/1$ by Cruz. However, for multiclass FIFO, few such results are available. To fill the gap, we prove delay bounds for multiclass FIFO in this work, considering both deterministic and stochastic cases. Specifically, delay bounds are present...

  20. Bounded Fixed-Point Iteration

    DEFF Research Database (Denmark)

    Nielson, Hanne Riis; Nielson, Flemming

    1992-01-01

    they obtain a quadratic bound. These bounds are shown to be tight. Specializing the case of strict and additive functions to functionals of a form that would correspond to iterative programs they show that a linear bound is tight. This is related to several analyses studied in the literature (including...

  1. Error bounds for set inclusions

    Institute of Scientific and Technical Information of China (English)

    ZHENG; Xiyin(郑喜印)

    2003-01-01

    A variant of Robinson-Ursescu Theorem is given in normed spaces. Several error bound theorems for convex inclusions are proved and in particular a positive answer to Li and Singer's conjecture is given under weaker assumption than the assumption required in their conjecture. Perturbation error bounds are also studied. As applications, we study error bounds for convex inequality systems.

  2. Multifunctions of bounded variation

    Science.gov (United States)

    Vinter, R. B.

    2016-02-01

    Consider control systems described by a differential equation with a control term or, more generally, by a differential inclusion with velocity set F (t , x). Certain properties of state trajectories can be derived when it is assumed that F (t , x) is merely measurable w.r.t. the time variable t. But sometimes a refined analysis requires the imposition of stronger hypotheses regarding the time dependence. Stronger forms of necessary conditions for minimizing state trajectories can be derived, for example, when F (t , x) is Lipschitz continuous w.r.t. time. It has recently become apparent that significant addition properties of state trajectories can still be derived, when the Lipschitz continuity hypothesis is replaced by the weaker requirement that F (t , x) has bounded variation w.r.t. time. This paper introduces a new concept of multifunctions F (t , x) that have bounded variation w.r.t. time near a given state trajectory, of special relevance to control. We provide an application to sensitivity analysis.

  3. Speed of sound bounds and neutron star structure

    CERN Document Server

    Moustakidis, Ch C; Margaritis, Ch; Lalazissis, G A

    2016-01-01

    The accurate determination of the maximum mass of the neutron stars is one of the most important tasks in Astrophysics. It is directly related with the identification of the black holes in the Universe, the production of neutron stars from the supernovae explosion and the Equation of State (EoS) of dense matter. However, not only the EoS is directly connected with neutron star masses, but also the speed of sound in dense matter is a crucial quantity which characterizes the stiffness of the EoS. The upper bound of the speed of sound imposes strong constraints on the maximum mass of neutron stars. However, this upper bound remains still an open issue. Recent observations, of binary neutron star systems, offer the possibility to measure with high accuracy both the mass and the tidal polarizability of the stars. We study possible effects of the upper bound of the speed of sound on the upper bound of the mass and the tidal polarizability. We conclude that this kind of measurements, combined with recent observation...

  4. High accuracy semidefinite programming bounds for kissing numbers

    NARCIS (Netherlands)

    Mittelmann, H.D.; Vallentin, F.

    2009-01-01

    The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This paper is a repor

  5. Sharp Bounds by Probability-Generating Functions and Variable Drift

    DEFF Research Database (Denmark)

    Doerr, Benjamin; Fouz, Mahmoud; Witt, Carsten

    2011-01-01

    We introduce to the runtime analysis of evolutionary algorithms two powerful techniques: probability-generating functions and variable drift analysis. They are shown to provide a clean framework for proving sharp upper and lower bounds. As an application, we improve the results by Doerr et al. (G...

  6. Optimal portfolio selection for cashflows with bounded capital at risk

    NARCIS (Netherlands)

    Vyncke, D.; Goovaerts, M.J.; Dhaene, J.L.M.; Vanduffel, S.

    2005-01-01

    We consider a continuous-time Markowitz type portfolio problem that consists of minimizing the discounted cost of a given cash-fl ow under the constraint of a restricted Capital at Risk. In a Black-Scholes setting, upper and lower bounds are obtained by means of simple analytical expressions that

  7. Tolerance-based Branch and Bound algorithms for the ATSP

    NARCIS (Netherlands)

    Turkensteen, Marcel; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard

    2008-01-01

    The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances to guide the search for optimal solutions. In spite of the fact that it needs

  8. BOUNDS OF THE HAUSDORFF MEASURE OF SIERPINSKI CARPET

    Institute of Scientific and Technical Information of China (English)

    Baoguo Jia

    2006-01-01

    By means of the idea of [2](Jia Baoguo, J. Math. Anal. Appl. In press) and the self-similarity of Sierpinski carpet, we obtain the lower and upper bounds of the Hausdorff Measure of Sierpinski carpet, which can approach the Hausdorff Measure of Sierpinski carpet infinitely.

  9. DECAY ESTIMATES FOR ISENTROPIC COMPRESSIBLE MAGNETOHYDRODYNAMIC EQUATIONS IN BOUNDED DOMAIN

    Institute of Scientific and Technical Information of China (English)

    Mohamed Ahmed Abdallah; Jiang Fei; Tan Zhong

    2012-01-01

    In this paper,under the hypothesis that (o) is upper bounded,we construct a Lyapunov functional for the multidimensional isentropic compressible magnetohydrodynamic equations and show that the weak solutions decay exponentially to the equilibrium state in L2 norm.Our result verifies that the method of Daoyuan Fang,Ruizhao Zi and Ting Zhang [1] can be adapted to magnetohydrodynamic equations.

  10. High accuracy semidefinite programming bounds for kissing numbers

    NARCIS (Netherlands)

    H.D. Mittelmann; F. Vallentin (Frank)

    2010-01-01

    htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This

  11. High accuracy semidefinite programming bounds for kissing numbers

    NARCIS (Netherlands)

    H.D. Mittelmann; F. Vallentin (Frank)

    2009-01-01

    htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This

  12. Dark matter annihilation bound from the diffuse gamma ray flux

    Energy Technology Data Exchange (ETDEWEB)

    Kachelriess, M.; /Norwegian U. Sci. Tech.; Serpico, P.D.; /Fermilab

    2007-07-01

    An upper limit on the total annihilation rate of dark matter (DM) has been recently derived from the observed atmospheric neutrino background. It is a very conservative upper bound based on the sole hypothesis that the DM annihilation products are the least detectable final states in the Standard Model (SM), neutrinos. Any other decay channel into SM particles would lead to stronger constraints. We show that comparable bounds are obtained for DM masses around the TeV scale by observations of the diffuse gamma ray flux by EGRET, because electroweak bremsstrahlung leads to non-negligible electromagnetic branching ratios, even if DM particles only couple to neutrinos at tree level. A better mapping and the partial resolution of the diffuse gamma-ray background into astrophysical sources by the GLAST satellite will improve this bound in the near future.

  13. What's the Problem with a "Rigorous Academic Curriculum"?: Setting New Terms for Students' School Experiences

    Science.gov (United States)

    Wraga, William G.

    2011-01-01

    An analysis of the ubiquitous but taken-for-granted term "rigorous academic curriculum" reveals that by definition it is not an academically rigorous term. The term contains multiple meanings, negative connotations, and a constricted conception of the school curriculum. It is associated with a discredited learning theory and in practice…

  14. The Relationship between Project-Based Learning and Rigor in STEM-Focused High Schools

    Science.gov (United States)

    Edmunds, Julie; Arshavsky, Nina; Glennie, Elizabeth; Charles, Karen; Rice, Olivia

    2016-01-01

    Project-based learning (PjBL) is an approach often favored in STEM classrooms, yet some studies have shown that teachers struggle to implement it with academic rigor. This paper explores the relationship between PjBL and rigor in the classrooms of ten STEM-oriented high schools. Utilizing three different data sources reflecting three different…

  15. Characteristics of School Districts That Participate in Rigorous National Educational Evaluations

    Science.gov (United States)

    Stuart, Elizabeth A.; Bell, Stephen H.; Ebnesajjad, Cyrus; Olsen, Robert B.; Orr, Larry L.

    2017-01-01

    Given increasing interest in evidence-based policy, there is growing attention to how well the results from rigorous program evaluations may inform policy decisions. However, little attention has been paid to documenting the characteristics of schools or districts that participate in rigorous educational evaluations, and how they compare to…

  16. Trends in Methodological Rigor in Intervention Research Published in School Psychology Journals

    Science.gov (United States)

    Burns, Matthew K.; Klingbeil, David A.; Ysseldyke, James E.; Petersen-Brown, Shawna

    2012-01-01

    Methodological rigor in intervention research is important for documenting evidence-based practices and has been a recent focus in legislation, including the No Child Left Behind Act. The current study examined the methodological rigor of intervention research in four school psychology journals since the 1960s. Intervention research has increased…

  17. Trends in Methodological Rigor in Intervention Research Published in School Psychology Journals

    Science.gov (United States)

    Burns, Matthew K.; Klingbeil, David A.; Ysseldyke, James E.; Petersen-Brown, Shawna

    2012-01-01

    Methodological rigor in intervention research is important for documenting evidence-based practices and has been a recent focus in legislation, including the No Child Left Behind Act. The current study examined the methodological rigor of intervention research in four school psychology journals since the 1960s. Intervention research has increased…

  18. 34 CFR 691.16 - Rigorous secondary school program of study.

    Science.gov (United States)

    2010-07-01

    ... 34 Education 3 2010-07-01 2010-07-01 false Rigorous secondary school program of study. 691.16... Rigorous secondary school program of study. (a)(1) For each award year commencing with the 2009-2010 award year, the Secretary establishes a deadline for submission of information about secondary...

  19. Models and Techniques for Proving Data Structure Lower Bounds

    DEFF Research Database (Denmark)

    Larsen, Kasper Green

    In this dissertation, we present a number of new techniques and tools for proving lower bounds on the operational time of data structures. These techniques provide new lines of attack for proving lower bounds in both the cell probe model, the group model, the pointer machine model and the I/O-mod...... for range reporting problems in the pointer machine and the I/O-model. With this technique, we tighten the gap between the known upper bound and lower bound for the most fundamental range reporting problem, orthogonal range reporting. 5......In this dissertation, we present a number of new techniques and tools for proving lower bounds on the operational time of data structures. These techniques provide new lines of attack for proving lower bounds in both the cell probe model, the group model, the pointer machine model and the I....../O-model. In all cases, we push the frontiers further by proving lower bounds higher than what could possibly be proved using previously known techniques. For the cell probe model, our results have the following consequences: The rst (lg n) query time lower bound for linear space static data structures...

  20. High frequency characteristics of elasticity of skeletal muscle fibres kept in relaxed and rigor state.

    Science.gov (United States)

    De Winkel, M E; Blangé, T; Treijtel, B W

    1994-04-01

    The viscoelastic properties of crossbridges in rigor state are studied by means of application of small length changes, completed within 30 microseconds, to isometric skinned fibre segments of the iliofibularis muscle of the frog in relaxed and rigor state and measurement of the tension response. Results are expressed as a complex Young's modulus, the real part of which denotes normalized stiffness, while the imaginary part denotes normalized viscous mechanical impedance. Young's modulus was examined over a wide frequency range varying from 5 Hz up to 50 kHz. Young's modulus can be interpreted in terms of stiffness and viscous friction of the half-sarcomere or in terms of elastic changes in tension and recovery upon a step length change. The viscoelastic properties of half-sarcomeres of muscle fibre segments in rigor state showed strong resemblance to those of activated fibres in that shortening a muscle fibre in rigor state resulted in an immediate drop in tension, after which half of the drop in tension was recovered. The following slower phases of tension recovery--a subsequent drop in tension and slow completion of tension recovery--as seen in the activated state, do not occur in rigor state. The magnitude of Young's moduli of fibres in rigor state generally decreased from a value of 3.12 x 10(7) N m-2 at 40 kHz to 1.61 x 10(7) N m-2 at about 100 Hz. Effects of increased viscosity of the incubation medium, decreased interfilament distance in the relaxed state and variation of rigor tension upon frequency dependence of complex Young's modulus have been investigated. Variation of tension of crossbridges in rigor state influenced to some extent the frequency dependence of the Young's modulus. Recovery in relaxed state is not dependent on the viscosity of the medium. Recovery in rigor is slowed down at raised viscosity of the incubation medium, but less than half the amount expected if viscosity of the medium would be the cause of internal friction of the half

  1. On the Content Bound for Real Quadratic Field Extensions

    Directory of Open Access Journals (Sweden)

    Robert G. Underwood

    2012-12-01

    Full Text Available Let K be a finite extension of Q and let S = {ν} denote the collection of K normalized absolute values on K. Let V+K denote the additive group of adeles over K and let K ≥0   c : V + → R denote the content map defined as c({aν } = Q K   ν ∈S ν (aν for {aν } ∈ V+K A classical result of J. W. S. Cassels states that there is a constant c > 0 depending only on the field K  with the following property: if {aν } ∈ V+K with c({aν }  > c, then there exists a non-zero element b  ∈ K for which ν (b ≤ ν (aν , ∀ν  ∈ S. Let cK be the greatest lower bound of the set of all c that satisfy this property. In the case that K is a real quadratic extension there is a known upper bound for cK due to S. Lang. The purpose of this paper is to construct a new upper bound for cK in the case that K has class number one. We compare our new bound with Lang’s bound for various real quadratic extensions and find that our new bound is better than Lang’s in many instances.

  2. Dynamic Garment Simulation based on Hybrid Bounding Volume Hierarchy

    Directory of Open Access Journals (Sweden)

    Zhu Dongyong

    2016-12-01

    Full Text Available In order to solve the computing speed and efficiency problem of existing dynamic clothing simulation, this paper presents a dynamic garment simulation based on a hybrid bounding volume hierarchy. It firstly uses MCASG graph theory to do the primary segmentation for a given three-dimensional human body model. And then it applies K-means cluster to do the secondary segmentation to collect the human body’s upper arms, lower arms, upper legs, lower legs, trunk, hip and woman’s chest as the elementary units of dynamic clothing simulation. According to different shapes of these elementary units, it chooses the closest and most efficient hybrid bounding box to specify these units, such as cylinder bounding box and elliptic cylinder bounding box. During the process of constructing these bounding boxes, it uses the least squares method and slices of the human body to get the related parameters. This approach makes it possible to use the least amount of bounding boxes to create close collision detection regions for the appearance of the human body. A spring-mass model based on a triangular mesh of the clothing model is finally constructed for dynamic simulation. The simulation result shows the feasibility and superiority of the method described.

  3. Formation of "bound

    Science.gov (United States)

    Nowak, K.; Kästner, M.; Miltner, A.

    2009-04-01

    During degradation of organic pollutants in soil, metabolites, microbial biomass, CO2and "bound" residues ("non-extractable" residues in soil organic matter) are formed. Enhanced transformation of these contaminants into "bound" residues has been proposed as an alternative remediation method for polluted soils. However, this kind of residues may pose a potential risk for the environment due to their chemical structure and possible remobilization under different conditions. Therefore particular attention is given actually to "bound" residues. Part of these non-extractable residues may be "biogenic," because microorganisms use the carbon from the pollutant to form their biomass components (fatty acids, amino acids, amino sugars), which subsequently may be incorporated into soil organic matter. Furthermore, the CO2 originating from mineralization of xenobiotics, can be re-assimilated by microorganisms and also incorporated into "biogenic residue". The hazard posed by "bound" residues may be overestimated because they are "biogenic" (contain microbial fatty acids and amino acids). The knowledge about the pathways of "biogenic residue" formation is necessary for a proper assessment of the fate of tested pollutants and their turnover in the soil environment. Moreover, these data are needed to establish the realistic degradation rates of the contaminants in soil. The main objectives of this study are: to quantify the extent of "biogenic residue" (fatty acids, amino acids, amino sugars) formation during the degradation of a model pollutant (2,4-dichlorophenoxyacetic acid = 2,4-D) and during CO2 assimilation by microorganisms and to evaluate which components are mainly incorporated into "bound" residues. To investigate the extent of "biogenic residue" formation in soil during the degradation of 2,4-D, experiments with either 14C-U-ring and 13C6-2,4-D or carboxyl-14C 2,4-D were performed. The incubation experiments were performed according to OECD test guideline 307, in the

  4. Estimation variance bounds of importance sampling simulations in digital communication systems

    Science.gov (United States)

    Lu, D.; Yao, K.

    1991-01-01

    In practical applications of importance sampling (IS) simulation, two basic problems are encountered, that of determining the estimation variance and that of evaluating the proper IS parameters needed in the simulations. The authors derive new upper and lower bounds on the estimation variance which are applicable to IS techniques. The upper bound is simple to evaluate and may be minimized by the proper selection of the IS parameter. Thus, lower and upper bounds on the improvement ratio of various IS techniques relative to the direct Monte Carlo simulation are also available. These bounds are shown to be useful and computationally simple to obtain. Based on the proposed technique, one can readily find practical suboptimum IS parameters. Numerical results indicate that these bounding techniques are useful for IS simulations of linear and nonlinear communication systems with intersymbol interference in which bit error rate and IS estimation variances cannot be obtained readily using prior techniques.

  5. Estimation variance bounds of importance sampling simulations in digital communication systems

    Science.gov (United States)

    Lu, D.; Yao, K.

    1991-01-01

    In practical applications of importance sampling (IS) simulation, two basic problems are encountered, that of determining the estimation variance and that of evaluating the proper IS parameters needed in the simulations. The authors derive new upper and lower bounds on the estimation variance which are applicable to IS techniques. The upper bound is simple to evaluate and may be minimized by the proper selection of the IS parameter. Thus, lower and upper bounds on the improvement ratio of various IS techniques relative to the direct Monte Carlo simulation are also available. These bounds are shown to be useful and computationally simple to obtain. Based on the proposed technique, one can readily find practical suboptimum IS parameters. Numerical results indicate that these bounding techniques are useful for IS simulations of linear and nonlinear communication systems with intersymbol interference in which bit error rate and IS estimation variances cannot be obtained readily using prior techniques.

  6. New bounds on neutrino electric millicharge from GEMMA experiment on neutrino magnetic moment

    CERN Document Server

    Brudanin, Victor B; Starostin, Alexander S; Studenikin, Alexander I

    2014-01-01

    Using the new limit on the neutrino anomalous magnetic moment recently obtained by GEMMA experiment we get an order-of-magnitude estimation for possible new direct upper bound on the neutrino electric millicharge $\\mid q_{\

  7. ROBUST DESIGN MODELS FOR CUSTOMER-SPECIFIED BOUNDS ON PROCESS PARAMETERS

    Institute of Scientific and Technical Information of China (English)

    Sangmun SHIN; Byung Rae CHO

    2006-01-01

    Robust design (RD) has received much attention from researchers and practitioners for years, and a number of methodologies have been studied in the research community. The majority of existing RD models focus on the minimum variability with a zero bias. However, it is often the case that the customer may specify upper bounds on one of the two process parameters (i.e., the process mean and variance). In this situation, the existing RD models may not work efficiently in incorporating the customer's needs. To this end, we propose two simple RD models using the ε-constraint feasible region method - one with an upper bound of process bias specified and the other with an upper bound on process variability specified. We then conduct a case study to analyze the effects of upper bounds on each of the process parameters in terms of optimal operating conditions and mean squarederror.

  8. Bounding the number of points on a curve using a generalization of Weierstrass semigroups

    DEFF Research Database (Denmark)

    Beelen, Peter; Ruano, Diego

    2011-01-01

    In [5] an upper bound for the number of points on an al- gebraic curve dened over a nite eld was derived. In this article we generalize their result by considering Weierstrass groups of several points simultaneously....

  9. Multi-Level Reduced Order Modeling Equipped with Probabilistic Error Bounds

    Science.gov (United States)

    Abdo, Mohammad Gamal Mohammad Mostafa

    This thesis develops robust reduced order modeling (ROM) techniques to achieve the needed efficiency to render feasible the use of high fidelity tools for routine engineering analyses. Markedly different from the state-of-the-art ROM techniques, our work focuses only on techniques which can quantify the credibility of the reduction which can be measured with the reduction errors upper-bounded for the envisaged range of ROM model application. Our objective is two-fold. First, further developments of ROM techniques are proposed when conventional ROM techniques are too taxing to be computationally practical. This is achieved via a multi-level ROM methodology designed to take advantage of the multi-scale modeling strategy typically employed for computationally taxing models such as those associated with the modeling of nuclear reactor behavior. Second, the discrepancies between the original model and ROM model predictions over the full range of model application conditions are upper-bounded in a probabilistic sense with high probability. ROM techniques may be classified into two broad categories: surrogate construction techniques and dimensionality reduction techniques, with the latter being the primary focus of this work. We focus on dimensionality reduction, because it offers a rigorous approach by which reduction errors can be quantified via upper-bounds that are met in a probabilistic sense. Surrogate techniques typically rely on fitting a parametric model form to the original model at a number of training points, with the residual of the fit taken as a measure of the prediction accuracy of the surrogate. This approach, however, does not generally guarantee that the surrogate model predictions at points not included in the training process will be bound by the error estimated from the fitting residual. Dimensionality reduction techniques however employ a different philosophy to render the reduction, wherein randomized snapshots of the model variables, such as the

  10. Tight Bounds for Distributed Functional Monitoring

    CERN Document Server

    Woodruff, David P

    2011-01-01

    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 output to a function $f$ computed over the union of the inputs. The goal is to minimize the communication. We show the randomized communication complexity of estimating the number of distinct elements up to a $1+\\eps$ factor is $\\Omega(k/\\eps^2)$, improving the previous $\\Omega(k + 1/\\eps^2)$ bound and matching known upper bounds. For the $p$-th frequency moment $F_p$, $p > 1$, we improve the previous $\\Omega(k + 1/\\eps^2)$ communication bound to $\\tilde{\\Omega}(k^{p-1}/\\eps^2)$. We obtain similar improvements for heavy hitters, empirical entropy, and other problems. We also show that we can estimate $F_p$, for any $p > 1$, using $\\tilde{O}(k^{p-1}\\poly(\\eps^{-1}))$ communication. This drastically improves upon the pre...

  11. Hybrid bounds for Dirichlet's L-function

    Science.gov (United States)

    Huxley, M. N.; Watt, N.

    2000-11-01

    This is a paper about upper bounds for Dirichlet's L-function, L(s, [chi]), on its critical line (s + s¯ = 1). It is to be assumed throughout that, unless otherwise stated, the Dirichlet character, [chi], is periodic modulo a prime, r, and is not the principal character mod r. Our main theorem below shows that, if [epsilon] > 0, thenformula here(where A is an absolute constant), for 0 < [alpha] = (log r)/(log t) [less-than-or-eq, slant] 2/753 [minus sign] [epsilon]. Somewhat weaker bounds are obtained for other cases where 0 < [alpha] [less-than-or-eq, slant] 11/180 [minus sign] [epsilon]. Note that in [13] it was shown that, for 0 < [alpha] [less-than-or-eq, slant] 2/57,formula hereOur main theorem is a corollary of the new bounds we prove for certain exponential sums, S, with a Dirichlet character factor:formula herewhere M2 [less-than-or-eq, slant] 2M and f(x) is a real function whose derivatives satisfy certain conditions restricting their size.

  12. Solving the minimum flow problem with interval bounds and flows

    Indian Academy of Sciences (India)

    Mehdi Ghiyasvand

    2012-12-01

    The minimum cost flow problem with interval data can be solved using two minimum cost flow problems with crisp data. In this paper, the idea of Ghiyasvand was extended for solving the minimum flow problem with interval-valued lower, upper bounds and flows. This problem can be solved using two minimum flow problems with crisp data. Then, this result is extended to networks with fuzzy lower, upper bounds and flows.

  13. On the nonlocal Fisher-KPP equation: steady states, spreading speed and global bounds

    Science.gov (United States)

    Hamel, François; Ryzhik, Lenya

    2014-11-01

    We consider the Fisher-KPP (for Kolmogorov-Petrovsky-Piskunov) equation with a nonlocal interaction term. We establish a condition on the interaction that allows for existence of non-constant periodic solutions, and prove uniform upper bounds for the solutions of the Cauchy problem, as well as upper and lower bounds on the spreading rate of the solutions with compactly supported initial data.

  14. The RHMC algorithm for theories with unknown spectral bounds

    CERN Document Server

    Kogut, J B

    2006-01-01

    The Rational Hybrid Monte Carlo (RHMC) algorithm extends the Hybrid Monte Carlo algorithm for lattice QCD simulations to situations involving fractional powers of the determinant of the quadratic Dirac operator. This avoids the updating increment ($dt$) dependence of observables which plagues the Hybrid Molecular-dynamics (HMD) method. The RHMC algorithm uses rational approximations to fractional powers of the quadratic Dirac operator. Such approximations are only available when positive upper and lower bounds to the operator's spectrum are known. We apply the RHMC algorithm to simulations of 2 theories for which a positive lower spectral bound is unknown: lattice QCD with staggered quarks at finite isospin chemical potential and lattice QCD with massless staggered quarks and chiral 4-fermion interactions ($\\chi$QCD). A choice of lower bound is made in each case, and the properties of the RHMC simulations these define are studied. Justification of our choices of lower bounds is made by comparing measurements ...

  15. On the Exponential Probability Bounds for the Bernoulli Random Variables

    CERN Document Server

    Nikulin, Vladimir

    2010-01-01

    We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha, beta}. In order to optimize the bound we are interested to minimize linear coefficient alpha and to maximize exponential coefficient beta. Generally, the value of linear coefficient alpha may not be smaller than one. The following 2 settings were proved: 1) {1, 2} in the case of classical discreet problem as it was formulated by Bernoulli in the 17th century, and 2) {1, 2/(1+epsilon^2)} in the general discreet case with arbitrary rational p and epsilon. The second setting represents a new structure of the exponential bound which may be extended to continuous case.

  16. Bounds on the Effect of Progressive Structural Degradation

    DEFF Research Database (Denmark)

    Achtziger, W.; Bendsøe, Martin P; Taylor, John E.

    1998-01-01

    Problem formulations are presented for the evaluation of upper and lower bounds on the effect of progressive structural degradation. For the purposes of this study, degradation effect is measured by an increase in global structural compliance (flexibility). Thus the slated bounds are given simply......, increasing values for the bound in this constraint track the evolution of local degradation. While the full exposition of the paper is written specifically for trussed structures, analogues for the more useful formulations are described as well for the treatment of continuum systems. Implementation...... of methods for computational solution are described in detail, and computational results are given for the bound solutions corresponding to evolution from a starting structure through to its fully degraded form. (C) 1998 Elsevier Science Ltd. All rights reserved....

  17. Capacity bounds for parallel IM-DD optical wireless channels

    KAUST Repository

    Chaaban, Anas

    2016-07-26

    A system consisting of parallel intensity-modulation direct-detection optical wireless channels with a total average intensity constraint is studied. Capacity upper and lower bounds for this system are derived. If channel-state information is available at the transmitter, the bounds have to be optimized with respect to intensity allocation over the parallel channels. The optimization of the lower bound is non-convex, however, the Karush-Kuhn-Tucker conditions can be used to find a list of possible solutions one of which is optimal. The optimal solution can then be found by an exhaustive search algorithm, which is computationally expensive. To overcome this, we propose a low-complexity intensity allocation algorithm which is nearly optimal. The optimized capacity lower bound coincides with the capacity at high signal-to-noise ratio. © 2016 IEEE.

  18. Vulnerable Derivatives and Good Deal Bounds: A Structural Model

    DEFF Research Database (Denmark)

    Murgoci, Agatha

    2013-01-01

    can be obtained. We provide a link between the objective probability measure and the range of potential risk-neutral measures, which has an intuitive economic meaning. We also provide tight pricing bounds for European calls and show how to extend the call formula to pricing other financial products......We price vulnerable derivatives -- i.e. derivatives where the counterparty may default. These are basically the derivatives traded on the over-the-counter (OTC) markets. Default is modeled in a structural framework. The technique employed for pricing is good deal bounds (GDBs). The method imposes...... a new restriction in the arbitrage free model by setting upper bounds on the Sharpe ratios (SRs) of the assets. The potential prices that are eliminated represent unreasonably good deals. The constraint on the SR translates into a constraint on the stochastic discount factor. Thus, tight pricing bounds...

  19. The Lower Bounds for Eigenvalues of Elliptic Operators --By Nonconforming Finite Element Methods

    CERN Document Server

    Hu, Jun; Lin, Qun

    2011-01-01

    Finding eigenvalues of partial differential operators is important in the mathematical science. Since the exact eigenvalues are almost impossible, many papers and books investigate their bounds from above and below. It is well known that the variational principle (including the conforming finite element methods) provides the upper bounds, while there are no general theories to provide the lower bounds. The aim of our paper is to introduce a new systematic method that can produce the lower bounds for eigenvalues. The main idea is to use the nonconforming finite element methods. However, the numerics from the literature demonstrate that some nonconforming elements produce upper bounds of eigenvalues though some other nonconforming elements yield lower bounds. The general herein conclusion is that if the local approximation property of the nonconforming finite element space $V_h$ is better than the global continuity property of $V_h$, the corresponding method of the eigenvalue problem will produce the lower boun...

  20. Differences in the Charge Distribution of Glycerol-Extracted Muscle Fibers in Rigor, Relaxation, and Contraction

    Science.gov (United States)

    Pemrick, Suzanne M.; Edwards, Charles

    1974-01-01

    Glycerol-extracted rabbit psoas muscle fibers were impaled with KCl-filled glass microelectrodes. For fibers at rest-length, the potentials were significantly more negative in solutions producing relaxation than in solutions producing either rigor or contraction; further the potentials in the latter two cases were not significantly different. For stretched fibers, with no overlap between thick and thin filaments, the potentials did not differ in the rigor, the relaxation, or the contraction solutions. The potentials measured from fibers in rigor did not vary significantly with the sarcomere length. For relaxed fibers, however, the potential magnitude decreased with increasing sarcomere length. The difference between the potentials measured for rigor and relaxed fibers exhibited a nonlinear relationship with sarcomere length. The potentials from calcium-insensitive fibers were less negative in both the rigor and the relaxation solutions than those from normal fibers. When calcium-insensitive fibers had been incubated in Hasselbach and Schneider's solution plus MgCl2 or Guba-Straub's solution plus MgATP the potentials recorded upon impalement were similar in the rigor and the relaxation solution to those obtained from normal fibers in the relaxed state. It is concluded that the increase in the negative potential as the glycerinated fiber goes from rigor to relaxation may be due to an alteration in the conformation of the contractile proteins in the relaxed state. PMID:4443791

  1. Bounds on the number of vertex independent sets in a graph

    DEFF Research Database (Denmark)

    Vestergaard, Preben D.; Pedersen, Anders Sune

    2006-01-01

    We consider the number of vertex independent sets i(G)In general, the problem of determining the value of i(G) is NP-complete. We present several upper and lower bounds for i(G) in terms of order, size or independence number. We obtain improved bounds for i(G) on restricted graph classes...

  2. Bounds for right tails of deterministic and stochastic sums of random variables

    NARCIS (Netherlands)

    G. Darkiewicz; G. Deelstra; J. Dhaene; T. Hoedemakers; M. Vanmaele

    2009-01-01

    We investigate lower and upper bounds for right tails (stop-loss premiums) of deterministic and stochastic sums of nonindependent random variables. The bounds are derived using the concepts of comonotonicity, convex order, and conditioning. The performance of the presented approximations is investig

  3. A semidefinite programming based branch-and-bound framework for the quadratic assignment problem

    NARCIS (Netherlands)

    Truetsch, U.

    2014-01-01

    The practical approach to calculate an exact solution for a quadratic assignment problem (QAP) via a branch-and-bound framework depends strongly on a "smart" choice of different strategies within the framework, for example the branching strategy, heuristics for the upper bound or relaxations for the

  4. Matrix Bounds for the Solution of the Continuous Algebraic Riccati Equation

    Directory of Open Access Journals (Sweden)

    Juan Zhang

    2010-01-01

    Full Text Available We propose new upper and lower matrix bounds for the solution of the continuous algebraic Riccati equation (CARE. In certain cases, these lower bounds improve and extend the previous results. Finally, we give a corresponding numerical example to illustrate the effectiveness of our results.

  5. Combinatorial bounds on the α-divergence of univariate mixture models

    KAUST Repository

    Nielsen, Frank

    2017-06-20

    We derive lower- and upper-bounds of α-divergence between univariate mixture models with components in the exponential family. Three pairs of bounds are presented in order with increasing quality and increasing computational cost. They are verified empirically through simulated Gaussian mixture models. The presented methodology generalizes to other divergence families relying on Hellinger-type integrals.

  6. Bounding approaches to system identification

    CERN Document Server

    Norton, John; Piet-Lahanier, Hélène; Walter, Éric

    1996-01-01

    In response to the growing interest in bounding error approaches, the editors of this volume offer the first collection of papers to describe advances in techniques and applications of bounding of the parameters, or state variables, of uncertain dynamical systems. Contributors explore the application of the bounding approach as an alternative to the probabilistic analysis of such systems, relating its importance to robust control-system design.

  7. On functions of bounded variation

    OpenAIRE

    Aistleitner, Christoph; Pausinger, Florian; Svane, Anne Marie; Tichy, Robert F.

    2015-01-01

    The recently introduced concept of $\\mathcal{D}$-variation unifies previous concepts of variation of multivariate functions. In this paper, we give an affirmative answer to the open question from Pausinger \\& Svane (J. Complexity, 2014) whether every function of bounded Hardy--Krause variation is Borel measurable and has bounded $\\mathcal{D}$-variation. Moreover, we show that the space of functions of bounded $\\mathcal{D}$-variation can be turned into a commutative Banach algebra.

  8. On the realization of the bulk modulus bounds for two-phase viscoelastic composites

    DEFF Research Database (Denmark)

    Andreasen, Casper Schousboe; Andreassen, Erik; Jensen, Jakob Søndergaard;

    2014-01-01

    Materials with good vibration damping properties and high stiffness are of great industrial interest. In this paper the bounds for viscoelastic composites are investigated and material microstructures that realize the upper bound are obtained by topology optimization. These viscoelastic composite...... damping. In order to ensure manufacturability of such composites the connectivity of the matrix is ensured by imposing a conductivity constraint and the influence on the bounds is discussed. © 2013 Elsevier Ltd. All rights reserved....

  9. Capacity bounds for kth best path selection over generalized fading channels

    KAUST Repository

    Hanif, Muhammad Fainan

    2014-02-01

    Exact ergodic capacity calculation for fading wireless channels typically involves time-consuming numerical evaluation of infinite integrals. In this paper, lower and upper bounds on ergodic capacity for kth best path are presented. These bounds have simple analytic expressions which allow their fast evaluation. Numerical results show that the newly proposed bounds closely approximate the exact ergodic capacity for a large variety of system configurations. © 1997-2012 IEEE.

  10. A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

    CERN Document Server

    Nguyen, Khoa D; Rasmussen, Lars K

    2007-01-01

    In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.

  11. Disciplining bioethics: towards a standard of methodological rigor in bioethics research.

    Science.gov (United States)

    Adler, Daniel; Zlotnik Shaul, Randi

    2012-05-01

    Contemporary bioethics research is often described as multi- or interdisciplinary. Disciplines are characterized, in part, by their methods. Thus, when bioethics research draws on a variety of methods, it crosses disciplinary boundaries. Yet each discipline has its own standard of rigor--so when multiple disciplinary perspectives are considered, what constitutes rigor? This question has received inadequate attention, as there is considerable disagreement regarding the disciplinary status of bioethics. This disagreement has presented five challenges to bioethics research. Addressing them requires consideration of the main types of cross-disciplinary research, and consideration of proposals aiming to ensure rigor in bioethics research.

  12. The lower bound on independence number

    Institute of Scientific and Technical Information of China (English)

    LI; Yusheng

    2002-01-01

    [1]Caro, Y., New Results on the Independence Number, Technical Report, Tel_Aviv: Tel_Aviv University, 1979.[2]Wei, V., A lower bound on the stability number of a simple graph, Bell Laboratories Technical Memorandum, 1981, 81_11217_11219.\\}[3]Alon, N., Spencer, J., The Probabilistic Method, New York: Wiley_Interscience, 1992.[4]Ajtai, M., Komls, J., Szemerédi E., A note on Ramsey numbers, J. Combin. Theory, Ser. A, 1980, 29: 354-360.[5]Shearer, J., A note on the independence number of triangle_free graphs, Discrete Math., 1983, 46: 83-87.[6]Kim, J., The Ramsey number R(3,t)has order of magnitude t\\+2/logt, Random Structures Algorithms, 1995, 7: 174-207.[7]Tardos, E., 1997 Fulkerson Prize, Notices of American Math. Soc., 1998, 45(8): 984.[8]Griggs, J., Lower bounds on the independence number in term of the degrees, J. Combin. Theory, Ser. B, 1983, 34: 22-29.[9]Li, Y., Rousseau, C., Fan_complete graph Ramsey numbers, J. Graph Theory, 1996, 23: 413-420.[10]Shearer, J., A note on the independence number of triangle_free graphs, II, J. Combin. Theory, Ser. B, 1991, 53: 300-307.[11]Li, Y., Rousseau, C., On book_complete Ramsey numbers, J. Combin. Theory, Ser. B, 1996, 68: 36-44.[12]Li, Y., Rousseau, C., Zang, W., Asymptotic upper bounds for Ramsey functions, Graphs Combin., 2001, 17: 123-128.[13]Caro, Y., Li, Y., Rousseau, C. et al., Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers, Discrete Math., 2000, 220: 51-56.

  13. Metastability of Bose and Fermi gases on the upper branch

    Science.gov (United States)

    LeClair, André; Roditi, Itzhak; Squires, Joshua

    2016-12-01

    We study three-dimensional Bose and Fermi gases in the upper branch, a phase defined by the absence of bound states in the repulsive interaction regime, within an approximation that considers only two-body interactions. Employing a formalism based on the S matrix, we derive useful analytic expressions that hold on the upper branch in the weak coupling limit. We determine upper branch phase diagrams for both bosons and fermions with techniques valid for arbitrary positive scattering length.

  14. Improving the Rigor of Quasi-Experimental Impact Evaluations: Lessons for Teen Pregnancy Prevention Researchers

    OpenAIRE

    Brian Goesling; Joanne Lee

    2015-01-01

    This research brief highlights three ways to improve the rigor of quasi-experimental impact evaluations of social and public health interventions, focusing specifically on evaluations of teen pregnancy prevention programs.

  15. Guest Editorial. Educational Research as Disciplined Inquiry: Examining the Facets of Rigor in Our Work.

    Science.gov (United States)

    Munby, Hugh

    2003-01-01

    Discusses reliability, validity, and rigor in qualitative educational research and the need for replacing validity and reliability with a concept that values human affairs as the purpose of research. (Contains 28 references.) (YDS)

  16. Conceptualizing rigor and its implications for education in the era of the Common Core

    Directory of Open Access Journals (Sweden)

    David D. Paige

    2015-12-01

    Full Text Available The adoption of Common Core State Standards in the USA by 46 states and the District of Columbia has provided several new foci for K-12 instruction, not the least of which is the reading and understanding of complex text, a higher order thinking process. Closely associated with this is the notion of rigor, the focus of the present study. As educators who work with administrators and teachers across the country, we have noticed that while there exists a general concern about rigor, there is not a coherent understanding of what it is. As such, there is a need to establish a common understanding of rigor that is useful for school-based personnel. Additionally, we propose that it’s important for educators to regularly measure and track rigor as one part of a larger dashboard of quality indicators which can inform school leaders on the educational health of their school.

  17. Rigorous results for the one-dimensional Fermi liquid at zero temperature

    Energy Technology Data Exchange (ETDEWEB)

    Procacci, Aldo [Minas Gerais Univ., Belo Horizonte, MG (Brazil). Dept. de Matematica

    1994-12-31

    Some of the most important aspects for a rigorous discussion of analyticity properties of Schwinger functions for the ground state theory of a many-fermion system in one dimension are presented. (author). 9 refs.

  18. A Lower Bound on Concurrence

    Institute of Scientific and Technical Information of China (English)

    LIU Li-Guo; TIAN Cheng-Lin; CHEN Ping-Xing; YUAN Nai-Chang

    2009-01-01

    We derive an analytical lower bound on the concurrence for bipartite quantum systems with an improved computable cross norm or realignment criterion and an improved positive partial transpose criterion respectively.Furthermore we demonstrate that our bound is better than that obtained from the local uncertainty relations criterion with optimal local orthogonal observables which is known as one of the best estimations of concurrence.

  19. Anaphoric Pronouns and Bound Variables

    Science.gov (United States)

    Wasow, Thomas

    1975-01-01

    Deals with certain problems inherent in deriving anaphoric pronouns from bound variables. Syntactic rules applied to determine anaphora relations cannot be applied if anaphoric pronouns and their antecedents have identical underlying forms. An approach to anaphora which preserves some advantages of the bound-variable theory without the problems is…

  20. Market Access through Bound Tariffs

    DEFF Research Database (Denmark)

    Sala, Davide; Schröder, Philipp J.H.; Yalcin, Erdal

    on the risk that exporters face in destination markets. The present paper formalizes the underlying interaction of risk, fixed export costs and firms' market entry decisions based on techniques known from the real options literature; doing so we highlight the important role of bound tariffs at the extensive......WTO negotiations deal predominantly with bound - besides applied - tariff rates. But, how can reductions in tariffs ceilings, i.e. tariff rates that no exporter may ever actually be confronted with, generate market access? The answer to this question relates to the effects of tariff bindings...... margin of trade. We find that bound tariffs are more effective with higher risk destination markets, that a large binding overhang may still command substantial market access, and that reductions in bound tariffs generate effective market access even when bound rates are above current and long...