Perturbative unitarity constraints on gauge portals

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

El Hedri, Sonia; Shepherd, William; Walker, Devin G. E.

Dark matter that was once in thermal equilibrium with the Standard Model is generally prohibited from obtaining all of its mass from the electroweak phase transition. This implies a new scale of physics and mediator particles to facilitate dark matter annihilation. In this work, we focus on dark matter that annihilates through a generic gauge boson portal. We show how partial wave unitarity places upper bounds on the dark gauge boson, dark Higgs and dark matter masses. Outside of well-defined fine-tuned regions, we find an upper bound of 9 TeV for the dark matter mass when the dark Higgs andmore » dark gauge bosons both facilitate the dark matter annihilations. In this scenario, the upper bound on the dark Higgs and dark gauge boson masses are 10 TeV and 16 TeV, respectively. When only the dark gauge boson facilitates dark matter annihilations, we find an upper bound of 3 TeV and 6 TeV for the dark matter and dark gauge boson, respectively. Overall, using the gauge portal as a template, we describe a method to not only place upper bounds on the dark matter mass but also on the new particles with Standard Model quantum numbers. Here, we briefly discuss the reach of future accelerator, direct and indirect detection experiments for this class of models.« less

Spread of entanglement and causality

NASA Astrophysics Data System (ADS)

Casini, Horacio; Liu, Hong; Mezei, Márk

2016-07-01

We investigate causality constraints on the time evolution of entanglement entropy after a global quench in relativistic theories. We first provide a general proof that the so-called tsunami velocity is bounded by the speed of light. We then generalize the free particle streaming model of [1] to general dimensions and to an arbitrary entanglement pattern of the initial state. In more than two spacetime dimensions the spread of entanglement in these models is highly sensitive to the initial entanglement pattern, but we are able to prove an upper bound on the normalized rate of growth of entanglement entropy, and hence the tsunami velocity. The bound is smaller than what one gets for quenches in holographic theories, which highlights the importance of interactions in the spread of entanglement in many-body systems. We propose an interacting model which we believe provides an upper bound on the spread of entanglement for interacting relativistic theories. In two spacetime dimensions with multiple intervals, this model and its variations are able to reproduce intricate results exhibited by holographic theories for a significant part of the parameter space. For higher dimensions, the model bounds the tsunami velocity at the speed of light. Finally, we construct a geometric model for entanglement propagation based on a tensor network construction for global quenches.

Differential Games of inf-sup Type and Isaacs Equations

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

Kaise, Hidehiro; Sheu, S.-J.

2005-06-15

Motivated by the work of Fleming, we provide a general framework to associate inf-sup type values with the Isaacs equations.We show that upper and lower bounds for the generators of inf-sup type are upper and lower Hamiltonians, respectively. In particular, the lower (resp. upper) bound corresponds to the progressive (resp. strictly progressive) strategy. By the Dynamic Programming Principle and identification of the generator, we can prove that the inf-sup type game is characterized as the unique viscosity solution of the Isaacs equation. We also discuss the Isaacs equation with a Hamiltonian of a convex combination between the lower and uppermore » Hamiltonians.« less

Statistical thermodynamics foundation for photovoltaic and photothermal conversion. II. Application to photovoltaic conversion

NASA Astrophysics Data System (ADS)

Badescu, Viorel; Landsberg, Peter T.

1995-08-01

The general theory developed in part I was applied to build up two models of photovoltaic conversion. To this end two different systems were analyzed. The first system consists of the whole absorber (converter), for which the balance equations for energy and entropy are written and then used to derive an upper bound for solar energy conversion. The second system covers a part of the absorber (converter), namely the valence and conduction electronic bands. The balance of energy is used in this case to derive, under additional assumptions, another upper limit for the conversion efficiency. This second system deals with the real location where the power is generated. Both models take into consideration the radiation polarization and reflection, and the effects of concentration. The second model yields a more accurate upper bound for the conversion efficiency. A generalized solar cell equation is derived. It is proved that other previous theories are particular cases of the present more general formalism.

Constraining the generalized uncertainty principle with the atomic weak-equivalence-principle test

NASA Astrophysics Data System (ADS)

Gao, Dongfeng; Wang, Jin; Zhan, Mingsheng

2017-04-01

Various models of quantum gravity imply the Planck-scale modifications of Heisenberg's uncertainty principle into a so-called generalized uncertainty principle (GUP). The GUP effects on high-energy physics, cosmology, and astrophysics have been extensively studied. Here, we focus on the weak-equivalence-principle (WEP) violation induced by the GUP. Results from the WEP test with the 85Rb-87Rb dual-species atom interferometer are used to set upper bounds on parameters in two GUP proposals. A 1045-level bound on the Kempf-Mangano-Mann proposal and a 1027-level bound on Maggiore's proposal, which are consistent with bounds from other experiments, are obtained. All these bounds have huge room for improvement in the future.

Upper bounds on quantum uncertainty products and complexity measures

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

Guerrero, Angel; Sanchez-Moreno, Pablo; Dehesa, Jesus S.

The position-momentum Shannon and Renyi uncertainty products of general quantum systems are shown to be bounded not only from below (through the known uncertainty relations), but also from above in terms of the Heisenberg-Kennard product . Moreover, the Cramer-Rao, Fisher-Shannon, and Lopez-Ruiz, Mancini, and Calbet shape measures of complexity (whose lower bounds have been recently found) are also bounded from above. The improvement of these bounds for systems subject to spherically symmetric potentials is also explicitly given. Finally, applications to hydrogenic and oscillator-like systems are done.

Performance analysis for minimally nonlinear irreversible refrigerators at finite cooling power

NASA Astrophysics Data System (ADS)

Long, Rui; Liu, Zhichun; Liu, Wei

2018-04-01

The coefficient of performance (COP) for general refrigerators at finite cooling power have been systematically researched through the minimally nonlinear irreversible model, and its lower and upper bounds in different operating regions have been proposed. Under the tight coupling conditions, we have calculated the universal COP bounds under the χ figure of merit in different operating regions. When the refrigerator operates in the region with lower external flux, we obtained the general bounds (0 < ε <(√{ 9 + 8εC } - 3) / 2) under the χ figure of merit. We have also calculated the universal bounds for maximum gain in COP under different operating regions to give a further insight into the COP gain with the cooling power away from the maximum one. When the refrigerator operates in the region located between maximum cooling power and maximum COP with lower external flux, the upper bound for COP and the lower bound for relative gain in COP present large values, compared to a relative small loss from the maximum cooling power. If the cooling power is the main objective, it is desirable to operate the refrigerator at a slightly lower cooling power than at the maximum one, where a small loss in the cooling power induces a much larger COP enhancement.

Bounds and inequalities relating h-index, g-index, e-index and generalized impact factor: an improvement over existing models.

PubMed

Abbas, Ash Mohammad

2012-01-01

In this paper, we describe some bounds and inequalities relating h-index, g-index, e-index, and generalized impact factor. We derive the bounds and inequalities relating these indexing parameters from their basic definitions and without assuming any continuous model to be followed by any of them. We verify the theorems using citation data for five Price Medalists. We observe that the lower bound for h-index given by Theorem 2, [formula: see text], g ≥ 1, comes out to be more accurate as compared to Schubert-Glanzel relation h is proportional to C(2/3)P(-1/3) for a proportionality constant of 1, where C is the number of citations and P is the number of papers referenced. Also, the values of h-index obtained using Theorem 2 outperform those obtained using Egghe-Liang-Rousseau power law model for the given citation data of Price Medalists. Further, we computed the values of upper bound on g-index given by Theorem 3, g ≤ (h + e), where e denotes the value of e-index. We observe that the upper bound on g-index given by Theorem 3 is reasonably tight for the given citation record of Price Medalists.

Sublinear Upper Bounds for Stochastic Programs with Recourse. Revision.

DTIC Science & Technology

1987-06-01

approximation procedures for (1.1) generally rely on discretizations of E (Huang, Ziemba , and Ben-Tal (1977), Kall and Stoyan (1982), Birge and Wets...Wright, Practical optimization (Academic Press, London and New York,1981). C.C. Huang, W. Ziemba , and A. Ben-Tal, "Bounds on the expectation of a con

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

Zachos, C. K.; High Energy Physics

Following ref [1], a classical upper bound for quantum entropy is identified and illustrated, 0 {le} S{sub q} {le} ln (e{sigma}{sup 2}/2{h_bar}), involving the variance {sigma}{sup 2} in phase space of the classical limit distribution of a given system. A fortiori, this further bounds the corresponding information-theoretical generalizations of the quantum entropy proposed by Renyi.

Multi-soliton interaction of a generalized Schrödinger-Boussinesq system in a magnetized plasma

NASA Astrophysics Data System (ADS)

Zhao, Xue-Hui; Tian, Bo; Chai, Jun; Wu, Xiao-Yu; Guo, Yong-Jiang

2017-04-01

Under investigation in this paper is a generalized Schrödinger-Boussinesq system, which describes the stationary propagation of coupled upper-hybrid waves and magnetoacoustic waves in a magnetized plasma. Bilinear forms, one-, two- and three-soliton solutions are derived by virtue of the Hirota method and symbolic computation. Propagation and interaction for the solitons are illustrated graphically: Coefficients β1^{} and β2^{} can affect the velocities and propagation directions of the solitary waves. Amplitude, velocity and shape of the one solitary wave keep invariant during the propagation, implying that the transport of the energy is stable in the upper-hybrid and magnetoacoustic waves, and amplitude of the upper-hybrid wave is bigger than that of the magnetoacoustic wave. For the upper-hybrid and magnetoacoustic waves, head-on, overtaking and bound-state interaction between the two solitary waves are asymptotically depicted, respectively, indicating that the interaction between the two solitary waves is elastic. Elastic interaction between the bound-state soliton and a single one soliton is also displayed, and interaction among the three solitary waves is all elastic.

A note on the upper bound of the spectral radius for SOR iteration matrix

NASA Astrophysics Data System (ADS)

Chang, D.-W. Da-Wei

2004-05-01

Recently, Wang and Huang (J. Comput. Appl. Math. 135 (2001) 325, Corollary 4.7) established the following estimation on the upper bound of the spectral radius for successive overrelaxation (SOR) iteration matrix:ρSOR≤1-ω+ωρGSunder the condition that the coefficient matrix A is a nonsingular M-matrix and ω≥1, where ρSOR and ρGS are the spectral radius of SOR iteration matrix and Gauss-Seidel iteration matrix, respectively. In this note, we would like to point out that the above estimation is not valid in general.

On the validity of the Arrhenius equation for electron attachment rate coefficients.

PubMed

Fabrikant, Ilya I; Hotop, Hartmut

2008-03-28

The validity of the Arrhenius equation for dissociative electron attachment rate coefficients is investigated. A general analysis allows us to obtain estimates of the upper temperature bound for the range of validity of the Arrhenius equation in the endothermic case and both lower and upper bounds in the exothermic case with a reaction barrier. The results of the general discussion are illustrated by numerical examples whereby the rate coefficient, as a function of temperature for dissociative electron attachment, is calculated using the resonance R-matrix theory. In the endothermic case, the activation energy in the Arrhenius equation is close to the threshold energy, whereas in the case of exothermic reactions with an intermediate barrier, the activation energy is found to be substantially lower than the barrier height.

Nonlinear recurrent neural networks for finite-time solution of general time-varying linear matrix equations.

PubMed

Xiao, Lin; Liao, Bolin; Li, Shuai; Chen, Ke

2018-02-01

In order to solve general time-varying linear matrix equations (LMEs) more efficiently, this paper proposes two nonlinear recurrent neural networks based on two nonlinear activation functions. According to Lyapunov theory, such two nonlinear recurrent neural networks are proved to be convergent within finite-time. Besides, by solving differential equation, the upper bounds of the finite convergence time are determined analytically. Compared with existing recurrent neural networks, the proposed two nonlinear recurrent neural networks have a better convergence property (i.e., the upper bound is lower), and thus the accurate solutions of general time-varying LMEs can be obtained with less time. At last, various different situations have been considered by setting different coefficient matrices of general time-varying LMEs and a great variety of computer simulations (including the application to robot manipulators) have been conducted to validate the better finite-time convergence of the proposed two nonlinear recurrent neural networks. Copyright © 2017 Elsevier Ltd. All rights reserved.

Divergences and estimating tight bounds on Bayes error with applications to multivariate Gaussian copula and latent Gaussian copula

NASA Astrophysics Data System (ADS)

Thelen, Brian J.; Xique, Ismael J.; Burns, Joseph W.; Goley, G. Steven; Nolan, Adam R.; Benson, Jonathan W.

2017-04-01

In Bayesian decision theory, there has been a great amount of research into theoretical frameworks and information- theoretic quantities that can be used to provide lower and upper bounds for the Bayes error. These include well-known bounds such as Chernoff, Battacharrya, and J-divergence. Part of the challenge of utilizing these various metrics in practice is (i) whether they are "loose" or "tight" bounds, (ii) how they might be estimated via either parametric or non-parametric methods, and (iii) how accurate the estimates are for limited amounts of data. In general what is desired is a methodology for generating relatively tight lower and upper bounds, and then an approach to estimate these bounds efficiently from data. In this paper, we explore the so-called triangle divergence which has been around for a while, but was recently made more prominent in some recent research on non-parametric estimation of information metrics. Part of this work is motivated by applications for quantifying fundamental information content in SAR/LIDAR data, and to help in this, we have developed a flexible multivariate modeling framework based on multivariate Gaussian copula models which can be combined with the triangle divergence framework to quantify this information, and provide approximate bounds on Bayes error. In this paper we present an overview of the bounds, including those based on triangle divergence and verify that under a number of multivariate models, the upper and lower bounds derived from triangle divergence are significantly tighter than the other common bounds, and often times, dramatically so. We also propose some simple but effective means for computing the triangle divergence using Monte Carlo methods, and then discuss estimation of the triangle divergence from empirical data based on Gaussian Copula models.

A linear programming approach to max-sum problem: a review.

PubMed

Werner, Tomás

2007-07-01

The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.

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

PubMed

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.

A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels

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

Gurvitis, Leonid

2009-01-01

An upper bound on the ergodic capacity of MIMO channels was introduced recently in [1]. This upper bound amounts to the maximization on the simplex of some multilinear polynomial p({lambda}{sub 1}, ..., {lambda}{sub n}) with non-negative coefficients. In general, such maximizations problems are NP-HARD. But if say, the functional log(p) is concave on the simplex and can be efficiently evaluated, then the maximization can also be done efficiently. Such log-concavity was conjectured in [1]. We give in this paper self-contained proof of the conjecture, based on the theory of H-Stable polynomials.

Modeling of magnitude distributions by the generalized truncated exponential distribution

NASA Astrophysics Data System (ADS)

Raschke, Mathias

2015-01-01

The probability distribution of the magnitude can be modeled by an exponential distribution according to the Gutenberg-Richter relation. Two alternatives are the truncated exponential distribution (TED) and the cutoff exponential distribution (CED). The TED is frequently used in seismic hazard analysis although it has a weak point: when two TEDs with equal parameters except the upper bound magnitude are mixed, then the resulting distribution is not a TED. Inversely, it is also not possible to split a TED of a seismic region into TEDs of subregions with equal parameters except the upper bound magnitude. This weakness is a principal problem as seismic regions are constructed scientific objects and not natural units. We overcome it by the generalization of the abovementioned exponential distributions: the generalized truncated exponential distribution (GTED). Therein, identical exponential distributions are mixed by the probability distribution of the correct cutoff points. This distribution model is flexible in the vicinity of the upper bound magnitude and is equal to the exponential distribution for smaller magnitudes. Additionally, the exponential distributions TED and CED are special cases of the GTED. We discuss the possible ways of estimating its parameters and introduce the normalized spacing for this purpose. Furthermore, we present methods for geographic aggregation and differentiation of the GTED and demonstrate the potential and universality of our simple approach by applying it to empirical data. The considerable improvement by the GTED in contrast to the TED is indicated by a large difference between the corresponding values of the Akaike information criterion.

A simple method for assessing occupational exposure via the one-way random effects model.

PubMed

Krishnamoorthy, K; Mathew, Thomas; Peng, Jie

2016-11-01

A one-way random effects model is postulated for the log-transformed shift-long personal exposure measurements, where the random effect in the model represents an effect due to the worker. Simple closed-form confidence intervals are proposed for the relevant parameters of interest using the method of variance estimates recovery (MOVER). The performance of the confidence bounds is evaluated and compared with those based on the generalized confidence interval approach. Comparison studies indicate that the proposed MOVER confidence bounds are better than the generalized confidence bounds for the overall mean exposure and an upper percentile of the exposure distribution. The proposed methods are illustrated using a few examples involving industrial hygiene data.

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games

NASA Astrophysics Data System (ADS)

Bilò, Vittorio; Caragiannis, Ioannis; Fanelli, Angelo; Monaco, Gianpiero

Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda. Even though the generalization of such games in directed networks is well understood in terms of the price of stability (it is exactly H n , the n-th harmonic number, for games with n players), far less is known for network design games in undirected networks. The upper bound carries over to this case as well while the best known lower bound is 42/23 ≈ 1.826. For more restricted but interesting variants of such games such as broadcast and multicast games, sublogarithmic upper bounds are known while the best known lower bound is 12/7 ≈ 1.714. In the current paper, we improve the lower bounds as follows. We break the psychological barrier of 2 by showing that the price of stability of undirected network design games is at least 348/155 ≈ 2.245. Our proof uses a recursive construction of a network design game with a simple gadget as the main building block. For broadcast and multicast games, we present new lower bounds of 20/11 ≈ 1.818 and 1.862, respectively.

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

PubMed

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

Upper and lower bounds for the speed of pulled fronts with a cut-off

NASA Astrophysics Data System (ADS)

Benguria, R. D.; Depassier, M. C.; Loss, M.

2008-02-01

We establish rigorous upper and lower bounds for the speed of pulled fronts with a cut-off. For all reaction terms of KPP type a simple analytic upper bound is given. The lower bounds however depend on details of the reaction term. For a small cut-off parameter the two leading order terms in the asymptotic expansion of the upper and lower bounds coincide and correspond to the Brunet-Derrida formula. For large cut-off parameters the bounds do not coincide and permit a simple estimation of the speed of the front.

On the error probability of general tree and trellis codes with applications to sequential decoding

NASA Technical Reports Server (NTRS)

Johannesson, R.

1973-01-01

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Efficient Regressions via Optimally Combining Quantile Information*

PubMed Central

Zhao, Zhibiao; Xiao, Zhijie

2014-01-01

We develop a generally applicable framework for constructing efficient estimators of regression models via quantile regressions. The proposed method is based on optimally combining information over multiple quantiles and can be applied to a broad range of parametric and nonparametric settings. When combining information over a fixed number of quantiles, we derive an upper bound on the distance between the efficiency of the proposed estimator and the Fisher information. As the number of quantiles increases, this upper bound decreases and the asymptotic variance of the proposed estimator approaches the Cramér-Rao lower bound under appropriate conditions. In the case of non-regular statistical estimation, the proposed estimator leads to super-efficient estimation. We illustrate the proposed method for several widely used regression models. Both asymptotic theory and Monte Carlo experiments show the superior performance over existing methods. PMID:25484481

Jarzynski equality: connections to thermodynamics and the second law.

PubMed

Palmieri, Benoit; Ronis, David

2007-01-01

The one-dimensional expanding ideal gas model is used to compute the exact nonequilibrium distribution function. The state of the system during the expansion is defined in terms of local thermodynamics quantities. The final equilibrium free energy, obtained a long time after the expansion, is compared against the free energy that appears in the Jarzynski equality. Within this model, where the Jarzynski equality holds rigorously, the free energy change that appears in the equality does not equal the actual free energy change of the system at any time of the process. More generally, the work bound that is obtained from the Jarzynski equality is an upper bound to the upper bound that is obtained from the first and second laws of thermodynamics. The cancellation of the dissipative (nonequilibrium) terms that result in the Jarzynski equality is shown in the framework of response theory. This is used to show that the intuitive assumption that the Jarzynski work bound becomes equal to the average work done when the system evolves quasistatically is incorrect under some conditions.

``Carbon Credits'' for Resource-Bounded Computations Using Amortised Analysis

NASA Astrophysics Data System (ADS)

Jost, Steffen; Loidl, Hans-Wolfgang; Hammond, Kevin; Scaife, Norman; Hofmann, Martin

Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic static type-based analysis for inferring upper bounds on resource usage for programs involving general algebraic datatypes and full recursion. Our method can easily be used to bound any countable resource, without needing to revisit proofs. We apply the analysis to the important metrics of worst-case execution time, stack- and heap-space usage. Our results from several realistic embedded control applications demonstrate good matches between our inferred bounds and measured worst-case costs for heap and stack usage. For time usage we infer good bounds for one application. Where we obtain less tight bounds, this is due to the use of software floating-point libraries.

Quantum Dynamical Applications of Salem's Theorem

NASA Astrophysics Data System (ADS)

Damanik, David; Del Rio, Rafael

2009-07-01

We consider the survival probability of a state that evolves according to the Schrödinger dynamics generated by a self-adjoint operator H. We deduce from a classical result of Salem that upper bounds for the Hausdorff dimension of a set supporting the spectral measure associated with the initial state imply lower bounds on a subsequence of time scales for the survival probability. This general phenomenon is illustrated with applications to the Fibonacci operator and the critical almost Mathieu operator. In particular, this gives the first quantitative dynamical bound for the critical almost Mathieu operator.

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

NASA Technical Reports Server (NTRS)

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 energy consumption for each bytecode instruction is measured is beyond the scope of this paper. Instead, this paper is about how to infer safe energy consumption estimations assuming that those energy consumption costs are provided. For concreteness, we use a simplified version of an existing resource model [1] in which an energy consumption cost for individual Java opcodes is defined.

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

NASA Technical Reports Server (NTRS)

Mceliece, R. J.; Rodemich, E. R.; Rumsey, H., Jr.; Welch, L. R.

1977-01-01

An upper bound on the rate of a binary code as a function of minimum code distance (using a Hamming code metric) is arrived at from Delsarte-MacWilliams inequalities. The upper bound so found is asymptotically less than Levenshtein's bound, and a fortiori less than Elias' bound. Appendices review properties of Krawtchouk polynomials and Q-polynomials utilized in the rigorous proofs.

Constructions for finite-state codes

NASA Technical Reports Server (NTRS)

Pollara, F.; Mceliece, R. J.; Abdel-Ghaffar, K.

1987-01-01

A class of codes called finite-state (FS) codes is defined and investigated. These codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived from known upper bounds on the minimum distance of block codes. A general construction for FS codes is then given, based on the idea of partitioning a given linear block into cosets of one of its subcodes, and it is shown that in many cases the FS codes constructed in this way have a d sub free which is as large as possible. These codes are found without the need for lengthy computer searches, and have potential applications for future deep-space coding systems. The issue of catastropic error propagation (CEP) for FS codes is also investigated.

More on the decoder error probability for Reed-Solomon codes

NASA Technical Reports Server (NTRS)

Cheung, K.-M.

1987-01-01

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occurs. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub e (u) for the (255, 223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

Expected performance of m-solution backtracking

NASA Technical Reports Server (NTRS)

Nicol, D. M.

1986-01-01

This paper derives upper bounds on the expected number of search tree nodes visited during an m-solution backtracking search, a search which terminates after some preselected number m problem solutions are found. The search behavior is assumed to have a general probabilistic structure. The results are stated in terms of node expansion and contraction. A visited search tree node is said to be expanding if the mean number of its children visited by the search exceeds 1 and is contracting otherwise. It is shown that if every node expands, or if every node contracts, then the number of search tree nodes visited by a search has an upper bound which is linear in the depth of the tree, in the mean number of children a node has, and in the number of solutions sought. Also derived are bounds linear in the depth of the tree in some situations where an upper portion of the tree contracts (expands), while the lower portion expands (contracts). While previous analyses of 1-solution backtracking have concluded that the expected performance is always linear in the tree depth, the model allows superlinear expected performance.

The upper bounds of reduced axial and shear moduli in cross-ply laminates with matrix cracks

NASA Technical Reports Server (NTRS)

Lee, Jong-Won; Allen, D. H.; Harris, C. E.

1991-01-01

The present study proposes a mathematical model utilizing the internal state variable concept for predicting the upper bounds of the reduced axial and shear stiffnesses in cross-ply laminates with matrix cracks. The displacement components at the matrix crack surfaces are explicitly expressed in terms of the observable axial and shear strains and the undamaged material properties. The reduced axial and shear stiffnesses are predicted for glass/epoxy and graphite/epoxy laminates. Comparison of the model with other theoretical and experimental studies is also presented to confirm direct applicability of the model to angle-ply laminates with matrix cracks subjected to general in-plane loading.

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

Azunre, P.

Here in this paper, two novel techniques for bounding the solutions of parametric weakly coupled second-order semilinear parabolic partial differential equations are developed. The first provides a theorem to construct interval bounds, while the second provides a theorem to construct lower bounds convex and upper bounds concave in the parameter. The convex/concave bounds can be significantly tighter than the interval bounds because of the wrapping effect suffered by interval analysis in dynamical systems. Both types of bounds are computationally cheap to construct, requiring solving auxiliary systems twice and four times larger than the original system, respectively. An illustrative numerical examplemore » of bound construction and use for deterministic global optimization within a simple serial branch-and-bound algorithm, implemented numerically using interval arithmetic and a generalization of McCormick's relaxation technique, is presented. Finally, problems within the important class of reaction-diffusion systems may be optimized with these tools.« less

Incomplete Kochen-Specker coloring

NASA Astrophysics Data System (ADS)

Granström, Helena

2007-09-01

A particular incomplete Kochen-Specker coloring, suggested by Appleby [Stud. Hist. Philos. Mod. Phys. 36, 1 (2005)] in dimension three, is generalized to arbitrary dimension. We investigate its effectivity as a function of dimension, using two different measures. A limit is derived for the fraction of the sphere that can be colored using the generalized Appleby construction as the number of dimensions approaches infinity. The second, and physically more relevant measure of effectivity, is to look at the fraction of properly colored ON bases. Using this measure, we derive a "lower bound for the upper bound" in three and four real dimensions.

UPPER BOUND RISK ESTIMATES FOR MIXTURES OF CARCINOGENS

EPA Science Inventory

The excess cancer risk that might result from exposure to a mixture of chemical carcinogens usually is estimated with data from experiments conducted on individual chemicals. An upper bound on the total excess risk is estimated commonly by summing individual upper bound risk esti...

PubMed

Trinker, Horst

2011-10-28

We study the distribution of triples of codewords of codes and ordered codes. Schrijver [A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (8) (2005) 2859-2866] used the triple distribution of a code to establish a bound on the number of codewords based on semidefinite programming. In the first part of this work, we generalize this approach for ordered codes. In the second part, we consider linear codes and linear ordered codes and present a MacWilliams-type identity for the triple distribution of their dual code. Based on the non-negativity of this linear transform, we establish a linear programming bound and conclude with a table of parameters for which this bound yields better results than the standard linear programming bound.

Information models of software productivity - Limits on productivity growth

NASA Technical Reports Server (NTRS)

Tausworthe, Robert C.

1992-01-01

Research into generalized information-metric models of software process productivity establishes quantifiable behavior and theoretical bounds. The models establish a fundamental mathematical relationship between software productivity and the human capacity for information traffic, the software product yield (system size), information efficiency, and tool and process efficiencies. An upper bound is derived that quantifies average software productivity and the maximum rate at which it may grow. This bound reveals that ultimately, when tools, methodologies, and automated assistants have reached their maximum effective state, further improvement in productivity can only be achieved through increasing software reuse. The reuse advantage is shown not to increase faster than logarithmically in the number of reusable features available. The reuse bound is further shown to be somewhat dependent on the reuse policy: a general 'reuse everything' policy can lead to a somewhat slower productivity growth than a specialized reuse policy.

Imaginary-frequency polarizability and van der Waals force constants of two-electron atoms, with rigorous bounds

NASA Technical Reports Server (NTRS)

Glover, R. M.; Weinhold, F.

1977-01-01

Variational functionals of Braunn and Rebane (1972) for the imagery-frequency polarizability (IFP) have been generalized by the method of Gramian inequalities to give rigorous upper and lower bounds, valid even when the true (but unknown) unperturbed wavefunction must be represented by a variational approximation. Using these formulas in conjunction with flexible variational trial functions, tight error bounds are computed for the IFP and the associated two- and three-body van der Waals interaction constants of the ground 1(1S) and metastable 2(1,3S) states of He and Li(+). These bounds generally establish the ground-state properties to within a fraction of a per cent and metastable properties to within a few per cent, permitting a comparative assessment of competing theoretical methods at this level of accuracy. Unlike previous 'error bounds' for these properties, the present results have a completely a priori theoretical character, with no empirical input data.

Statistical speed of quantum states: Generalized quantum Fisher information and Schatten speed

NASA Astrophysics Data System (ADS)

Gessner, Manuel; Smerzi, Augusto

2018-02-01

We analyze families of measures for the quantum statistical speed which include as special cases the quantum Fisher information, the trace speed, i.e., the quantum statistical speed obtained from the trace distance, and more general quantifiers obtained from the family of Schatten norms. These measures quantify the statistical speed under generic quantum evolutions and are obtained by maximizing classical measures over all possible quantum measurements. We discuss general properties, optimal measurements, and upper bounds on the speed of separable states. We further provide a physical interpretation for the trace speed by linking it to an analog of the quantum Cramér-Rao bound for median-unbiased quantum phase estimation.

Generalized Hofmann quantum process fidelity bounds for quantum filters

NASA Astrophysics Data System (ADS)

Sedlák, Michal; Fiurášek, Jaromír

2016-04-01

We propose and investigate bounds on the quantum process fidelity of quantum filters, i.e., probabilistic quantum operations represented by a single Kraus operator K . These bounds generalize the Hofmann bounds on the quantum process fidelity of unitary operations [H. F. Hofmann, Phys. Rev. Lett. 94, 160504 (2005), 10.1103/PhysRevLett.94.160504] and are based on probing the quantum filter with pure states forming two mutually unbiased bases. Determination of these bounds therefore requires far fewer measurements than full quantum process tomography. We find that it is particularly suitable to construct one of the probe bases from the right eigenstates of K , because in this case the bounds are tight in the sense that if the actual filter coincides with the ideal one, then both the lower and the upper bounds are equal to 1. We theoretically investigate the application of these bounds to a two-qubit optical quantum filter formed by the interference of two photons on a partially polarizing beam splitter. For an experimentally convenient choice of factorized input states and measurements we study the tightness of the bounds. We show that more stringent bounds can be obtained by more sophisticated processing of the data using convex optimization and we compare our methods for different choices of the input probe states.

Thermalization Time Bounds for Pauli Stabilizer Hamiltonians

NASA Astrophysics Data System (ADS)

Temme, Kristan

2017-03-01

We prove a general lower bound to the spectral gap of the Davies generator for Hamiltonians that can be written as the sum of commuting Pauli operators. These Hamiltonians, defined on the Hilbert space of N-qubits, serve as one of the most frequently considered candidates for a self-correcting quantum memory. A spectral gap bound on the Davies generator establishes an upper limit on the life time of such a quantum memory and can be used to estimate the time until the system relaxes to thermal equilibrium when brought into contact with a thermal heat bath. The bound can be shown to behave as {λ ≥ O(N^{-1} exp(-2β overline{ɛ}))}, where {overline{ɛ}} is a generalization of the well known energy barrier for logical operators. Particularly in the low temperature regime we expect this bound to provide the correct asymptotic scaling of the gap with the system size up to a factor of N -1. Furthermore, we discuss conditions and provide scenarios where this factor can be removed and a constant lower bound can be proven.

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

NASA Astrophysics Data System (ADS)

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

2008-05-01

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

A one-dimensional model of solid-earth electrical resistivity beneath Florida

USGS Publications Warehouse

Blum, Cletus; Love, Jeffrey J.; Pedrie, Kolby; Bedrosian, Paul A.; Rigler, E. Joshua

2015-11-19

An estimated one-dimensional layered model of electrical resistivity beneath Florida was developed from published geological and geophysical information. The resistivity of each layer is represented by plausible upper and lower bounds as well as a geometric mean resistivity. Corresponding impedance transfer functions, Schmucker-Weidelt transfer functions, apparent resistivity, and phase responses are calculated for inducing geomagnetic frequencies ranging from 10−5 to 100 hertz. The resulting one-dimensional model and response functions can be used to make general estimates of time-varying electric fields associated with geomagnetic storms such as might represent induction hazards for electric-power grid operation. The plausible upper- and lower-bound resistivity structures show the uncertainty, giving a wide range of plausible time-varying electric fields.

Bounding the solutions of parametric weakly coupled second-order semilinear parabolic partial differential equations

DOE PAGES

Azunre, P.

2016-09-21

Here in this paper, two novel techniques for bounding the solutions of parametric weakly coupled second-order semilinear parabolic partial differential equations are developed. The first provides a theorem to construct interval bounds, while the second provides a theorem to construct lower bounds convex and upper bounds concave in the parameter. The convex/concave bounds can be significantly tighter than the interval bounds because of the wrapping effect suffered by interval analysis in dynamical systems. Both types of bounds are computationally cheap to construct, requiring solving auxiliary systems twice and four times larger than the original system, respectively. An illustrative numerical examplemore » of bound construction and use for deterministic global optimization within a simple serial branch-and-bound algorithm, implemented numerically using interval arithmetic and a generalization of McCormick's relaxation technique, is presented. Finally, problems within the important class of reaction-diffusion systems may be optimized with these tools.« less

The generalized truncated exponential distribution as a model for earthquake magnitudes

NASA Astrophysics Data System (ADS)

Raschke, Mathias

2015-04-01

The random distribution of small, medium and large earthquake magnitudes follows an exponential distribution (ED) according to the Gutenberg-Richter relation. But a magnitude distribution is truncated in the range of very large magnitudes because the earthquake energy is finite and the upper tail of the exponential distribution does not fit well observations. Hence the truncated exponential distribution (TED) is frequently applied for the modelling of the magnitude distributions in the seismic hazard and risk analysis. The TED has a weak point: when two TEDs with equal parameters, except the upper bound magnitude, are mixed, then the resulting distribution is not a TED. Inversely, it is also not possible to split a TED of a seismic region into TEDs of subregions with equal parameters, except the upper bound magnitude. This weakness is a principal problem as seismic regions are constructed scientific objects and not natural units. It also applies to alternative distribution models. The presented generalized truncated exponential distribution (GTED) overcomes this weakness. The ED and the TED are special cases of the GTED. Different issues of the statistical inference are also discussed and an example of empirical data is presented in the current contribution.

Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings.

PubMed

Werner, Tomás

2015-07-01

Many inference tasks in pattern recognition and artificial intelligence lead to partition functions in which addition and multiplication are abstract binary operations forming a commutative semiring. By generalizing max-sum diffusion (one of convergent message passing algorithms for approximate MAP inference in graphical models), we propose an iterative algorithm to upper bound such partition functions over commutative semirings. The iteration of the algorithm is remarkably simple: change any two factors of the partition function such that their product remains the same and their overlapping marginals become equal. In many commutative semirings, repeating this iteration for different pairs of factors converges to a fixed point when the overlapping marginals of every pair of factors coincide. We call this state marginal consistency. During that, an upper bound on the partition function monotonically decreases. This abstract algorithm unifies several existing algorithms, including max-sum diffusion and basic constraint propagation (or local consistency) algorithms in constraint programming. We further construct a hierarchy of marginal consistencies of increasingly higher levels and show than any such level can be enforced by adding identity factors of higher arity (order). Finally, we discuss instances of the framework for several semirings, including the distributive lattice and the max-sum and sum-product semirings.

Upper bound on the slope of steady water waves with small adverse vorticity

NASA Astrophysics Data System (ADS)

So, Seung Wook; Strauss, Walter A.

2018-03-01

We consider the angle of inclination (with respect to the horizontal) of the profile of a steady 2D inviscid symmetric periodic or solitary water wave subject to gravity. There is an upper bound of 31.15° in the irrotational case [1] and an upper bound of 45° in the case of favorable vorticity [13]. On the other hand, if the vorticity is adverse, the profile can become vertical. We prove here that if the adverse vorticity is sufficiently small, then the angle still has an upper bound which is slightly larger than 45°.

Thin-wall approximation in vacuum decay: A lemma

NASA Astrophysics Data System (ADS)

Brown, Adam R.

2018-05-01

The "thin-wall approximation" gives a simple estimate of the decay rate of an unstable quantum field. Unfortunately, the approximation is uncontrolled. In this paper I show that there are actually two different thin-wall approximations and that they bracket the true decay rate: I prove that one is an upper bound and the other a lower bound. In the thin-wall limit, the two approximations converge. In the presence of gravity, a generalization of this lemma provides a simple sufficient condition for nonperturbative vacuum instability.

Thermal dark matter co-annihilating with a strongly interacting scalar

NASA Astrophysics Data System (ADS)

Biondini, S.; Laine, M.

2018-04-01

Recently many investigations have considered Majorana dark matter co-annihilating with bound states formed by a strongly interacting scalar field. However only the gluon radiation contribution to bound state formation and dissociation, which at high temperatures is subleading to soft 2 → 2 scatterings, has been included. Making use of a non-relativistic effective theory framework and solving a plasma-modified Schrödinger equation, we address the effect of soft 2 → 2 scatterings as well as the thermal dissociation of bound states. We argue that the mass splitting between the Majorana and scalar field has in general both a lower and an upper bound, and that the dark matter mass scale can be pushed at least up to 5…6TeV.

Edge states at phase boundaries and their stability

NASA Astrophysics Data System (ADS)

Asorey, M.; Balachandran, A. P.; Pérez-Pardo, J. M.

2016-10-01

We analyze the effects of Robin-like boundary conditions on different quantum field theories of spin 0, 1/2 and 1 on manifolds with boundaries. In particular, we show that these conditions often lead to the appearance of edge states. These states play a significant role in physical phenomena like quantum Hall effect and topological insulators. We prove in a rigorous way the existence of spectral lower bounds on the kinetic term of different Hamiltonians, even in the case of Abelian gauge fields where it is a non-elliptic differential operator. This guarantees the stability and consistency of massive field theories with masses larger than the lower bound of the kinetic term. Moreover, we find an upper bound for the deepest edge state. In the case of Abelian gauge theories, we analyze a generalization of Robin boundary conditions. For Dirac fermions, we analyze the cases of Atiyah-Patodi-Singer and chiral bag boundary conditions. The explicit dependence of the bounds on the boundary conditions and the size of the system is derived under general assumptions.

Amortized entanglement of a quantum channel and approximately teleportation-simulable channels

NASA Astrophysics Data System (ADS)

Kaur, Eneet; Wilde, Mark M.

2018-01-01

This paper defines the amortized entanglement of a quantum channel as the largest difference in entanglement between the output and the input of the channel, where entanglement is quantified by an arbitrary entanglement measure. We prove that the amortized entanglement of a channel obeys several desirable properties, and we also consider special cases such as the amortized relative entropy of entanglement and the amortized Rains relative entropy. These latter quantities are shown to be single-letter upper bounds on the secret-key-agreement and PPT-assisted quantum capacities of a quantum channel, respectively. Of especial interest is a uniform continuity bound for these latter two special cases of amortized entanglement, in which the deviation between the amortized entanglement of two channels is bounded from above by a simple function of the diamond norm of their difference and the output dimension of the channels. We then define approximately teleportation- and positive-partial-transpose-simulable (PPT-simulable) channels as those that are close in diamond norm to a channel which is either exactly teleportation- or PPT-simulable, respectively. These results then lead to single-letter upper bounds on the secret-key-agreement and PPT-assisted quantum capacities of channels that are approximately teleportation- or PPT-simulable, respectively. Finally, we generalize many of the concepts in the paper to the setting of general resource theories, defining the amortized resourcefulness of a channel and the notion of ν-freely-simulable channels, connecting these concepts in an operational way as well.

Unified trade-off optimization for general heat devices with nonisothermal processes.

PubMed

Long, Rui; Liu, Wei

2015-04-01

An analysis of the efficiency and coefficient of performance (COP) for general heat engines and refrigerators with nonisothermal processes is conducted under the trade-off criterion. The specific heat of the working medium has significant impacts on the optimal configurations of heat devices. For cycles with constant specific heat, the bounds of the efficiency and COP are found to be the same as those obtained through the endoreversible Carnot ones. However, they are independent of the cycle time durations. For cycles with nonconstant specific heat, whose dimensionless contact time approaches infinity, the general alternative upper and lower bounds of the efficiency and COP under the trade-off criteria have been proposed under the asymmetric limits. Furthermore, when the dimensionless contact time approaches zero, the endoreversible Carnot model is recovered. In addition, the efficiency and COP bounds of different kinds of actual heat engines and refrigerators have also been analyzed. This paper may provide practical insight for designing and operating actual heat engines and refrigerators.

Estimation of the upper bound of predictive performance for alternative models that use in vivo reference data (OpenTox USA 2017)

EPA Science Inventory

The number of chemicals with limited toxicological information for chemical safety decision-making has accelerated alternative model development, which often are evaluated via referencing animal toxicology studies. In vivo studies are generally considered the standard for hazard ...

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

Treesearch

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

Bounds on OPE coefficients from interference effects in the conformal collider

NASA Astrophysics Data System (ADS)

Córdova, Clay; Maldacena, Juan; Turiaci, Gustavo J.

2017-11-01

We apply the average null energy condition to obtain upper bounds on the three-point function coefficients of stress tensors and a scalar operator, < TTOi>, in general CFTs. We also constrain the gravitational anomaly of U(1) currents in four-dimensional CFTs, which are encoded in three-point functions of the form 〈 T T J 〉. In theories with a large N AdS dual we translate these bounds into constraints on the coefficient of a higher derivative bulk term of the form ∫ϕ W 2. We speculate that these bounds also apply in de-Sitter. In this case our results constrain inflationary observables, such as the amplitude for chiral gravity waves that originate from higher derivative terms in the Lagrangian of the form ϕ W W ∗.

When clusters collide: constraints on antimatter on the largest scales

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

Steigman, Gary, E-mail: steigman@mps.ohio-state.edu

2008-10-15

Observations have ruled out the presence of significant amounts of antimatter in the Universe on scales ranging from the solar system, to the Galaxy, to groups and clusters of galaxies, and even to distances comparable to the scale of the present horizon. Except for the model-dependent constraints on the largest scales, the most significant upper limits to diffuse antimatter in the Universe are those on the {approx}Mpc scale of clusters of galaxies provided by the EGRET upper bounds to annihilation gamma rays from galaxy clusters whose intracluster gas is revealed through its x-ray emission. On the scale of individual clustersmore » of galaxies the upper bounds to the fraction of mixed matter and antimatter for the 55 clusters from a flux-limited x-ray survey range from 5 Multiplication-Sign 10{sup -9} to <1 Multiplication-Sign 10{sup -6}, strongly suggesting that individual clusters of galaxies are made entirely of matter or of antimatter. X-ray and gamma-ray observations of colliding clusters of galaxies, such as the Bullet Cluster, permit these constraints to be extended to even larger scales. If the observations of the Bullet Cluster, where the upper bound to the antimatter fraction is found to be <3 Multiplication-Sign 10{sup -6}, can be generalized to other colliding clusters of galaxies, cosmologically significant amounts of antimatter will be excluded on scales of order {approx}20 Mpc (M{approx}5 Multiplication-Sign 10{sup 15}M{sub sun})« less

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

Treesearch

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

Sign rank versus Vapnik-Chervonenkis dimension

NASA Astrophysics Data System (ADS)

Alon, N.; Moran, Sh; Yehudayoff, A.

2017-12-01

This work studies the maximum possible sign rank of sign (N × N)-matrices with a given Vapnik-Chervonenkis dimension d. For d=1, this maximum is three. For d=2, this maximum is \\widetilde{\\Theta}(N1/2). For d >2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given Vapnik-Chervonenkis dimension, and the number of maximum classes of a given Vapnik-Chervonenkis dimension--answering a question of Frankl from 1989, and (ii) design an efficient algorithm that provides an O(N/log(N)) multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the adjacency (N × N)-matrix of a Δ-regular graph with a second eigenvalue of absolute value λ and Δ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least Δ/λ. We use this connection to prove the existence of a maximum class C\\subseteq\\{+/- 1\\}^N with Vapnik-Chervonenkis dimension 2 and sign rank \\widetilde{\\Theta}(N1/2). This answers a question of Ben-David et al. regarding the sign rank of large Vapnik-Chervonenkis classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics. Bibliography: 69 titles.

49 CFR 821.7 - Filing of documents with the Board.

Code of Federal Regulations, 2013 CFR

2013-10-01

..., National Transportation Safety Board, 490 L'Enfant Plaza East SW., Washington, DC 20594, and addressed to... filed with the Office of General Counsel, National Transportation Safety Board, 490 L'Enfant Plaza East... upper left-hand corner by staple or clip, and shall not be bound or hole-punched. Any document failing...

Photocopy of photograph entitled "Botanical Gardens and officers quarters, Fitzsimons ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

Photocopy of photograph entitled "Botanical Gardens and officers quarters, Fitzsimons General Hospital". Dated 1924 on the back, the photograph looks north from the corner of E. Colfax Ave. and Peoria St. Some features such as the buildings at the upper right are actual but other features such as the large building at the upper left are drawn in. Photograph in the Fitzsimons Army Medical Center Public Affairs Office, building 120. This photograph was never copyrighted and is in the public domain. - Fitzsimons General Hospital, Bounded by East Colfax to south, Peoria Street to west, Denver City/County & Adams County Line to north, & U.S. Route 255 to east, Aurora, Adams County, CO

Upper bounds on secret-key agreement over lossy thermal bosonic channels

NASA Astrophysics Data System (ADS)

Kaur, Eneet; Wilde, Mark M.

2017-12-01

Upper bounds on the secret-key-agreement capacity of a quantum channel serve as a way to assess the performance of practical quantum-key-distribution protocols conducted over that channel. In particular, if a protocol employs a quantum repeater, achieving secret-key rates exceeding these upper bounds is evidence of having a working quantum repeater. In this paper, we extend a recent advance [Liuzzo-Scorpo et al., Phys. Rev. Lett. 119, 120503 (2017), 10.1103/PhysRevLett.119.120503] in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels such that it now applies to the relative entropy of entanglement measure. As a consequence of this extension, we find tighter upper bounds on the nonasymptotic secret-key-agreement capacity of the lossy thermal bosonic channel than were previously known. The lossy thermal bosonic channel serves as a more realistic model of communication than the pure-loss bosonic channel, because it can model the effects of eavesdropper tampering and imperfect detectors. An implication of our result is that the previously known upper bounds on the secret-key-agreement capacity of the thermal channel are too pessimistic for the practical finite-size regime in which the channel is used a finite number of times, and so it should now be somewhat easier to witness a working quantum repeater when using secret-key-agreement capacity upper bounds as a benchmark.

Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination

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

Audenaert, Koenraad M. R., E-mail: koenraad.audenaert@rhul.ac.uk; Department of Physics and Astronomy, University of Ghent, S9, Krijgslaan 281, B-9000 Ghent; Mosonyi, Milán, E-mail: milan.mosonyi@gmail.com

2014-10-01

We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states σ₁, …, σ{sub r}. By splitting up the overall test into multiple binary tests in various ways we obtain a number of upper bounds on the optimal error probability in terms of the binary error probabilities. These upper bounds allow us to deduce various bounds on the asymptotic error rate, for which it has been hypothesized that it is given by the multi-hypothesis quantum Chernoff bound (or Chernoff divergence) C(σ₁, …, σ{sub r}), as recently introduced by Nussbaum and Szkoła in analogy with Salikhov'smore » classical multi-hypothesis Chernoff bound. This quantity is defined as the minimum of the pairwise binary Chernoff divergences min{sub j« less

Density Large Deviations for Multidimensional Stochastic Hyperbolic Conservation Laws

NASA Astrophysics Data System (ADS)

Barré, J.; Bernardin, C.; Chetrite, R.

2018-02-01

We investigate the density large deviation function for a multidimensional conservation law in the vanishing viscosity limit, when the probability concentrates on weak solutions of a hyperbolic conservation law. When the mobility and diffusivity matrices are proportional, i.e. an Einstein-like relation is satisfied, the problem has been solved in Bellettini and Mariani (Bull Greek Math Soc 57:31-45, 2010). When this proportionality does not hold, we compute explicitly the large deviation function for a step-like density profile, and we show that the associated optimal current has a non trivial structure. We also derive a lower bound for the large deviation function, valid for a more general weak solution, and leave the general large deviation function upper bound as a conjecture.

Transient response of multidegree-of-freedom linear systems to forcing functions with inequality constraints

NASA Technical Reports Server (NTRS)

Michalopoulos, C. D.

1974-01-01

Optimal control theory is applied to analyze the transient response of discrete linear systems to forcing functions with unknown time dependence but having known bounds. Particular attention is given to forcing functions which include: (1) maximum displacement of any given mass element, (2) maximum relative displacement of any two adjacent masses, and (3) maximum acceleration of a given mass. Linear mechanical systems with an arbitrary number of degrees of freedom and only one forcing function acting are considered. In the general case, the desired forcing function is found to be a function that switches from the upper-to-lower bound and vice-versa at certain moments of time. A general procedure for finding such switching times is set forth.

Gauge mediation at the LHC: status and prospects

DOE PAGES

Knapen, Simon; Redigolo, Diego

2017-01-30

We show that the predictivity of general gauge mediation (GGM) with TeV-scale stops is greatly increased once the Higgs mass constraint is imposed. The most notable results are a strong lower bound on the mass of the gluino and right-handed squarks, and an upper bound on the Higgsino mass. If the μ-parameter is positive, the wino mass is also bounded from above. These constraints relax significantly for high messenger scales and as such long-lived NLSPs are favored in GGM. We identify a small set of most promising topologies for the neutralino/sneutrino NLSP scenarios and estimate the impact of the currentmore » bounds and the sensitivity of the high luminosity LHC. The stau, stop and sbottom NLSP scenarios can be robustly excluded at the high luminosity LHC.« less

How entangled can a multi-party system possibly be?

NASA Astrophysics Data System (ADS)

Qi, Liqun; Zhang, Guofeng; Ni, Guyan

2018-06-01

The geometric measure of entanglement of a pure quantum state is defined to be its distance to the space of pure product (separable) states. Given an n-partite system composed of subsystems of dimensions d1 , … ,dn, an upper bound for maximally allowable entanglement is derived in terms of geometric measure of entanglement. This upper bound is characterized exclusively by the dimensions d1 , … ,dn of composite subsystems. Numerous examples demonstrate that the upper bound appears to be reasonably tight.

Generalized surface tension bounds in vacuum decay

NASA Astrophysics Data System (ADS)

Masoumi, Ali; Paban, Sonia; Weinberg, Erick J.

2018-02-01

Coleman and De Luccia (CDL) showed that gravitational effects can prevent the decay by bubble nucleation of a Minkowski or AdS false vacuum. In their thin-wall approximation this happens whenever the surface tension in the bubble wall exceeds an upper bound proportional to the difference of the square roots of the true and false vacuum energy densities. Recently it was shown that there is another type of thin-wall regime that differs from that of CDL in that the radius of curvature grows substantially as one moves through the wall. Not only does the CDL derivation of the bound fail in this case, but also its very formulation becomes ambiguous because the surface tension is not well defined. We propose a definition of the surface tension and show that it obeys a bound similar in form to that of the CDL case. We then show that both thin-wall bounds are special cases of a more general bound that is satisfied for all bounce solutions with Minkowski or AdS false vacua. We discuss the limit where the parameters of the theory attain critical values and the bound is saturated. The bounce solution then disappears and a static planar domain wall solution appears in its stead. The scalar field potential then is of the form expected in supergravity, but this is only guaranteed along the trajectory in field space traced out by the bounce.

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

PubMed

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. Copyright © 2013 Elsevier Ltd. All rights reserved.

Estimation of the lower and upper bounds on the probability of failure using subset simulation and random set theory

NASA Astrophysics Data System (ADS)

Alvarez, Diego A.; Uribe, Felipe; Hurtado, Jorge E.

2018-02-01

Random set theory is a general framework which comprises uncertainty in the form of probability boxes, possibility distributions, cumulative distribution functions, Dempster-Shafer structures or intervals; in addition, the dependence between the input variables can be expressed using copulas. In this paper, the lower and upper bounds on the probability of failure are calculated by means of random set theory. In order to accelerate the calculation, a well-known and efficient probability-based reliability method known as subset simulation is employed. This method is especially useful for finding small failure probabilities in both low- and high-dimensional spaces, disjoint failure domains and nonlinear limit state functions. The proposed methodology represents a drastic reduction of the computational labor implied by plain Monte Carlo simulation for problems defined with a mixture of representations for the input variables, while delivering similar results. Numerical examples illustrate the efficiency of the proposed approach.

Estimation variance bounds of importance sampling simulations in digital communication systems

NASA Technical Reports Server (NTRS)

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.

Biodegradation kinetics for pesticide exposure assessment.

PubMed

Wolt, J D; Nelson, H P; Cleveland, C B; van Wesenbeeck, I J

2001-01-01

Understanding pesticide risks requires characterizing pesticide exposure within the environment in a manner that can be broadly generalized across widely varied conditions of use. The coupled processes of sorption and soil degradation are especially important for understanding the potential environmental exposure of pesticides. The data obtained from degradation studies are inherently variable and, when limited in extent, lend uncertainty to exposure characterization and risk assessment. Pesticide decline in soils reflects dynamically coupled processes of sorption and degradation that add complexity to the treatment of soil biodegradation data from a kinetic perspective. Additional complexity arises from study design limitations that may not fully account for the decline in microbial activity of test systems, or that may be inadequate for considerations of all potential dissipation routes for a given pesticide. Accordingly, kinetic treatment of data must accommodate a variety of differing approaches starting with very simple assumptions as to reaction dynamics and extending to more involved treatments if warranted by the available experimental data. Selection of the appropriate kinetic model to describe pesticide degradation should rely on statistical evaluation of the data fit to ensure that the models used are not overparameterized. Recognizing the effects of experimental conditions and methods for kinetic treatment of degradation data is critical for making appropriate comparisons among pesticide biodegradation data sets. Assessment of variability in soil half-life among soils is uncertain because for many pesticides the data on soil degradation rate are limited to one or two soils. Reasonable upper-bound estimates of soil half-life are necessary in risk assessment so that estimated environmental concentrations can be developed from exposure models. Thus, an understanding of the variable and uncertain distribution of soil half-lives in the environment is necessary to estimate bounding values. Statistical evaluation of measures of central tendency for multisoil kinetic studies shows that geometric means better represent the distribution in soil half-lives than do the arithmetic or harmonic means. Estimates of upper-bound soil half-life values based on the upper 90% confidence bound on the geometric mean tend to accurately represent the upper bound when pesticide degradation rate is biologically driven but appear to overestimate the upper bound when there is extensive coupling of biodegradation with sorptive processes. The limited data available comparing distribution in pesticide soil half-lives between multisoil laboratory studies and multilocation field studies suggest that the probability density functions are similar. Thus, upper-bound estimates of pesticide half-life determined from laboratory studies conservatively represent pesticide biodegradation in the field environment for the purposes of exposure and risk assessment. International guidelines and approaches used for interpretations of soil biodegradation reflect many common elements, but differ in how the source and nature of variability in soil kinetic data are considered. Harmonization of approaches for the use of soil biodegradation data will improve the interpretative power of these data for the purposes of exposure and risk assessment.

Efficiency versus speed in quantum heat engines: Rigorous constraint from Lieb-Robinson bound

NASA Astrophysics Data System (ADS)

Shiraishi, Naoto; Tajima, Hiroyasu

2017-08-01

A long-standing open problem whether a heat engine with finite power achieves the Carnot efficiency is investgated. We rigorously prove a general trade-off inequality on thermodynamic efficiency and time interval of a cyclic process with quantum heat engines. In a first step, employing the Lieb-Robinson bound we establish an inequality on the change in a local observable caused by an operation far from support of the local observable. This inequality provides a rigorous characterization of the following intuitive picture that most of the energy emitted from the engine to the cold bath remains near the engine when the cyclic process is finished. Using this description, we prove an upper bound on efficiency with the aid of quantum information geometry. Our result generally excludes the possibility of a process with finite speed at the Carnot efficiency in quantum heat engines. In particular, the obtained constraint covers engines evolving with non-Markovian dynamics, which almost all previous studies on this topic fail to address.

Efficiency versus speed in quantum heat engines: Rigorous constraint from Lieb-Robinson bound.

PubMed

Shiraishi, Naoto; Tajima, Hiroyasu

2017-08-01

A long-standing open problem whether a heat engine with finite power achieves the Carnot efficiency is investgated. We rigorously prove a general trade-off inequality on thermodynamic efficiency and time interval of a cyclic process with quantum heat engines. In a first step, employing the Lieb-Robinson bound we establish an inequality on the change in a local observable caused by an operation far from support of the local observable. This inequality provides a rigorous characterization of the following intuitive picture that most of the energy emitted from the engine to the cold bath remains near the engine when the cyclic process is finished. Using this description, we prove an upper bound on efficiency with the aid of quantum information geometry. Our result generally excludes the possibility of a process with finite speed at the Carnot efficiency in quantum heat engines. In particular, the obtained constraint covers engines evolving with non-Markovian dynamics, which almost all previous studies on this topic fail to address.

Constrained signal reconstruction from wavelet transform coefficients

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

Brislawn, C.M.

1991-12-31

A new method is introduced for reconstructing a signal from an incomplete sampling of its Discrete Wavelet Transform (DWT). The algorithm yields a minimum-norm estimate satisfying a priori upper and lower bounds on the signal. The method is based on a finite-dimensional representation theory for minimum-norm estimates of bounded signals developed by R.E. Cole. Cole`s work has its origins in earlier techniques of maximum-entropy spectral estimation due to Lang and McClellan, which were adapted by Steinhardt, Goodrich and Roberts for minimum-norm spectral estimation. Cole`s extension of their work provides a representation for minimum-norm estimates of a class of generalized transformsmore » in terms of general correlation data (not just DFT`s of autocorrelation lags, as in spectral estimation). One virtue of this great generality is that it includes the inverse DWT. 20 refs.« less

On the role of entailment patterns and scalar implicatures in the processing of numerals

PubMed Central

Panizza, Daniele; Chierchia, Gennaro; Clifton, Charles

2009-01-01

There has been much debate, in both the linguistics and the psycholinguistics literature, concerning numbers and the interpretation of number denoting determiners ('numerals'). Such debate concerns, in particular, the nature and distribution of upper-bounded ('at-least') interpretations vs. lower-bounded ('exact') construals. In the present paper we show that the interpretation and processing of numerals are affected by the entailment properties of the context in which they occur. Experiment 1 established off-line preferences using a questionnaire. Experiment 2 investigated the processing issue through an eye tracking experiment using a silent reading task. Our results show that the upper-bounded interpretation of numerals occurs more often in an upward entailing context than in a downward entailing context. Reading times of the numeral itself were longer when it was embedded in an upward entailing context than when it was not, indicating that processing resources were required when the context triggered an upper-bounded interpretation. However, reading of a following context that required an upper-bounded interpretation triggered more regressions towards the numeral when it had occurred in a downward entailing context than in an upward entailing one. Such findings show that speakers' interpretation and processing of numerals is systematically affected by the polarity of the sentence in which they occur, and support the hypothesis that the upper-bounded interpretation of numerals is due to a scalar implicature. PMID:20161494

The Upper and Lower Bounds of the Prediction Accuracies of Ensemble Methods for Binary Classification

PubMed Central

Wang, Xueyi; Davidson, Nicholas J.

2011-01-01

Ensemble methods have been widely used to improve prediction accuracy over individual classifiers. In this paper, we achieve a few results about the prediction accuracies of ensemble methods for binary classification that are missed or misinterpreted in previous literature. First we show the upper and lower bounds of the prediction accuracies (i.e. the best and worst possible prediction accuracies) of ensemble methods. Next we show that an ensemble method can achieve > 0.5 prediction accuracy, while individual classifiers have < 0.5 prediction accuracies. Furthermore, for individual classifiers with different prediction accuracies, the average of the individual accuracies determines the upper and lower bounds. We perform two experiments to verify the results and show that it is hard to achieve the upper and lower bounds accuracies by random individual classifiers and better algorithms need to be developed. PMID:21853162

Upper bound of abutment scour in laboratory and field data

USGS Publications Warehouse

Benedict, Stephen

2016-01-01

The U.S. Geological Survey, in cooperation with the South Carolina Department of Transportation, conducted a field investigation of abutment scour in South Carolina and used those data to develop envelope curves that define the upper bound of abutment scour. To expand on this previous work, an additional cooperative investigation was initiated to combine the South Carolina data with abutment scour data from other sources and evaluate upper bound patterns with this larger data set. To facilitate this analysis, 446 laboratory and 331 field measurements of abutment scour were compiled into a digital database. This extensive database was used to evaluate the South Carolina abutment scour envelope curves and to develop additional envelope curves that reflected the upper bound of abutment scour depth for the laboratory and field data. The envelope curves provide simple but useful supplementary tools for assessing the potential maximum abutment scour depth in the field setting.

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels

PubMed Central

2012-01-01

Background The double-cut-and-join (DCJ) is a model that is able to efficiently sort a genome into another, generalizing the typical mutations (inversions, fusions, fissions, translocations) to which genomes are subject, but allowing the existence of circular chromosomes at the intermediate steps. In the general model many circular chromosomes can coexist in some intermediate step. However, when the compared genomes are linear, it is more plausible to use the so-called restricted DCJ model, in which we proceed the reincorporation of a circular chromosome immediately after its creation. These two consecutive DCJ operations, which create and reincorporate a circular chromosome, mimic a transposition or a block-interchange. When the compared genomes have the same content, it is known that the genomic distance for the restricted DCJ model is the same as the distance for the general model. If the genomes have unequal contents, in addition to DCJ it is necessary to consider indels, which are insertions and deletions of DNA segments. Linear time algorithms were proposed to compute the distance and to find a sorting scenario in a general, unrestricted DCJ-indel model that considers DCJ and indels. Results In the present work we consider the restricted DCJ-indel model for sorting linear genomes with unequal contents. We allow DCJ operations and indels with the following constraint: if a circular chromosome is created by a DCJ, it has to be reincorporated in the next step (no other DCJ or indel can be applied between the creation and the reincorporation of a circular chromosome). We then develop a sorting algorithm and give a tight upper bound for the restricted DCJ-indel distance. Conclusions We have given a tight upper bound for the restricted DCJ-indel distance. The question whether this bound can be reduced so that both the general and the restricted DCJ-indel distances are equal remains open. PMID:23281630

Single Polygon Counting on Cayley Tree of Order 3

NASA Astrophysics Data System (ADS)

Pah, Chin Hee

2010-07-01

We showed that one form of generalized Catalan numbers is the solution to the problem of finding different connected component with finite vertices containing a fixed root for the semi-infinite Cayley tree of order 3. We give the formula for the full graph, Cayley tree of order 3 which is derived from the generalized Catalan numbers. Using ratios of Gamma functions, two upper bounds are given for problem defined on semi-infinite Cayley tree of order 3 as well as the full graph.

Necessary condition for local distinguishability of maximally entangled states: Beyond orthogonality preservation

NASA Astrophysics Data System (ADS)

Singal, Tanmay; Rahaman, Ramij; Ghosh, Sibasish; Kar, Guruprasad

2017-10-01

The (im)possibility of local distinguishability of orthogonal multipartite quantum states still remains an intriguing question. Beyond C3⊗C3 , the problem remains unsolved even for maximally entangled states (MESs). So far, the only known condition for the local distinguishability of states is the well-known orthogonality preservation (OP). Using an upper bound on the locally accessible information for bipartite states, we derive a very simple necessary condition for any set of pairwise orthogonal MESs in Cd⊗Cd to be perfectly locally distinguishable. It is seen that particularly when the number of pairwise orthogonal MES states in Cd⊗Cd is equal to d , then this necessary condition, along with the OP condition, imposes more constraints (for said states to be perfectly locally distinguishable) than the OP condition does. When testing this condition for the local distinguishability of all sets of four generalized Bell states in C4⊗C4 , we find that it is not only necessary but also sufficient to determine their local distinguishability. This demonstrates that the aforementioned upper bound may play a significant role in the general scenario of local distinguishability of bipartite states.

Physical Uncertainty Bounds (PUB)

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

Vaughan, Diane Elizabeth; Preston, Dean L.

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 switchingmore » out the available physics models, one can obtain upper bounds on the uncertainties in simulated quantities of interest.« less

Record length requirement of long-range dependent teletraffic

NASA Astrophysics Data System (ADS)

Li, Ming

2017-04-01

This article contributes the highlights mainly in two folds. On the one hand, it presents a formula to compute the upper bound of the variance of the correlation periodogram measurement of teletraffic (traffic for short) with long-range dependence (LRD) for a given record length T and a given value of the Hurst parameter H (Theorems 1 and 2). On the other hand, it proposes two formulas for the computation of the variance upper bound of the correlation periodogram measurement of traffic of fractional Gaussian noise (fGn) type and the generalized Cauchy (GC) type, respectively (Corollaries 1 and 2). They may constitute a reference guideline of record length requirement of traffic with LRD. In addition, record length requirement for the correlation periodogram measurement of traffic with either the Schuster type or the Bartlett one is studied and the present results about it show that both types of periodograms may be used for the correlation measurement of traffic with a pre-desired variance bound of correlation estimation. Moreover, real traffic in the Internet Archive by the Special Interest Group on Data Communication under the Association for Computing Machinery of US (ACM SIGCOMM) is analyzed in the case study in this topic.

Energy-constrained two-way assisted private and quantum capacities of quantum channels

NASA Astrophysics Data System (ADS)

Davis, Noah; Shirokov, Maksim E.; Wilde, Mark M.

2018-06-01

With the rapid growth of quantum technologies, knowing the fundamental characteristics of quantum systems and protocols is essential for their effective implementation. A particular communication setting that has received increased focus is related to quantum key distribution and distributed quantum computation. In this setting, a quantum channel connects a sender to a receiver, and their goal is to distill either a secret key or entanglement, along with the help of arbitrary local operations and classical communication (LOCC). In this work, we establish a general theory of energy-constrained, LOCC-assisted private and quantum capacities of quantum channels, which are the maximum rates at which an LOCC-assisted quantum channel can reliably establish a secret key or entanglement, respectively, subject to an energy constraint on the channel input states. We prove that the energy-constrained squashed entanglement of a channel is an upper bound on these capacities. We also explicitly prove that a thermal state maximizes a relaxation of the squashed entanglement of all phase-insensitive, single-mode input bosonic Gaussian channels, generalizing results from prior work. After doing so, we prove that a variation of the method introduced by Goodenough et al. [New J. Phys. 18, 063005 (2016), 10.1088/1367-2630/18/6/063005] leads to improved upper bounds on the energy-constrained secret-key-agreement capacity of a bosonic thermal channel. We then consider a multipartite setting and prove that two known multipartite generalizations of the squashed entanglement are in fact equal. We finally show that the energy-constrained, multipartite squashed entanglement plays a role in bounding the energy-constrained LOCC-assisted private and quantum capacity regions of quantum broadcast channels.

Rigorous results for the minimal speed of Kolmogorov-Petrovskii-Piscounov monotonic fronts with a cutoffa)

NASA Astrophysics Data System (ADS)

Benguria, Rafael D.; Depassier, M. Cristina; Loss, Michael

2012-12-01

We study the effect of a cutoff on the speed of pulled fronts of the one-dimensional reaction diffusion equation. To accomplish this, we first use variational techniques to prove the existence of a heteroclinic orbit in phase space for traveling wave solutions of the corresponding reaction diffusion equation under conditions that include discontinuous reaction profiles. This existence result allows us to prove rigorous upper and lower bounds on the minimal speed of monotonic fronts in terms of the cut-off parameter ɛ. From these bounds we estimate the range of validity of the Brunet-Derrida formula for a general class of reaction terms.

Eigenvalues of the Wentzell-Laplace operator and of the fourth order Steklov problems

NASA Astrophysics Data System (ADS)

Xia, Changyu; Wang, Qiaoling

2018-05-01

We prove a sharp upper bound and a lower bound for the first nonzero eigenvalue of the Wentzell-Laplace operator on compact manifolds with boundary and an isoperimetric inequality for the same eigenvalue in the case where the manifold is a bounded domain in a Euclidean space. We study some fourth order Steklov problems and obtain isoperimetric upper bound for the first eigenvalue of them. We also find all the eigenvalues and eigenfunctions for two kind of fourth order Steklov problems on a Euclidean ball.

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

PubMed

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.

The Problem of Limited Inter-rater Agreement in Modelling Music Similarity

PubMed Central

Flexer, Arthur; Grill, Thomas

2016-01-01

One of the central goals of Music Information Retrieval (MIR) is the quantification of similarity between or within pieces of music. These quantitative relations should mirror the human perception of music similarity, which is however highly subjective with low inter-rater agreement. Unfortunately this principal problem has been given little attention in MIR so far. Since it is not meaningful to have computational models that go beyond the level of human agreement, these levels of inter-rater agreement present a natural upper bound for any algorithmic approach. We will illustrate this fundamental problem in the evaluation of MIR systems using results from two typical application scenarios: (i) modelling of music similarity between pieces of music; (ii) music structure analysis within pieces of music. For both applications, we derive upper bounds of performance which are due to the limited inter-rater agreement. We compare these upper bounds to the performance of state-of-the-art MIR systems and show how the upper bounds prevent further progress in developing better MIR systems. PMID:28190932

LIGO GW150914 and GW151226 gravitational wave detection and generalized gravitation theory (MOG)

NASA Astrophysics Data System (ADS)

Moffat, J. W.

2016-12-01

The nature of gravitational waves in a generalized gravitation theory is investigated. The linearized field equations and the metric tensor quadrupole moment power and the decrease in radius of an inspiralling binary system of two compact objects are derived. The generalized Kerr metric describing a spinning black hole is determined by its mass M and the spin parameter a = cS / GM2. The LIGO-Virgo collaboration data is fitted with smaller binary black hole masses in agreement with the current electromagnetic, observed X-ray binary upper bound for a black hole mass, M ≲ 10M⊙.

Hoeffding Type Inequalities and their Applications in Statistics and Operations Research

NASA Astrophysics Data System (ADS)

Daras, Tryfon

2007-09-01

Large Deviation theory is the branch of Probability theory that deals with rare events. Sometimes, these events can be described by the sum of random variables that deviates from its mean more than a "normal" amount. A precise calculation of the probabilities of such events turns out to be crucial in a variety of different contents (e.g. in Probability Theory, Statistics, Operations Research, Statistical Physics, Financial Mathematics e.t.c.). Recent applications of the theory deal with random walks in random environments, interacting diffusions, heat conduction, polymer chains [1]. In this paper we prove an inequality of exponential type, namely theorem 2.1, which gives a large deviation upper bound for a specific sequence of r.v.s. Inequalities of this type have many applications in Combinatorics [2]. The inequality generalizes already proven results of this type, in the case of symmetric probability measures. We get as consequences to the inequality: (a) large deviations upper bounds for exchangeable Bernoulli sequences of random variables, generalizing results proven for independent and identically distributed Bernoulli sequences of r.v.s. and (b) a general form of Bernstein's inequality. We compare the inequality with large deviation results already proven by the author and try to see its advantages. Finally, using the inequality, we solve one of the basic problems of Operations Research (bin packing problem) in the case of exchangeable r.v.s.

Reshaping USAF Culture and Strategy: Lasting Themes and Emerging Trends

DTIC Science & Technology

2011-12-12

operations are well-rooted in the air and space experience, near space concepts have struggled to develop the organizational 22 momentum ...space). Nevertheless, by July 2005, the near space concept had achieved sufficient momentum for General Lance Lord (then Commander of Air Force... Bernoulli ) the vertical dimension. Although operating at the upper reaches of the atmosphere, near space flight is bound by Bernoulian principles. The

Evidence for a bound on the lifetime of de Sitter space

NASA Astrophysics Data System (ADS)

Freivogel, Ben; Lippert, Matthew

2008-12-01

Recent work has suggested a surprising new upper bound on the lifetime of de Sitter vacua in string theory. The bound is parametrically longer than the Hubble time but parametrically shorter than the recurrence time. We investigate whether the bound is satisfied in a particular class of de Sitter solutions, the KKLT vacua. Despite the freedom to make the supersymmetry breaking scale exponentially small, which naively would lead to extremely stable vacua, we find that the lifetime is always less than about exp(1022) Hubble times, in agreement with the proposed bound. This result, however, is contingent on several estimates and assumptions; in particular, we rely on a conjectural upper bound on the Euler number of the Calabi-Yau fourfolds used in KKLT compactifications.

Aggregating quantum repeaters for the quantum internet

NASA Astrophysics Data System (ADS)

Azuma, Koji; Kato, Go

2017-09-01

The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016), 10.1038/ncomms13523]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.

Extremal values on Zagreb indices of trees with given distance k-domination number.

PubMed

Pei, Lidan; Pan, Xiangfeng

2018-01-01

Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k -dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k -domination number [Formula: see text] of G is the minimum cardinality among all distance k -dominating sets of G . The first Zagreb index of G is defined as [Formula: see text] and the second Zagreb index of G is [Formula: see text]. In this paper, we obtain the upper bounds for the Zagreb indices of n -vertex trees with given distance k -domination number and characterize the extremal trees, which generalize the results of Borovićanin and Furtula (Appl. Math. Comput. 276:208-218, 2016). What is worth mentioning, for an n -vertex tree T , is that a sharp upper bound on the distance k -domination number [Formula: see text] is determined.

Diffusion Influenced Adsorption Kinetics.

PubMed

Miura, Toshiaki; Seki, Kazuhiko

2015-08-27

When the kinetics of adsorption is influenced by the diffusive flow of solutes, the solute concentration at the surface is influenced by the surface coverage of solutes, which is given by the Langmuir-Hinshelwood adsorption equation. The diffusion equation with the boundary condition given by the Langmuir-Hinshelwood adsorption equation leads to the nonlinear integro-differential equation for the surface coverage. In this paper, we solved the nonlinear integro-differential equation using the Grünwald-Letnikov formula developed to solve fractional kinetics. Guided by the numerical results, analytical expressions for the upper and lower bounds of the exact numerical results were obtained. The upper and lower bounds were close to the exact numerical results in the diffusion- and reaction-controlled limits, respectively. We examined the validity of the two simple analytical expressions obtained in the diffusion-controlled limit. The results were generalized to include the effect of dispersive diffusion. We also investigated the effect of molecular rearrangement of anisotropic molecules on surface coverage.

Non-linear collisional Penrose process: How much energy can a black hole release?

NASA Astrophysics Data System (ADS)

Nakao, Ken-ichi; Okawa, Hirotada; Maeda, Kei-ichi

2018-01-01

Energy extraction from a rotating or charged black hole is one of the fascinating issues in general relativity. The collisional Penrose process is one such extraction mechanism and has been reconsidered intensively since Bañados, Silk, and West pointed out the physical importance of very high energy collisions around a maximally rotating black hole. In order to get results analytically, the test particle approximation has been adopted so far. Successive works based on this approximation scheme have not yet revealed the upper bound on the efficiency of the energy extraction because of the lack of backreaction. In the Reissner-Nordström spacetime, by fully taking into account the self-gravity of the shells, we find that there is an upper bound on the extracted energy that is consistent with the area law of a black hole. We also show one particular scenario in which almost the maximum energy extraction is achieved even without the Bañados-Silk-West collision.

Quantifying the tracking capability of space-based AIS systems

NASA Astrophysics Data System (ADS)

Skauen, Andreas Nordmo

2016-01-01

The Norwegian Defence Research Establishment (FFI) has operated three Automatic Identification System (AIS) receivers in space. Two are on dedicated nano-satellites, AISSat-1 and AISSat-2. The third, the NORAIS Receiver, was installed on the International Space Station. A general method for calculating the upper bound on the tracking capability of a space-based AIS system has been developed and the results from the algorithm applied to AISSat-1 and the NORAIS Receiver individually. In addition, a constellation of AISSat-1 and AISSat-2 is presented. The tracking capability is defined as the probability of re-detecting ships as they move around the globe and is explained to represent and upper bound on a space-based AIS system performance. AISSat-1 and AISSat-2 operates on the nominal AIS1 and AIS2 channels, while the NORAIS Receiver data used are from operations on the dedicated space AIS channels, AIS3 and AIS4. The improved tracking capability of operations on the space AIS channels is presented.

Upper bound on the efficiency of certain nonimaging concentrators in the physical-optics model

NASA Astrophysics Data System (ADS)

Welford, W. T.; Winston, R.

1982-09-01

Upper bounds on the performance of nonimaging concentrators are obtained within the framework of scalar-wave theory by using a simple approach to avoid complex calculations on multiple phase fronts. The approach consists in treating a theoretically perfect image-forming device and postulating that no non-image-forming concentrator can have a better performance than such an ideal image-forming system. The performance of such a system can be calculated according to wave theory, and this will provide, in accordance with the postulate, upper bounds on the performance of nonimaging systems. The method is demonstrated for a two-dimensional compound parabolic concentrator.

Lower and upper bounds for entanglement of Rényi-α entropy.

PubMed

Song, Wei; Chen, Lin; Cao, Zhuo-Liang

2016-12-23

Entanglement Rényi-α entropy is an entanglement measure. It reduces to the standard entanglement of formation when α tends to 1. We derive analytical lower and upper bounds for the entanglement Rényi-α entropy of arbitrary dimensional bipartite quantum systems. We also demonstrate the application our bound for some concrete examples. Moreover, we establish the relation between entanglement Rényi-α entropy and some other entanglement measures.

Global a priori estimates for the inhomogeneous Landau equation with moderately soft potentials

NASA Astrophysics Data System (ADS)

Cameron, Stephen; Silvestre, Luis; Snelson, Stanley

2018-05-01

We establish a priori upper bounds for solutions to the spatially inhomogeneous Landau equation in the case of moderately soft potentials, with arbitrary initial data, under the assumption that mass, energy and entropy densities stay under control. Our pointwise estimates decay polynomially in the velocity variable. We also show that if the initial data satisfies a Gaussian upper bound, this bound is propagated for all positive times.

Global solutions of restricted open-shell Hartree-Fock theory from semidefinite programming with applications to strongly correlated quantum systems.

PubMed

Veeraraghavan, Srikant; Mazziotti, David A

2014-03-28

We present a density matrix approach for computing global solutions of restricted open-shell Hartree-Fock theory, based on semidefinite programming (SDP), that gives upper and lower bounds on the Hartree-Fock energy of quantum systems. While wave function approaches to Hartree-Fock theory yield an upper bound to the Hartree-Fock energy, we derive a semidefinite relaxation of Hartree-Fock theory that yields a rigorous lower bound on the Hartree-Fock energy. We also develop an upper-bound algorithm in which Hartree-Fock theory is cast as a SDP with a nonconvex constraint on the rank of the matrix variable. Equality of the upper- and lower-bound energies guarantees that the computed solution is the globally optimal solution of Hartree-Fock theory. The work extends a previously presented method for closed-shell systems [S. Veeraraghavan and D. A. Mazziotti, Phys. Rev. A 89, 010502-R (2014)]. For strongly correlated systems the SDP approach provides an alternative to the locally optimized Hartree-Fock energies and densities with a certificate of global optimality. Applications are made to the potential energy curves of C2, CN, Cr2, and NO2.

Noisy metrology: a saturable lower bound on quantum Fisher information

NASA Astrophysics Data System (ADS)

Yousefjani, R.; Salimi, S.; Khorashad, A. S.

2017-06-01

In order to provide a guaranteed precision and a more accurate judgement about the true value of the Cramér-Rao bound and its scaling behavior, an upper bound (equivalently a lower bound on the quantum Fisher information) for precision of estimation is introduced. Unlike the bounds previously introduced in the literature, the upper bound is saturable and yields a practical instruction to estimate the parameter through preparing the optimal initial state and optimal measurement. The bound is based on the underling dynamics, and its calculation is straightforward and requires only the matrix representation of the quantum maps responsible for encoding the parameter. This allows us to apply the bound to open quantum systems whose dynamics are described by either semigroup or non-semigroup maps. Reliability and efficiency of the method to predict the ultimate precision limit are demonstrated by three main examples.

Standard Deviation for Small Samples

ERIC Educational Resources Information Center

Joarder, Anwar H.; Latif, Raja M.

2006-01-01

Neater representations for variance are given for small sample sizes, especially for 3 and 4. With these representations, variance can be calculated without a calculator if sample sizes are small and observations are integers, and an upper bound for the standard deviation is immediate. Accessible proofs of lower and upper bounds are presented for…

Finite-error metrological bounds on multiparameter Hamiltonian estimation

NASA Astrophysics Data System (ADS)

Kura, Naoto; Ueda, Masahito

2018-01-01

Estimation of multiple parameters in an unknown Hamiltonian is investigated. We present upper and lower bounds on the time required to complete the estimation within a prescribed error tolerance δ . The lower bound is given on the basis of the Cramér-Rao inequality, where the quantum Fisher information is bounded by the squared evolution time. The upper bound is obtained by an explicit construction of estimation procedures. By comparing the cases with different numbers of Hamiltonian channels, we also find that the few-channel procedure with adaptive feedback and the many-channel procedure with entanglement are equivalent in the sense that they require the same amount of time resource up to a constant factor.

Low-dimensional Representation of Error Covariance

NASA Technical Reports Server (NTRS)

Tippett, Michael K.; Cohn, Stephen E.; Todling, Ricardo; Marchesin, Dan

2000-01-01

Ensemble and reduced-rank approaches to prediction and assimilation rely on low-dimensional approximations of the estimation error covariances. Here stability properties of the forecast/analysis cycle for linear, time-independent systems are used to identify factors that cause the steady-state analysis error covariance to admit a low-dimensional representation. A useful measure of forecast/analysis cycle stability is the bound matrix, a function of the dynamics, observation operator and assimilation method. Upper and lower estimates for the steady-state analysis error covariance matrix eigenvalues are derived from the bound matrix. The estimates generalize to time-dependent systems. If much of the steady-state analysis error variance is due to a few dominant modes, the leading eigenvectors of the bound matrix approximate those of the steady-state analysis error covariance matrix. The analytical results are illustrated in two numerical examples where the Kalman filter is carried to steady state. The first example uses the dynamics of a generalized advection equation exhibiting nonmodal transient growth. Failure to observe growing modes leads to increased steady-state analysis error variances. Leading eigenvectors of the steady-state analysis error covariance matrix are well approximated by leading eigenvectors of the bound matrix. The second example uses the dynamics of a damped baroclinic wave model. The leading eigenvectors of a lowest-order approximation of the bound matrix are shown to approximate well the leading eigenvectors of the steady-state analysis error covariance matrix.

Reduction from cost-sensitive ordinal ranking to weighted binary classification.

PubMed

Lin, Hsuan-Tien; Li, Ling

2012-05-01

We present a reduction framework from ordinal ranking to binary classification. The framework consists of three steps: extracting extended examples from the original examples, learning a binary classifier on the extended examples with any binary classification algorithm, and constructing a ranker from the binary classifier. Based on the framework, we show that a weighted 0/1 loss of the binary classifier upper-bounds the mislabeling cost of the ranker, both error-wise and regret-wise. Our framework allows not only the design of good ordinal ranking algorithms based on well-tuned binary classification approaches, but also the derivation of new generalization bounds for ordinal ranking from known bounds for binary classification. In addition, our framework unifies many existing ordinal ranking algorithms, such as perceptron ranking and support vector ordinal regression. When compared empirically on benchmark data sets, some of our newly designed algorithms enjoy advantages in terms of both training speed and generalization performance over existing algorithms. In addition, the newly designed algorithms lead to better cost-sensitive ordinal ranking performance, as well as improved listwise ranking performance.

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

NASA Technical Reports Server (NTRS)

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.

A False-name-Proof Double Auction Protocol for Arbitrary Evaluation Values

NASA Astrophysics Data System (ADS)

Sakurai, Yuko; Yokoo, Makoto

We develop a new false-name-proof double auction protocol called the Generalized Threshold Price Double auction (GTPD) protocol. False-name-proofness generalizes strategy-proofness by incorporating the possibility of false-name bids, e.g., bids submitted using multiple e-mail addresses. An existing protocol called TPD protocol is false-name-proof but can handle only the cases where marginal utilities of each agent always decrease, while our new GTPD protocol can handle arbitrary evaluation values. When marginal utilities can increase, some bids cannot be divided into a single unit (e.g., an all-or-nothing bid). Due to the existence of such indivisible bids, meeting supply/demand becomes difficult. Furthermore, a seller/buyer can submit a false-name-bid by pretending to be a potential buyer/seller to manipulate allocations and payments. In the GTPD protocol, the auctioneer is required to absorb the supply-demand imbalance up to a given upper-bound. Also, the GTPD incorporate a new false-name-proof one-sided auction protocol that is guaranteed to sell/buy a certain number of units. Simulation results show that when the threshold price is set appropriately, this protocol can obtain a good social surplus, and the number of absorbed units is much smaller than the given upper-bound.

Tri-critical behavior of the Blume-Emery-Griffiths model on a Kagomé lattice: Effective-field theory and Rigorous bounds

NASA Astrophysics Data System (ADS)

Santos, Jander P.; Sá Barreto, F. C.

2016-01-01

Spin correlation identities for the Blume-Emery-Griffiths model on Kagomé lattice are derived and combined with rigorous correlation inequalities lead to upper bounds on the critical temperature. From the spin correlation identities the mean field approximation and the effective field approximation results for the magnetization, the critical frontiers and the tricritical points are obtained. The rigorous upper bounds on the critical temperature improve over those effective-field type theories results.

Bounds for the Z-spectral radius of nonnegative tensors.

PubMed

He, Jun; Liu, Yan-Min; Ke, Hua; Tian, Jun-Kang; Li, Xiang

2016-01-01

In this paper, we have proposed some new upper bounds for the largest Z-eigenvalue of an irreducible weakly symmetric and nonnegative tensor, which improve the known upper bounds obtained in Chang et al. (Linear Algebra Appl 438:4166-4182, 2013), Song and Qi (SIAM J Matrix Anal Appl 34:1581-1595, 2013), He and Huang (Appl Math Lett 38:110-114, 2014), Li et al. (J Comput Anal Appl 483:182-199, 2015), He (J Comput Anal Appl 20:1290-1301, 2016).

Morphological representation of order-statistics filters.

PubMed

Charif-Chefchaouni, M; Schonfeld, D

1995-01-01

We propose a comprehensive theory for the morphological bounds on order-statistics filters (and their repeated iterations). Conditions are derived for morphological openings and closings to serve as bounds (lower and upper, respectively) on order-statistics filters (and their repeated iterations). Under various assumptions, morphological open-closings and close-openings are also shown to serve as (tighter) bounds (lower and upper, respectively) on iterations of order-statistics filters. Simulations of the application of the results presented to image restoration are finally provided.

Does space-time torsion determine the minimum mass of gravitating particles?

NASA Astrophysics Data System (ADS)

Böhmer, Christian G.; Burikham, Piyabut; Harko, Tiberiu; Lake, Matthew J.

2018-03-01

We derive upper and lower limits for the mass-radius ratio of spin-fluid spheres in Einstein-Cartan theory, with matter satisfying a linear barotropic equation of state, and in the presence of a cosmological constant. Adopting a spherically symmetric interior geometry, we obtain the generalized continuity and Tolman-Oppenheimer-Volkoff equations for a Weyssenhoff spin fluid in hydrostatic equilibrium, expressed in terms of the effective mass, density and pressure, all of which contain additional contributions from the spin. The generalized Buchdahl inequality, which remains valid at any point in the interior, is obtained, and general theoretical limits for the maximum and minimum mass-radius ratios are derived. As an application of our results we obtain gravitational red shift bounds for compact spin-fluid objects, which may (in principle) be used for observational tests of Einstein-Cartan theory in an astrophysical context. We also briefly consider applications of the torsion-induced minimum mass to the spin-generalized strong gravity model for baryons/mesons, and show that the existence of quantum spin imposes a lower bound for spinning particles, which almost exactly reproduces the electron mass.

Does space-time torsion determine the minimum mass of gravitating particles?

PubMed

Böhmer, Christian G; Burikham, Piyabut; Harko, Tiberiu; Lake, Matthew J

2018-01-01

We derive upper and lower limits for the mass-radius ratio of spin-fluid spheres in Einstein-Cartan theory, with matter satisfying a linear barotropic equation of state, and in the presence of a cosmological constant. Adopting a spherically symmetric interior geometry, we obtain the generalized continuity and Tolman-Oppenheimer-Volkoff equations for a Weyssenhoff spin fluid in hydrostatic equilibrium, expressed in terms of the effective mass, density and pressure, all of which contain additional contributions from the spin. The generalized Buchdahl inequality, which remains valid at any point in the interior, is obtained, and general theoretical limits for the maximum and minimum mass-radius ratios are derived. As an application of our results we obtain gravitational red shift bounds for compact spin-fluid objects, which may (in principle) be used for observational tests of Einstein-Cartan theory in an astrophysical context. We also briefly consider applications of the torsion-induced minimum mass to the spin-generalized strong gravity model for baryons/mesons, and show that the existence of quantum spin imposes a lower bound for spinning particles, which almost exactly reproduces the electron mass.

The upper bound of Pier Scour defined by selected laboratory and field data

USGS Publications Warehouse

Benedict, Stephen; Caldwell, Andral W.

2015-01-01

The U.S. Geological Survey, in cooperation with the South Carolina Department of Transportation, conducted several field investigations of pier scour in South Carolina (Benedict and Caldwell, 2006; Benedict and Caldwell, 2009) and used that data to develop envelope curves defining the upper bound of pier scour. To expand upon this previous work, an additional cooperative investigation was initiated to combine the South Carolina data with pier-scour data from other sources and evaluate the upper bound of pier scour with this larger data set. To facilitate this analysis, a literature review was made to identify potential sources of published pier-scour data, and selected data were compiled into a digital spreadsheet consisting of approximately 570 laboratory and 1,880 field measurements. These data encompass a wide range of laboratory and field conditions and represent field data from 24 states within the United States and six other countries. This extensive database was used to define the upper bound of pier-scour depth with respect to pier width encompassing the laboratory and field data. Pier width is a primary variable that influences pier-scour depth (Laursen and Toch, 1956; Melville and Coleman, 2000; Mueller and Wagner, 2005, Ettema et al. 2011, Arneson et al. 2012) and therefore, was used as the primary explanatory variable in developing the upper-bound envelope curve. The envelope curve provides a simple but useful tool for assessing the potential maximum pier-scour depth for pier widths of about 30 feet or less.

Bounds on the information rate of quantum-secret-sharing schemes

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

Sarvepalli, Pradeep

An important metric of the performance of a quantum-secret-sharing scheme is its information rate. Beyond the fact that the information rate is upper-bounded by one, very little is known in terms of bounds on the information rate of quantum-secret-sharing schemes. Furthermore, not every scheme can be realized with rate one. In this paper we derive upper bounds for the information rates of quantum-secret-sharing schemes. We show that there exist quantum access structures on n players for which the information rate cannot be better than O((log{sub 2}n)/n). These results are the quantum analogues of the bounds for classical-secret-sharing schemes proved bymore » Csirmaz.« less

The upper bound to the Relative Reporting Ratio—a measure of the impact of the violation of hidden assumptions underlying some disproportionality methods used in signal detection

PubMed Central

Van Holle, Lionel; Bauchau, Vincent

2014-01-01

Purpose For disproportionality measures based on the Relative Reporting Ratio (RRR) such as the Information Component (IC) and the Empirical Bayesian Geometrical Mean (EBGM), each product and event is assumed to represent a negligible fraction of the spontaneous report database (SRD). Here, we provide the tools for allowing signal detection experts to assess the consequence of the violation of this assumption on their specific SRD. Methods For each product–event pair (P–E), a worst-case scenario associated all the reported events-of-interest with the product of interest. The values of the RRR under this scenario were measured for different sets of stratification factors using the GlaxoSmithKline vaccines SRD. These values represent the RRR upper bound that RRR cannot exceed whatever the true strength of association. Results Depending on the choice of stratification factors, the RRR could not exceed an upper bound of 2 for up to 2.4% of the P–Es. For Engerix™, 23.4% of all reports in the SDR, the RRR could not exceed an upper bound of 2 for up to 13.8% of pairs. For the P–E Rotarix™-Intussusception, the choice of stratification factors impacted the upper bound to RRR: from 52.5 for an unstratified RRR to 2.0 for a fully stratified RRR. Conclusions The quantification of the upper bound can indicate whether measures such as EBGM, IC, or RRR can be used for SRD for which products or events represent a non-negligible fraction of the entire SRD. In addition, at the level of the product or P–E, it can also highlight detrimental impact of overstratification. © 2014 The Authors. Pharmacoepidemiology and Drug Safety published by John Wiley & Sons, Ltd. PMID:24395594

Quantum Kronecker sum-product low-density parity-check codes with finite rate

NASA Astrophysics Data System (ADS)

Kovalev, Alexey A.; Pryadko, Leonid P.

2013-07-01

We introduce an ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Zémor and generalized bicycle codes by MacKay as limiting cases. The construction allows for both the lower and the upper bounds on the minimum distance; they scale as a square root of the block length. Many thus defined codes have a finite rate and limited-weight stabilizer generators, an analog of classical low-density parity-check (LDPC) codes. Compared to the hypergraph-product codes, hyperbicycle codes generally have a wider range of parameters; in particular, they can have a higher rate while preserving the estimated error threshold.

Control design for robust stability in linear regulators: Application to aerospace flight control

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.

1986-01-01

Time domain stability robustness analysis and design for linear multivariable uncertain systems with bounded uncertainties is the central theme of the research. After reviewing the recently developed upper bounds on the linear elemental (structured), time varying perturbation of an asymptotically stable linear time invariant regulator, it is shown that it is possible to further improve these bounds by employing state transformations. Then introducing a quantitative measure called the stability robustness index, a state feedback conrol design algorithm is presented for a general linear regulator problem and then specialized to the case of modal systems as well as matched systems. The extension of the algorithm to stochastic systems with Kalman filter as the state estimator is presented. Finally an algorithm for robust dynamic compensator design is presented using Parameter Optimization (PO) procedure. Applications in a aircraft control and flexible structure control are presented along with a comparison with other existing methods.

WHAMII - An enumeration and insertion procedure with binomial bounds for the stochastic time-constrained traveling salesman problem

NASA Technical Reports Server (NTRS)

Dahl, Roy W.; Keating, Karen; Salamone, Daryl J.; Levy, Laurence; Nag, Barindra; Sanborn, Joan A.

1987-01-01

This paper presents an algorithm (WHAMII) designed to solve the Artificial Intelligence Design Challenge at the 1987 AIAA Guidance, Navigation and Control Conference. The problem under consideration is a stochastic generalization of the traveling salesman problem in which travel costs can incur a penalty with a given probability. The variability in travel costs leads to a probability constraint with respect to violating the budget allocation. Given the small size of the problem (eleven cities), an approach is considered that combines partial tour enumeration with a heuristic city insertion procedure. For computational efficiency during both the enumeration and insertion procedures, precalculated binomial probabilities are used to determine an upper bound on the actual probability of violating the budget constraint for each tour. The actual probability is calculated for the final best tour, and additional insertions are attempted until the actual probability exceeds the bound.

Bounds of memory strength for power-law series.

PubMed

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<α≤3, as α grows bigger, the upper bound increases from 0 to +1 while the lower bound 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.

Bounds of memory strength for power-law series

NASA Astrophysics Data System (ADS)

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 <α ≤3 , as α grows bigger, the upper bound increases from 0 to +1 while the lower bound 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.

Relations between work and entropy production for general information-driven, finite-state engines

NASA Astrophysics Data System (ADS)

Merhav, Neri

2017-02-01

We consider a system model of a general finite-state machine (ratchet) that simultaneously interacts with three kinds of reservoirs: a heat reservoir, a work reservoir, and an information reservoir, the latter being taken to be a running digital tape whose symbols interact sequentially with the machine. As has been shown in earlier work, this finite-state machine can act as a demon (with memory), which creates a net flow of energy from the heat reservoir into the work reservoir (thus extracting useful work) at the price of increasing the entropy of the information reservoir. Under very few assumptions, we propose a simple derivation of a family of inequalities that relate the work extraction with the entropy production. These inequalities can be seen as either upper bounds on the extractable work or as lower bounds on the entropy production, depending on the point of view. Many of these bounds are relatively easy to calculate and they are tight in the sense that equality can be approached arbitrarily closely. In their basic forms, these inequalities are applicable to any finite number of cycles (and not only asymptotically), and for a general input information sequence (possibly correlated), which is not necessarily assumed even stationary. Several known results are obtained as special cases.

Bound of dissipation on a plane Couette dynamo

NASA Astrophysics Data System (ADS)

Alboussière, Thierry

2009-06-01

Variational turbulence is among the few approaches providing rigorous results in turbulence. In addition, it addresses a question of direct practical interest, namely, the rate of energy dissipation. Unfortunately, only an upper bound is obtained as a larger functional space than the space of solutions to the Navier-Stokes equations is searched. Yet, in some cases, this upper bound is in good agreement with experimental results in terms of order of magnitude and power law of the imposed Reynolds number. In this paper, the variational approach to turbulence is extended to the case of dynamo action and an upper bound is obtained for the global dissipation rate (viscous and Ohmic). A simple plane Couette flow is investigated. For low magnetic Prandtl number Pm fluids, the upper bound of energy dissipation is that of classical turbulence (i.e., proportional to the cubic power of the shear velocity) for magnetic Reynolds numbers below Pm-1 and follows a steeper evolution for magnetic Reynolds numbers above Pm-1 (i.e., proportional to the shear velocity to the power of 4) in the case of electrically insulating walls. However, the effect of wall conductance is crucial: for a given value of wall conductance, there is a value for the magnetic Reynolds number above which energy dissipation cannot be bounded. This limiting magnetic Reynolds number is inversely proportional to the square root of the conductance of the wall. Implications in terms of energy dissipation in experimental and natural dynamos are discussed.

Limitations of the background field method applied to Rayleigh-Bénard convection

NASA Astrophysics Data System (ADS)

Nobili, Camilla; Otto, Felix

2017-09-01

We consider Rayleigh-Bénard convection as modeled by the Boussinesq equations, in the case of infinite Prandtl numbers and with no-slip boundary condition. There is a broad interest in bounds of the upwards heat flux, as given by the Nusselt number Nu, in terms of the forcing via the imposed temperature difference, as given by the Rayleigh number in the turbulent regime Ra ≫ 1 . In several studies, the background field method applied to the temperature field has been used to provide upper bounds on Nu in terms of Ra. In these applications, the background field method comes in the form of a variational problem where one optimizes a stratified temperature profile subject to a certain stability condition; the method is believed to capture the marginal stability of the boundary layer. The best available upper bound via this method is Nu ≲Ra/1 3 ( ln R a )/1 15 ; it proceeds via the construction of a stable temperature background profile that increases logarithmically in the bulk. In this paper, we show that the background temperature field method cannot provide a tighter upper bound in terms of the power of the logarithm. However, by another method, one does obtain the tighter upper bound Nu ≲ Ra /1 3 ( ln ln Ra ) /1 3 so that the result of this paper implies that the background temperature field method is unphysical in the sense that it cannot provide the optimal bound.

Effect of minimal length uncertainty on the mass-radius relation of white dwarfs

NASA Astrophysics Data System (ADS)

Mathew, Arun; Nandy, Malay K.

2018-06-01

Generalized uncertainty relation that carries the imprint of quantum gravity introduces a minimal length scale into the description of space-time. It effectively changes the invariant measure of the phase space through a factor (1 + βp2) - 3 so that the equation of state for an electron gas undergoes a significant modification from the ideal case. It has been shown in the literature (Rashidi 2016) that the ideal Chandrasekhar limit ceases to exist when the modified equation of state due to the generalized uncertainty is taken into account. To assess the situation in a more complete fashion, we analyze in detail the mass-radius relation of Newtonian white dwarfs whose hydrostatic equilibria are governed by the equation of state of the degenerate relativistic electron gas subjected to the generalized uncertainty principle. As the constraint of minimal length imposes a severe restriction on the availability of high momentum states, it is speculated that the central Fermi momentum cannot have values arbitrarily higher than pmax ∼β - 1 / 2. When this restriction is imposed, it is found that the system approaches limiting mass values higher than the Chandrasekhar mass upon decreasing the parameter β to a value given by a legitimate upper bound. Instead, when the more realistic restriction due to inverse β-decay is considered, it is found that the mass and radius approach the values 1.4518 M⊙ and 601.18 km near the legitimate upper bound for the parameter β.

Upper-Bound Estimates Of SEU in CMOS

NASA Technical Reports Server (NTRS)

Edmonds, Larry D.

1990-01-01

Theory of single-event upsets (SEU) (changes in logic state caused by energetic charged subatomic particles) in complementary metal oxide/semiconductor (CMOS) logic devices extended to provide upper-bound estimates of rates of SEU when limited experimental information available and configuration and dimensions of SEU-sensitive regions of devices unknown. Based partly on chord-length-distribution method.

An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution

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

Datta, Nilanjana, E-mail: n.datta@statslab.cam.ac.uk; Hsieh, Min-Hsiu, E-mail: Min-Hsiu.Hsieh@uts.edu.au; Oppenheim, Jonathan, E-mail: j.oppenheim@ucl.ac.uk

State redistribution is the protocol in which given an arbitrary tripartite quantum state, with two of the subsystems initially being with Alice and one being with Bob, the goal is for Alice to send one of her subsystems to Bob, possibly with the help of prior shared entanglement. We derive an upper bound on the second order asymptotic expansion for the quantum communication cost of achieving state redistribution with a given finite accuracy. In proving our result, we also obtain an upper bound on the quantum communication cost of this protocol in the one-shot setting, by using the protocol ofmore » coherent state merging as a primitive.« less

Bounds on strong field magneto-transport in three-dimensional composites

NASA Astrophysics Data System (ADS)

Briane, Marc; Milton, Graeme W.

2011-10-01

This paper deals with bounds satisfied by the effective non-symmetric conductivity of three-dimensional composites in the presence of a strong magnetic field. On the one hand, it is shown that for general composites the antisymmetric part of the effective conductivity cannot be bounded solely in terms of the antisymmetric part of the local conductivity, contrary to the columnar case studied by Briane and Milton [SIAM J. Appl. Math. 70(8), 3272-3286 (2010), 10.1137/100798090]. Thus a suitable rank-two laminate, the conductivity of which has a bounded antisymmetric part together with a high-contrast symmetric part, may generate an arbitrarily large antisymmetric part of the effective conductivity. On the other hand, bounds are provided which show that the antisymmetric part of the effective conductivity must go to zero if the upper bound on the antisymmetric part of the local conductivity goes to zero, and the symmetric part of the local conductivity remains bounded below and above. Elementary bounds on the effective moduli are derived assuming the local conductivity and the effective conductivity have transverse isotropy in the plane orthogonal to the magnetic field. New Hashin-Shtrikman type bounds for two-phase three-dimensional composites with a non-symmetric conductivity are provided under geometric isotropy of the microstructure. The derivation of the bounds is based on a particular variational principle symmetrizing the problem, and the use of Y-tensors involving the averages of the fields in each phase.

A Maximal Element Theorem in FWC-Spaces and Its Applications

PubMed Central

Hu, Qingwen; Miao, Yulin

2014-01-01

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

Evaluating the Potential Importance of Monoterpene Degradation for Global Acetone Production

NASA Astrophysics Data System (ADS)

Kelp, M. M.; Brewer, J.; Keller, C. A.; Fischer, E. V.

2015-12-01

Acetone is one of the most abundant volatile organic compounds (VOCs) in the atmosphere, but estimates of the global source of acetone vary widely. A better understanding of acetone sources is essential because acetone serves as a source of HOx in the upper troposphere and as a precursor to the NOx reservoir species peroxyacetyl nitrate (PAN). Although there are primary anthropogenic and pyrogenic sources of acetone, the dominant acetone sources are thought to be from direct biogenic emissions and photochemical production, particularly from the oxidation of iso-alkanes. Recent work suggests that the photochemical degradation of monoterpenes may also represent a significant contribution to global acetone production. We investigate that hypothesis using the GEOS-Chem chemical transport model. In this work, we calculate the emissions of eight terpene species (α-pinene, β-pinene, limonene, Δ3-carene, myrcene, sabinene, trans-β-ocimene, and an 'other monoterpenes' category which contains 34 other trace species) and couple these with upper and lower bound literature yields from species-specific chamber studies. We compare the simulated acetone distributions against in situ acetone measurements from a global suite of NASA aircraft campaigns. When simulating an upper bound on yields, the model-to-measurement comparison improves for North America at both the surface and in the upper troposphere. The inclusion of acetone production from monoterpene degradation also improves the ability of the model to reproduce observations of acetone in East Asian outflow. However, in general the addition of monoterpenes degrades the model comparison for the Southern Hemisphere.

Improved bounds on the energy-minimizing strains in martensitic polycrystals

NASA Astrophysics Data System (ADS)

Peigney, Michaël

2016-07-01

This paper is concerned with the theoretical prediction of the energy-minimizing (or recoverable) strains in martensitic polycrystals, considering a nonlinear elasticity model of phase transformation at finite strains. The main results are some rigorous upper bounds on the set of energy-minimizing strains. Those bounds depend on the polycrystalline texture through the volume fractions of the different orientations. The simplest form of the bounds presented is obtained by combining recent results for single crystals with a homogenization approach proposed previously for martensitic polycrystals. However, the polycrystalline bound delivered by that procedure may fail to recover the monocrystalline bound in the homogeneous limit, as is demonstrated in this paper by considering an example related to tetragonal martensite. This motivates the development of a more detailed analysis, leading to improved polycrystalline bounds that are notably consistent with results for single crystals in the homogeneous limit. 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.

Solving Open Job-Shop Scheduling Problems by SAT Encoding

NASA Astrophysics Data System (ADS)

Koshimura, Miyuki; Nabeshima, Hidetomo; Fujita, Hiroshi; Hasegawa, Ryuzo

This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3, and YN4. We proved that the best known upper bounds 678 of ABZ9 and 884 of YN1 are indeed optimal. We also improved the upper bound of YN2 and lower bounds of ABZ8, YN2, YN3 and YN4.

Upper and lower bounds for semi-Markov reliability models of reconfigurable systems

NASA Technical Reports Server (NTRS)

White, A. L.

1984-01-01

This paper determines the information required about system recovery to compute the reliability of a class of reconfigurable systems. Upper and lower bounds are derived for these systems. The class consists of those systems that satisfy five assumptions: the components fail independently at a low constant rate, fault occurrence and system reconfiguration are independent processes, the reliability model is semi-Markov, the recovery functions which describe system configuration have small means and variances, and the system is well designed. The bounds are easy to compute, and examples are included.

The Laughlin liquid in an external potential

NASA Astrophysics Data System (ADS)

Rougerie, Nicolas; Yngvason, Jakob

2018-04-01

We study natural perturbations of the Laughlin state arising from the effects of trapping and disorder. These are N-particle wave functions that have the form of a product of Laughlin states and analytic functions of the N variables. We derive an upper bound to the ground state energy in a confining external potential, matching exactly a recently derived lower bound in the large N limit. Irrespective of the shape of the confining potential, this sharp upper bound can be achieved through a modification of the Laughlin function by suitably arranged quasi-holes.

Determining Normal-Distribution Tolerance Bounds Graphically

NASA Technical Reports Server (NTRS)

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.

On base station cooperation using statistical CSI in jointly correlated MIMO downlink channels

NASA Astrophysics Data System (ADS)

Zhang, Jun; Jiang, Bin; Jin, Shi; Gao, Xiqi; Wong, Kai-Kit

2012-12-01

This article studies the transmission of a single cell-edge user's signal using statistical channel state information at cooperative base stations (BSs) with a general jointly correlated multiple-input multiple-output (MIMO) channel model. We first present an optimal scheme to maximize the ergodic sum capacity with per-BS power constraints, revealing that the transmitted signals of all BSs are mutually independent and the optimum transmit directions for each BS align with the eigenvectors of the BS's own transmit correlation matrix of the channel. Then, we employ matrix permanents to derive a closed-form tight upper bound for the ergodic sum capacity. Based on these results, we develop a low-complexity power allocation solution using convex optimization techniques and a simple iterative water-filling algorithm (IWFA) for power allocation. Finally, we derive a necessary and sufficient condition for which a beamforming approach achieves capacity for all BSs. Simulation results demonstrate that the upper bound of ergodic sum capacity is tight and the proposed cooperative transmission scheme increases the downlink system sum capacity considerably.

The upper bound of abutment scour defined by selected laboratory and field data

USGS Publications Warehouse

Benedict, Stephen; Caldwell, Andral W.

2015-01-01

The U.S. Geological Survey, in cooperation with the South Carolina Department of Transportation, conducted a field investigation of abutment scour in South Carolina and used that data to develop envelope curves defining the upper bound of abutment scour. To expand upon this previous work, an additional cooperative investigation was initiated to combine the South Carolina data with abutment-scour data from other sources and evaluate the upper bound of abutment scour with the larger data set. To facilitate this analysis, a literature review was made to identify potential sources of published abutment-scour data, and selected data, consisting of 446 laboratory and 331 field measurements, were compiled for the analysis. These data encompassed a wide range of laboratory and field conditions and represent field data from 6 states within the United States. The data set was used to evaluate the South Carolina abutment-scour envelope curves. Additionally, the data were used to evaluate a dimensionless abutment-scour envelope curve developed by Melville (1992), highlighting the distinct difference in the upper bound for laboratory and field data. The envelope curves evaluated in this investigation provide simple but useful tools for assessing the potential maximum abutment-scour depth in the field setting.

Symmetry Parameter Constraints from a Lower Bound on Neutron-matter Energy

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

Tews, Ingo; Lattimer, James M.; Ohnishi, Akira

We propose the existence of a lower bound on the energy of pure neutron matter (PNM) on the basis of unitary-gas considerations. We discuss its justification from experimental studies of cold atoms as well as from theoretical studies of neutron matter. We demonstrate that this bound results in limits to the density-dependent symmetry energy, which is the difference between the energies of symmetric nuclear matter and PNM. In particular, this bound leads to a lower limit to the volume symmetry energy parameter S {sub 0}. In addition, for assumed values of S {sub 0} above this minimum, this bound impliesmore » both upper and lower limits to the symmetry energy slope parameter L , which describes the lowest-order density dependence of the symmetry energy. A lower bound on neutron-matter incompressibility is also obtained. These bounds are found to be consistent with both recent calculations of the energies of PNM and constraints from nuclear experiments. Our results are significant because several equations of state that are currently used in astrophysical simulations of supernovae and neutron star mergers, as well as in nuclear physics simulations of heavy-ion collisions, have symmetry energy parameters that violate these bounds. Furthermore, below the nuclear saturation density, the bound on neutron-matter energies leads to a lower limit to the density-dependent symmetry energy, which leads to upper limits to the nuclear surface symmetry parameter and the neutron-star crust–core boundary. We also obtain a lower limit to the neutron-skin thicknesses of neutron-rich nuclei. Above the nuclear saturation density, the bound on neutron-matter energies also leads to an upper limit to the symmetry energy, with implications for neutron-star cooling via the direct Urca process.« less

Computational experience with a parallel algorithm for tetrangle inequality bound smoothing.

PubMed

Rajan, K; Deo, N

1999-09-01

Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the 2(n(n-1)) atom pairs, using NMR. Given the bounds so obtained on the distances between some of the atom pairs, it is often useful to compute tighter bounds on all the 2(n(n-1)) pairwise distances. This process is referred to as bound smoothing. The initial lower and upper bounds for the pairwise distances not measured are usually assumed to be 0 and infinity. One method for bound smoothing is to use the limits imposed by the triangle inequality. The distance bounds so obtained can often be tightened further by applying the tetrangle inequality--the limits imposed on the six pairwise distances among a set of four atoms (instead of three for the triangle inequalities). The tetrangle inequality is expressed by the Cayley-Menger determinants. For every quadruple of atoms, each pass of the tetrangle inequality bound smoothing procedure finds upper and lower limits on each of the six distances in the quadruple. Applying the tetrangle inequalities to each of the (4n) quadruples requires O(n4) time. Here, we propose a parallel algorithm for bound smoothing employing the tetrangle inequality. Each pass of our algorithm requires O(n3 log n) time on a REW PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine) with O(log(n)n) processors. An implementation of this parallel algorithm on the Intel Paragon XP/S and its performance are also discussed.

Symmetry Parameter Constraints from a Lower Bound on Neutron-matter Energy

NASA Astrophysics Data System (ADS)

Tews, Ingo; Lattimer, James M.; Ohnishi, Akira; Kolomeitsev, Evgeni E.

2017-10-01

We propose the existence of a lower bound on the energy of pure neutron matter (PNM) on the basis of unitary-gas considerations. We discuss its justification from experimental studies of cold atoms as well as from theoretical studies of neutron matter. We demonstrate that this bound results in limits to the density-dependent symmetry energy, which is the difference between the energies of symmetric nuclear matter and PNM. In particular, this bound leads to a lower limit to the volume symmetry energy parameter S 0. In addition, for assumed values of S 0 above this minimum, this bound implies both upper and lower limits to the symmetry energy slope parameter L ,which describes the lowest-order density dependence of the symmetry energy. A lower bound on neutron-matter incompressibility is also obtained. These bounds are found to be consistent with both recent calculations of the energies of PNM and constraints from nuclear experiments. Our results are significant because several equations of state that are currently used in astrophysical simulations of supernovae and neutron star mergers, as well as in nuclear physics simulations of heavy-ion collisions, have symmetry energy parameters that violate these bounds. Furthermore, below the nuclear saturation density, the bound on neutron-matter energies leads to a lower limit to the density-dependent symmetry energy, which leads to upper limits to the nuclear surface symmetry parameter and the neutron-star crust-core boundary. We also obtain a lower limit to the neutron-skin thicknesses of neutron-rich nuclei. Above the nuclear saturation density, the bound on neutron-matter energies also leads to an upper limit to the symmetry energy, with implications for neutron-star cooling via the direct Urca process.

Solving the muon g -2 anomaly in deflected anomaly mediated SUSY breaking with messenger-matter interactions

NASA Astrophysics Data System (ADS)

Wang, Fei; Wang, Wenyu; Yang, Jin Min

2017-10-01

We propose to introduce general messenger-matter interactions in the deflected anomaly mediated supersymmetry (SUSY) breaking (AMSB) scenario to explain the gμ-2 anomaly. Scenarios with complete or incomplete grand unified theory (GUT) multiplet messengers are discussed, respectively. The introduction of incomplete GUT mulitiplets can be advantageous in various aspects. We found that the gμ-2 anomaly can be solved in both scenarios under current constraints including the gluino mass bounds, while the scenarios with incomplete GUT representation messengers are more favored by the gμ-2 data. We also found that the gluino is upper bounded by about 2.5 TeV (2.0 TeV) in scenario A and 3.0 TeV (2.7 TeV) in scenario B if the generalized deflected AMSB scenarios are used to fully account for the gμ-2 anomaly at 3 σ (2 σ ) level. Such a gluino should be accessible in the future LHC searches. Dark matter (DM) constraints, including DM relic density and direct detection bounds, favor scenario B with incomplete GUT multiplets. Much of the allowed parameter space for scenario B could be covered by the future DM direct detection experiments.

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

NASA Astrophysics Data System (ADS)

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

A note on the WGC, effective field theory and clockwork within string theory

NASA Astrophysics Data System (ADS)

Ibáñez, Luis E.; Montero, Miguel

2018-02-01

It has been recently argued that Higgsing of theories with U(1) n gauge interactions consistent with the Weak Gravity Conjecture (WGC) may lead to effective field theories parametrically violating WGC constraints. The minimal examples typically involve Higgs scalars with a large charge with respect to a U(1) (e.g. charges ( Z, 1) in U(1)2 with Z ≫ 1). This type of Higgs multiplets play also a key role in clockwork U(1) theories. We study these issues in the context of heterotic string theory and find that, even if there is no new physics at the standard magnetic WGC scale Λ ˜ g IR M P , the string scale is just slightly above, at a scale ˜ √{k_{IR}}Λ. Here k IR is the level of the IR U(1) worldsheet current. We show that, unlike the standard magnetic cutoff, this bound is insensitive to subsequent Higgsing. One may argue that this constraint gives rise to no bound at the effective field theory level since k IR is model dependent and in general unknown. However there is an additional constraint to be taken into account, which is that the Higgsing scalars with large charge Z should be part of the string massless spectrum, which becomes an upper bound k IR ≤ k 0 2 , where k 0 is the level of the UV currents. Thus, for fixed k 0, Z cannot be made parametrically large. The upper bound on the charges Z leads to limitations on the size and structure of hierarchies in an iterated U(1) clockwork mechanism.

Rapidly assessing the probability of exceptionally high natural hazard losses

NASA Astrophysics Data System (ADS)

Gollini, Isabella; Rougier, Jonathan

2014-05-01

One of the objectives in catastrophe modeling is to assess the probability distribution of losses for a specified period, such as a year. From the point of view of an insurance company, the whole of the loss distribution is interesting, and valuable in determining insurance premiums. But the shape of the righthand tail is critical, because it impinges on the solvency of the company. A simple measure of the risk of insolvency is the probability that the annual loss will exceed the company's current operating capital. Imposing an upper limit on this probability is one of the objectives of the EU Solvency II directive. If a probabilistic model is supplied for the loss process, then this tail probability can be computed, either directly, or by simulation. This can be a lengthy calculation for complex losses. Given the inevitably subjective nature of quantifying loss distributions, computational resources might be better used in a sensitivity analysis. This requires either a quick approximation to the tail probability or an upper bound on the probability, ideally a tight one. We present several different bounds, all of which can be computed nearly instantly from a very general event loss table. We provide a numerical illustration, and discuss the conditions under which the bound is tight. Although we consider the perspective of insurance and reinsurance companies, exactly the same issues concern the risk manager, who is typically very sensitive to large losses.

Measures of disturbance and incompatibility for quantum measurements

NASA Astrophysics Data System (ADS)

Mandayam, Prabha; Srinivas, M. D.

2014-06-01

We propose a class of incompatibility measures for quantum observables based on quantifying the effect of a measurement of one observable on the statistics of the outcomes of another. Specifically, for a pair of observables A and B with purely discrete spectra, we compare the following two probability distributions: one resulting from a measurement of A followed by a measurement of B on a given state and the other obtained from a measurement of B alone on the same state. We show that maximizing the distance between these two distributions over all states yields a valid measure of the incompatibility of observables A and B, which is zero if and only if they commute and is strictly greater than zero (and less than or equal to one) otherwise. For finite-dimensional systems, we obtain a tight upper bound on the incompatibility of any pair of observables and show that the bound is attained when the observables are totally nondegenerate and associated with mutually unbiased bases. In the process, we also establish an important relation between the incompatibility of a pair of observables and the maximal disturbances due to their measurements. Finally, we indicate how these measures of incompatibility and disturbance can be extended to the more general class of nonprojective measurements. In particular, we obtain a nontrivial upper bound on the incompatibility of one Lüders instrument with another.

Generalization Performance of Regularized Ranking With Multiscale Kernels.

PubMed

Zhou, Yicong; Chen, Hong; Lan, Rushi; Pan, Zhibin

2016-05-01

The regularized kernel method for the ranking problem has attracted increasing attentions in machine learning. The previous regularized ranking algorithms are usually based on reproducing kernel Hilbert spaces with a single kernel. In this paper, we go beyond this framework by investigating the generalization performance of the regularized ranking with multiscale kernels. A novel ranking algorithm with multiscale kernels is proposed and its representer theorem is proved. We establish the upper bound of the generalization error in terms of the complexity of hypothesis spaces. It shows that the multiscale ranking algorithm can achieve satisfactory learning rates under mild conditions. Experiments demonstrate the effectiveness of the proposed method for drug discovery and recommendation tasks.

Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas

DTIC Science & Technology

2014-03-27

research in Artifical Intelligence (Section 2.1) and why games are studied (Section 2.2). Section 2.3 discusses how games are played and solved. An...5 2.1 Games in Artificial Intelligence . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Game Study...Artificial Intelligence UCT Upper Confidence Bounds applied to Trees HUCT Heuristic Guided UCT LOA Lines of Action UCB Upper Confidence Bound RAVE Rapid

The Estimation of the IRT Reliability Coefficient and Its Lower and Upper Bounds, with Comparisons to CTT Reliability Statistics

ERIC Educational Resources Information Center

Kim, Seonghoon; Feldt, Leonard S.

2010-01-01

The primary purpose of this study is to investigate the mathematical characteristics of the test reliability coefficient rho[subscript XX'] as a function of item response theory (IRT) parameters and present the lower and upper bounds of the coefficient. Another purpose is to examine relative performances of the IRT reliability statistics and two…

Multivariate Lipschitz optimization: Survey and computational comparison

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

Hansen, P.; Gourdin, E.; Jaumard, B.

1994-12-31

Many methods have been proposed to minimize a multivariate Lipschitz function on a box. They pertain the three approaches: (i) reduction to the univariate case by projection (Pijavskii) or by using a space-filling curve (Strongin); (ii) construction and refinement of a single upper bounding function (Pijavskii, Mladineo, Mayne and Polak, Jaumard Hermann and Ribault, Wood...); (iii) branch and bound with local upper bounding functions (Galperin, Pint{acute e}r, Meewella and Mayne, the present authors). A survey is made, stressing similarities of algorithms, expressed when possible within a unified framework. Moreover, an extensive computational comparison is reported on.

Numerical and analytical bounds on threshold error rates for hypergraph-product codes

NASA Astrophysics Data System (ADS)

Kovalev, Alexey A.; Prabhakar, Sanjay; Dumer, Ilya; Pryadko, Leonid P.

2018-06-01

We study analytically and numerically decoding properties of finite-rate hypergraph-product quantum low density parity-check codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several nontrivial lower and upper bounds for the decodable region are constructed analytically by analyzing the properties of the homological difference, equal minus the logarithm of the maximum-likelihood decoding probability for a given syndrome. Numerical results include an upper bound for the decodable region from specific heat calculations in associated Ising models and a minimum-weight decoding threshold of approximately 7 % .

Computational micromechanics of woven composites

NASA Technical Reports Server (NTRS)

Hopkins, Dale A.; Saigal, Sunil; Zeng, Xiaogang

1991-01-01

The bounds on the equivalent elastic material properties of a composite are presently addressed by a unified energy approach which is valid for both unidirectional and 2D and 3D woven composites. The unit cell considered is assumed to consist, first, of the actual composite arrangement of the fibers and matrix material, and then, of an equivalent pseudohomogeneous material. Equating the strain energies due to the two arrangements yields an estimate of the upper bound for the material equivalent properties; successive increases in the order of displacement field that is assumed in the composite arrangement will successively produce improved upper bound estimates.

Upper bounds on the photon mass

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

Accioly, Antonio; Group of Field Theory from First Principles, Sao Paulo State University; Instituto de Fisica Teorica

2010-09-15

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.

Estimating the Richness of a Population When the Maximum Number of Classes Is Fixed: A Nonparametric Solution to an Archaeological Problem

PubMed Central

Eren, Metin I.; Chao, Anne; Hwang, Wen-Han; Colwell, Robert K.

2012-01-01

Background Estimating assemblage species or class richness from samples remains a challenging, but essential, goal. Though a variety of statistical tools for estimating species or class richness have been developed, they are all singly-bounded: assuming only a lower bound of species or classes. Nevertheless there are numerous situations, particularly in the cultural realm, where the maximum number of classes is fixed. For this reason, a new method is needed to estimate richness when both upper and lower bounds are known. Methodology/Principal Findings Here, we introduce a new method for estimating class richness: doubly-bounded confidence intervals (both lower and upper bounds are known). We specifically illustrate our new method using the Chao1 estimator, rarefaction, and extrapolation, although any estimator of asymptotic richness can be used in our method. Using a case study of Clovis stone tools from the North American Lower Great Lakes region, we demonstrate that singly-bounded richness estimators can yield confidence intervals with upper bound estimates larger than the possible maximum number of classes, while our new method provides estimates that make empirical sense. Conclusions/Significance Application of the new method for constructing doubly-bound richness estimates of Clovis stone tools permitted conclusions to be drawn that were not otherwise possible with singly-bounded richness estimates, namely, that Lower Great Lakes Clovis Paleoindians utilized a settlement pattern that was probably more logistical in nature than residential. However, our new method is not limited to archaeological applications. It can be applied to any set of data for which there is a fixed maximum number of classes, whether that be site occupancy models, commercial products (e.g. athletic shoes), or census information (e.g. nationality, religion, age, race). PMID:22666316

Upper bound on the Abelian gauge coupling from asymptotic safety

NASA Astrophysics Data System (ADS)

Eichhorn, Astrid; Versteegen, Fleur

2018-01-01

We explore the impact of asymptotically safe quantum gravity on the Abelian gauge coupling in a model including a charged scalar, confirming indications that asymptotically safe quantum fluctuations of gravity could trigger a power-law running towards a free fixed point for the gauge coupling above the Planck scale. Simultaneously, quantum gravity fluctuations balance against matter fluctuations to generate an interacting fixed point, which acts as a boundary of the basin of attraction of the free fixed point. This enforces an upper bound on the infrared value of the Abelian gauge coupling. In the regime of gravity couplings which in our approximation also allows for a prediction of the top quark and Higgs mass close to the experimental value [1], we obtain an upper bound approximately 35% above the infrared value of the hypercharge coupling in the Standard Model.

Limits of Gaussian fluctuations in the cosmic microwave background at 19.2 GHz

NASA Technical Reports Server (NTRS)

Boughn, S. P.; Cheng, E. S.; Cottingham, D. A.; Fixsen, D. J.

1992-01-01

The Northern Hemisphere data from the 19.2 GHz full sky survey are analyzed to place limits on the magnitude of Gaussian fluctuations in the cosmic microwave background implied by a variety of correlation functions. Included among the models tested are the monochromatic and Gaussian-shaped families, and those with power-law spectra for n values between -2 and 1. An upper bound is placed on the quadrupole anisotropy of Delta T/T less than 3.2 x 10 exp -5 rms, and an upper bound on scale-invariant (n = 1) fluctuations of a2 less than 4.5 x 10 exp -5 (95 percent confidence level). There is significant contamination of these data from Galactic emission, and improvement of the modeling of the Galaxy could yield a significant reduction of these upper bounds.

Limits on Gaussian fluctuations in the cosmic microwave background at 19.2 GHz

NASA Technical Reports Server (NTRS)

Boughn, S. P.; Cheng, E. S.; Cottingham, D. A.; Fixsen, D. J.

1991-01-01

The Northern Hemisphere data from the 19.2 GHz full sky survey are analyzed to place limits on the magnitude of Gaussian fluctuations in the cosmic microwave background implied by a variety of correlation functions. Included among the models tested are the monochromatic and Gaussian-shaped families, and those with power law spectra for n from -2 to 1. We place an upper bound on the quadrupole anisotropy of DeltaT/T less than 3.2 x 10 exp -5 rms, and an upper bound on scale-invariant (n = 1) fluctuations of a2 less than 4.5 x 10 exp -5 (95 percent confidence level). There is significant contamination of these data from Galactic emission, and improvement of our modeling of the Galaxy could yield a significant reduction of these upper bounds.

Complexity Bounds for Quantum Computation

DTIC Science & Technology

2007-06-22

Programs Trustees of Boston University Boston, MA 02215 - Complexity Bounds for Quantum Computation REPORT DOCUMENTATION PAGE 18. SECURITY CLASSIFICATION...Complexity Bounds for Quantum Comp[utation Report Title ABSTRACT This project focused on upper and lower bounds for quantum computability using constant...classical computation models, particularly emphasizing new examples of where quantum circuits are more powerful than their classical counterparts. A second

Large number limit of multifield inflation

NASA Astrophysics Data System (ADS)

Guo, Zhong-Kai

2017-12-01

We compute the tensor and scalar spectral index nt, ns, the tensor-to-scalar ratio r , and the consistency relation nt/r in the general monomial multifield slow-roll inflation models with potentials V ˜∑iλi|ϕi| pi . The general models give a novel relation that nt, ns and nt/r are all proportional to the logarithm of the number of fields Nf when Nf is getting extremely large with the order of magnitude around O (1040). An upper bound Nf≲N*eZ N* is given by requiring the slow variation parameter small enough where N* is the e -folding number and Z is a function of distributions of λi and pi. Besides, nt/r differs from the single-field result -1 /8 with substantial probability except for a few very special cases. Finally, we derive theoretical bounds r >2 /N* (r ≳0.03 ) and for nt, which can be tested by observation in the near future.

Application of the relative energy release criteria to enclosure fire testing. [aircraft compartments

NASA Technical Reports Server (NTRS)

Roschke, E. J.; Coulbert, C. D.

1979-01-01

The five relative energy release criteria (RERC) which are a first step towards formulating a unified concept that can be applied to the development of fires in enclosures, place upper bounds on the rate and amount of energy released during a fire. They are independent, calculated readily, and may be applied generally to any enclosure regardless of size. They are useful in pretest planning and for interpreting experimental data. Data from several specific fire test programs were examined to evaluate the potential use of RERC to provide test planning guidelines. The RERC were compared with experimental data obtained in full-scale enclosures. These results confirm that in general the RERC do identify the proper limiting constraints on enclosure fire development and determine the bounds of the fire development envelope. Plotting actual fire data against the RERC reveals new valid insights into fire behavior and reveals the controlling constraints in fire development. The RERC were calculated and plotted for several descrpitions of full-scale fires in various aircraft compartments.

Upper Bound on Diffusivity

NASA Astrophysics Data System (ADS)

Hartman, Thomas; Hartnoll, Sean A.; Mahajan, Raghu

2017-10-01

The linear growth of operators in local quantum systems leads to an effective light cone even if the system is nonrelativistic. We show that the consistency of diffusive transport with this light cone places an upper bound on the diffusivity: D ≲v2τeq. The operator growth velocity v defines the light cone, and τeq is the local equilibration time scale, beyond which the dynamics of conserved densities is diffusive. We verify that the bound is obeyed in various weakly and strongly interacting theories. In holographic models, this bound establishes a relation between the hydrodynamic and leading nonhydrodynamic quasinormal modes of planar black holes. Our bound relates transport data—including the electrical resistivity and the shear viscosity—to the local equilibration time, even in the absence of a quasiparticle description. In this way, the bound sheds light on the observed T -linear resistivity of many unconventional metals, the shear viscosity of the quark-gluon plasma, and the spin transport of unitary fermions.

Intrinsic upper bound on two-qubit polarization entanglement predetermined by pump polarization correlations in parametric down-conversion

NASA Astrophysics Data System (ADS)

Kulkarni, Girish; Subrahmanyam, V.; Jha, Anand K.

2016-06-01

We study how one-particle correlations transfer to manifest as two-particle correlations in the context of parametric down-conversion (PDC), a process in which a pump photon is annihilated to produce two entangled photons. We work in the polarization degree of freedom and show that for any two-qubit generation process that is both trace-preserving and entropy-nondecreasing, the concurrence C (ρ ) of the generated two-qubit state ρ follows an intrinsic upper bound with C (ρ )≤(1 +P )/2 , where P is the degree of polarization of the pump photon. We also find that for the class of two-qubit states that is restricted to have only two nonzero diagonal elements such that the effective dimensionality of the two-qubit state is the same as the dimensionality of the pump polarization state, the upper bound on concurrence is the degree of polarization itself, that is, C (ρ )≤P . Our work shows that the maximum manifestation of two-particle correlations as entanglement is dictated by one-particle correlations. The formalism developed in this work can be extended to include multiparticle systems and can thus have important implications towards deducing the upper bounds on multiparticle entanglement, for which no universally accepted measure exists.

Backstepping Design of Adaptive Neural Fault-Tolerant Control for MIMO Nonlinear Systems.

PubMed

Gao, Hui; Song, Yongduan; Wen, Changyun

In this paper, an adaptive controller is developed for a class of multi-input and multioutput nonlinear systems with neural networks (NNs) used as a modeling tool. It is shown that all the signals in the closed-loop system with the proposed adaptive neural controller are globally uniformly bounded for any external input in . In our control design, the upper bound of the NN modeling error and the gains of external disturbance are characterized by unknown upper bounds, which is more rational to establish the stability in the adaptive NN control. Filter-based modification terms are used in the update laws of unknown parameters to improve the transient performance. Finally, fault-tolerant control is developed to accommodate actuator failure. An illustrative example applying the adaptive controller to control a rigid robot arm shows the validation of the proposed controller.In this paper, an adaptive controller is developed for a class of multi-input and multioutput nonlinear systems with neural networks (NNs) used as a modeling tool. It is shown that all the signals in the closed-loop system with the proposed adaptive neural controller are globally uniformly bounded for any external input in . In our control design, the upper bound of the NN modeling error and the gains of external disturbance are characterized by unknown upper bounds, which is more rational to establish the stability in the adaptive NN control. Filter-based modification terms are used in the update laws of unknown parameters to improve the transient performance. Finally, fault-tolerant control is developed to accommodate actuator failure. An illustrative example applying the adaptive controller to control a rigid robot arm shows the validation of the proposed controller.

Length bounds for connecting discharges in triggered lightning subsequent strokes

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

Idone, V.P.

1990-11-20

Highly time resolved streak recordings from nine subsequent strokes in four triggered flashes have been examined for evidence of the occurrence of upward connecting discharges. These photographic recordings were obtained with superior spatial and temporal resolution (0.3 m and 0.5 {lambda}s) and were examined with a video image analysis system to help delineate the separate leader and return stroke image tracks. Unfortunately, a definitive determination of the occurrence of connecting discharges in these strokes could not be made. The data did allow various determinations of an upper bound length for any possible connecting discharge in each stroke. Under the simplestmore » analysis approach possible, an 'absolute' upper bound set of lengths was measured that ranged from 12 to 27 m with a mean of 19 m; two other more involved analyses yielded arguably better upper bound estimates of 8-18 m and 7-26 m with means of 19 m; two other more involved analyses yielded arguably better upper bound estimates of 8-18 m and 7-26 m with means of 12 and 13 m, respectively. An additional set of low time-resolution telephoto recordings of the lowest few meters of channel revealed six strokes in these flashes with one or more upward unconnected channels originating from the lightning rod tip. The maximum length of unconnected channel seen in each of these strokes ranged from 0.2 to 1.6 m with a mean of 0.7 m. This latter set of observations is interpreted as indirect evidence that connecting discharges did occur in these strokes and that the lower bound for their length is about 1 m.« less

Efficiency bounds for nonequilibrium heat engines

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

Mehta, Pankaj; Polkovnikov, Anatoli, E-mail: asp@bu.edu

2013-05-15

We analyze the efficiency of thermal engines (either quantum or classical) working with a single heat reservoir like an atmosphere. The engine first gets an energy intake, which can be done in an arbitrary nonequilibrium way e.g. combustion of fuel. Then the engine performs the work and returns to the initial state. We distinguish two general classes of engines where the working body first equilibrates within itself and then performs the work (ergodic engine) or when it performs the work before equilibrating (non-ergodic engine). We show that in both cases the second law of thermodynamics limits their efficiency. For ergodicmore » engines we find a rigorous upper bound for the efficiency, which is strictly smaller than the equivalent Carnot efficiency. I.e. the Carnot efficiency can be never achieved in single reservoir heat engines. For non-ergodic engines the efficiency can be higher and can exceed the equilibrium Carnot bound. By extending the fundamental thermodynamic relation to nonequilibrium processes, we find a rigorous thermodynamic bound for the efficiency of both ergodic and non-ergodic engines and show that it is given by the relative entropy of the nonequilibrium and initial equilibrium distributions. These results suggest a new general strategy for designing more efficient engines. We illustrate our ideas by using simple examples. -- Highlights: ► Derived efficiency bounds for heat engines working with a single reservoir. ► Analyzed both ergodic and non-ergodic engines. ► Showed that non-ergodic engines can be more efficient. ► Extended fundamental thermodynamic relation to arbitrary nonequilibrium processes.« less

Computation of canonical correlation and best predictable aspect of future for time series

NASA Technical Reports Server (NTRS)

Pourahmadi, Mohsen; Miamee, A. G.

1989-01-01

The canonical correlation between the (infinite) past and future of a stationary time series is shown to be the limit of the canonical correlation between the (infinite) past and (finite) future, and computation of the latter is reduced to a (generalized) eigenvalue problem involving (finite) matrices. This provides a convenient and essentially, finite-dimensional algorithm for computing canonical correlations and components of a time series. An upper bound is conjectured for the largest canonical correlation.

Synchronizability of random rectangular graphs

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

Estrada, Ernesto, E-mail: ernesto.estrada@strath.ac.uk; Chen, Guanrong

2015-08-15

Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.

Three-player conflicting interest games and nonlocality

NASA Astrophysics Data System (ADS)

Bolonek-Lasoń, Katarzyna

2017-08-01

We outline the general construction of three-player games with incomplete information which fulfil the following conditions: (i) symmetry with respect to the permutations of players; (ii) the existence of an upper bound for total payoff resulting from Bell inequalities; (iii) the existence of both fair and unfair Nash equilibria saturating this bound. Conditions (i)-(iii) imply that we are dealing with conflicting interest games. An explicit example of such a game is given. A quantum counterpart of this game is considered. It is obtained by keeping the same utilities but replacing classical advisor by a quantum one. It is shown that the quantum game possesses only fair equilibria with strictly higher payoffs than in the classical case. This implies that quantum nonlocality can be used to resolve the conflict between the players.

Mathematics of gravitational lensing: multiple imaging and magnification

NASA Astrophysics Data System (ADS)

Petters, A. O.; Werner, M. C.

2010-09-01

The mathematical theory of gravitational lensing has revealed many generic and global properties. Beginning with multiple imaging, we review Morse-theoretic image counting formulas and lower bound results, and complex-algebraic upper bounds in the case of single and multiple lens planes. We discuss recent advances in the mathematics of stochastic lensing, discussing a general formula for the global expected number of minimum lensed images as well as asymptotic formulas for the probability densities of the microlensing random time delay functions, random lensing maps, and random shear, and an asymptotic expression for the global expected number of micro-minima. Multiple imaging in optical geometry and a spacetime setting are treated. We review global magnification relation results for model-dependent scenarios and cover recent developments on universal local magnification relations for higher order caustics.

New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

NASA Astrophysics Data System (ADS)

Liu, Jianzhou; Wang, Li; Zhang, Juan

2017-11-01

The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this paper, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we offer corresponding numerical examples to illustrate the effectiveness of the derived results.

Universality of quantum gravity corrections.

PubMed

Das, Saurya; Vagenas, Elias C

2008-11-28

We show that the existence of a minimum measurable length and the related generalized uncertainty principle (GUP), predicted by theories of quantum gravity, influence all quantum Hamiltonians. Thus, they predict quantum gravity corrections to various quantum phenomena. We compute such corrections to the Lamb shift, the Landau levels, and the tunneling current in a scanning tunneling microscope. We show that these corrections can be interpreted in two ways: (a) either that they are exceedingly small, beyond the reach of current experiments, or (b) that they predict upper bounds on the quantum gravity parameter in the GUP, compatible with experiments at the electroweak scale. Thus, more accurate measurements in the future should either be able to test these predictions, or further tighten the above bounds and predict an intermediate length scale between the electroweak and the Planck scale.

Risk assessment and monitoring programme of nitrates through vegetables in the Region of Valencia (Spain).

PubMed

Quijano, Leyre; Yusà, Vicent; Font, Guillermina; McAllister, Claudia; Torres, Concepción; Pardo, Olga

2017-02-01

This study was carried out to determine current levels of nitrate in vegetables marketed in the Region of Valencia (Spain) and to estimate the toxicological risk associated with their intake. A total of 533 samples of seven vegetable species were studied. Nitrate levels were derived from the Valencia Region monitoring programme carried out from 2009 to 2013 and food consumption levels were taken from the first Valencia Food Consumption Survey, conducted in 2010. The exposure was estimated using a probabilistic approach and two scenarios were assumed for left-censored data: the lower-bound scenario, in which unquantified results (below the limit of quantification) were set to zero and the upper-bound scenario, in which unquantified results were set to the limit of quantification value. The exposure of the Valencia consumers to nitrate through the consumption of vegetable products appears to be relatively low. In the adult population (16-95 years) the P99.9 was 3.13 mg kg -1 body weight day -1 and 3.15 mg kg -1 body weight day -1 in the lower bound and upper bound scenario, respectively. On the other hand, for young people (6-15 years) the P99.9 of the exposure was 4.20 mg kg -1 body weight day -1 and 4.40 mg kg -1 body weight day -1 in the lower bound and upper bound scenario, respectively. The risk characterisation indicates that, under the upper bound scenario, 0.79% of adults and 1.39% of young people can exceed the Acceptable Daily Intake of nitrate. This percentage could join the vegetable extreme consumers (such as vegetarians) of vegetables. Overall, the estimated exposures to nitrate from vegetables are unlikely to result in appreciable health risks. Copyright © 2016 Elsevier Ltd. All rights reserved.

On the upper bound in the Bohm sheath criterion

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

Kotelnikov, I. A., E-mail: I.A.Kotelnikov@inp.nsk.su; Skovorodin, D. I., E-mail: D.I.Skovorodin@inp.nsk.su

2016-02-15

The question is discussed about the existence of an upper bound in the Bohm sheath criterion, according to which the Debye sheath at the interface between plasma and a negatively charged electrode is stable only if the ion flow velocity in plasma exceeds the ion sound velocity. It is stated that, with an exception of some artificial ionization models, the Bohm sheath criterion is satisfied as an equality at the lower bound and the ion flow velocity is equal to the speed of sound. In the one-dimensional theory, a supersonic flow appears in an unrealistic model of a localized ionmore » source the size of which is less than the Debye length; however, supersonic flows seem to be possible in the two- and three-dimensional cases. In the available numerical codes used to simulate charged particle sources with a plasma emitter, the presence of the upper bound in the Bohm sheath criterion is not supposed; however, the correspondence with experimental data is usually achieved if the ion flow velocity in plasma is close to the ion sound velocity.« less

Computer search for binary cyclic UEP codes of odd length up to 65

NASA Technical Reports Server (NTRS)

Lin, Mao-Chao; Lin, Chi-Chang; Lin, Shu

1990-01-01

Using an exhaustive computation, the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances at least 3 are found. For those codes that can only have upper bounds on their unequal error protection capabilities computed, an analytic method developed by Dynkin and Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.

On the Kirchhoff Index of Graphs

NASA Astrophysics Data System (ADS)

Das, Kinkar C.

2013-09-01

Let G be a connected graph of order n with Laplacian eigenvalues μ1 ≥ μ2 ≥ ... ≥ μn-1 > mn = 0. The Kirchhoff index of G is defined as [xxx] In this paper. we give lower and upper bounds on Kf of graphs in terms on n, number of edges, maximum degree, and number of spanning trees. Moreover, we present lower and upper bounds on the Nordhaus-Gaddum-type result for the Kirchhoff index.

Upper bound of pier scour in laboratory and field data

USGS Publications Warehouse

Benedict, Stephen; Caldwell, Andral W.

2016-01-01

The U.S. Geological Survey (USGS), in cooperation with the South Carolina Department of Transportation, conducted several field investigations of pier scour in South Carolina and used the data to develop envelope curves defining the upper bound of pier scour. To expand on this previous work, an additional cooperative investigation was initiated to combine the South Carolina data with pier scour data from other sources and to evaluate upper-bound relations with this larger data set. To facilitate this analysis, 569 laboratory and 1,858 field measurements of pier scour were compiled to form the 2014 USGS Pier Scour Database. This extensive database was used to develop an envelope curve for the potential maximum pier scour depth encompassing the laboratory and field data. The envelope curve provides a simple but useful tool for assessing the potential maximum pier scour depth for effective pier widths of about 30 ft or less.

Resilient filtering for time-varying stochastic coupling networks under the event-triggering scheduling

NASA Astrophysics Data System (ADS)

Wang, Fan; Liang, Jinling; Dobaie, Abdullah M.

2018-07-01

The resilient filtering problem is considered for a class of time-varying networks with stochastic coupling strengths. An event-triggered strategy is adopted to save the network resources by scheduling the signal transmission from the sensors to the filters based on certain prescribed rules. Moreover, the filter parameters to be designed are subject to gain perturbations. The primary aim of the addressed problem is to determine a resilient filter that ensures an acceptable filtering performance for the considered network with event-triggering scheduling. To handle such an issue, an upper bound on the estimation error variance is established for each node according to the stochastic analysis. Subsequently, the resilient filter is designed by locally minimizing the derived upper bound at each iteration. Moreover, rigorous analysis shows the monotonicity of the minimal upper bound regarding the triggering threshold. Finally, a simulation example is presented to show effectiveness of the established filter scheme.

Objects of Maximum Electromagnetic Chirality

NASA Astrophysics Data System (ADS)

Fernandez-Corbaton, Ivan; Fruhnert, Martin; Rockstuhl, Carsten

2016-07-01

We introduce a definition of the electromagnetic chirality of an object and show that it has an upper bound. Reciprocal objects attain the upper bound if and only if they are transparent for all the fields of one polarization handedness (helicity). Additionally, electromagnetic duality symmetry, i.e., helicity preservation upon interaction, turns out to be a necessary condition for reciprocal objects to attain the upper bound. We use these results to provide requirements for the design of such extremal objects. The requirements can be formulated as constraints on the polarizability tensors for dipolar objects or on the material constitutive relations for continuous media. We also outline two applications for objects of maximum electromagnetic chirality: a twofold resonantly enhanced and background-free circular dichroism measurement setup, and angle-independent helicity filtering glasses. Finally, we use the theoretically obtained requirements to guide the design of a specific structure, which we then analyze numerically and discuss its performance with respect to maximal electromagnetic chirality.

Measuring Integrated Information from the Decoding Perspective

PubMed Central

Oizumi, Masafumi; Amari, Shun-ichi; Yanagawa, Toru; Fujii, Naotaka; Tsuchiya, Naotsugu

2016-01-01

Accumulating evidence indicates that the capacity to integrate information in the brain is a prerequisite for consciousness. Integrated Information Theory (IIT) of consciousness provides a mathematical approach to quantifying the information integrated in a system, called integrated information, Φ. Integrated information is defined theoretically as the amount of information a system generates as a whole, above and beyond the amount of information its parts independently generate. IIT predicts that the amount of integrated information in the brain should reflect levels of consciousness. Empirical evaluation of this theory requires computing integrated information from neural data acquired from experiments, although difficulties with using the original measure Φ precludes such computations. Although some practical measures have been previously proposed, we found that these measures fail to satisfy the theoretical requirements as a measure of integrated information. Measures of integrated information should satisfy the lower and upper bounds as follows: The lower bound of integrated information should be 0 and is equal to 0 when the system does not generate information (no information) or when the system comprises independent parts (no integration). The upper bound of integrated information is the amount of information generated by the whole system. Here we derive the novel practical measure Φ* by introducing a concept of mismatched decoding developed from information theory. We show that Φ* is properly bounded from below and above, as required, as a measure of integrated information. We derive the analytical expression of Φ* under the Gaussian assumption, which makes it readily applicable to experimental data. Our novel measure Φ* can generally be used as a measure of integrated information in research on consciousness, and also as a tool for network analysis on diverse areas of biology. PMID:26796119

The QCD mass gap and quark deconfinement scales as mass bounds in strong gravity

NASA Astrophysics Data System (ADS)

Burikham, Piyabut; Harko, Tiberiu; Lake, Matthew J.

2017-11-01

Though not a part of mainstream physics, Salam's theory of strong gravity remains a viable effective model for the description of strong interactions in the gauge singlet sector of QCD, capable of producing particle confinement and asymptotic freedom, but not of reproducing interactions involving SU(3) color charge. It may therefore be used to explore the stability and confinement of gauge singlet hadrons, though not to describe scattering processes that require color interactions. It is a two-tensor theory of both strong interactions and gravity, in which the strong tensor field is governed by equations formally identical to the Einstein equations, apart from the coupling parameter, which is of order 1 {GeV}^{-1}. We revisit the strong gravity theory and investigate the strong gravity field equations in the presence of a mixing term which induces an effective strong cosmological constant, Λ f. This introduces a strong de Sitter radius for strongly interacting fermions, producing a confining bubble, which allows us to identify Λ f with the `bag constant' of the MIT bag model, B ˜eq 2 × 10^{14} {g} {cm}^{-3}. Assuming a static, spherically symmetric geometry, we derive the strong gravity TOV equation, which describes the equilibrium properties of compact hadronic objects. From this, we determine the generalized Buchdahl inequalities for a strong gravity `particle', giving rise to upper and lower bounds on the mass/radius ratio of stable, compact, strongly interacting objects. We show, explicitly, that the existence of the lower mass bound is induced by the presence of Λ _f, producing a mass gap, and that the upper bound corresponds to a deconfinement phase transition. The physical implications of our results for holographic duality in the context of the AdS/QCD and dS/QCD correspondences are also discussed.

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

NASA Astrophysics Data System (ADS)

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.

Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination

NASA Astrophysics Data System (ADS)

Audenaert, Koenraad M. R.; Mosonyi, Milán

2014-10-01

We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states σ1, …, σr. By splitting up the overall test into multiple binary tests in various ways we obtain a number of upper bounds on the optimal error probability in terms of the binary error probabilities. These upper bounds allow us to deduce various bounds on the asymptotic error rate, for which it has been hypothesized that it is given by the multi-hypothesis quantum Chernoff bound (or Chernoff divergence) C(σ1, …, σr), as recently introduced by Nussbaum and Szkoła in analogy with Salikhov's classical multi-hypothesis Chernoff bound. This quantity is defined as the minimum of the pairwise binary Chernoff divergences min _{j

Evaluation of uncertainty for regularized deconvolution: A case study in hydrophone measurements.

PubMed

Eichstädt, S; Wilkens, V

2017-06-01

An estimation of the measurand in dynamic metrology usually requires a deconvolution based on a dynamic calibration of the measuring system. Since deconvolution is, mathematically speaking, an ill-posed inverse problem, some kind of regularization is required to render the problem stable and obtain usable results. Many approaches to regularized deconvolution exist in the literature, but the corresponding evaluation of measurement uncertainties is, in general, an unsolved issue. In particular, the uncertainty contribution of the regularization itself is a topic of great importance, because it has a significant impact on the estimation result. Here, a versatile approach is proposed to express prior knowledge about the measurand based on a flexible, low-dimensional modeling of an upper bound on the magnitude spectrum of the measurand. This upper bound allows the derivation of an uncertainty associated with the regularization method in line with the guidelines in metrology. As a case study for the proposed method, hydrophone measurements in medical ultrasound with an acoustic working frequency of up to 7.5 MHz are considered, but the approach is applicable for all kinds of estimation methods in dynamic metrology, where regularization is required and which can be expressed as a multiplication in the frequency domain.

LS Bound based gene selection for DNA microarray data.

PubMed

Zhou, Xin; Mao, K Z

2005-04-15

One problem with discriminant analysis of DNA microarray data is that each sample is represented by quite a large number of genes, and many of them are irrelevant, insignificant or redundant to the discriminant problem at hand. Methods for selecting important genes are, therefore, of much significance in microarray data analysis. In the present study, a new criterion, called LS Bound measure, is proposed to address the gene selection problem. The LS Bound measure is derived from leave-one-out procedure of LS-SVMs (least squares support vector machines), and as the upper bound for leave-one-out classification results it reflects to some extent the generalization performance of gene subsets. We applied this LS Bound measure for gene selection on two benchmark microarray datasets: colon cancer and leukemia. We also compared the LS Bound measure with other evaluation criteria, including the well-known Fisher's ratio and Mahalanobis class separability measure, and other published gene selection algorithms, including Weighting factor and SVM Recursive Feature Elimination. The strength of the LS Bound measure is that it provides gene subsets leading to more accurate classification results than the filter method while its computational complexity is at the level of the filter method. A companion website can be accessed at http://www.ntu.edu.sg/home5/pg02776030/lsbound/. The website contains: (1) the source code of the gene selection algorithm; (2) the complete set of tables and figures regarding the experimental study; (3) proof of the inequality (9). ekzmao@ntu.edu.sg.

Context in Generalized Conversational Implicatures: The Case of Some

PubMed Central

Dupuy, Ludivine E.; Van der Henst, Jean-Baptiste; Cheylus, Anne; Reboul, Anne C.

2016-01-01

There is now general agreement about the optionality of scalar implicatures: the pragmatic interpretation will be accessed depending on the context relative to which the utterance is interpreted. The question, then, is what makes a context upper- (vs. lower-) bounding. Neo-Gricean accounts should predict that contexts including factual information will enhance the rate of pragmatic interpretations. Post-Gricean accounts should predict that contexts including psychological attributions will enhance the rate of pragmatic interpretations. We tested two factors using the quantifier scale : (1) the existence of factual information that facilitates the computation of pragmatic interpretations in the context (here, the cardinality of the domain of quantification) and (2) the fact that the context makes the difference between the semantic and the pragmatic interpretations of the target sentence relevant, involving psychological attributions to the speaker (here a question using all). We did three experiments, all of which suggest that while cardinality information may be necessary to the computation of the pragmatic interpretation, it plays a minor role in triggering it; highlighting the contrast between the pragmatic and the semantic interpretations, while it is not necessary to the computation of the pragmatic interpretation, strongly mandates a pragmatic interpretation. These results favor Sperber and Wilson's (1995) post-Gricean account over Chierchia's (2013) neo-Gricean account. Overall, this suggests that highlighting the relevance of the pragmatic vs. semantic interpretations of the target sentence makes a context upper-bounding. Additionally, the results give a small advantage to the post-Gricean account. PMID:27047413

Compressed Secret Key Agreement:Maximizing Multivariate Mutual Information per Bit

NASA Astrophysics Data System (ADS)

Chan, Chung

2017-10-01

The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components for generating a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy of the compressed sources. Since the maximum achievable key rate captures the total amount of information mutual to the compressed sources, an optimal compression scheme essentially maximizes the multivariate mutual information per bit of randomness of the private sources, and can therefore be viewed more generally as a dimension reduction technique. Single-letter lower and upper bounds on the maximum achievable key rate are derived for the general source model, and an explicit polynomial-time computable formula is obtained for the pairwise independent network model. In particular, the converse results and the upper bounds are obtained from those of the related secret key agreement problem with rate-limited discussion. A precise duality is shown for the two-user case with one-way discussion, and such duality is extended to obtain the desired converse results in the multi-user case. In addition to posing new challenges in information processing and dimension reduction, the compressed secret key agreement problem helps shed new light on resolving the difficult problem of secret key agreement with rate-limited discussion, by offering a more structured achieving scheme and some simpler conjectures to prove.

Tidal disruption of Periodic Comet Shoemaker-Levy 9 and a constraint on its mean density

NASA Technical Reports Server (NTRS)

Boss, Alan P.

1994-01-01

The apparent tidal disruption of Periodic Comet Shoemaker-Levy 9 (1993e) during a close encounter within approximately 1.62 planetary radii of Jupiter can be used along with theoretical models of tidal disruption to place an upper bound on the density of the predisruption body. Depending on the theoretical model used, these upper bounds range from rho(sub c) less than 0.702 +/- 0.080 g/cu cm for a simple analytical model calibrated by numerical smoothed particle hydrodynamics (SPH) simulations to rho(sub c) less than 1.50 +/- 0.17 g/cu cm for a detailed semianalytical model. The quoted uncertainties stem from an assumed uncertainty in the perijove radius. However, the uncertainty introduced by the different theoretical models is the major source of error; this uncertainty could be eliminated by future SPH simulations specialized to cometary disruptions, including the effects of initially prolate, spinning comets. If the SPH-based upper bound turns out to be most appropriate, it would be consistent with the predisruption body being a comet with a relatively low density and porous structure, as has been asserted previously based on observations of cometary outgassing. Regardless of which upper bound is preferable, the models all agree that the predisruption body could not have been a relatively high-density body, such as an asteroid with rho approximately = 2 g/cu cm.

Limit analysis of hollow spheres or spheroids with Hill orthotropic matrix

NASA Astrophysics Data System (ADS)

Pastor, Franck; Pastor, Joseph; Kondo, Djimedo

2012-03-01

Recent theoretical studies of the literature are concerned by the hollow sphere or spheroid (confocal) problems with orthotropic Hill type matrix. They have been developed in the framework of the limit analysis kinematical approach by using very simple trial velocity fields. The present Note provides, through numerical upper and lower bounds, a rigorous assessment of the approximate criteria derived in these theoretical works. To this end, existing static 3D codes for a von Mises matrix have been easily extended to the orthotropic case. Conversely, instead of the non-obvious extension of the existing kinematic codes, a new original mixed approach has been elaborated on the basis of the plane strain structure formulation earlier developed by F. Pastor (2007). Indeed, such a formulation does not need the expressions of the unit dissipated powers. Interestingly, it delivers a numerical code better conditioned and notably more rapid than the previous one, while preserving the rigorous upper bound character of the corresponding numerical results. The efficiency of the whole approach is first demonstrated through comparisons of the results to the analytical upper bounds of Benzerga and Besson (2001) or Monchiet et al. (2008) in the case of spherical voids in the Hill matrix. Moreover, we provide upper and lower bounds results for the hollow spheroid with the Hill matrix which are compared to those of Monchiet et al. (2008).

Search for Chemically Bound Water in the Surface Layer of Mars Based on HEND/Mars Odyssey Data

NASA Technical Reports Server (NTRS)

Basilevsky, A. T.; Litvak, M. L.; Mitrofanov, I. G.; Boynton, W.; Saunders, R. S.

2003-01-01

This study is emphasized on search for signatures of chemically bound water in surface layer of Mars based on data acquired by High Energy Neutron Detector (HEND) which is part of the Mars Odyssey Gamma Ray Spectrometer (GRS). Fluxes of epithermal (probe the upper 1-2 m) and fast (the upper 20-30 cm) neutrons, considered in this work, were measured since mid February till mid June 2002. First analysis of this data set with emphasis of chemically bound water was made. Early publications of the GRS results reported low neutron flux at high latitudes, interpreted as signature of ground water ice, and in two low latitude areas: Arabia and SW of Olympus Mons (SWOM), interpreted as 'geographic variations in the amount of chemically and/or physically bound H2O and or OH...'. It is clear that surface materials of Mars do contain chemically bound water, but its amounts are poorly known and its geographic distribution was not analyzed.

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

NASA Technical Reports Server (NTRS)

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.

An analysis of the vertical structure equation for arbitrary thermal profiles

NASA Technical Reports Server (NTRS)

Cohn, Stephen E.; Dee, Dick P.

1989-01-01

The vertical structure equation is a singular Sturm-Liouville problem whose eigenfunctions describe the vertical dependence of the normal modes of the primitive equations linearized about a given thermal profile. The eigenvalues give the equivalent depths of the modes. The spectrum of the vertical structure equation and the appropriateness of various upper boundary conditions, both for arbitrary thermal profiles were studied. The results depend critically upon whether or not the thermal profile is such that the basic state atmosphere is bounded. In the case of a bounded atmosphere it is shown that the spectrum is always totally discrete, regardless of details of the thermal profile. For the barotropic equivalent depth, which corresponds to the lowest eigen value, upper and lower bounds which depend only on the surface temperature and the atmosphere height were obtained. All eigenfunctions are bounded, but always have unbounded first derivatives. It was proved that the commonly invoked upper boundary condition that vertical velocity must vanish as pressure tends to zero, as well as a number of alternative conditions, is well posed. It was concluded that the vertical structure equation always has a totally discrete spectrum under the assumptions implicit in the primitive equations.

An analysis of the vertical structure equation for arbitrary thermal profiles

NASA Technical Reports Server (NTRS)

Cohn, Stephen E.; Dee, Dick P.

1987-01-01

The vertical structure equation is a singular Sturm-Liouville problem whose eigenfunctions describe the vertical dependence of the normal modes of the primitive equations linearized about a given thermal profile. The eigenvalues give the equivalent depths of the modes. The spectrum of the vertical structure equation and the appropriateness of various upper boundary conditions, both for arbitrary thermal profiles were studied. The results depend critically upon whether or not the thermal profile is such that the basic state atmosphere is bounded. In the case of a bounded atmosphere it is shown that the spectrum is always totally discrete, regardless of details of the thermal profile. For the barotropic equivalent depth, which corresponds to the lowest eigen value, upper and lower bounds which depend only on the surface temperature and the atmosphere height were obtained. All eigenfunctions are bounded, but always have unbounded first derivatives. It was proved that the commonly invoked upper boundary condition that vertical velocity must vanish as pressure tends to zero, as well as a number of alternative conditions, is well posed. It was concluded that the vertical structure equation always has a totally discrete spectrum under the assumptions implicit in the primitive equations.

Ultimate energy density of observable cold baryonic matter.

PubMed

Lattimer, James M; Prakash, Madappa

2005-03-25

We demonstrate that the largest measured mass of a neutron star establishes an upper bound to the energy density of observable cold baryonic matter. An equation of state-independent expression satisfied by both normal neutron stars and self-bound quark matter stars is derived for the largest energy density of matter inside stars as a function of their masses. The largest observed mass sets the lowest upper limit to the density. Implications from existing and future neutron star mass measurements are discussed.

On the perturbation and subproper splittings for the generalized inverse AT,S(2) of rectangular matrix A

NASA Astrophysics Data System (ADS)

Wei, Yimin; Wu, Hebing

2001-12-01

In this paper, the perturbation and subproper splittings for the generalized inverse AT,S(2), the unique matrix X such that XAX=X, R(X)=T and N(X)=S, are considered. We present lower and upper bounds for the perturbation of AT,S(2). Convergence of subproper splittings for computing the special solution AT,S(2)b of restricted rectangular linear system Ax=b, x[set membership, variant]T, are studied. For the solution AT,S(2)b we develop a characterization. Therefore, we give a unified treatment of the related problems considered in literature by Ben-Israel, Berman, Hanke, Neumann, Plemmons, etc.

Computing an upper bound on contact stress with surrogate duality

NASA Astrophysics Data System (ADS)

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.

Performance bounds on parallel self-initiating discrete-event

NASA Technical Reports Server (NTRS)

Nicol, David M.

1990-01-01

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Bounds on the Coupling of the Majoron to Light Neutrinos from Supernova Cooling

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

Farzan, Yasaman

2002-12-02

We explore the role of Majoron (J) emission in the supernova cooling process, as a source of upper bound on the neutrino-Majoron coupling. We show that the strongest upper bound on the coupling to {nu}{sub 3} comes from the {nu}{sub e}{nu}{sub e} {yields} J process in the core of a supernova. We also find bounds on diagonal couplings of the Majoron to {nu}{sub {mu}({tau})}{nu}{sub {mu}({tau})} and on off-diagonal {nu}{sub e}{nu}{sub {mu}({tau})} couplings in various regions of the parameter space. We discuss the evaluation of cross-section for four-particle interactions ({nu}{nu} {yields} JJ and {nu}J {yields} {nu}J). We show that these aremore » typically dominated by three-particle sub-processes and do not give new independent constraints.« less

The photodissociation lifetimes of the OH and OD radicals in comets

NASA Technical Reports Server (NTRS)

Singh, P. D.; Van Dishoeck, E. F.; Dalgarno, A.

1983-01-01

The photodissociation rates of OH and OD molecules due to absorption of solar radiation in the X(2)Pi-A(2)Sigma(+) electronic transition are calculated to lie between 3.5 and 6.7 x 10 to the -6th/sec for OH for heliocentric velocities between -60 and +60 km/sec and at about 4.7 x 10 to the -7th/sec for OD at 1 AU from the sun. The corresponding lifetimes, which are upper bounds to the actual lifetimes, are generally consistent with the observational cometary data.

Projective mappings and dimensions of vector spaces of three types of Killing-Yano tensors on pseudo Riemannian manifolds of constant curvature

NASA Astrophysics Data System (ADS)

Mikeš, Josef; Stepanov, Sergey; Hinterleitner, Irena

2012-07-01

In our paper we have determined the dimension of the space of conformal Killing-Yano tensors and the dimensions of its two subspaces of closed conformal Killing-Yano and Killing-Yano tensors on pseudo Riemannian manifolds of constant curvature. This result is a generalization of well known results on sharp upper bounds of the dimensions of the vector spaces of conformal Killing-Yano, Killing-Yano and concircular vector fields on pseudo Riemannian manifolds of constant curvature.

Kernel K-Means Sampling for Nyström Approximation.

PubMed

He, Li; Zhang, Hong

2018-05-01

A fundamental problem in Nyström-based kernel matrix approximation is the sampling method by which training set is built. In this paper, we suggest to use kernel -means sampling, which is shown in our works to minimize the upper bound of a matrix approximation error. We first propose a unified kernel matrix approximation framework, which is able to describe most existing Nyström approximations under many popular kernels, including Gaussian kernel and polynomial kernel. We then show that, the matrix approximation error upper bound, in terms of the Frobenius norm, is equal to the -means error of data points in kernel space plus a constant. Thus, the -means centers of data in kernel space, or the kernel -means centers, are the optimal representative points with respect to the Frobenius norm error upper bound. Experimental results, with both Gaussian kernel and polynomial kernel, on real-world data sets and image segmentation tasks show the superiority of the proposed method over the state-of-the-art methods.

ϕ 3 theory with F4 flavor symmetry in 6 - 2 ɛ dimensions: 3-loop renormalization and conformal bootstrap

NASA Astrophysics Data System (ADS)

Pang, Yi; Rong, Junchen; Su, Ning

2016-12-01

We consider ϕ 3 theory in 6 - 2 ɛ with F 4 global symmetry. The beta function is calculated up to 3 loops, and a stable unitary IR fixed point is observed. The anomalous dimensions of operators quadratic or cubic in ϕ are also computed. We then employ conformal bootstrap technique to study the fixed point predicted from the perturbative approach. For each putative scaling dimension of ϕ (Δ ϕ ), we obtain the corresponding upper bound on the scaling dimension of the second lowest scalar primary in the 26 representation ( Δ 26 2nd ) which appears in the OPE of ϕ × ϕ. In D = 5 .95, we observe a sharp peak on the upper bound curve located at Δ ϕ equal to the value predicted by the 3-loop computation. In D = 5, we observe a weak kink on the upper bound curve at ( Δ ϕ , Δ 26 2nd ) = (1.6, 4).

Up-and-down designs for phase I clinical trials

PubMed Central

Liu, Suyu; Cai, Chunyan; Ning, Jing

2014-01-01

Various up-and-down designs have been proposed to improve the operating characteristics of the traditional “3+3” design, but they have been of limited use in practice. A major impediment to the adoption of the improved up-and-down designs is a lack of general guidance and a comprehensive assessment of the operating characteristics of these designs under practical clinical settings. To fill this gap, we review six up-and-down designs: the “3+3” design, accelerated titration design, biased coin design, k-in-a-row design, group up-and-down design and cumulative group up-and-down design. We conduct comprehensive simulation studies to evaluate their operating characteristics under various practical settings, and compare their performance to a theoretical optimal bound of nonparametric designs. The results show that the cumulative group up-and-down design has the best overall performance in terms of selecting the maximum tolerated dose (MTD), assigning patients to the MTD and patient safety. Its performance is generally close to the upper bound of nonparametric designs, but improvement seems possible in some cases. PMID:23856381

Strong polygamy of quantum correlations in multi-party quantum systems

NASA Astrophysics Data System (ADS)

Kim, Jeong San

2014-10-01

We propose a new type of polygamy inequality for multi-party quantum entanglement. We first consider the possible amount of bipartite entanglement distributed between a fixed party and any subset of the rest parties in a multi-party quantum system. By using the summation of these distributed entanglements, we provide an upper bound of the distributed entanglement between a party and the rest in multi-party quantum systems. We then show that this upper bound also plays as a lower bound of the usual polygamy inequality, therefore the strong polygamy of multi-party quantum entanglement. For the case of multi-party pure states, we further show that the strong polygamy of entanglement implies the strong polygamy of quantum discord.

Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems

NASA Astrophysics Data System (ADS)

Tobasco, Ian; Goluskin, David; Doering, Charles R.

2018-02-01

For any quantity of interest in a system governed by ordinary differential equations, it is natural to seek the largest (or smallest) long-time average among solution trajectories, as well as the extremal trajectories themselves. Upper bounds on time averages can be proved a priori using auxiliary functions, the optimal choice of which is a convex optimization problem. We prove that the problems of finding maximal trajectories and minimal auxiliary functions are strongly dual. Thus, auxiliary functions provide arbitrarily sharp upper bounds on time averages. Moreover, any nearly minimal auxiliary function provides phase space volumes in which all nearly maximal trajectories are guaranteed to lie. For polynomial equations, auxiliary functions can be constructed by semidefinite programming, which we illustrate using the Lorenz system.

Bound-Preserving Discontinuous Galerkin Methods for Conservative Phase Space Advection in Curvilinear Coordinates

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

Mezzacappa, Anthony; Endeve, Eirik; Hauck, Cory D.

We extend the positivity-preserving method of Zhang & Shu [49] to simulate the advection of neutral particles in phase space using curvilinear coordinates. The ability to utilize these coordinates is important for non-equilibrium transport problems in general relativity and also in science and engineering applications with specific geometries. The method achieves high-order accuracy using Discontinuous Galerkin (DG) discretization of phase space and strong stabilitypreserving, Runge-Kutta (SSP-RK) time integration. Special care in taken to ensure that the method preserves strict bounds for the phase space distribution function f; i.e., f ϵ [0, 1]. The combination of suitable CFL conditions and themore » use of the high-order limiter proposed in [49] is su cient to ensure positivity of the distribution function. However, to ensure that the distribution function satisfies the upper bound, the discretization must, in addition, preserve the divergencefree property of the phase space ow. Proofs that highlight the necessary conditions are presented for general curvilinear coordinates, and the details of these conditions are worked out for some commonly used coordinate systems (i.e., spherical polar spatial coordinates in spherical symmetry and cylindrical spatial coordinates in axial symmetry, both with spherical momentum coordinates). Results from numerical experiments - including one example in spherical symmetry adopting the Schwarzschild metric - demonstrate that the method achieves high-order accuracy and that the distribution function satisfies the maximum principle.« less

Bond additive modeling 10. Upper and lower bounds of bond incident degree indices of catacondensed fluoranthenes

NASA Astrophysics Data System (ADS)

Vukičević, Damir; Đurđević, Jelena

2011-10-01

Bond incident degree index is a descriptor that is calculated as the sum of the bond contributions such that each bond contribution depends solely on the degrees of its incident vertices (e.g. Randić index, Zagreb index, modified Zagreb index, variable Randić index, atom-bond connectivity index, augmented Zagreb index, sum-connectivity index, many Adriatic indices, and many variable Adriatic indices). In this Letter we find tight upper and lower bounds for bond incident degree index for catacondensed fluoranthenes with given number of hexagons.

Beating the photon-number-splitting attack in practical quantum cryptography.

PubMed

Wang, Xiang-Bin

2005-06-17

We propose an efficient method to verify the upper bound of the fraction of counts caused by multiphoton pulses in practical quantum key distribution using weak coherent light, given whatever type of Eve's action. The protocol simply uses two coherent states for the signal pulses and vacuum for the decoy pulse. Our verified upper bound is sufficiently tight for quantum key distribution with a very lossy channel, in both the asymptotic and nonasymptotic case. So far our protocol is the only decoy-state protocol that works efficiently for currently existing setups.

The local interstellar helium density - Corrected

NASA Technical Reports Server (NTRS)

Freeman, J.; Paresce, F.; Bowyer, S.

1979-01-01

An upper bound for the number density of neutral helium in the local interstellar medium of 0.004 + or - 0.0022 per cu cm was previously reported, based on extreme-ultraviolet telescope observations at 584 A made during the 1975 Apollo-Soyuz Test Project. A variety of evidence is found which indicates that the 584-A sensitivity of the instrument declined by a factor of 2 between the last laboratory calibration and the time of the measurements. The upper bound on the helium density is therefore revised to 0.0089 + or - 0.005 per cu cm.

Upper bound on three-tangles of reduced states of four-qubit pure states

NASA Astrophysics Data System (ADS)

Sharma, S. Shelly; Sharma, N. K.

2017-06-01

Closed formulas for upper bounds on three-tangles of three-qubit reduced states in terms of three-qubit-invariant polynomials of pure four-qubit states are obtained. Our results offer tighter constraints on total three-way entanglement of a given qubit with the rest of the system than those used by Regula et al. [Phys. Rev. Lett. 113, 110501 (2014), 10.1103/PhysRevLett.113.110501 and Phys. Rev. Lett. 116, 049902(E) (2016)], 10.1103/PhysRevLett.116.049902 to verify monogamy of four-qubit quantum entanglement.

Outdoor, Indoor, and Personal Exposure to VOCs in Children

PubMed Central

Adgate, John L.; Church, Timothy R.; Ryan, Andrew D.; Ramachandran, Gurumurthy; Fredrickson, Ann L.; Stock, Thomas H.; Morandi, Maria T.; Sexton, Ken

2004-01-01

We measured volatile organic compound (VOC) exposures in multiple locations for a diverse population of children who attended two inner-city schools in Minneapolis, Minnesota. Fifteen common VOCs were measured at four locations: outdoors (O), indoors at school (S), indoors at home (H), and in personal samples (P). Concentrations of most VOCs followed the general pattern O ≈ S < P ≤ H across the measured microenvironments. The S and O environments had the smallest and H the largest influence on personal exposure to most compounds. A time-weighted model of P exposure using all measured microenvironments and time–activity data provided little additional explanatory power beyond that provided by using the H measurement alone. Although H and P concentrations of most VOCs measured in this study were similar to or lower than levels measured in recent personal monitoring studies of adults and children in the United States, p-dichlorobenzene was the notable exception to this pattern, with upper-bound exposures more than 100 times greater than those found in other studies of children. Median and upper-bound H and P exposures were well above health benchmarks for several compounds, so outdoor measurements likely underestimate long-term health risks from children’s exposure to these compounds. PMID:15471730

Spreading-vanishing dichotomy in a diffusive logistic model with a free boundary, II

NASA Astrophysics Data System (ADS)

Du, Yihong; Guo, Zongming

We study the diffusive logistic equation with a free boundary in higher space dimensions and heterogeneous environment. Such a model may be used to describe the spreading of a new or invasive species, with the free boundary representing the expanding front. For simplicity, we assume that the environment and the solution are radially symmetric. In the special case of one space dimension and homogeneous environment, this free boundary problem was investigated in Du and Lin (2010) [10]. We prove that the spreading-vanishing dichotomy established in Du and Lin (2010) [10] still holds in the more general and ecologically realistic setting considered here. Moreover, when spreading occurs, we obtain best possible upper and lower bounds for the spreading speed of the expanding front. When the environment is asymptotically homogeneous at infinity, these two bounds coincide. Our results indicate that the asymptotic spreading speed determined by this model does not depend on the spatial dimension.

Channel Simulation in Quantum Metrology

NASA Astrophysics Data System (ADS)

Laurenza, Riccardo; Lupo, Cosmo; Spedalieri, Gaetana; Braunstein, Samuel L.; Pirandola, Stefano

2018-04-01

In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels,wemay express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.

Adiabatic description of capture into resonance and surfatron acceleration of charged particles by electromagnetic waves.

PubMed

Artemyev, A V; Neishtadt, A I; Zelenyi, L M; Vainchtein, D L

2010-12-01

We present an analytical and numerical study of the surfatron acceleration of nonrelativistic charged particles by electromagnetic waves. The acceleration is caused by capture of particles into resonance with one of the waves. We investigate capture for systems with one or two waves and provide conditions under which the obtained results can be applied to systems with more than two waves. In the case of a single wave, the once captured particles never leave the resonance and their velocity grows linearly with time. However, if there are two waves in the system, the upper bound of the energy gain may exist and we find the analytical value of that bound. We discuss several generalizations including the relativistic limit, different wave amplitudes, and a wide range of the waves' wavenumbers. The obtained results are used for qualitative description of some phenomena observed in the Earth's magnetosphere. © 2010 American Institute of Physics.

Circuit bounds on stochastic transport in the Lorenz equations

NASA Astrophysics Data System (ADS)

Weady, Scott; Agarwal, Sahil; Wilen, Larry; Wettlaufer, J. S.

2018-07-01

In turbulent Rayleigh-Bénard convection one seeks the relationship between the heat transport, captured by the Nusselt number, and the temperature drop across the convecting layer, captured by the Rayleigh number. In experiments, one measures the Nusselt number for a given Rayleigh number, and the question of how close that value is to the maximal transport is a key prediction of variational fluid mechanics in the form of an upper bound. The Lorenz equations have traditionally been studied as a simplified model of turbulent Rayleigh-Bénard convection, and hence it is natural to investigate their upper bounds, which has previously been done numerically and analytically, but they are not as easily accessible in an experimental context. Here we describe a specially built circuit that is the experimental analogue of the Lorenz equations and compare its output to the recently determined upper bounds of the stochastic Lorenz equations [1]. The circuit is substantially more efficient than computational solutions, and hence we can more easily examine the system. Because of offsets that appear naturally in the circuit, we are motivated to study unique bifurcation phenomena that arise as a result. Namely, for a given Rayleigh number, we find a reentrant behavior of the transport on noise amplitude and this varies with Rayleigh number passing from the homoclinic to the Hopf bifurcation.

A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments.

PubMed

Heskes, Tom; Eisinga, Rob; Breitling, Rainer

2014-11-21

The rank product method is a powerful statistical technique for identifying differentially expressed molecules in replicated experiments. A critical issue in molecule selection is accurate calculation of the p-value of the rank product statistic to adequately address multiple testing. Both exact calculation and permutation and gamma approximations have been proposed to determine molecule-level significance. These current approaches have serious drawbacks as they are either computationally burdensome or provide inaccurate estimates in the tail of the p-value distribution. We derive strict lower and upper bounds to the exact p-value along with an accurate approximation that can be used to assess the significance of the rank product statistic in a computationally fast manner. The bounds and the proposed approximation are shown to provide far better accuracy over existing approximate methods in determining tail probabilities, with the slightly conservative upper bound protecting against false positives. We illustrate the proposed method in the context of a recently published analysis on transcriptomic profiling performed in blood. We provide a method to determine upper bounds and accurate approximate p-values of the rank product statistic. The proposed algorithm provides an order of magnitude increase in throughput as compared with current approaches and offers the opportunity to explore new application domains with even larger multiple testing issue. The R code is published in one of the Additional files and is available at http://www.ru.nl/publish/pages/726696/rankprodbounds.zip .

Energy Bounds for a Compressed Elastic Film on a Substrate

NASA Astrophysics Data System (ADS)

Bourne, David P.; Conti, Sergio; Müller, Stefan

2017-04-01

We study pattern formation in a compressed elastic film which delaminates from a substrate. Our key tool is the determination of rigorous upper and lower bounds on the minimum value of a suitable energy functional. The energy consists of two parts, describing the two main physical effects. The first part represents the elastic energy of the film, which is approximated using the von Kármán plate theory. The second part represents the fracture or delamination energy, which is approximated using the Griffith model of fracture. A simpler model containing the first term alone was previously studied with similar methods by several authors, assuming that the delaminated region is fixed. We include the fracture term, transforming the elastic minimisation into a free boundary problem, and opening the way for patterns which result from the interplay of elasticity and delamination. After rescaling, the energy depends on only two parameters: the rescaled film thickness, {σ }, and a measure of the bonding strength between the film and substrate, {γ }. We prove upper bounds on the minimum energy of the form {σ }^a {γ }^b and find that there are four different parameter regimes corresponding to different values of a and b and to different folding patterns of the film. In some cases, the upper bounds are attained by self-similar folding patterns as observed in experiments. Moreover, for two of the four parameter regimes we prove matching, optimal lower bounds.

New Operational Matrices for Solving Fractional Differential Equations on the Half-Line

PubMed Central

2015-01-01

In this paper, the fractional-order generalized Laguerre operational matrices (FGLOM) of fractional derivatives and fractional integration are derived. These operational matrices are used together with spectral tau method for solving linear fractional differential equations (FDEs) of order ν (0 < ν < 1) on the half line. An upper bound of the absolute errors is obtained for the approximate and exact solutions. Fractional-order generalized Laguerre pseudo-spectral approximation is investigated for solving nonlinear initial value problem of fractional order ν. The extension of the fractional-order generalized Laguerre pseudo-spectral method is given to solve systems of FDEs. We present the advantages of using the spectral schemes based on fractional-order generalized Laguerre functions and compare them with other methods. Several numerical examples are implemented for FDEs and systems of FDEs including linear and nonlinear terms. We demonstrate the high accuracy and the efficiency of the proposed techniques. PMID:25996369

New operational matrices for solving fractional differential equations on the half-line.

PubMed

Bhrawy, Ali H; Taha, Taha M; Alzahrani, Ebraheem O; Alzahrani, Ebrahim O; Baleanu, Dumitru; Alzahrani, Abdulrahim A

2015-01-01

In this paper, the fractional-order generalized Laguerre operational matrices (FGLOM) of fractional derivatives and fractional integration are derived. These operational matrices are used together with spectral tau method for solving linear fractional differential equations (FDEs) of order ν (0 < ν < 1) on the half line. An upper bound of the absolute errors is obtained for the approximate and exact solutions. Fractional-order generalized Laguerre pseudo-spectral approximation is investigated for solving nonlinear initial value problem of fractional order ν. The extension of the fractional-order generalized Laguerre pseudo-spectral method is given to solve systems of FDEs. We present the advantages of using the spectral schemes based on fractional-order generalized Laguerre functions and compare them with other methods. Several numerical examples are implemented for FDEs and systems of FDEs including linear and nonlinear terms. We demonstrate the high accuracy and the efficiency of the proposed techniques.

Optimal digital dynamical decoupling for general decoherence via Walsh modulation

NASA Astrophysics Data System (ADS)

Qi, Haoyu; Dowling, Jonathan P.; Viola, Lorenza

2017-11-01

We provide a general framework for constructing digital dynamical decoupling sequences based on Walsh modulation—applicable to arbitrary qubit decoherence scenarios. By establishing equivalence between decoupling design based on Walsh functions and on concatenated projections, we identify a family of optimal Walsh sequences, which can be exponentially more efficient, in terms of the required total pulse number, for fixed cancellation order, than known digital sequences based on concatenated design. Optimal sequences for a given cancellation order are highly non-unique—their performance depending sensitively on the control path. We provide an analytic upper bound to the achievable decoupling error and show how sequences within the optimal Walsh family can substantially outperform concatenated decoupling in principle, while respecting realistic timing constraints.

Saturn's very axisymmetric magnetic field: No detectable secular variation or tilt

NASA Astrophysics Data System (ADS)

Cao, Hao; Russell, Christopher T.; Christensen, Ulrich R.; Dougherty, Michele K.; Burton, Marcia E.

2011-04-01

Saturn is the only planet in the solar system whose observed magnetic field is highly axisymmetric. At least a small deviation from perfect symmetry is required for a dynamo-generated magnetic field. Analyzing more than six years of magnetometer data obtained by Cassini close to the planet, we show that Saturn's observed field is much more axisymmetric than previously thought. We invert the magnetometer observations that were obtained in the "current-free" inner magnetosphere for an internal model, varying the assumed unknown rotation rate of Saturn's deep interior. No unambiguous non-axially symmetric magnetic moment is detected, with a new upper bound on the dipole tilt of 0.06°. An axisymmetric internal model with Schmidt-normalized spherical harmonic coefficients g10 = 21,191 ± 24 nT, g20 = 1586 ± 7 nT. g30 = 2374 ± 47 nT is derived from these measurements, the upper bounds on the axial degree 4 and 5 terms are 720 nT and 3200 nT respectively. The secular variation for the last 30 years is within the probable error of each term from degree 1 to 3, and the upper bounds are an order of magnitude smaller than in similar terrestrial terms for degrees 1 and 2. Differentially rotating conducting stable layers above Saturn's dynamo region have been proposed to symmetrize the magnetic field (Stevenson, 1982). The new upper bound on the dipole tilt implies that this stable layer must have a thickness L >= 4000 km, and this thickness is consistent with our weak secular variation observations.

A prevalence-based approach to societal costs occurring in consequence of child abuse and neglect

PubMed Central

2012-01-01

Background Traumatization in childhood can result in lifelong health impairment and may have a negative impact on other areas of life such as education, social contacts and employment as well. Despite the frequent occurrence of traumatization, which is reflected in a 14.5 percent prevalence rate of severe child abuse and neglect, the economic burden of the consequences is hardly known. The objective of this prevalence-based cost-of-illness study is to show how impairment of the individual is reflected in economic trauma follow-up costs borne by society as a whole in Germany and to compare the results with other countries’ costs. Methods From a societal perspective trauma follow-up costs were estimated using a bottom-up approach. The literature-based prevalence rate includes emotional, physical and sexual abuse as well as physical and emotional neglect in Germany. Costs are derived from individual case scenarios of child endangerment presented in a German cost-benefit-analysis. A comparison with trauma follow-up costs in Australia, Canada and the USA is based on purchasing power parity. Results The annual trauma follow-up costs total to a margin of EUR 11.1 billion for the lower bound and to EUR 29.8 billion for the upper bound. This equals EUR 134.84 and EUR 363.58, respectively, per capita for the German population. These results conform to the ones obtained from cost studies conducted in Australia (lower bound) and Canada (upper bound), whereas the result for the United States is much lower. Conclusion Child abuse and neglect result in trauma follow-up costs of economically relevant magnitude for the German society. Although the result is well in line with other countries’ costs, the general lack of data should be fought in order to enable more detailed future studies. Creating a reliable cost data basis in the first place can pave the way for long-term cost savings. PMID:23158382

A prevalence-based approach to societal costs occurring in consequence of child abuse and neglect.

PubMed

Habetha, Susanne; Bleich, Sabrina; Weidenhammer, Jörg; Fegert, Jörg M

2012-11-16

Traumatization in childhood can result in lifelong health impairment and may have a negative impact on other areas of life such as education, social contacts and employment as well. Despite the frequent occurrence of traumatization, which is reflected in a 14.5 percent prevalence rate of severe child abuse and neglect, the economic burden of the consequences is hardly known. The objective of this prevalence-based cost-of-illness study is to show how impairment of the individual is reflected in economic trauma follow-up costs borne by society as a whole in Germany and to compare the results with other countries' costs. From a societal perspective trauma follow-up costs were estimated using a bottom-up approach. The literature-based prevalence rate includes emotional, physical and sexual abuse as well as physical and emotional neglect in Germany. Costs are derived from individual case scenarios of child endangerment presented in a German cost-benefit-analysis. A comparison with trauma follow-up costs in Australia, Canada and the USA is based on purchasing power parity. The annual trauma follow-up costs total to a margin of EUR 11.1 billion for the lower bound and to EUR 29.8 billion for the upper bound. This equals EUR 134.84 and EUR 363.58, respectively, per capita for the German population. These results conform to the ones obtained from cost studies conducted in Australia (lower bound) and Canada (upper bound), whereas the result for the United States is much lower. Child abuse and neglect result in trauma follow-up costs of economically relevant magnitude for the German society. Although the result is well in line with other countries' costs, the general lack of data should be fought in order to enable more detailed future studies. Creating a reliable cost data basis in the first place can pave the way for long-term cost savings.

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

Baker, Kyri; Toomey, Bridget

Evolving power systems with increasing levels of stochasticity call for a need to solve optimal power flow problems with large quantities of random variables. Weather forecasts, electricity prices, and shifting load patterns introduce higher levels of uncertainty and can yield optimization problems that are difficult to solve in an efficient manner. Solution methods for single chance constraints in optimal power flow problems have been considered in the literature, ensuring single constraints are satisfied with a prescribed probability; however, joint chance constraints, ensuring multiple constraints are simultaneously satisfied, have predominantly been solved via scenario-based approaches or by utilizing Boole's inequality asmore » an upper bound. In this paper, joint chance constraints are used to solve an AC optimal power flow problem while preventing overvoltages in distribution grids under high penetrations of photovoltaic systems. A tighter version of Boole's inequality is derived and used to provide a new upper bound on the joint chance constraint, and simulation results are shown demonstrating the benefit of the proposed upper bound. The new framework allows for a less conservative and more computationally efficient solution to considering joint chance constraints, specifically regarding preventing overvoltages.« less

Lorenz curves in a new science-funding model

NASA Astrophysics Data System (ADS)

Huang, Ding-wei

2017-12-01

We propose an agent-based model to theoretically and systematically explore the implications of a new approach to fund science, which has been suggested recently by J. Bollen et al.[?] We introduce various parameters and examine their effects. The concentration of funding is shown by the Lorenz curve and the Gini coefficient. In this model, all scientists are treated equally and follow the well-intended regulations. All scientists give a fixed ratio of their funding to others. The fixed ratio becomes an upper bound for the Gini coefficient. We observe two distinct regimes in the parameter space: valley and plateau. In the valley regime, the fluidity of funding is significant. The Lorenz curve is smooth. The Gini coefficient is well below the upper bound. The funding distribution is the desired result. In the plateau regime, the cumulative advantage is significant. The Lorenz curve has a sharp turn. The Gini coefficient saturates to the upper bound. The undue concentration of funding happens swiftly. The funding distribution is the undesired results, where a minority of scientists take the majority of funding. Phase transitions between these two regimes are discussed.

Error control techniques for satellite and space communications

NASA Technical Reports Server (NTRS)

Costello, Daniel J., Jr.

1990-01-01

An expurgated upper bound on the event error probability of trellis coded modulation is presented. This bound is used to derive a lower bound on the minimum achievable free Euclidean distance d sub (free) of trellis codes. It is shown that the dominant parameters for both bounds, the expurgated error exponent and the asymptotic d sub (free) growth rate, respectively, can be obtained from the cutoff-rate R sub O of the transmission channel by a simple geometric construction, making R sub O the central parameter for finding good trellis codes. Several constellations are optimized with respect to the bounds.

On the impact of communication complexity in the design of parallel numerical algorithms

NASA Technical Reports Server (NTRS)

Gannon, D.; Vanrosendale, J.

1984-01-01

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

On the impact of communication complexity on the design of parallel numerical algorithms

NASA Technical Reports Server (NTRS)

Gannon, D. B.; Van Rosendale, J.

1984-01-01

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Some New Properties of Quantum Correlations

NASA Astrophysics Data System (ADS)

Liu, Feng; Li, Fei; Wei, Yunxia

2017-02-01

Quantum coherence measures the correlation between different measurement results in a single-system, while entanglement and quantum discord measure the correlation among different subsystems in a multipartite system. In this paper, we focus on the relative entropy form of them, and obtain three new properties of them as follows: 1) General forms of maximally coherent states for the relative entropy coherence, 2) Linear monogamy of the relative entropy entanglement, and 3) Subadditivity of quantum discord. Here, the linear monogamy is defined as there is a small constant as the upper bound on the sum of the relative entropy entanglement in subsystems.

Variability in sinking fluxes and composition of particle-bound phosphorus in the Xisha area of the northern South China Sea

NASA Astrophysics Data System (ADS)

Dong, Yuan; Li, Qian P.; Wu, Zhengchao; Zhang, Jia-Zhong

2016-12-01

Export fluxes of phosphorus (P) by sinking particles are important in studying ocean biogeochemical dynamics, whereas their composition and temporal variability are still inadequately understood in the global oceans, including the northern South China Sea (NSCS). A time-series study of particle fluxes was conducted at a mooring station adjacent to the Xisha Trough in the NSCS from September 2012 to September 2014, with sinking particles collected every two weeks by two sediment traps deployed at 500 m and 1500 m depths. Five operationally defined particulate P classes of sinking particles including loosely-bound P, Fe-bound P, CaCO3-bound P, detrital apatite P, and refractory organic P were quantified by a sequential extraction method (SEDEX). Our results revealed substantial variability in sinking particulate P composition at the Xisha over two years of samplings. Particulate inorganic P was largely contributed from Fe-bound P in the upper trap, but detrital P in the lower trap. Particulate organic P, including exchangeable organic P, CaCO3-bound organic P, and refractory organic P, contributed up to 50-55% of total sinking particulate P. Increase of CaCO3-bound P in the upper trap during 2014 could be related to a strong El Niño event with enhanced CaCO3 deposition. We also found sediment resuspension responsible for the unusual high particles fluxes at the lower trap based on analyses of a two-component mixing model. There was on average a total mass flux of 78±50 mg m-2 d-1 at the upper trap during the study period. A significant correlation between integrated primary productivity in the region and particle fluxes at 500 m of the station suggested the important role of biological production in controlling the concentration, composition, and export fluxes of sinking particulate P in the NSCS.

ON COMPUTING UPPER LIMITS TO SOURCE INTENSITIES

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

Kashyap, Vinay L.; Siemiginowska, Aneta; Van Dyk, David A.

2010-08-10

A common problem in astrophysics is determining how bright a source could be and still not be detected in an observation. Despite the simplicity with which the problem can be stated, the solution involves complicated statistical issues that require careful analysis. In contrast to the more familiar confidence bound, this concept has never been formally analyzed, leading to a great variety of often ad hoc solutions. Here we formulate and describe the problem in a self-consistent manner. Detection significance is usually defined by the acceptable proportion of false positives (background fluctuations that are claimed as detections, or Type I error),more » and we invoke the complementary concept of false negatives (real sources that go undetected, or Type II error), based on the statistical power of a test, to compute an upper limit to the detectable source intensity. To determine the minimum intensity that a source must have for it to be detected, we first define a detection threshold and then compute the probabilities of detecting sources of various intensities at the given threshold. The intensity that corresponds to the specified Type II error probability defines that minimum intensity and is identified as the upper limit. Thus, an upper limit is a characteristic of the detection procedure rather than the strength of any particular source. It should not be confused with confidence intervals or other estimates of source intensity. This is particularly important given the large number of catalogs that are being generated from increasingly sensitive surveys. We discuss, with examples, the differences between these upper limits and confidence bounds. Both measures are useful quantities that should be reported in order to extract the most science from catalogs, though they answer different statistical questions: an upper bound describes an inference range on the source intensity, while an upper limit calibrates the detection process. We provide a recipe for computing upper limits that applies to all detection algorithms.« less

Reverse preferential spread in complex networks

NASA Astrophysics Data System (ADS)

Toyoizumi, Hiroshi; Tani, Seiichi; Miyoshi, Naoto; Okamoto, Yoshio

2012-08-01

Large-degree nodes may have a larger influence on the network, but they can be bottlenecks for spreading information since spreading attempts tend to concentrate on these nodes and become redundant. We discuss that the reverse preferential spread (distributing information inversely proportional to the degree of the receiving node) has an advantage over other spread mechanisms. In large uncorrelated networks, we show that the mean number of nodes that receive information under the reverse preferential spread is an upper bound among any other weight-based spread mechanisms, and this upper bound is indeed a logistic growth independent of the degree distribution.

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks

NASA Astrophysics Data System (ADS)

Chung, Tein-Yaw; Lee, Kuan-Chun; Lee, Hsiao-Chih

This paper derived a closed-form expression for inter-flow capacity of a backhaul wireless mesh network (WMN) with centralized scheduling by employing a ring-based approach. Through the definition of an interference area, we are able to accurately describe a bottleneck collision area for a WMN and calculate the upper bound of inter-flow capacity. The closed-form expression shows that the upper bound is a function of the ratio between transmission range and network radius. Simulations and numerical analysis show that our analytic solution can better estimate the inter-flow capacity of WMNs than that of previous approach.

[The synaptic proteins of the temporal associative area in the neocortex (field Ep) of cats with normal and decreased cognitive capacities].

PubMed

Zakharova (Orlova), E I; Mukhin, E I

1994-01-01

Fractions of light and heavy synaptosomes were prepared from associative temporal area of cat brain, which were previously tested behaviorally for ability to solve the generalization, gnostic and abstraction tasks. The synaptic membrane subfractions and synaptoplasma fractions were isolated and the content of the total protein and of the demasked protein sulfhydryl groups (SH groups) was investigated spectrophotometrically. The maximal content of the demasked SH groups was revealed in the upper subfractions (mainly the membranes of cholinergic synapses) and minimal content--in the lower subfractions (mainly noncholinergic synapses). Significantly smaller total protein content in the upper and middle subfractions of light synaptosomes was found, and more demasked SH groups in the membrane-bound proteins of the upper and middle subfractions of light and heavy synaptosomes was found in the cortex area of the "clever" then "silly" cats. Suggestion concerning characteristic for brains of "clever" cats relatively low total quantity of synapses in the area Ep of the cortex and significantly higher proportion of cholinergic ones is discussed.

Toward allocative efficiency in the prescription drug industry.

PubMed

Guell, R C; Fischbaum, M

1995-01-01

Traditionally, monopoly power in the pharmaceutical industry has been measured by profits. An alternative method estimates the deadweight loss of consumer surplus associated with the exercise of monopoly power. Although upper and lower bound estimates for this inefficiency are far apart, they at least suggest a dramatically greater welfare loss than measures of industry profitability would imply. A proposed system would have the U.S. government employing its power of eminent domain to "take" and distribute pharmaceutical patents, providing as "just compensation" the present value of the patent's expected future monopoly profits. Given the allocative inefficiency of raising taxes to pay for the program, the impact of the proposal on allocative efficiency would be at least as good at our lower bound estimate of monopoly costs while substantially improving efficiency at or near our upper bound estimate.

Tight upper bound for the maximal quantum value of the Svetlichny operators

NASA Astrophysics Data System (ADS)

Li, Ming; Shen, Shuqian; Jing, Naihuan; Fei, Shao-Ming; Li-Jost, Xianqing

2017-10-01

It is a challenging task to detect genuine multipartite nonlocality (GMNL). In this paper, the problem is considered via computing the maximal quantum value of Svetlichny operators for three-qubit systems and a tight upper bound is obtained. The constraints on the quantum states for the tightness of the bound are also presented. The approach enables us to give the necessary and sufficient conditions of violating the Svetlichny inequality (SI) for several quantum states, including the white and color noised Greenberger-Horne-Zeilinger (GHZ) states. The relation between the genuine multipartite entanglement concurrence and the maximal quantum value of the Svetlichny operators for mixed GHZ class states is also discussed. As the SI is useful for the investigation of GMNL, our results give an effective and operational method to detect the GMNL for three-qubit mixed states.

A lower bound on the Milky Way mass from general phase-space distribution function models

NASA Astrophysics Data System (ADS)

Bratek, Łukasz; Sikora, Szymon; Jałocha, Joanna; Kutschera, Marek

2014-02-01

We model the phase-space distribution of the kinematic tracers using general, smooth distribution functions to derive a conservative lower bound on the total mass within ≈150-200 kpc. By approximating the potential as Keplerian, the phase-space distribution can be simplified to that of a smooth distribution of energies and eccentricities. Our approach naturally allows for calculating moments of the distribution function, such as the radial profile of the orbital anisotropy. We systematically construct a family of phase-space functions with the resulting radial velocity dispersion overlapping with the one obtained using data on radial motions of distant kinematic tracers, while making no assumptions about the density of the tracers and the velocity anisotropy parameter β regarded as a function of the radial variable. While there is no apparent upper bound for the Milky Way mass, at least as long as only the radial motions are concerned, we find a sharp lower bound for the mass that is small. In particular, a mass value of 2.4 × 1011 M⊙, obtained in the past for lower and intermediate radii, is still consistent with the dispersion profile at larger radii. Compared with much greater mass values in the literature, this result shows that determining the Milky Way mass is strongly model-dependent. We expect a similar reduction of mass estimates in models assuming more realistic mass profiles. Full Table 1 is only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (ftp://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/562/A134

Vacuum stability in the U(1)χ extended model with vanishing scalar potential at the Planck scale

NASA Astrophysics Data System (ADS)

Haba, Naoyuki; Yamaguchi, Yuya

2015-09-01

We investigate the vacuum stability in a scale invariant local {U}(1)_χ model with vanishing scalar potential at the Planck scale. We find that it is impossible to realize the Higgs mass of 125 GeV while keeping the Higgs quartic coupling λ _H positive in all energy scales, that is, the same as the standard model. Once one allows λ _H<0, the lower bounds of the Z' boson mass ares obtained through the positive definiteness of the scalar mass squared eigenvalues, while the bounds are smaller than the LHC bounds. On the other hand, the upper bounds strongly depend on the number of relevant Majorana Yukawa couplings of the right-handed neutrinos N_ν . Considering decoupling effects of the Z' boson and the right-handed neutrinos, the condition of the singlet scalar quartic coupling λ _φ >0 gives the upper bound in the N_ν =1 case, while it does not constrain the N_ν =2 and 3 cases. In particular, we find that the Z' boson mass is tightly restricted for the N_ν =1 case as M_{Z'} &lsim 3.7 TeV.

Improved upper bounds on energy dissipation rates in plane Couette flow with boundary injection and suction

NASA Astrophysics Data System (ADS)

Lee, Harry; Wen, Baole; Doering, Charles

2017-11-01

The rate of viscous energy dissipation ɛ in incompressible Newtonian planar Couette flow (a horizontal shear layer) imposed with uniform boundary injection and suction is studied numerically. Specifically, fluid is steadily injected through the top plate with a constant rate at a constant angle of injection, and the same amount of fluid is sucked out vertically through the bottom plate at the same rate. This set-up leads to two control parameters, namely the angle of injection, θ, and the Reynolds number of the horizontal shear flow, Re . We numerically implement the `background field' variational problem formulated by Constantin and Doering with a one-dimensional unidirectional background field ϕ(z) , where z aligns with the distance between the plates. Computation is carried out at various levels of Re with θ = 0 , 0 .1° ,1° and 2°, respectively. The computed upper bounds on ɛ scale like Re0 as Re > 20 , 000 for each fixed θ, this agrees with Kolmogorov's hypothesis on isotropic turbulence. The outcome provides new upper bounds to ɛ among any solution to the underlying Navier-Stokes equations, and they are sharper than the analytical bounds presented in Doering et al. (2000). This research was partially supported by the NSF Award DMS-1515161, and the University of Michigan's Rackham Graduate Student Research Grant.

$$ \\mathcal{N} $$ = 4 superconformal bootstrap of the K 3 CFT

DOE PAGES

Lin, Ying-Hsuan; Shao, Shu-Heng; Simmons-Duffin, David; ...

2017-05-23

We study two-dimensional (4; 4) superconformal eld theories of central charge c = 6, corresponding to nonlinear sigma models on K3 surfaces, using the superconformal bootstrap. This is made possible through a surprising relation between the BPS N = 4 superconformal blocks with c = 6 and bosonic Virasoro conformal blocks with c = 28, and an exact result on the moduli dependence of a certain integrated BPS 4-point function. Nontrivial bounds on the non-BPS spectrum in the K3 CFT are obtained as functions of the CFT moduli, that interpolate between the free orbifold points and singular CFT points. Wemore » observe directly from the CFT perspective the signature of a continuous spectrum above a gap at the singular moduli, and fi nd numerically an upper bound on this gap that is saturated by the A1 N = 4 cigar CFT. We also derive an analytic upper bound on the fi rst nonzero eigenvalue of the scalar Laplacian on K3 in the large volume regime, that depends on the K3 moduli data. As two byproducts, we find an exact equivalence between a class of BPS N = 2 superconformal blocks and Virasoro conformal blocks in two dimensions, and an upper bound on the four-point functions of operators of sufficiently low scaling dimension in three and four dimensional CFTs.« less

$$ \\mathcal{N} $$ = 4 superconformal bootstrap of the K 3 CFT

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

Lin, Ying-Hsuan; Shao, Shu-Heng; Simmons-Duffin, David

We study two-dimensional (4; 4) superconformal eld theories of central charge c = 6, corresponding to nonlinear sigma models on K3 surfaces, using the superconformal bootstrap. This is made possible through a surprising relation between the BPS N = 4 superconformal blocks with c = 6 and bosonic Virasoro conformal blocks with c = 28, and an exact result on the moduli dependence of a certain integrated BPS 4-point function. Nontrivial bounds on the non-BPS spectrum in the K3 CFT are obtained as functions of the CFT moduli, that interpolate between the free orbifold points and singular CFT points. Wemore » observe directly from the CFT perspective the signature of a continuous spectrum above a gap at the singular moduli, and fi nd numerically an upper bound on this gap that is saturated by the A1 N = 4 cigar CFT. We also derive an analytic upper bound on the fi rst nonzero eigenvalue of the scalar Laplacian on K3 in the large volume regime, that depends on the K3 moduli data. As two byproducts, we find an exact equivalence between a class of BPS N = 2 superconformal blocks and Virasoro conformal blocks in two dimensions, and an upper bound on the four-point functions of operators of sufficiently low scaling dimension in three and four dimensional CFTs.« less

Comonotonic bounds on the survival probabilities in the Lee-Carter model for mortality projection

NASA Astrophysics Data System (ADS)

Denuit, Michel; Dhaene, Jan

2007-06-01

In the Lee-Carter framework, future survival probabilities are random variables with an intricate distribution function. In large homogeneous portfolios of life annuities, value-at-risk or conditional tail expectation of the total yearly payout of the company are approximately equal to the corresponding quantities involving random survival probabilities. This paper aims to derive some bounds in the increasing convex (or stop-loss) sense on these random survival probabilities. These bounds are obtained with the help of comonotonic upper and lower bounds on sums of correlated random variables.

OPERATOR NORM INEQUALITIES BETWEEN TENSOR UNFOLDINGS ON THE PARTITION LATTICE

PubMed Central

Wang, Miaoyan; Duc, Khanh Dao; Fischer, Jonathan; Song, Yun S.

2017-01-01

Interest in higher-order tensors has recently surged in data-intensive fields, with a wide range of applications including image processing, blind source separation, community detection, and feature extraction. A common paradigm in tensor-related algorithms advocates unfolding (or flattening) the tensor into a matrix and applying classical methods developed for matrices. Despite the popularity of such techniques, how the functional properties of a tensor changes upon unfolding is currently not well understood. In contrast to the body of existing work which has focused almost exclusively on matricizations, we here consider all possible unfoldings of an order-k tensor, which are in one-to-one correspondence with the set of partitions of {1, …, k}. We derive general inequalities between the lp-norms of arbitrary unfoldings defined on the partition lattice. In particular, we demonstrate how the spectral norm (p = 2) of a tensor is bounded by that of its unfoldings, and obtain an improved upper bound on the ratio of the Frobenius norm to the spectral norm of an arbitrary tensor. For specially-structured tensors satisfying a generalized definition of orthogonal decomposability, we prove that the spectral norm remains invariant under specific subsets of unfolding operations. PMID:28286347

Trajectories of bright stars at the Galactic Center as a tool to evaluate a graviton mass

NASA Astrophysics Data System (ADS)

Zakharov, Alexander; Jovanović, Predrag; Borka, Dusko; Jovanović, Vesna Borka

2016-10-01

Scientists worked in Saint-Petersburg (Petrograd, Leningrad) played the extremely important role in creation of scientific school and development of general relativity in Russia. Very recently LIGO collaboration discovered gravitational waves [1] predicted 100 years ago by A. Einstein. In the papers reporting about this discovery, the joint LIGO & VIRGO team presented an upper limit on graviton mass such as mg < 1.2 × 10-22eV [1, 2]. The authors concluded that their observational data do not show violations of classical general relativity because the graviton mass limit is very small. We show that an analysis of bright star trajectories could bound graviton mass with a comparable accuracy with accuracies reached with gravitational wave interferometers and expected with forthcoming pulsar timing observations for gravitational wave detection. This analysis gives an opportunity to treat observations of bright stars near the Galactic Center as a tool for an evaluation specific parameters of the black hole and also to obtain constraints on the fundamental gravity law such as a modifications of Newton gravity law in a weak field approximation. In that way, based on a potential reconstruction at the Galactic Center we give a bounds on a graviton mass.

OPERATOR NORM INEQUALITIES BETWEEN TENSOR UNFOLDINGS ON THE PARTITION LATTICE.

PubMed

Wang, Miaoyan; Duc, Khanh Dao; Fischer, Jonathan; Song, Yun S

2017-05-01

Interest in higher-order tensors has recently surged in data-intensive fields, with a wide range of applications including image processing, blind source separation, community detection, and feature extraction. A common paradigm in tensor-related algorithms advocates unfolding (or flattening) the tensor into a matrix and applying classical methods developed for matrices. Despite the popularity of such techniques, how the functional properties of a tensor changes upon unfolding is currently not well understood. In contrast to the body of existing work which has focused almost exclusively on matricizations, we here consider all possible unfoldings of an order- k tensor, which are in one-to-one correspondence with the set of partitions of {1, …, k }. We derive general inequalities between the l p -norms of arbitrary unfoldings defined on the partition lattice. In particular, we demonstrate how the spectral norm ( p = 2) of a tensor is bounded by that of its unfoldings, and obtain an improved upper bound on the ratio of the Frobenius norm to the spectral norm of an arbitrary tensor. For specially-structured tensors satisfying a generalized definition of orthogonal decomposability, we prove that the spectral norm remains invariant under specific subsets of unfolding operations.

Mantle dynamics in super-Earths: Post-perovskite rheology and self-regulation of viscosity

NASA Astrophysics Data System (ADS)

Tackley, P. J.; Ammann, M.; Brodholt, J. P.; Dobson, D. P.; Valencia, D.

2013-07-01

The discovery of extra-solar "super-Earth" planets with sizes up to twice that of Earth has prompted interest in their possible lithosphere and mantle dynamics and evolution. Simple scalings suggest that super-Earths are more likely than an equivalent Earth-sized planet to be undergoing plate tectonics. Generally, viscosity and thermal conductivity increase with pressure while thermal expansivity decreases, resulting in lower convective vigour in the deep mantle, which, if extralopated to the largest super-Earths might, according to conventional thinking, result in no convection in their deep mantles due to the very low effective Rayleigh number. Here we evaluate this. First, as the mantle of a super-Earth is made mostly of post-perovskite we here extend the density functional theory (DFT) calculations of post-perovskite activation enthalpy of to a pressure of 1 TPa, for both slowest diffusion (upper-bound rheology) and fastest diffusion (lower-bound rheology) directions. Along a 1600 K adiabat the upper-bound rheology would lead to a post-perovskite layer of a very high (˜1030 Pa s) but relatively uniform viscosity, whereas the lower-bound rheology leads to a post-perovskite viscosity increase of ˜7 orders of magnitude with depth; in both cases the deep mantle viscosity would be too high for convection. Second, we use these DFT-calculated values in statistically steady-state numerical simulations of mantle convection and lithosphere dynamics of planets with up to ten Earth masses. The models assume a compressible mantle including depth-dependence of material properties and plastic yielding induced plate-like lithospheric behaviour. Results confirm the likelihood of plate tectonics for planets with Earth-like surface conditions (temperature and water) and show a self-regulation of deep mantle temperature. The deep mantle is not adiabatic; instead feedback between internal heating, temperature and viscosity regulates the temperature such that the viscosity has the value needed to facilitate convective loss of the radiogenic heat, which results in a very hot perovskite layer for the upper-bound rheology, a super-adiabatic perovskite layer for the lower-bound rheology, and an azimuthally-averaged viscosity of no more than 1026 Pa s. Convection in large super-Earths is characterised by large upwellings (even with zero basal heating) and small, time-dependent downwellings, which for large super-Earths merge into broad downwellings. In the context of planetary evolution, if, as is likely, a super-Earth was extremely hot/molten after its formation, it is thus likely that even after billions of years its deep interior is still extremely hot and possibly substantially molten with a "super basal magma ocean" - a larger version of the proposal of Labrosse et al. (Labrosse, S., Hernlund, J.W., Coltice, N. [2007]. Nature 450, 866-869), although this depends on presently unknown melt-solid density contrast and solidus.

When, not if: the inescapability of an uncertain climate future.

PubMed

Ballard, Timothy; Lewandowsky, Stephan

2015-11-28

Climate change projections necessarily involve uncertainty. Analysis of the physics and mathematics of the climate system reveals that greater uncertainty about future temperature increases is nearly always associated with greater expected damages from climate change. In contrast to those normative constraints, uncertainty is frequently cited in public discourse as a reason to delay mitigative action. This failure to understand the actual implications of uncertainty may incur notable future costs. It is therefore important to communicate uncertainty in a way that improves people's understanding of climate change risks. We examined whether responses to projections were influenced by whether the projection emphasized uncertainty in the outcome or in its time of arrival. We presented participants with statements and graphs indicating projected increases in temperature, sea levels, ocean acidification and a decrease in arctic sea ice. In the uncertain-outcome condition, statements reported the upper and lower confidence bounds of the projected outcome at a fixed time point. In the uncertain time-of-arrival condition, statements reported the upper and lower confidence bounds of the projected time of arrival for a fixed outcome. Results suggested that people perceived the threat as more serious and were more likely to encourage mitigative action in the time-uncertain condition than in the outcome-uncertain condition. This finding has implications for effectively communicating the climate change risks to policy-makers and the general public. © 2015 The Author(s).

A screening-level assessment of the health risks of chronic smoke exposure for wildland firefighters.

PubMed

Booze, Thomas F; Reinhardt, Timothy E; Quiring, Sharon J; Ottmar, Roger D

2004-05-01

A screening health risk assessment was performed to assess the upper-bound risks of cancer and noncancer adverse health effects among wildland firefighters performing wildfire suppression and prescribed burn management. Of the hundreds of chemicals in wildland fire smoke, we identified 15 substances of potential concern from the standpoints of concentration and toxicology; these included aldehydes, polycyclic aromatic hydrocarbons, carbon monoxide, benzene, and respirable particulate matter. Data defining daily exposures to smoke at prescribed burns and wildfires, potential days of exposure in a year, and career lengths were used to estimate average and reasonable maximum career inhalation exposures to these substances. Of the 15 substances in smoke that were evaluated, only benzene and formaldehyde posed a cancer risk greater than 1 per million, while only acrolein and respirable particulate matter exposures resulted in hazard indices greater than 1.0. The estimated upper-bound cancer risks ranged from 1.4 to 220 excess cancers per million, and noncancer hazard indices ranged from 9 to 360, depending on the exposure group. These values only indicate the likelihood of adverse health effects, not whether they will or will not occur. The risk assessment process narrows the field of substances that deserve further assessment, and the hazards identified by risk assessment generally agree with those identified as a concern in occupational exposure assessments.

Effective elastic moduli of triangular lattice material with defects

NASA Astrophysics Data System (ADS)

Liu, Xiaoyu; Liang, Naigang

2012-10-01

This paper presents an attempt to extend homogenization analysis for the effective elastic moduli of triangular lattice materials with microstructural defects. The proposed homogenization method adopts a process based on homogeneous strain boundary conditions, the micro-scale constitutive law and the micro-to-macro static operator to establish the relationship between the macroscopic properties of a given lattice material to its micro-discrete behaviors and structures. Further, the idea behind Eshelby's equivalent eigenstrain principle is introduced to replace a defect distribution by an imagining displacement field (eigendisplacement) with the equivalent mechanical effect, and the triangular lattice Green's function technique is developed to solve the eigendisplacement field. The proposed method therefore allows handling of different types of microstructural defects as well as its arbitrary spatial distribution within a general and compact framework. Analytical closed-form estimations are derived, in the case of the dilute limit, for all the effective elastic moduli of stretch-dominated triangular lattices containing fractured cell walls and missing cells, respectively. Comparison with numerical results, the Hashin-Shtrikman upper bounds and uniform strain upper bounds are also presented to illustrate the predictive capability of the proposed method for lattice materials. Based on this work, we propose that not only the effective Young's and shear moduli but also the effective Poisson's ratio of triangular lattice materials depend on the number density of fractured cell walls and their spatial arrangements.

Spherically symmetric vacuum in covariant F (T )=T +α/2 T2+O (Tγ) gravity theory

NASA Astrophysics Data System (ADS)

DeBenedictis, Andrew; Ilijić, Saša

2016-12-01

Recently, a fully covariant version of the theory of F (T ) torsion gravity has been introduced by M. Kršśák and E. Saridakis [Classical Quantum Gravity 33, 115009 (2016)]. In covariant F (T ) gravity, the Schwarzschild solution is not a vacuum solution for F (T )≠T , and therefore determining the spherically symmetric vacuum is an important open problem. Within the covariant framework, we perturbatively solve the spherically symmetric vacuum gravitational equations around the Schwarzschild solution for the scenario with F (T )=T +(α /2 )T2 , representing the dominant terms in theories governed by Lagrangians analytic in the torsion scalar. From this, we compute the perihelion shift correction to solar system planetary orbits as well as perturbative gravitational effects near neutron stars. This allows us to set an upper bound on the magnitude of the coupling constant, α , which governs deviations from general relativity. We find the bound on this nonlinear torsion coupling constant by specifically considering the uncertainty in the perihelion shift of Mercury. We also analyze a bound from a similar comparison with the periastron orbit of the binary pulsar PSR J0045-7319 as an independent check for consistency. Setting bounds on the dominant nonlinear coupling is important in determining if other effects in the Solar System or greater universe could be attributable to nonlinear torsion.

Bounds on graviton mass using weak lensing and SZ effect in galaxy clusters

NASA Astrophysics Data System (ADS)

Rana, Akshay; Jain, Deepak; Mahajan, Shobhit; Mukherjee, Amitabha

2018-06-01

In General Relativity (GR), the graviton is massless. However, a common feature in several theoretical alternatives of GR is a non-zero mass for the graviton. These theories can be described as massive gravity theories. Despite many theoretical complexities in these theories, on phenomenological grounds the implications of massive gravity have been widely used to put bounds on graviton mass. One of the generic implications of giving a mass to the graviton is that the gravitational potential will follow a Yukawa-like fall off. We use this feature of massive gravity theories to probe the mass of graviton by using the largest gravitationally bound objects, namely galaxy clusters. In this work, we use the mass estimates of galaxy clusters measured at various cosmologically defined radial distances measured via weak lensing (WL) and Sunyaev-Zel'dovich (SZ) effect. We also use the model independent values of Hubble parameter H (z) smoothed by a non-parametric method, Gaussian process. Within 1σ confidence region, we obtain the mass of graviton mg < 5.9 ×10-30 eV with the corresponding Compton length scale λg > 6.82 Mpc from weak lensing and mg < 8.31 ×10-30 eV with λg > 5.012 Mpc from SZ effect. This analysis improves the upper bound on graviton mass obtained earlier from galaxy clusters.

Simplified phenomenology for colored dark sectors

NASA Astrophysics Data System (ADS)

El Hedri, Sonia; Kaminska, Anna; de Vries, Maikel; Zurita, Jose

2017-04-01

We perform a general study of the relic density and LHC constraints on simplified models where the dark matter coannihilates with a strongly interacting particle X. In these models, the dark matter depletion is driven by the self-annihilation of X to pairs of quarks and gluons through the strong interaction. The phenomenology of these scenarios therefore only depends on the dark matter mass and the mass splitting between dark matter and X as well as the quantum numbers of X. In this paper, we consider simplified models where X can be either a scalar, a fermion or a vector, as well as a color triplet, sextet or octet. We compute the dark matter relic density constraints taking into account Sommerfeld corrections and bound state formation. Furthermore, we examine the restrictions from thermal equilibrium, the lifetime of X and the current and future LHC bounds on X pair production. All constraints are comprehensively presented in the mass splitting versus dark matter mass plane. While the relic density constraints can lead to upper bounds on the dark matter mass ranging from 2 TeV to more than 10 TeV across our models, the prospective LHC bounds range from 800 to 1500 GeV. A full coverage of the strongly coannihilating dark matter parameter space would therefore require hadron colliders with significantly higher center-of-mass energies.

Effects of triplet Higgs bosons in long baseline neutrino experiments

NASA Astrophysics Data System (ADS)

Huitu, K.; Kärkkäinen, T. J.; Maalampi, J.; Vihonen, S.

2018-05-01

The triplet scalars (Δ =Δ++,Δ+,Δ0) utilized in the so-called type-II seesaw model to explain the lightness of neutrinos, would generate nonstandard interactions (NSI) for a neutrino propagating in matter. We investigate the prospects to probe these interactions in long baseline neutrino oscillation experiments. We analyze the upper bounds that the proposed DUNE experiment might set on the nonstandard parameters and numerically derive upper bounds, as a function of the lightest neutrino mass, on the ratio the mass MΔ of the triplet scalars, and the strength |λϕ| of the coupling ϕ ϕ Δ of the triplet Δ and conventional Higgs doublet ϕ . We also discuss the possible misinterpretation of these effects as effects arising from a nonunitarity of the neutrino mixing matrix and compare the results with the bounds that arise from the charged lepton flavor violating processes.

Estimates on Functional Integrals of Quantum Mechanics and Non-relativistic Quantum Field Theory

NASA Astrophysics Data System (ADS)

Bley, Gonzalo A.; Thomas, Lawrence E.

2017-01-01

We provide a unified method for obtaining upper bounds for certain functional integrals appearing in quantum mechanics and non-relativistic quantum field theory, functionals of the form {E[{exp}(A_T)]} , the (effective) action {A_T} being a function of particle trajectories up to time T. The estimates in turn yield rigorous lower bounds for ground state energies, via the Feynman-Kac formula. The upper bounds are obtained by writing the action for these functional integrals in terms of stochastic integrals. The method is illustrated in familiar quantum mechanical settings: for the hydrogen atom, for a Schrödinger operator with {1/|x|^2} potential with small coupling, and, with a modest adaptation of the method, for the harmonic oscillator. We then present our principal applications of the method, in the settings of non-relativistic quantum field theories for particles moving in a quantized Bose field, including the optical polaron and Nelson models.

Dwell time-based stabilisation of switched delay systems using free-weighting matrices

NASA Astrophysics Data System (ADS)

Koru, Ahmet Taha; Delibaşı, Akın; Özbay, Hitay

2018-01-01

In this paper, we present a quasi-convex optimisation method to minimise an upper bound of the dwell time for stability of switched delay systems. Piecewise Lyapunov-Krasovskii functionals are introduced and the upper bound for the derivative of Lyapunov functionals is estimated by free-weighting matrices method to investigate non-switching stability of each candidate subsystems. Then, a sufficient condition for the dwell time is derived to guarantee the asymptotic stability of the switched delay system. Once these conditions are represented by a set of linear matrix inequalities , dwell time optimisation problem can be formulated as a standard quasi-convex optimisation problem. Numerical examples are given to illustrate the improvements over previously obtained dwell time bounds. Using the results obtained in the stability case, we present a nonlinear minimisation algorithm to synthesise the dwell time minimiser controllers. The algorithm solves the problem with successive linearisation of nonlinear conditions.

Decay of superconducting correlations for gauged electrons in dimensions D ≤ 4

NASA Astrophysics Data System (ADS)

Tada, Yasuhiro; Koma, Tohru

2018-03-01

We study lattice superconductors coupled to gauge fields, such as an attractive Hubbard model in electromagnetic fields, with a standard gauge fixing. We prove upper bounds for a two-point Cooper pair correlation at finite temperatures in spatial dimensions D ≤ 4. The upper bounds decay exponentially in three dimensions and by power law in four dimensions. These imply the absence of the superconducting long-range order for the Cooper pair amplitude as a consequence of fluctuations of the gauge fields. Since our results hold for the gauge fixing Hamiltonian, they cannot be obtained as a corollary of Elitzur's theorem.

Calculations of reliability predictions for the Apollo spacecraft

NASA Technical Reports Server (NTRS)

Amstadter, B. L.

1966-01-01

A new method of reliability prediction for complex systems is defined. Calculation of both upper and lower bounds are involved, and a procedure for combining the two to yield an approximately true prediction value is presented. Both mission success and crew safety predictions can be calculated, and success probabilities can be obtained for individual mission phases or subsystems. Primary consideration is given to evaluating cases involving zero or one failure per subsystem, and the results of these evaluations are then used for analyzing multiple failure cases. Extensive development is provided for the overall mission success and crew safety equations for both the upper and lower bounds.

Investigation of matter-antimatter interaction for possible propulsion applications

NASA Technical Reports Server (NTRS)

Morgan, D. L., Jr.

1974-01-01

Matter-antimatter annihilation is discussed as a means of rocket propulsion. The feasibility of different means of antimatter storage is shown to depend on how annihilation rates are affected by various circumstances. The annihilation processes are described, with emphasis on important features of atom-antiatom interatomic potential energies. A model is developed that allows approximate calculation of upper and lower bounds to the interatomic potential energy for any atom-antiatom pair. Formulae for the upper and lower bounds for atom-antiatom annihilation cross-sections are obtained and applied to the annihilation rates for each means of antimatter storage under consideration. Recommendations for further studies are presented.

On the Role of Entailment Patterns and Scalar Implicatures in the Processing of Numerals

ERIC Educational Resources Information Center

Panizza, Daniele; Chierchia, Gennaro; Clifton, Charles, Jr.

2009-01-01

There has been much debate, in both the linguistics and the psycholinguistics literature, concerning numbers and the interpretation of number denoting determiners ("numerals"). Such debate concerns, in particular, the nature and distribution of upper-bounded ("exact") interpretations vs. lower-bounded ("at-least") construals. In the present paper…

A Posteriori Finite Element Bounds for Sensitivity Derivatives of Partial-Differential-Equation Outputs. Revised

NASA Technical Reports Server (NTRS)

Lewis, Robert Michael; Patera, Anthony T.; Peraire, Jaume

1998-01-01

We present a Neumann-subproblem a posteriori finite element procedure for the efficient and accurate calculation of rigorous, 'constant-free' upper and lower bounds for sensitivity derivatives of functionals of the solutions of partial differential equations. The design motivation for sensitivity derivative error control is discussed; the a posteriori finite element procedure is described; the asymptotic bounding properties and computational complexity of the method are summarized; and illustrative numerical results are presented.

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

Müller-Hermes, Alexander, E-mail: muellerh@ma.tum.de; Wolf, Michael M., E-mail: m.wolf@tum.de; Reeb, David, E-mail: reeb.qit@gmail.com

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transposemore » bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.« less

Measures and limits of models of fixation selection.

PubMed

Wilming, Niklas; Betz, Torsten; Kietzmann, Tim C; König, Peter

2011-01-01

Models of fixation selection are a central tool in the quest to understand how the human mind selects relevant information. Using this tool in the evaluation of competing claims often requires comparing different models' relative performance in predicting eye movements. However, studies use a wide variety of performance measures with markedly different properties, which makes a comparison difficult. We make three main contributions to this line of research: First we argue for a set of desirable properties, review commonly used measures, and conclude that no single measure unites all desirable properties. However the area under the ROC curve (a classification measure) and the KL-divergence (a distance measure of probability distributions) combine many desirable properties and allow a meaningful comparison of critical model performance. We give an analytical proof of the linearity of the ROC measure with respect to averaging over subjects and demonstrate an appropriate correction of entropy-based measures like KL-divergence for small sample sizes in the context of eye-tracking data. Second, we provide a lower bound and an upper bound of these measures, based on image-independent properties of fixation data and between subject consistency respectively. Based on these bounds it is possible to give a reference frame to judge the predictive power of a model of fixation selection. We provide open-source python code to compute the reference frame. Third, we show that the upper, between subject consistency bound holds only for models that predict averages of subject populations. Departing from this we show that incorporating subject-specific viewing behavior can generate predictions which surpass that upper bound. Taken together, these findings lay out the required information that allow a well-founded judgment of the quality of any model of fixation selection and should therefore be reported when a new model is introduced.

Randomized noninferiority trial of telephone versus in-person genetic counseling for hereditary breast and ovarian cancer.

PubMed

Schwartz, Marc D; Valdimarsdottir, Heiddis B; Peshkin, Beth N; Mandelblatt, Jeanne; Nusbaum, Rachel; Huang, An-Tsun; Chang, Yaojen; Graves, Kristi; Isaacs, Claudine; Wood, Marie; McKinnon, Wendy; Garber, Judy; McCormick, Shelley; Kinney, Anita Y; Luta, George; Kelleher, Sarah; Leventhal, Kara-Grace; Vegella, Patti; Tong, Angie; King, Lesley

2014-03-01

Although guidelines recommend in-person counseling before BRCA1/BRCA2 gene testing, genetic counseling is increasingly offered by telephone. As genomic testing becomes more common, evaluating alternative delivery approaches becomes increasingly salient. We tested whether telephone delivery of BRCA1/2 genetic counseling was noninferior to in-person delivery. Participants (women age 21 to 85 years who did not have newly diagnosed or metastatic cancer and lived within a study site catchment area) were randomly assigned to usual care (UC; n = 334) or telephone counseling (TC; n = 335). UC participants received in-person pre- and post-test counseling; TC participants completed all counseling by telephone. Primary outcomes were knowledge, satisfaction, decision conflict, distress, and quality of life; secondary outcomes were equivalence of BRCA1/2 test uptake and costs of delivering TC versus UC. TC was noninferior to UC on all primary outcomes. At 2 weeks after pretest counseling, knowledge (d = 0.03; lower bound of 97.5% CI, -0.61), perceived stress (d = -0.12; upper bound of 97.5% CI, 0.21), and satisfaction (d = -0.16; lower bound of 97.5% CI, -0.70) had group differences and confidence intervals that did not cross their 1-point noninferiority limits. Decision conflict (d = 1.1; upper bound of 97.5% CI, 3.3) and cancer distress (d = -1.6; upper bound of 97.5% CI, 0.27) did not cross their 4-point noninferiority limit. Results were comparable at 3 months. TC was not equivalent to UC on BRCA1/2 test uptake (UC, 90.1%; TC, 84.2%). TC yielded cost savings of $114 per patient. Genetic counseling can be effectively and efficiently delivered via telephone to increase access and decrease costs.

A formulation of a matrix sparsity approach for the quantum ordered search algorithm

NASA Astrophysics Data System (ADS)

Parmar, Jupinder; Rahman, Saarim; Thiara, Jaskaran

One specific subset of quantum algorithms is Grovers Ordered Search Problem (OSP), the quantum counterpart of the classical binary search algorithm, which utilizes oracle functions to produce a specified value within an ordered database. Classically, the optimal algorithm is known to have a log2N complexity; however, Grovers algorithm has been found to have an optimal complexity between the lower bound of ((lnN-1)/π≈0.221log2N) and the upper bound of 0.433log2N. We sought to lower the known upper bound of the OSP. With Farhi et al. MITCTP 2815 (1999), arXiv:quant-ph/9901059], we see that the OSP can be resolved into a translational invariant algorithm to create quantum query algorithm restraints. With these restraints, one can find Laurent polynomials for various k — queries — and N — database sizes — thus finding larger recursive sets to solve the OSP and effectively reducing the upper bound. These polynomials are found to be convex functions, allowing one to make use of convex optimization to find an improvement on the known bounds. According to Childs et al. [Phys. Rev. A 75 (2007) 032335], semidefinite programming, a subset of convex optimization, can solve the particular problem represented by the constraints. We were able to implement a program abiding to their formulation of a semidefinite program (SDP), leading us to find that it takes an immense amount of storage and time to compute. To combat this setback, we then formulated an approach to improve results of the SDP using matrix sparsity. Through the development of this approach, along with an implementation of a rudimentary solver, we demonstrate how matrix sparsity reduces the amount of time and storage required to compute the SDP — overall ensuring further improvements will likely be made to reach the theorized lower bound.

Sample Complexity Bounds for Differentially Private Learning

PubMed Central

Chaudhuri, Kamalika; Hsu, Daniel

2013-01-01

This work studies the problem of privacy-preserving classification – namely, learning a classifier from sensitive data while preserving the privacy of individuals in the training set. In particular, the learning algorithm is required in this problem to guarantee differential privacy, a very strong notion of privacy that has gained significant attention in recent years. A natural question to ask is: what is the sample requirement of a learning algorithm that guarantees a certain level of privacy and accuracy? We address this question in the context of learning with infinite hypothesis classes when the data is drawn from a continuous distribution. We first show that even for very simple hypothesis classes, any algorithm that uses a finite number of examples and guarantees differential privacy must fail to return an accurate classifier for at least some unlabeled data distributions. This result is unlike the case with either finite hypothesis classes or discrete data domains, in which distribution-free private learning is possible, as previously shown by Kasiviswanathan et al. (2008). We then consider two approaches to differentially private learning that get around this lower bound. The first approach is to use prior knowledge about the unlabeled data distribution in the form of a reference distribution chosen independently of the sensitive data. Given such a reference , we provide an upper bound on the sample requirement that depends (among other things) on a measure of closeness between and the unlabeled data distribution. Our upper bound applies to the non-realizable as well as the realizable case. The second approach is to relax the privacy requirement, by requiring only label-privacy – namely, that the only labels (and not the unlabeled parts of the examples) be considered sensitive information. An upper bound on the sample requirement of learning with label privacy was shown by Chaudhuri et al. (2006); in this work, we show a lower bound. PMID:25285183

Communication complexity and information complexity

NASA Astrophysics Data System (ADS)

Pankratov, Denis

Information complexity enables the use of information-theoretic tools in communication complexity theory. Prior to the results presented in this thesis, information complexity was mainly used for proving lower bounds and direct-sum theorems in the setting of communication complexity. We present three results that demonstrate new connections between information complexity and communication complexity. In the first contribution we thoroughly study the information complexity of the smallest nontrivial two-party function: the AND function. While computing the communication complexity of AND is trivial, computing its exact information complexity presents a major technical challenge. In overcoming this challenge, we reveal that information complexity gives rise to rich geometrical structures. Our analysis of information complexity relies on new analytic techniques and new characterizations of communication protocols. We also uncover a connection of information complexity to the theory of elliptic partial differential equations. Once we compute the exact information complexity of AND, we can compute exact communication complexity of several related functions on n-bit inputs with some additional technical work. Previous combinatorial and algebraic techniques could only prove bounds of the form theta( n). Interestingly, this level of precision is typical in the area of information theory, so our result demonstrates that this meta-property of precise bounds carries over to information complexity and in certain cases even to communication complexity. Our result does not only strengthen the lower bound on communication complexity of disjointness by making it more exact, but it also shows that information complexity provides the exact upper bound on communication complexity. In fact, this result is more general and applies to a whole class of communication problems. In the second contribution, we use self-reduction methods to prove strong lower bounds on the information complexity of two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product mod 2 (IP). In our first result we affirm the conjecture that the information complexity of GHD is linear even under the uniform distribution. This strengthens the O(n) bound shown by Kerenidis et al. (2012) and answers an open problem by Chakrabarti et al. (2012). We also prove that the information complexity of IP is arbitrarily close to the trivial upper bound n as the permitted error tends to zero, again strengthening the O(n) lower bound proved by Braverman and Weinstein (2011). More importantly, our proofs demonstrate that self-reducibility makes the connection between information complexity and communication complexity lower bounds a two-way connection. Whereas numerous results in the past used information complexity techniques to derive new communication complexity lower bounds, we explore a generic way, in which communication complexity lower bounds imply information complexity lower bounds in a black-box manner. In the third contribution we consider the roles that private and public randomness play in the definition of information complexity. In communication complexity, private randomness can be trivially simulated by public randomness. Moreover, the communication cost of simulating public randomness with private randomness is well understood due to Newman's theorem (1991). In information complexity, the roles of public and private randomness are reversed: public randomness can be trivially simulated by private randomness. However, the information cost of simulating private randomness with public randomness is not understood. We show that protocols that use only public randomness admit a rather strong compression. In particular, efficient simulation of private randomness by public randomness would imply a version of a direct sum theorem in the setting of communication complexity. This establishes a yet another connection between the two areas. (Abstract shortened by UMI.).

Shadow-Based Vehicle Detection in Urban Traffic

PubMed Central

Ibarra-Arenado, Manuel; Tjahjadi, Tardi; Pérez-Oria, Juan; Robla-Gómez, Sandra; Jiménez-Avello, Agustín

2017-01-01

Vehicle detection is a fundamental task in Forward Collision Avoiding Systems (FACS). Generally, vision-based vehicle detection methods consist of two stages: hypotheses generation and hypotheses verification. In this paper, we focus on the former, presenting a feature-based method for on-road vehicle detection in urban traffic. Hypotheses for vehicle candidates are generated according to the shadow under the vehicles by comparing pixel properties across the vertical intensity gradients caused by shadows on the road, and followed by intensity thresholding and morphological discrimination. Unlike methods that identify the shadow under a vehicle as a road region with intensity smaller than a coarse lower bound of the intensity for road, the thresholding strategy we propose determines a coarse upper bound of the intensity for shadow which reduces false positives rates. The experimental results are promising in terms of detection performance and robustness in day time under different weather conditions and cluttered scenarios to enable validation for the first stage of a complete FACS. PMID:28448465

Axioms of adaptivity

PubMed Central

Carstensen, C.; Feischl, M.; Page, M.; Praetorius, D.

2014-01-01

This paper aims first at a simultaneous axiomatic presentation of the proof of optimal convergence rates for adaptive finite element methods and second at some refinements of particular questions like the avoidance of (discrete) lower bounds, inexact solvers, inhomogeneous boundary data, or the use of equivalent error estimators. Solely four axioms guarantee the optimality in terms of the error estimators. Compared to the state of the art in the temporary literature, the improvements of this article can be summarized as follows: First, a general framework is presented which covers the existing literature on optimality of adaptive schemes. The abstract analysis covers linear as well as nonlinear problems and is independent of the underlying finite element or boundary element method. Second, efficiency of the error estimator is neither needed to prove convergence nor quasi-optimal convergence behavior of the error estimator. In this paper, efficiency exclusively characterizes the approximation classes involved in terms of the best-approximation error and data resolution and so the upper bound on the optimal marking parameters does not depend on the efficiency constant. Third, some general quasi-Galerkin orthogonality is not only sufficient, but also necessary for the R-linear convergence of the error estimator, which is a fundamental ingredient in the current quasi-optimality analysis due to Stevenson 2007. Finally, the general analysis allows for equivalent error estimators and inexact solvers as well as different non-homogeneous and mixed boundary conditions. PMID:25983390

Influence of gravitation on the propagation of electromagnetic radiation

NASA Technical Reports Server (NTRS)

Mashhoon, B.

1975-01-01

The existence of a general helicity-rotation coupling is demonstrated for electromagnetic waves propagating in the field of a slowly rotating body and in the Goedel universe. This coupling leads to differential focusing of circularly polarized radiation by a gravitational field which is detectable for a rapidly rotating collapsed body. The electromagnetic perturbations and their frequency spectrum are given for the Goedel universe. The spectrum of frequencies is bounded from below by the characteristic rotation frequency of the Goedel universe. If the universe were rotating, the differential focusing effect would be extremely small due to the present upper limit on the anisotropy of the microwave background radiation.

Density of convex intersections and applications

PubMed Central

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

2017-01-01

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

Opaque minerals as aids in distinguishing between source and sorting effects on beach sand mineralogy in southwestern Oregon.

USGS Publications Warehouse

Luepke, G.

1980-01-01

Source area and wave sorting effects can be separated on 4 Oregon beaches bounded by prominent headlands by studying the magnetic fraction of the sand. On 3 beaches the percentage of magnetite in the sand from the upper swash zone consistently increases toward the N end of each beach, apparently owing to selective sorting during littoral transport. However, the percentages of Cr and Ti in the magnetite are generally independent of sorting effects. Each beach appears to be characterized by a fairly distinct range of Ti/Cr in the magnetic fraction and the range differs from beach to beach. -from Author

Strong Unitary and Overlap Uncertainty Relations: Theory and Experiment

NASA Astrophysics Data System (ADS)

Bong, Kok-Wei; Tischler, Nora; Patel, Raj B.; Wollmann, Sabine; Pryde, Geoff J.; Hall, Michael J. W.

2018-06-01

We derive and experimentally investigate a strong uncertainty relation valid for any n unitary operators, which implies the standard uncertainty relation and others as special cases, and which can be written in terms of geometric phases. It is saturated by every pure state of any n -dimensional quantum system, generates a tight overlap uncertainty relation for the transition probabilities of any n +1 pure states, and gives an upper bound for the out-of-time-order correlation function. We test these uncertainty relations experimentally for photonic polarization qubits, including the minimum uncertainty states of the overlap uncertainty relation, via interferometric measurements of generalized geometric phases.

Ion wake field effects on the dust-ion-acoustic surface mode in a semi-bounded Lorentzian dusty plasma

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

Lee, Myoung-Jae; Jung, Young-Dae, E-mail: ydjung@hanyang.ac.kr; Department of Physics, Applied Physics, and Astronomy, Rensselaer Polytechnic Institute, 110 8th Street, Troy, New York 12180-3590

The dispersion relation for the dust ion-acoustic surface waves propagating at the interface of semi-bounded Lorentzian dusty plasma with supersonic ion flow has been kinetically derived to investigate the nonthermal property and the ion wake field effect. We found that the supersonic ion flow creates the upper and the lower modes. The increase in the nonthermal particles decreases the wave frequency for the upper mode whereas it increases the frequency for the lower mode. The increase in the supersonic ion flow velocity is found to enhance the wave frequency for both modes. We also found that the increase in nonthermalmore » plasmas is found to enhance the group velocity of the upper mode. However, the nonthermal particles suppress the lower mode group velocity. The nonthermal effects on the group velocity will be reduced in the limit of small or large wavelength limit.« less

Bounds on quantum confinement effects in metal nanoparticles

NASA Astrophysics Data System (ADS)

Blackman, G. Neal; Genov, Dentcho A.

2018-03-01

Quantum size effects on the permittivity of metal nanoparticles are investigated using the quantum box model. Explicit upper and lower bounds are derived for the permittivity and relaxation rates due to quantum confinement effects. These bounds are verified numerically, and the size dependence and frequency dependence of the empirical Drude size parameter is extracted from the model. Results suggest that the common practice of empirically modifying the dielectric function can lead to inaccurate predictions for highly uniform distributions of finite-sized particles.

Localization of the eigenvalues of linear integral equations with applications to linear ordinary differential equations.

NASA Technical Reports Server (NTRS)

Sloss, J. M.; Kranzler, S. K.

1972-01-01

The equivalence of a considered integral equation form with an infinite system of linear equations is proved, and the localization of the eigenvalues of the infinite system is expressed. Error estimates are derived, and the problems of finding upper bounds and lower bounds for the eigenvalues are solved simultaneously.

The Limits of Coding with Joint Constraints on Detected and Undetected Error Rates

NASA Technical Reports Server (NTRS)

Dolinar, Sam; Andrews, Kenneth; Pollara, Fabrizio; Divsalar, Dariush

2008-01-01

We develop a remarkably tight upper bound on the performance of a parameterized family of bounded angle maximum-likelihood (BA-ML) incomplete decoders. The new bound for this class of incomplete decoders is calculated from the code's weight enumerator, and is an extension of Poltyrev-type bounds developed for complete ML decoders. This bound can also be applied to bound the average performance of random code ensembles in terms of an ensemble average weight enumerator. We also formulate conditions defining a parameterized family of optimal incomplete decoders, defined to minimize both the total codeword error probability and the undetected error probability for any fixed capability of the decoder to detect errors. We illustrate the gap between optimal and BA-ML incomplete decoding via simulation of a small code.

Multi-Level Reduced Order Modeling Equipped with Probabilistic Error Bounds

NASA Astrophysics Data System (ADS)

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 model parameters, responses, or state variables, are projected onto lower dimensional subspaces, referred to as the "active subspaces", which are selected to capture a user-defined portion of the snapshots variations. Once determined, the ROM model application involves constraining the variables to the active subspaces. In doing so, the contribution from the variables discarded components can be estimated using a fundamental theorem from random matrix theory which has its roots in Dixon's theory, developed in 1983. This theory was initially presented for linear matrix operators. The thesis extends this theorem's results to allow reduction of general smooth nonlinear operators. The result is an approach by which the adequacy of a given active subspace determined using a given set of snapshots, generated either using the full high fidelity model, or other models with lower fidelity, can be assessed, which provides insight to the analyst on the type of snapshots required to reach a reduction that can satisfy user-defined preset tolerance limits on the reduction errors. Reactor physics calculations are employed as a test bed for the proposed developments. The focus will be on reducing the effective dimensionality of the various data streams such as the cross-section data and the neutron flux. The developed methods will be applied to representative assembly level calculations, where the size of the cross-section and flux spaces are typically large, as required by downstream core calculations, in order to capture the broad range of conditions expected during reactor operation. (Abstract shortened by ProQuest.).

On the Coriolis effect in acoustic waveguides.

PubMed

Wegert, Henry; Reindl, Leonard M; Ruile, Werner; Mayer, Andreas P

2012-05-01

Rotation of an elastic medium gives rise to a shift of frequency of its acoustic modes, i.e., the time-period vibrations that exist in it. This frequency shift is investigated by applying perturbation theory in the regime of small ratios of the rotation velocity and the frequency of the acoustic mode. In an expansion of the relative frequency shift in powers of this ratio, upper bounds are derived for the first-order and the second-order terms. The derivation of the theoretical upper bounds of the first-order term is presented for linear vibration modes as well as for stable nonlinear vibrations with periodic time dependence that can be represented by a Fourier series.

Asymptotics of the evolution semigroup associated with a scalar field in the presence of a non-linear electromagnetic field

NASA Astrophysics Data System (ADS)

Albeverio, Sergio; Tamura, Hiroshi

2018-04-01

We consider a model describing the coupling of a vector-valued and a scalar homogeneous Markovian random field over R4, interpreted as expressing the interaction between a charged scalar quantum field coupled with a nonlinear quantized electromagnetic field. Expectations of functionals of the random fields are expressed by Brownian bridges. Using this, together with Feynman-Kac-Itô type formulae and estimates on the small time and large time behaviour of Brownian functionals, we prove asymptotic upper and lower bounds on the kernel of the transition semigroup for our model. The upper bound gives faster than exponential decay for large distances of the corresponding resolvent (propagator).

SURE reliability analysis: Program and mathematics

NASA Technical Reports Server (NTRS)

Butler, Ricky W.; White, Allan L.

1988-01-01

The SURE program is a new reliability analysis tool for ultrareliable computer system architectures. The computational methods on which the program is based provide an efficient means for computing accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. Once a semi-Markov model is described using a simple input language, the SURE program automatically computes the upper and lower bounds on the probability of system failure. A parameter of the model can be specified as a variable over a range of values directing the SURE program to perform a sensitivity analysis automatically. This feature, along with the speed of the program, makes it especially useful as a design tool.

A Comparative Analysis of Speed Profile Models for Ankle Pointing Movements: Evidence that Lower and Upper Extremity Discrete Movements are Controlled by a Single Invariant Strategy

PubMed Central

Michmizos, Konstantinos P.; Vaisman, Lev; Krebs, Hermano Igo

2014-01-01

Little is known about whether our knowledge of how the central nervous system controls the upper extremities (UE), can generalize, and to what extent to the lower limbs. Our continuous efforts to design the ideal adaptive robotic therapy for the lower limbs of stroke patients and children with cerebral palsy highlighted the importance of analyzing and modeling the kinematics of the lower limbs, in general, and those of the ankle joints, in particular. We recruited 15 young healthy adults that performed in total 1,386 visually evoked, visually guided, and target-directed discrete pointing movements with their ankle in dorsal–plantar and inversion–eversion directions. Using a non-linear, least-squares error-minimization procedure, we estimated the parameters for 19 models, which were initially designed to capture the dynamics of upper limb movements of various complexity. We validated our models based on their ability to reconstruct the experimental data. Our results suggest a remarkable similarity between the top-performing models that described the speed profiles of ankle pointing movements and the ones previously found for the UE both during arm reaching and wrist pointing movements. Among the top performers were the support-bounded lognormal and the beta models that have a neurophysiological basis and have been successfully used in upper extremity studies with normal subjects and patients. Our findings suggest that the same model can be applied to different “human” hardware, perhaps revealing a key invariant in human motor control. These findings have a great potential to enhance our rehabilitation efforts in any population with lower extremity deficits by, for example, assessing the level of motor impairment and improvement as well as informing the design of control algorithms for therapeutic ankle robots. PMID:25505881

Validation of the SURE Program, phase 1

NASA Technical Reports Server (NTRS)

Dotson, Kelly J.

1987-01-01

Presented are the results of the first phase in the validation of the SURE (Semi-Markov Unreliability Range Evaluator) program. The SURE program gives lower and upper bounds on the death-state probabilities of a semi-Markov model. With these bounds, the reliability of a semi-Markov model of a fault-tolerant computer system can be analyzed. For the first phase in the validation, fifteen semi-Markov models were solved analytically for the exact death-state probabilities and these solutions compared to the corresponding bounds given by SURE. In every case, the SURE bounds covered the exact solution. The bounds, however, had a tendency to separate in cases where the recovery rate was slow or the fault arrival rate was fast.

The random coding bound is tight for the average code.

NASA Technical Reports Server (NTRS)

Gallager, R. G.

1973-01-01

The random coding bound of information theory provides a well-known upper bound to the probability of decoding error for the best code of a given rate and block length. The bound is constructed by upperbounding the average error probability over an ensemble of codes. The bound is known to give the correct exponential dependence of error probability on block length for transmission rates above the critical rate, but it gives an incorrect exponential dependence at rates below a second lower critical rate. Here we derive an asymptotic expression for the average error probability over the ensemble of codes used in the random coding bound. The result shows that the weakness of the random coding bound at rates below the second critical rate is due not to upperbounding the ensemble average, but rather to the fact that the best codes are much better than the average at low rates.

Scalable L-infinite coding of meshes.

PubMed

Munteanu, Adrian; Cernea, Dan C; Alecu, Alin; Cornelis, Jan; Schelkens, Peter

2010-01-01

The paper investigates the novel concept of local-error control in mesh geometry encoding. In contrast to traditional mesh-coding systems that use the mean-square error as target distortion metric, this paper proposes a new L-infinite mesh-coding approach, for which the target distortion metric is the L-infinite distortion. In this context, a novel wavelet-based L-infinite-constrained coding approach for meshes is proposed, which ensures that the maximum error between the vertex positions in the original and decoded meshes is lower than a given upper bound. Furthermore, the proposed system achieves scalability in L-infinite sense, that is, any decoding of the input stream will correspond to a perfectly predictable L-infinite distortion upper bound. An instantiation of the proposed L-infinite-coding approach is demonstrated for MESHGRID, which is a scalable 3D object encoding system, part of MPEG-4 AFX. In this context, the advantages of scalable L-infinite coding over L-2-oriented coding are experimentally demonstrated. One concludes that the proposed L-infinite mesh-coding approach guarantees an upper bound on the local error in the decoded mesh, it enables a fast real-time implementation of the rate allocation, and it preserves all the scalability features and animation capabilities of the employed scalable mesh codec.

Adaptive nonsingular fast terminal sliding-mode control for the tracking problem of uncertain dynamical systems.

PubMed

Boukattaya, Mohamed; Mezghani, Neila; Damak, Tarak

2018-06-01

In this paper, robust and adaptive nonsingular fast terminal sliding-mode (NFTSM) control schemes for the trajectory tracking problem are proposed with known or unknown upper bound of the system uncertainty and external disturbances. The developed controllers take the advantage of the NFTSM theory to ensure fast convergence rate, singularity avoidance, and robustness against uncertainties and external disturbances. First, a robust NFTSM controller is proposed which guarantees that sliding surface and equilibrium point can be reached in a short finite-time from any initial state. Then, in order to cope with the unknown upper bound of the system uncertainty which may be occurring in practical applications, a new adaptive NFTSM algorithm is developed. One feature of the proposed control law is their adaptation techniques where the prior knowledge of parameters uncertainty and disturbances is not needed. However, the adaptive tuning law can estimate the upper bound of these uncertainties using only position and velocity measurements. Moreover, the proposed controller eliminates the chattering effect without losing the robustness property and the precision. Stability analysis is performed using the Lyapunov stability theory, and simulation studies are conducted to verify the effectiveness of the developed control schemes. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Marginally trapped surfaces and AdS/CFT

NASA Astrophysics Data System (ADS)

Grado-White, Brianna; Marolf, Donald

2018-02-01

It has been proposed that the areas of marginally trapped or anti-trapped surfaces (also known as leaves of holographic screens) may encode some notion of entropy. To connect this to AdS/CFT, we study the case of marginally trapped surfaces anchored to an AdS boundary. We establish that such boundary-anchored leaves lie between the causal and extremal surfaces defined by the anchor and that they have area bounded below by that of the minimal extremal surface. This suggests that the area of any leaf represents a coarse-grained von Neumann entropy for the associated region of the dual CFT. We further demonstrate that the leading area-divergence of a boundary-anchored marginally trapped surface agrees with that for the associated extremal surface, though subleading divergences generally differ. Finally, we generalize an argument of Bousso and Engelhardt to show that holographic screens with all leaves anchored to the same boundary set have leaf-areas that increase monotonically along the screen, and we describe a construction through which this monotonicity can take the more standard form of requiring entropy to increase with boundary time. This construction is related to what one might call future causal holographic information, which in such cases also provides an upper bound on the area of the associated leaves.

Global Passivity in Microscopic Thermodynamics

NASA Astrophysics Data System (ADS)

Uzdin, Raam; Rahav, Saar

2018-04-01

The main thread that links classical thermodynamics and the thermodynamics of small quantum systems is the celebrated Clausius inequality form of the second law. However, its application to small quantum systems suffers from two cardinal problems. (i) The Clausius inequality does not hold when the system and environment are initially correlated—a commonly encountered scenario in microscopic setups. (ii) In some other cases, the Clausius inequality does not provide any useful information (e.g., in dephasing scenarios). We address these deficiencies by developing the notion of global passivity and employing it as a tool for deriving thermodynamic inequalities on observables. For initially uncorrelated thermal environments the global passivity framework recovers the Clausius inequality. More generally, global passivity provides an extension of the Clausius inequality that holds even in the presences of strong initial system-environment correlations. Crucially, the present framework provides additional thermodynamic bounds on expectation values. To illustrate the role of the additional bounds, we use them to detect unaccounted heat leaks and weak feedback operations ("Maxwell demons") that the Clausius inequality cannot detect. In addition, it is shown that global passivity can put practical upper and lower bounds on the buildup of system-environment correlations for dephasing interactions. Our findings are highly relevant for experiments in various systems such as ion traps, superconducting circuits, atoms in optical cavities, and more.

Variational principle for the Navier-Stokes equations.

PubMed

Kerswell, R R

1999-05-01

A variational principle is presented for the Navier-Stokes equations in the case of a contained boundary-driven, homogeneous, incompressible, viscous fluid. Based upon making the fluid's total viscous dissipation over a given time interval stationary subject to the constraint of the Navier-Stokes equations, the variational problem looks overconstrained and intractable. However, introducing a nonunique velocity decomposition, u(x,t)=phi(x,t) + nu(x,t), "opens up" the variational problem so that what is presumed a single allowable point over the velocity domain u corresponding to the unique solution of the Navier-Stokes equations becomes a surface with a saddle point over the extended domain (phi,nu). Complementary or dual variational problems can then be constructed to estimate this saddle point value strictly from above as part of a minimization process or below via a maximization procedure. One of these reduced variational principles is the natural and ultimate generalization of the upper bounding problem developed by Doering and Constantin. The other corresponds to the ultimate Busse problem which now acts to lower bound the true dissipation. Crucially, these reduced variational problems require only the solution of a series of linear problems to produce bounds even though their unique intersection is conjectured to correspond to a solution of the nonlinear Navier-Stokes equations.

Upper bounds of deformation in the Upper Rhine Graben from GPS data - First results from GURN (GNSS Upper Rhine Graben Network)

NASA Astrophysics Data System (ADS)

Masson, Frederic; Knoepfler, Andreas; Mayer, Michael; Ulrich, Patrice; Heck, Bernhard

2010-05-01

In September 2008, the Institut de Physique du Globe de Strasbourg (Ecole et Observatoire des Sciences de la Terre, EOST) and the Geodetic Institute (GIK) of Karlsruhe University (TH) established a transnational cooperation called GURN (GNSS Upper Rhine Graben Network). Within the GURN initiative these institutions are cooperating in order to establish a highly precise and highly sensitive network of permanently operating GNSS sites for the detection of crustal movements in the Upper Rhine Graben region. At the beginning, the network consisted of the permanently operating GNSS sites of SAPOS®-Baden-Württemberg, different data providers in France (e.g. EOST, Teria, RGP) and some further sites (e.g. IGS). In July 2009, the network was extended to the South when swisstopo (Switzerland) and to the North when SAPOS®-Rheinland-Pfalz joined GURN. Therefore, actually the GNSS network consists of approx. 80 permanently operating reference sites. The presentation will discuss the actual status of GURN, main research goals, and will present first results concerning the data quality as well as time series of a first reprocessing of all available data since 2002 using GAMIT/GLOBK (EOST working group) and the Bernese GPS Software (GIK working group). Based on these time series, the velocity as well as strain fields will be calculated in the future. The GURN initiative is also aiming for the estimation of the upper bounds of deformation in the Upper Rhine Graben region.

A Reduced Basis Method with Exact-Solution Certificates for Symmetric Coercive Equations

DTIC Science & Technology

2013-11-06

the energy associated with the infinite - dimensional weak solution of parametrized symmetric coercive partial differential equations with piecewise...builds bounds with respect to the infinite - dimensional weak solution, aims to entirely remove the issue of the “truth” within the certified reduced basis...framework. We in particular introduce a reduced basis method that provides rigorous upper and lower bounds

The Economic Cost of Methamphetamine Use in the United States, 2005

ERIC Educational Resources Information Center

Nicosia, Nancy; Pacula, Rosalie Liccardo; Kilmer, Beau; Lundberg, Russell; Chiesa, James

2009-01-01

This first national estimate suggests that the economic cost of methamphetamine (meth) use in the United States reached $23.4 billion in 2005. Given the uncertainty in estimating the costs of meth use, this book provides a lower-bound estimate of $16.2 billion and an upper-bound estimate of $48.3 billion. The analysis considers a wide range of…

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs

PubMed Central

Jiang, Peng; Li, Deshi; Sun, Tao

2017-01-01

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region. PMID:28925960

Paramagnetic or diamagnetic persistent currents? A topological point of view

NASA Astrophysics Data System (ADS)

Waintal, Xavier

2009-03-01

A persistent current flows at low temperatures in small conducting rings when they are threaded by a magnetic flux. I will discuss the sign of this persistent current (diamagnetic or paramagnetic response) in the special case of N electrons in a one dimensional ring [1]. One dimension is very special in the sense that the sign of the persistent current is entirely controlled by the topology of the system. I will establish lower bounds for the free energy in the presence of arbitrary electron-electron interactions and external potentials. Those bounds are the counterparts of upper bounds derived by Leggett using another topological argument. Rings with odd (even) numbers of polarized electrons are always diamagnetic (paramagnetic). The situation is more interesting with unpolarized electrons where Leggett upper bound breaks down: rings with N=4n exhibit either paramagnetic behavior or a superconductor-like current-phase relation. The topological argument provides a rigorous justification for the phenomenological Huckel rule which states that cyclic molecules with 4n + 2 electrons like benzene are aromatic while those with 4n electrons are not. [4pt] [1] Xavier Waintal, Geneviève Fleury, Kyryl Kazymyrenko, Manuel Houzet, Peter Schmitteckert, and Dietmar Weinmann Phys. Rev. Lett.101, 106804 (2008).

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs.

PubMed

Wang, Xiaoliang; Jiang, Peng; Li, Deshi; Sun, Tao

2017-09-19

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region.

The accuracy of less: Natural bounds explain why quantity decreases are estimated more accurately than quantity increases.

PubMed

Chandon, Pierre; Ordabayeva, Nailya

2017-02-01

Five studies show that people, including experts such as professional chefs, estimate quantity decreases more accurately than quantity increases. We argue that this asymmetry occurs because physical quantities cannot be negative. Consequently, there is a natural lower bound (zero) when estimating decreasing quantities but no upper bound when estimating increasing quantities, which can theoretically grow to infinity. As a result, the "accuracy of less" disappears (a) when a numerical or a natural upper bound is present when estimating quantity increases, or (b) when people are asked to estimate the (unbounded) ratio of change from 1 size to another for both increasing and decreasing quantities. Ruling out explanations related to loss aversion, symbolic number mapping, and the visual arrangement of the stimuli, we show that the "accuracy of less" influences choice and demonstrate its robustness in a meta-analysis that includes previously published results. Finally, we discuss how the "accuracy of less" may explain asymmetric reactions to the supersizing and downsizing of food portions, some instances of the endowment effect, and asymmetries in the perception of increases and decreases in physical and psychological distance. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Bounds on area and charge for marginally trapped surfaces with a cosmological constant

NASA Astrophysics Data System (ADS)

Simon, Walter

2012-03-01

We sharpen the known inequalities AΛ ⩽ 4π(1 - g) (Hayward et al 1994 Phys. Rev. D 49 5080, Woolgar 1999 Class. Quantum Grav. 16 3005) and A ⩾ 4πQ2 (Dain et al 2012 Class. Quantum Grav. 29 035013) between the area A and the electric charge Q of a stable marginally outer-trapped surface (MOTS) of genus g in the presence of a cosmological constant Λ. In particular, instead of requiring stability we include the principal eigenvalue λ of the stability operator. For Λ* = Λ + λ > 0, we obtain a lower and an upper bound for Λ*A in terms of Λ*Q2, as well as the upper bound Q \\le 1/(2\\sqrt{\\Lambda ^{*}}) for the charge, which reduces to Q \\le 1/(2\\sqrt{\\Lambda }) in the stable case λ ⩾ 0. For Λ* < 0, there only remains a lower bound on A. In the spherically symmetric, static, stable case, one of our area inequalities is saturated iff the surface gravity vanishes. We also discuss implications of our inequalities for ‘jumps’ and mergers of charged MOTS.

Perturbative unitarity constraints on the NMSSM Higgs Sector

DOE PAGES

Betre, Kassahun; El Hedri, Sonia; Walker, Devin G. E.

2017-11-11

We place perturbative unitarity constraints on both the dimensionful and dimensionless parameters in the Next-to-Minimal Supersymmetric Standard Model (NMSSM) Higgs Sector. These constraints, plus the requirement that the singlino and/or Higgsino constitutes at least part of the observed dark matter relic abundance, generate upper bounds on the Higgs, neutralino and chargino mass spectrum. Requiring higher-order corrections to be no more than 41% of the tree-level value, we obtain an upper bound of 20 TeV for the heavy Higgses and 12 TeV for the charginos and neutralinos outside defined fine-tuned regions. If the corrections are no more than 20% of themore » tree-level value, the bounds are 7 TeV for the heavy Higgses and 5 TeV for the charginos and neutralinos. Finally, in all, by using the NMSSM as a template, we describe a method which replaces naturalness arguments with more rigorous perturbative unitarity arguments to get a better understanding of when new physics will appear.« less

An upper bound on the radius of a highly electrically conducting lunar core

NASA Technical Reports Server (NTRS)

Hobbs, B. A.; Hood, L. L.; Herbert, F.; Sonett, C. P.

1983-01-01

Parker's (1980) nonlinear inverse theory for the electromagnetic sounding problem is converted to a form suitable for analysis of lunar day-side transfer function data by: (1) transforming the solution in plane geometry to that in spherical geometry; and (2) transforming the theoretical lunar transfer function in the dipole limit to an apparent resistivity function. The theory is applied to the revised lunar transfer function data set of Hood et al. (1982), which extends in frequency from 10 to the -5th to 10 to the -3rd Hz. On the assumption that an iron-rich lunar core, whether molten or solid, can be represented by a perfect conductor at the minimum sampled frequency, an upper bound of 435 km on the maximum radius of such a core is calculated. This bound is somewhat larger than values of 360-375 km previously estimated from the same data set via forward model calculations because the prior work did not consider all possible mantle conductivity functions.

An upper bound on the particle-laden dependency of shear stresses at solid-fluid interfaces

NASA Astrophysics Data System (ADS)

Zohdi, T. I.

2018-03-01

In modern advanced manufacturing processes, such as three-dimensional printing of electronics, fine-scale particles are added to a base fluid yielding a modified fluid. For example, in three-dimensional printing, particle-functionalized inks are created by adding particles to freely flowing solvents forming a mixture, which is then deposited onto a surface, which upon curing yields desirable solid properties, such as thermal conductivity, electrical permittivity and magnetic permeability. However, wear at solid-fluid interfaces within the machinery walls that deliver such particle-laden fluids is typically attributed to the fluid-induced shear stresses, which increase with the volume fraction of added particles. The objective of this work is to develop a rigorous strict upper bound for the tolerable volume fraction of particles that can be added, while remaining below a given stress threshold at a fluid-solid interface. To illustrate the bound's utility, the expression is applied to a series of classical flow regimes.

Perturbative unitarity constraints on the NMSSM Higgs Sector

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

Betre, Kassahun; El Hedri, Sonia; Walker, Devin G. E.

We place perturbative unitarity constraints on both the dimensionful and dimensionless parameters in the Next-to-Minimal Supersymmetric Standard Model (NMSSM) Higgs Sector. These constraints, plus the requirement that the singlino and/or Higgsino constitutes at least part of the observed dark matter relic abundance, generate upper bounds on the Higgs, neutralino and chargino mass spectrum. Requiring higher-order corrections to be no more than 41% of the tree-level value, we obtain an upper bound of 20 TeV for the heavy Higgses and 12 TeV for the charginos and neutralinos outside defined fine-tuned regions. If the corrections are no more than 20% of themore » tree-level value, the bounds are 7 TeV for the heavy Higgses and 5 TeV for the charginos and neutralinos. Finally, in all, by using the NMSSM as a template, we describe a method which replaces naturalness arguments with more rigorous perturbative unitarity arguments to get a better understanding of when new physics will appear.« less

Volumes and intrinsic diameters of hypersurfaces

NASA Astrophysics Data System (ADS)

Paeng, Seong-Hun

2015-09-01

We estimate the volume and the intrinsic diameter of a hypersurface M with geometric information of a hypersurface which is parallel to M at distance T. It can be applied to the Riemannian Penrose inequality to obtain a lower bound of the total mass of a spacetime. Also it can be used to obtain upper bounds of the volume and the intrinsic diameter of the celestial r-sphere without a lower bound of the sectional curvature. We extend our results to metric-measure spaces by using the Bakry-Emery Ricci tensor.

Distributed robust finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2016-04-01

This paper investigates the robust finite-time consensus problem of multi-agent systems in networks with undirected topology. Global nonlinear consensus protocols augmented with a variable structure are constructed with the aid of Lyapunov functions for each single-integrator agent dynamics in the presence of external disturbances. In particular, it is shown that the finite settling time of the proposed general framework for robust consensus design is upper bounded for any initial condition. This makes it possible for network consensus problems to design and estimate the convergence time offline for a multi-agent team with a given undirected information flow. Finally, simulation results are presented to demonstrate the performance and effectiveness of our finite-time protocols.

Characterizing entanglement with global and marginal entropic measures

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

Adesso, Gerardo; Illuminati, Fabrizio; De Siena, Silvio

2003-12-01

We qualify the entanglement of arbitrary mixed states of bipartite quantum systems by comparing global and marginal mixednesses quantified by different entropic measures. For systems of two qubits we discriminate the class of maximally entangled states with fixed marginal mixednesses, and determine an analytical upper bound relating the entanglement of formation to the marginal linear entropies. This result partially generalizes to mixed states the quantification of entanglement with marginal mixednesses holding for pure states. We identify a class of entangled states that, for fixed marginals, are globally more mixed than product states when measured by the linear entropy. Such statesmore » cannot be discriminated by the majorization criterion.« less

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

Rice, T. Maurice; Robinson, Neil J.; Tsvelik, Alexei M.

Here, the high-temperature normal state of the unconventional cuprate superconductors has resistivity linear in temperature T, which persists to values well beyond the Mott-Ioffe-Regel upper bound. At low temperatures, within the pseudogap phase, the resistivity is instead quadratic in T, as would be expected from Fermi liquid theory. Developing an understanding of these normal phases of the cuprates is crucial to explain the unconventional superconductivity. We present a simple explanation for this behavior, in terms of the umklapp scattering of electrons. This fits within the general picture emerging from functional renormalization group calculations that spurred the Yang-Rice-Zhang ansatz: Umklapp scatteringmore » is at the heart of the behavior in the normal phase.« less

The SURE reliability analysis program

NASA Technical Reports Server (NTRS)

Butler, R. W.

1986-01-01

The SURE program is a new reliability tool for ultrareliable computer system architectures. The program is based on computational methods recently developed for the NASA Langley Research Center. These methods provide an efficient means for computing accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. Once a semi-Markov model is described using a simple input language, the SURE program automatically computes the upper and lower bounds on the probability of system failure. A parameter of the model can be specified as a variable over a range of values directing the SURE program to perform a sensitivity analysis automatically. This feature, along with the speed of the program, makes it especially useful as a design tool.

The SURE Reliability Analysis Program

NASA Technical Reports Server (NTRS)

Butler, R. W.

1986-01-01

The SURE program is a new reliability analysis tool for ultrareliable computer system architectures. The program is based on computational methods recently developed for the NASA Langley Research Center. These methods provide an efficient means for computing accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. Once a semi-Markov model is described using a simple input language, the SURE program automatically computes the upper and lower bounds on the probability of system failure. A parameter of the model can be specified as a variable over a range of values directing the SURE program to perform a sensitivity analysis automatically. This feature, along with the speed of the program, makes it especially useful as a design tool.

Quantum State Tomography via Linear Regression Estimation

PubMed Central

Qi, Bo; Hou, Zhibo; Li, Li; Dong, Daoyi; Xiang, Guoyong; Guo, Guangcan

2013-01-01

A simple yet efficient state reconstruction algorithm of linear regression estimation (LRE) is presented for quantum state tomography. In this method, quantum state reconstruction is converted into a parameter estimation problem of a linear regression model and the least-squares method is employed to estimate the unknown parameters. An asymptotic mean squared error (MSE) upper bound for all possible states to be estimated is given analytically, which depends explicitly upon the involved measurement bases. This analytical MSE upper bound can guide one to choose optimal measurement sets. The computational complexity of LRE is O(d4) where d is the dimension of the quantum state. Numerical examples show that LRE is much faster than maximum-likelihood estimation for quantum state tomography. PMID:24336519

The digital computer as a metaphor for the perfect laboratory experiment: Loophole-free Bell experiments

NASA Astrophysics Data System (ADS)

De Raedt, Hans; Michielsen, Kristel; Hess, Karl

2016-12-01

Using Einstein-Podolsky-Rosen-Bohm experiments as an example, we demonstrate that the combination of a digital computer and algorithms, as a metaphor for a perfect laboratory experiment, provides solutions to problems of the foundations of physics. Employing discrete-event simulation, we present a counterexample to John Bell's remarkable "proof" that any theory of physics, which is both Einstein-local and "realistic" (counterfactually definite), results in a strong upper bound to the correlations that are being measured in Einstein-Podolsky-Rosen-Bohm experiments. Our counterexample, which is free of the so-called detection-, coincidence-, memory-, and contextuality loophole, violates this upper bound and fully agrees with the predictions of quantum theory for Einstein-Podolsky-Rosen-Bohm experiments.

Event-based recursive filtering for a class of nonlinear stochastic parameter systems over fading channels

NASA Astrophysics Data System (ADS)

Shen, Yuxuan; Wang, Zidong; Shen, Bo; Alsaadi, Fuad E.

2018-07-01

In this paper, the recursive filtering problem is studied for a class of time-varying nonlinear systems with stochastic parameter matrices. The measurement transmission between the sensor and the filter is conducted through a fading channel characterized by the Rice fading model. An event-based transmission mechanism is adopted to decide whether the sensor measurement should be transmitted to the filter. A recursive filter is designed such that, in the simultaneous presence of the stochastic parameter matrices and fading channels, the filtering error covariance is guaranteed to have an upper bound and such an upper bound is then minimized by appropriately choosing filter gain matrix. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed filtering scheme.

Combinatorial complexity of pathway analysis in metabolic networks.

PubMed

Klamt, Steffen; Stelling, Jörg

2002-01-01

Elementary flux mode analysis is a promising approach for a pathway-oriented perspective of metabolic networks. However, in larger networks it is hampered by the combinatorial explosion of possible routes. In this work we give some estimations on the combinatorial complexity including theoretical upper bounds for the number of elementary flux modes in a network of a given size. In a case study, we computed the elementary modes in the central metabolism of Escherichia coli while utilizing four different substrates. Interestingly, although the number of modes occurring in this complex network can exceed half a million, it is still far below the upper bound. Hence, to a certain extent, pathway analysis of central catabolism is feasible to assess network properties such as flexibility and functionality.

Rebuttal to "On the distribution of the modulus of Gabor wavelet coefficients and the upper bound of the dimensionless smoothness index in the case of additive Gaussian noises: Revisited" by Dong Wang, Qiang Zhou, and Kwok-Leung Tsui

NASA Astrophysics Data System (ADS)

Soltani Bozchalooi, Iman; Liang, Ming

2018-04-01

A discussion paper entitled "On the distribution of the modulus of Gabor wavelet coefficients and the upper bound of the dimensionless smoothness index in the case of additive Gaussian noises: revisited" by Dong Wang, Qiang Zhou, Kwok-Leung Tsui has been brought to our attention recently. This discussion paper (hereafter called Wang et al. paper) is based on arguments that are fundamentally incorrect and which we rebut within this commentary. However, as the flaws in the arguments proposed by Wang et al. are clear, we will keep this rebuttal as brief as possible.

Porous medium convection at large Rayleigh number: Studies of coherent structure, transport, and reduced dynamics

NASA Astrophysics Data System (ADS)

Wen, Baole

Buoyancy-driven convection in fluid-saturated porous media is a key environmental and technological process, with applications ranging from carbon dioxide storage in terrestrial aquifers to the design of compact heat exchangers. Porous medium convection is also a paradigm for forced-dissipative infinite-dimensional dynamical systems, exhibiting spatiotemporally chaotic dynamics if not "true" turbulence. The objective of this dissertation research is to quantitatively characterize the dynamics and heat transport in two-dimensional horizontal and inclined porous medium convection between isothermal plane parallel boundaries at asymptotically large values of the Rayleigh number Ra by investigating the emergent, quasi-coherent flow. This investigation employs a complement of direct numerical simulations (DNS), secondary stability and dynamical systems theory, and variational analysis. The DNS confirm the remarkable tendency for the interior flow to self-organize into closely-spaced columnar plumes at sufficiently large Ra (up to Ra ≃ 105), with more complex spatiotemporal features being confined to boundary layers near the heated and cooled walls. The relatively simple form of the interior flow motivates investigation of unstable steady and time-periodic convective states at large Ra as a function of the domain aspect ratio L. To gain insight into the development of spatiotemporally chaotic convection, the (secondary) stability of these fully nonlinear states to small-amplitude disturbances is investigated using a spatial Floquet analysis. The results indicate that there exist two distinct modes of instability at large Ra: a bulk instability mode and a wall instability mode. The former usually is excited by long-wavelength disturbances and is generally much weaker than the latter. DNS, strategically initialized to investigate the fully nonlinear evolution of the most dangerous secondary instability modes, suggest that the (long time) mean inter-plume spacing in statistically-steady porous medium convection results from an interplay between the competing effects of these two types of instability. Upper bound analysis is then employed to investigate the dependence of the heat transport enhancement factor, i.e. the Nusselt number Nu, on Ra and L. To solve the optimization problems arising from the "background field" upper-bound variational analysis, a novel two-step algorithm in which time is introduced into the formulation is developed. The new algorithm obviates the need for numerical continuation, thereby enabling the best available bounds to be computed up to Ra ≈ 2.65 x 104. A mathematical proof is given to demonstrate that the only steady state to which this numerical algorithm can converge is the required global optimal of the variational problem. Using this algorithm, the dependence of the bounds on L( Ra) is explored, and a "minimal flow unit" is identified. Finally, the upper bound variational methodology is also shown to yield quantitatively useful predictions of Nu and to furnish a functional basis that is naturally adapted to the boundary layer dynamics at large Ra..

Two Upper Bounds for the Weighted Path Length of Binary Trees. Report No. UIUCDCS-R-73-565.

ERIC Educational Resources Information Center

Pradels, Jean Louis

Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

The Mystery of Io's Warm Polar Regions: Implications for Heat Flow

NASA Technical Reports Server (NTRS)

Matson, D. L.; Veeder, G. J.; Johnson, T. V.; Blaney, D. L.; Davies, A. G.

2002-01-01

Unexpectedly warm polar temperatures further support the idea that Io is covered virtually everywhere by cooling lava flows. This implies a new heat flow component. Io's heat flow remains constrained between a lower bound of (approximately) 2.5 W m(exp -2) and an upper bound of (approximately) 13 W m(exp -2). Additional information is contained in the original extended abstract.

Risk aversion and risk seeking in multicriteria forest management: a Markov decision process approach

Treesearch

Joseph Buongiorno; Mo Zhou; Craig Johnston

2017-01-01

Markov decision process models were extended to reflect some consequences of the risk attitude of forestry decision makers. One approach consisted of maximizing the expected value of a criterion subject to an upper bound on the variance or, symmetrically, minimizing the variance subject to a lower bound on the expected value.  The other method used the certainty...

Verifying the error bound of numerical computation implemented in computer systems

DOEpatents

Sawada, Jun

2013-03-12

A verification tool receives a finite precision definition for an approximation of an infinite precision numerical function implemented in a processor in the form of a polynomial of bounded functions. The verification tool receives a domain for verifying outputs of segments associated with the infinite precision numerical function. The verification tool splits the domain into at least two segments, wherein each segment is non-overlapping with any other segment and converts, for each segment, a polynomial of bounded functions for the segment to a simplified formula comprising a polynomial, an inequality, and a constant for a selected segment. The verification tool calculates upper bounds of the polynomial for the at least two segments, beginning with the selected segment and reports the segments that violate a bounding condition.

Search for invisible decays of a Higgs boson using vector-boson fusion in pp collisions at √s = 8 TeV with the ATLAS detector

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

Aad, G.; Abbott, B.; Abdallah, J.

2016-01-28

A search for a Higgs boson produced via vector-boson fusion and decaying into invisible particles is presented, using 20.3 fb -1 of proton-proton collision data at a centre-of-mass energy of 8 TeV recorded by the ATLAS detector at the LHC. For a Higgs boson with a mass of 125 GeV, assuming the Standard Model production cross section, an upper bound of 0.28 is set on the branching fraction of H → invisible at 95% confidence level, where the expected upper limit is 0.31. Furthermore, the results are interpreted in models of Higgs-portal dark matter where the branching fraction limit ismore » converted into upper bounds on the dark-matter-nucleon scattering cross section as a function of the dark-matter particle mass, and compared to results from the direct dark-matter detection experiments.« less

Limits on the fluctuating part of y-type distortion monopole from Planck and SPT results

NASA Astrophysics Data System (ADS)

Khatri, Rishi; Sunyaev, Rashid

2015-08-01

We use the published Planck and SPT cluster catalogs [1,2] and recently published y-distortion maps [3] to put strong observational limits on the contribution of the fluctuating part of the y-type distortions to the y-distortion monopole. Our bounds are 5.4× 10-8 < langle yrangle < 2.2× 10-6. Our upper bound is a factor of 6.8 stronger than the currently best upper 95% confidence limit from COBE-FIRAS of langle yrangle <15× 10-6. In the standard cosmology, large scale structure is the only source of such distortions and our limits therefore constrain the baryonic physics involved in the formation of the large scale structure. Our lower limit, from the detected clusters in the Planck and SPT catalogs, also implies that a Pixie-like experiment should detect the y-distortion monopole at >27-σ. The biggest sources of uncertainty in our upper limit are the monopole offsets between different HFI channel maps that we estimate to be <10-6.

On the realization of the bulk modulus bounds for two-phase viscoelastic composites

NASA Astrophysics Data System (ADS)

Andreasen, Casper Schousboe; Andreassen, Erik; Jensen, Jakob Søndergaard; Sigmund, Ole

2014-02-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 composites can be realized by additive manufacturing technologies followed by an infiltration process. Viscoelastic composites consisting of a relatively stiff elastic phase, e.g. steel, and a relatively lossy viscoelastic phase, e.g. silicone rubber, have non-connected stiff regions when optimized for maximum 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.

1-norm support vector novelty detection and its sparseness.

PubMed

Zhang, Li; Zhou, WeiDa

2013-12-01

This paper proposes a 1-norm support vector novelty detection (SVND) method and discusses its sparseness. 1-norm SVND is formulated as a linear programming problem and uses two techniques for inducing sparseness, or the 1-norm regularization and the hinge loss function. We also find two upper bounds on the sparseness of 1-norm SVND, or exact support vector (ESV) and kernel Gram matrix rank bounds. The ESV bound indicates that 1-norm SVND has a sparser representation model than SVND. The kernel Gram matrix rank bound can loosely estimate the sparseness of 1-norm SVND. Experimental results show that 1-norm SVND is feasible and effective. Copyright © 2013 Elsevier Ltd. All rights reserved.

Bounds on invisible Higgs boson decays extracted from LHC ttH production data.

PubMed

Zhou, Ning; Khechadoorian, Zepyoor; Whiteson, Daniel; Tait, Tim M P

2014-10-10

We present an upper bound on the branching fraction of the Higgs boson to invisible particles by recasting a CMS Collaboration search for stop quarks decaying to tt + E(T)(miss). The observed (expected) bound, BF(H → inv.) < 0.40(0.65) at 95% C.L., is the strongest direct limit to date, benefiting from a downward fluctuation in the CMS data in that channel. In addition, we combine this new constraint with existing published constraints to give an observed (expected) bound of BF(H → inv.) < 0.40(0.40) at 95% C.L., and we show some of the implications for theories of dark matter which communicate through the Higgs portal.

Money Gone Up in Smoke: The Tobacco Use and Malnutrition Nexus in Bangladesh

PubMed Central

Husain, Muhammad Jami; Virk-Baker, Mandeep; Parascandola, Mark; Khondker, Bazlul Haque; Ahluwalia, Indu B.

2017-01-01

BACKGROUND The tobacco epidemic in Bangladesh is pervasive. Expenditures on tobacco may reduce money available for food in a country with a high malnutrition rate. OBJECTIVES The aims of the study are to quantify the opportunity costs of tobacco expenditure in terms of nutrition (ie, food energy) forgone and the potential improvements in the household level food-energy status if the money spent on tobacco were diverted for food consumption. METHOD We analyzed data from the 2010 Bangladesh Household Income and Expenditure Survey, a nationally representative survey conducted among 12,240 households. We present 2 analytical scenarios: (1) the lower-bound gain scenario entailing money spent on tobacco partially diverted to acquiring food according to households’ food consumption share in total expenditures; and (2) the upper-bound gain scenario entailing money spent on tobacco diverted to acquiring food only. Age- and gender-based energy norms were used to identify food-energy deficient households. Data were analyzed by mutually exclusive smoking-only, smokeless-only, and dual-tobacco user households. FINDINGS On average, a smoking-only household could gain 269–497 kilocalories (kcal) daily under the lower-bound and upper-bound scenarios, respectively. The potential energy gains for smokeless-only and dual-tobacco user households ranged from 148–268 kcal and 508–924 kcal, respectively. Under these lower- and upper-bound estimates, the percentage of smoking-only user households that are malnourished declined significantly from the baseline rate of 38% to 33% and 29%, respectively. For the smokeless-only and dual-tobacco user households, there were 2–3 and 6–9 percentage point drops in the malnutrition prevalence rates. The tobacco expenditure shift could translate to an additional 4.6–7.7 million food-energy malnourished persons meeting their caloric requirements. CONCLUSIONS The findings suggest that tobacco use reduction could facilitate concomitant improvements in population-level nutrition status and may inform the development and refinement of tobacco prevention and control efforts in Bangladesh. PMID:28283125

Money Gone Up in Smoke: The Tobacco Use and Malnutrition Nexus in Bangladesh.

PubMed

Husain, Muhammad Jami; Virk-Baker, Mandeep; Parascandola, Mark; Khondker, Bazlul Haque; Ahluwalia, Indu B

The tobacco epidemic in Bangladesh is pervasive. Expenditures on tobacco may reduce money available for food in a country with a high malnutrition rate. The aims of the study are to quantify the opportunity costs of tobacco expenditure in terms of nutrition (ie, food energy) forgone and the potential improvements in the household level food-energy status if the money spent on tobacco were diverted for food consumption. We analyzed data from the 2010 Bangladesh Household Income and Expenditure Survey, a nationally representative survey conducted among 12,240 households. We present 2 analytical scenarios: (1) the lower-bound gain scenario entailing money spent on tobacco partially diverted to acquiring food according to households' food consumption share in total expenditures; and (2) the upper-bound gain scenario entailing money spent on tobacco diverted to acquiring food only. Age- and gender-based energy norms were used to identify food-energy deficient households. Data were analyzed by mutually exclusive smoking-only, smokeless-only, and dual-tobacco user households. On average, a smoking-only household could gain 269-497 kilocalories (kcal) daily under the lower-bound and upper-bound scenarios, respectively. The potential energy gains for smokeless-only and dual-tobacco user households ranged from 148-268 kcal and 508-924 kcal, respectively. Under these lower- and upper-bound estimates, the percentage of smoking-only user households that are malnourished declined significantly from the baseline rate of 38% to 33% and 29%, respectively. For the smokeless-only and dual-tobacco user households, there were 2-3 and 6-9 percentage point drops in the malnutrition prevalence rates. The tobacco expenditure shift could translate to an additional 4.6-7.7 million food-energy malnourished persons meeting their caloric requirements. The findings suggest that tobacco use reduction could facilitate concomitant improvements in population-level nutrition status and may inform the development and refinement of tobacco prevention and control efforts in Bangladesh. Copyright © 2016. Published by Elsevier Inc.

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

NASA Technical Reports Server (NTRS)

Butler, Ricky (Technical Monitor); Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes

2004-01-01

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Bounded Linear Stability Analysis - A Time Delay Margin Estimation Approach for Adaptive Control

NASA Technical Reports Server (NTRS)

Nguyen, Nhan T.; Ishihara, Abraham K.; Krishnakumar, Kalmanje Srinlvas; Bakhtiari-Nejad, Maryam

2009-01-01

This paper presents a method for estimating time delay margin for model-reference adaptive control of systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent the conventional model-reference adaptive law by a locally bounded linear approximation within a small time window using the comparison lemma. The locally bounded linear approximation of the combined adaptive system is cast in a form of an input-time-delay differential equation over a small time window. The time delay margin of this system represents a local stability measure and is computed analytically by a matrix measure method, which provides a simple analytical technique for estimating an upper bound of time delay margin. Based on simulation results for a scalar model-reference adaptive control system, both the bounded linear stability method and the matrix measure method are seen to provide a reasonably accurate and yet not too conservative time delay margin estimation.

Generalization of the Schwarz–Christoffel mapping to multiply connected polygonal domains

PubMed Central

Vasconcelos, Giovani L.

2014-01-01

A generalization of the Schwarz–Christoffel mapping to multiply connected polygonal domains is obtained by making a combined use of two preimage domains, namely, a rectilinear slit domain and a bounded circular domain. The conformal mapping from the circular domain to the polygonal region is written as an indefinite integral whose integrand consists of a product of powers of the Schottky-Klein prime functions, which is the same irrespective of the preimage slit domain, and a prefactor function that depends on the choice of the rectilinear slit domain. A detailed derivation of the mapping formula is given for the case where the preimage slit domain is the upper half-plane with radial slits. Representation formulae for other canonical slit domains are also obtained but they are more cumbersome in that the prefactor function contains arbitrary parameters in the interior of the circular domain. PMID:24910523

Generalization of the Schwarz-Christoffel mapping to multiply connected polygonal domains.

PubMed

Vasconcelos, Giovani L

2014-06-08

A generalization of the Schwarz-Christoffel mapping to multiply connected polygonal domains is obtained by making a combined use of two preimage domains, namely, a rectilinear slit domain and a bounded circular domain. The conformal mapping from the circular domain to the polygonal region is written as an indefinite integral whose integrand consists of a product of powers of the Schottky-Klein prime functions, which is the same irrespective of the preimage slit domain, and a prefactor function that depends on the choice of the rectilinear slit domain. A detailed derivation of the mapping formula is given for the case where the preimage slit domain is the upper half-plane with radial slits. Representation formulae for other canonical slit domains are also obtained but they are more cumbersome in that the prefactor function contains arbitrary parameters in the interior of the circular domain.

Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement.

PubMed

Zhuang, Quntao; Zhu, Elton Yechao; Shor, Peter W

2017-05-19

We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's preshared ancilla. Instead of a pure state, we consider the signal-ancilla pair in a mixed state, purified by a "witness." Thus, the signal-witness correlation limits the resource available from the signal-ancilla correlation. Our formula characterizes the utility of different forms of resources, including noisy or limited entanglement assistance, for classical communication. With separable encoding, the sender's signals across multiple channel uses are still allowed to be entangled, yet our capacity formula is additive. In particular, for generalized covariant channels, our capacity formula has a simple closed form. Moreover, our additive capacity formula upper bounds the general coherent attack's information gain in various two-way quantum key distribution protocols. For Gaussian protocols, the additivity of the formula indicates that the collective Gaussian attack is the most powerful.

Tightening the entropic uncertainty bound in the presence of quantum memory

NASA Astrophysics Data System (ADS)

Adabi, F.; Salimi, S.; Haseli, S.

2016-06-01

The uncertainty principle is a fundamental principle in quantum physics. It implies that the measurement outcomes of two incompatible observables cannot be predicted simultaneously. In quantum information theory, this principle can be expressed in terms of entropic measures. M. Berta et al. [Nat. Phys. 6, 659 (2010), 10.1038/nphys1734] have indicated that uncertainty bound can be altered by considering a particle as a quantum memory correlating with the primary particle. In this article, we obtain a lower bound for entropic uncertainty in the presence of a quantum memory by adding an additional term depending on the Holevo quantity and mutual information. We conclude that our lower bound will be tightened with respect to that of Berta et al. when the accessible information about measurements outcomes is less than the mutual information about the joint state. Some examples have been investigated for which our lower bound is tighter than Berta et al.'s lower bound. Using our lower bound, a lower bound for the entanglement of formation of bipartite quantum states has been obtained, as well as an upper bound for the regularized distillable common randomness.

Negativity Bounds for Weyl-Heisenberg Quasiprobability Representations

NASA Astrophysics Data System (ADS)

DeBrota, John B.; Fuchs, Christopher A.

2017-08-01

The appearance of negative terms in quasiprobability representations of quantum theory is known to be inevitable, and, due to its equivalence with the onset of contextuality, of central interest in quantum computation and information. Until recently, however, nothing has been known about how much negativity is necessary in a quasiprobability representation. Zhu (Phys Rev Lett 117 (12):120404, 2016) proved that the upper and lower bounds with respect to one type of negativity measure are saturated by quasiprobability representations which are in one-to-one correspondence with the elusive symmetric informationally complete quantum measurements (SICs). We define a family of negativity measures which includes Zhu's as a special case and consider another member of the family which we call "sum negativity." We prove a sufficient condition for local maxima in sum negativity and find exact global maxima in dimensions 3 and 4. Notably, we find that Zhu's result on the SICs does not generally extend to sum negativity, although the analogous result does hold in dimension 4. Finally, the Hoggar lines in dimension 8 make an appearance in a conjecture on sum negativity.

Sigma model Q-balls and Q-stars

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

Verbin, Y.

2007-10-15

A new kind of Q-balls is found: Q-balls in a nonlinear sigma model. Their main properties are presented together with those of their self-gravitating generalization, sigma model Q-stars. A simple special limit of solutions which are bound by gravity alone ('sigma stars') is also discussed briefly. The analysis is based on calculating the mass, global U(1) charge and binding energy for families of solutions parametrized by the central value of the scalar field. Two kinds (differing by the potential term) of the new sigma model Q-balls and Q-stars are analyzed. They are found to share some characteristics while differing inmore » other respects like their properties for weak central scalar fields which depend strongly on the form of the potential term. They are also compared with their ordinary counterparts and although similar in some respects, significant differences are found like the existence of an upper bound on the central scalar field. A special subset of the sigma model Q-stars contains those which do not possess a flat space limit. Their relation with sigma star solutions is discussed.« less

Graviton mass bounds from an analysis of bright star trajectories at the Galactic Center

NASA Astrophysics Data System (ADS)

Zakharov, Alexander; Jovanović, Predrag; Borka, Dusko; Jovanović, Vesna Borka

2017-03-01

In February 2016 the LIGO & VIRGO collaboration reported the discovery of gravitational waves in merging black holes, therefore, the team confirmed GR predictions about an existence of black holes and gravitational waves in the strong gravitational field limit. Moreover, in their papers the joint LIGO & VIRGO team presented an upper limit on graviton mass such as mg < 1.2 × 10-22 eV (Abbott et al. 2016). So, the authors concluded that their observational data do not show any violation of classical general relativity. We show that an analysis of bright star trajectories could constrain graviton mass with a comparable accuracy with accuracies reached with gravitational wave interferometers and the estimate is consistent with the one obtained by the LIGO & VIRGO collaboration. This analysis gives an opportunity to treat observations of bright stars near the Galactic Center as a useful tool to obtain constraints on the fundamental gravity law such as modifications of the Newton gravity law in a weak field approximation. In that way, based on a potential reconstruction at the Galactic Center we obtain bounds on a graviton mass.

An extended GS method for dense linear systems

NASA Astrophysics Data System (ADS)

Niki, Hiroshi; Kohno, Toshiyuki; Abe, Kuniyoshi

2009-09-01

Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994) 1399-1411] derived the GSOR method, which uses an upper triangular matrix [Omega] in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum [Omega]. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner PG is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner produces an extremely small spectral radius in comparison with the other schemes considered.

Bound on the Slope of Steady Water Waves with Favorable Vorticity

NASA Astrophysics Data System (ADS)

Strauss, Walter A.; Wheeler, Miles H.

2016-12-01

We consider the angle {θ} of inclination (with respect to the horizontal) of the profile of a steady two dimensional inviscid symmetric periodic or solitary water wave subject to gravity. Although {θ} may surpass 30° for some irrotational waves close to the extreme wave, Amick (Arch Ration Mech Anal 99(2):91-114, 1987) proved that for any irrotational wave the angle must be less than 31.15°. Is the situation similar for periodic or solitary waves that are not irrotational? The extreme Gerstner wave has infinite depth, adverse vorticity and vertical cusps ( θ = 90°). Moreover, numerical calculations show that even waves of finite depth can overturn if the vorticity is adverse. In this paper, on the other hand, we prove an upper bound of 45° on {θ} for a large class of waves with favorable vorticity and finite depth. In particular, the vorticity can be any constant with the favorable sign. We also prove a series of general inequalities on the pressure within the fluid, including the fact that any overturning wave must have a pressure sink.

Estimation and Selection via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications

PubMed Central

Huang, Jian; Zhang, Cun-Hui

2013-01-01

The ℓ1-penalized method, or the Lasso, has emerged as an important tool for the analysis of large data sets. Many important results have been obtained for the Lasso in linear regression which have led to a deeper understanding of high-dimensional statistical problems. In this article, we consider a class of weighted ℓ1-penalized estimators for convex loss functions of a general form, including the generalized linear models. We study the estimation, prediction, selection and sparsity properties of the weighted ℓ1-penalized estimator in sparse, high-dimensional settings where the number of predictors p can be much larger than the sample size n. Adaptive Lasso is considered as a special case. A multistage method is developed to approximate concave regularized estimation by applying an adaptive Lasso recursively. We provide prediction and estimation oracle inequalities for single- and multi-stage estimators, a general selection consistency theorem, and an upper bound for the dimension of the Lasso estimator. Important models including the linear regression, logistic regression and log-linear models are used throughout to illustrate the applications of the general results. PMID:24348100

Hardening Effect Analysis by Modular Upper Bound and Finite Element Methods in Indentation of Aluminum, Steel, Titanium and Superalloys

PubMed Central

Bermudo, Carolina; Sevilla, Lorenzo; Martín, Francisco; Trujillo, Francisco Javier

2017-01-01

The application of incremental processes in the manufacturing industry is having a great development in recent years. The first stage of an Incremental Forming Process can be defined as an indentation. Because of this, the indentation process is starting to be widely studied, not only as a hardening test but also as a forming process. Thus, in this work, an analysis of the indentation process under the new Modular Upper Bound perspective has been performed. The modular implementation has several advantages, including the possibility of the introduction of different parameters to extend the study, such as the friction effect, the temperature or the hardening effect studied in this paper. The main objective of the present work is to analyze the three hardening models developed depending on the material characteristics. In order to support the validation of the hardening models, finite element analyses of diverse materials under an indentation are carried out. Results obtained from the Modular Upper Bound are in concordance with the results obtained from the numerical analyses. In addition, the numerical and analytical methods are in concordance with the results previously obtained in the experimental indentation of annealed aluminum A92030. Due to the introduction of the hardening factor, the new modular distribution is a suitable option for the analysis of indentation process. PMID:28772914

Exploring L1 model space in search of conductivity bounds for the MT problem

NASA Astrophysics Data System (ADS)

Wheelock, B. D.; Parker, R. L.

2013-12-01

Geophysical inverse problems of the type encountered in electromagnetic techniques are highly non-unique. As a result, any single inverted model, though feasible, is at best inconclusive and at worst misleading. In this paper, we use modified inversion methods to establish bounds on electrical conductivity within a model of the earth. Our method consists of two steps, each making use of the 1-norm in model regularization. Both 1-norm minimization problems are framed without approximation as non-negative least-squares (NNLS) problems. First, we must identify a parsimonious set of regions within the model for which upper and lower bounds on average conductivity will be sought. This is accomplished by minimizing the 1-norm of spatial variation, which produces a model with a limited number of homogeneous regions; in fact, the number of homogeneous regions will never be greater than the number of data, regardless of the number of free parameters supplied. The second step establishes bounds for each of these regions with pairs of inversions. The new suite of inversions also uses a 1-norm penalty, but applied to the conductivity values themselves, rather than the spatial variation thereof. In the bounding step we use the 1-norm of our model parameters because it is proportional to average conductivity. For a lower bound on average conductivity, the 1-norm within a bounding region is minimized. For an upper bound on average conductivity, the 1-norm everywhere outside a bounding region is minimized. The latter minimization has the effect of concentrating conductance into the bounding region. Taken together, these bounds are a measure of the uncertainty in the associated region of our model. Starting with a blocky inverse solution is key in the selection of the bounding regions. Of course, there is a tradeoff between resolution and uncertainty: an increase in resolution (smaller bounding regions), results in greater uncertainty (wider bounds). Minimization of the 1-norm of spatial variation delivers the fewest possible regions defined by a mean conductivity, the quantity we wish to bound. Thus, these regions present a natural set for which the most narrow and discriminating bounds can be found. For illustration, we apply these techniques to synthetic magnetotelluric (MT) data sets resulting from one-dimensional (1D) earth models. In each case we find that with realistic data coverage, any single inverted model can often stray from the truth, while the computed bounds on an encompassing region contain both the inverted and the true conductivities, indicating that our measure of model uncertainty is robust. Such estimates of uncertainty for conductivity can then be translated to bounds on important petrological parameters such as mineralogy, porosity, saturation, and fluid type.

Pharmacokinetics and repolarization effects of intravenous and transdermal granisetron.

PubMed

Mason, Jay W; Selness, Daniel S; Moon, Thomas E; O'Mahony, Bridget; Donachie, Peter; Howell, Julian

2012-05-15

The need for greater clarity about the effects of 5-HT(3) receptor antagonists on cardiac repolarization is apparent in the changing product labeling across this therapeutic class. This study assessed the repolarization effects of granisetron, a 5-HT(3) receptor antagonist antiemetic, administered intravenously and by a granisetron transdermal system (GTDS). In a parallel four-arm study, healthy subjects were randomized to receive intravenous granisetron, GTDS, placebo, or oral moxifloxacin (active control). The primary endpoint was difference in change from baseline in mean Fridericia-corrected QT interval (QTcF) between GTDS and placebo (ddQTcF) on days 3 and 5. A total of 240 subjects were enrolled, 60 in each group. Adequate sensitivity for detection of QTc change was shown by a 5.75 ms lower bound of the 90% confidence interval (CI) for moxifloxacin versus placebo at 2 hours postdose on day 3. Day 3 ddQTcF values varied between 0.2 and 1.9 ms for GTDS (maximum upper bound of 90% CI, 6.88 ms), between -1.2 and 1.6 ms for i.v. granisetron (maximum upper bound of 90% CI, 5.86 ms), and between -3.4 and 4.7 ms for moxifloxacin (maximum upper bound of 90% CI, 13.45 ms). Day 5 findings were similar. Pharmacokinetic-ddQTcF modeling showed a minimally positive slope of 0.157 ms/(ng/mL), but a very low correlation (r = 0.090). GTDS was not associated with statistically or clinically significant effects on QTcF or other electrocardiographic variables. This study provides useful clarification on the effect of granisetron delivered by GTDS on cardiac repolarization. ©2012 AACR.

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

NASA Astrophysics Data System (ADS)

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.

FACTORING TO FIT OFF DIAGONALS.

DTIC Science & Technology

imply an upper bound on the number of factors. When applied to somatotype data, the method improved substantially on centroid solutions and indicated a reinterpretation of earlier factoring studies. (Author)

Evolution of cosmic string networks

NASA Technical Reports Server (NTRS)

Albrecht, Andreas; Turok, Neil

1989-01-01

Results on cosmic strings are summarized including: (1) the application of non-equilibrium statistical mechanics to cosmic string evolution; (2) a simple one scale model for the long strings which has a great deal of predictive power; (3) results from large scale numerical simulations; and (4) a discussion of the observational consequences of our results. An upper bound on G mu of approximately 10(-7) emerges from the millisecond pulsar gravity wave bound. How numerical uncertainties affect this are discussed. Any changes which weaken the bound would probably also give the long strings the dominant role in producing observational consequences.

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

NASA Astrophysics Data System (ADS)

Chen, Zhixiang; Fu, Bin

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum multilinear monomial when the input is a ΠΣΠ polynomial. We first prove that the first problem is #P-hard and then devise a O *(3 n s(n)) upper bound for this problem for any polynomial represented by an arithmetic circuit of size s(n). Later, this upper bound is improved to O *(2 n ) for ΠΣΠ polynomials. We then design fully polynomial-time randomized approximation schemes for this problem for ΠΣ polynomials. On the negative side, we prove that, even for ΠΣΠ polynomials with terms of degree ≤ 2, the first problem cannot be approximated at all for any approximation factor ≥ 1, nor "weakly approximated" in a much relaxed setting, unless P=NP. For the second problem, we first give a polynomial time λ-approximation algorithm for ΠΣΠ polynomials with terms of degrees no more a constant λ ≥ 2. On the inapproximability side, we give a n (1 - ɛ)/2 lower bound, for any ɛ> 0, on the approximation factor for ΠΣΠ polynomials. When the degrees of the terms in these polynomials are constrained as ≤ 2, we prove a 1.0476 lower bound, assuming Pnot=NP; and a higher 1.0604 lower bound, assuming the Unique Games Conjecture.

Interpreting the spatio-temporal patterns of sea turtle strandings: Going with the flow

USGS Publications Warehouse

Hart, K.M.; Mooreside, P.; Crowder, L.B.

2006-01-01

Knowledge of the spatial and temporal distribution of specific mortality sources is crucial for management of species that are vulnerable to human interactions. Beachcast carcasses represent an unknown fraction of at-sea mortalities. While a variety of physical (e.g., water temperature) and biological (e.g., decomposition) factors as well as the distribution of animals and their mortality sources likely affect the probability of carcass stranding, physical oceanography plays a major role in where and when carcasses strand. Here, we evaluate the influence of nearshore physical oceanographic and wind regimes on sea turtle strandings to decipher seasonal trends and make qualitative predictions about stranding patterns along oceanfront beaches. We use results from oceanic drift-bottle experiments to check our predictions and provide an upper limit on stranding proportions. We compare predicted current regimes from a 3D physical oceanographic model to spatial and temporal locations of both sea turtle carcass strandings and drift bottle landfalls. Drift bottle return rates suggest an upper limit for the proportion of sea turtle carcasses that strand (about 20%). In the South Atlantic Bight, seasonal development of along-shelf flow coincides with increased numbers of strandings of both turtles and drift bottles in late spring and early summer. The model also predicts net offshore flow of surface waters during winter - the season with the fewest relative strandings. The drift bottle data provide a reasonable upper bound on how likely carcasses are to reach land from points offshore and bound the general timeframe for stranding post-mortem (< two weeks). Our findings suggest that marine turtle strandings follow a seasonal regime predictable from physical oceanography and mimicked by drift bottle experiments. Managers can use these findings to reevaluate incidental strandings limits and fishery takes for both nearshore and offshore mortality sources. ?? 2005 Elsevier Ltd. All rights reserved.

Tsirelson's bound from a generalized data processing inequality

NASA Astrophysics Data System (ADS)

Dahlsten, Oscar C. O.; Lercher, Daniel; Renner, Renato

2012-06-01

The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and the fact that correlations between two systems cannot increase under local operations, a property known as the data processing inequality (DPI). More specifically, we consider arbitrary convex probabilistic theories. These can be equipped with an entropy measure that naturally generalizes the von Neumann entropy, as shown recently in Short and Wehner (2010 New J. Phys. 12 033023) and Barnum et al (2010 New J. Phys. 12 033024). We prove that if the DPI holds with respect to this generalized entropy measure then the underlying theory necessarily respects Tsirelson's bound. We, moreover, generalize this statement to any entropy measure satisfying certain minimal requirements. A consequence of our result is that not all the entropic relations used for deriving Tsirelson's bound via information causality in Pawlowski et al (2009 Nature 461 1101-4) are necessary.

Necessary and sufficient criterion for extremal quantum correlations in the simplest Bell scenario

NASA Astrophysics Data System (ADS)

Ishizaka, Satoshi

2018-05-01

In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a plausible, analytical, necessary and sufficient condition ensuring that a nonlocal quantum correlation in the simplest scenario is an extremal boundary point. Our extremality condition amounts to certifying an information-theoretical quantity; the probability of guessing a measurement outcome of a distant party optimized using any quantum instrument. We show that this quantity can be upper and lower bounded from any correlation in a device-independent way, and we use numerical calculations to confirm that coincidence of the upper and lower bounds appears to be necessary and sufficient for the extremality.

On dynamic tumor eradication conditions under combined chemical/anti-angiogenic therapies

NASA Astrophysics Data System (ADS)

Starkov, Konstantin E.

2018-02-01

In this paper ultimate dynamics of the five-dimensional cancer tumor growth model at the angiogenesis phase is studied. This model elaborated by Pinho et al. in 2014 describes interactions between normal/cancer/endothelial cells under chemotherapy/anti-angiogenic agents in tumor growth process. The author derives ultimate upper bounds for normal/tumor/endothelial cells concentrations and ultimate upper and lower bounds for chemical/anti-angiogenic concentrations. Global asymptotic tumor clearance conditions are obtained for two versions: the use of only chemotherapy and the combined application of chemotherapy and anti-angiogenic therapy. These conditions are established as the attraction conditions to the maximum invariant set in the tumor free plane, and furthermore, the case is examined when this set consists only of tumor free equilibrium points.

Robust guaranteed cost tracking control of quadrotor UAV with uncertainties.

PubMed

Xu, Zhiwei; Nian, Xiaohong; Wang, Haibo; Chen, Yinsheng

2017-07-01

In this paper, a robust guaranteed cost controller (RGCC) is proposed for quadrotor UAV system with uncertainties to address set-point tracking problem. A sufficient condition of the existence for RGCC is derived by Lyapunov stability theorem. The designed RGCC not only guarantees the whole closed-loop system asymptotically stable but also makes the quadratic performance level built for the closed-loop system have an upper bound irrespective to all admissible parameter uncertainties. Then, an optimal robust guaranteed cost controller is developed to minimize the upper bound of performance level. Simulation results verify the presented control algorithms possess small overshoot and short setting time, with which the quadrotor has ability to perform set-point tracking task well. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Limits on cold dark matter cosmologies from new anisotropy bounds on the cosmic microwave background

NASA Technical Reports Server (NTRS)

Vittorio, Nicola; Meinhold, Peter; Lubin, Philip; Muciaccia, Pio Francesco; Silk, Joseph

1991-01-01

A self-consistent method is presented for comparing theoretical predictions of and observational upper limits on CMB anisotropy. New bounds on CDM cosmologies set by the UCSB South Pole experiment on the 1 deg angular scale are presented. An upper limit of 4.0 x 10 to the -5th is placed on the rms differential temperature anisotropy to a 95 percent confidence level and a power of the test beta = 55 percent. A lower limit of about 0.6/b is placed on the density parameter of cold dark matter universes with greater than about 3 percent baryon abundance and a Hubble constant of 50 km/s/Mpc, where b is the bias factor, equal to unity only if light traces mass.

Architectural elements and bounding surfaces in fluvial deposits: anatomy of the Kayenta formation (lower jurassic), Southwest Colorado

NASA Astrophysics Data System (ADS)

Miall, Andrew D.

1988-03-01

Three well-exposed outcrops in the Kayenta Formation (Lower Jurassic), near Dove Creek in southwestern Colorado, were studied using lateral profiles, in order to test recent regarding architectural-element analysis and the classification and interpretation of internal bounding surfaces. Examination of bounding surfaces within and between elements in the Kayenta outcrops raises problems in applying the three-fold classification of Allen (1983). Enlarging this classification to a six-fold hierarchy permits the discrimination of surfaces intermediate between Allen's second- and third-order types, corresponding to the upper bounding surfaces of macroforms, and internal erosional "reactivation" surfaces within the macroforms. Examples of the first five types of surface occur in the Kayenta outcrops at Dove Creek. The new classifications is offered as a general solution to the problem of description of complex, three-dimensional fluvial sandstone bodies. The Kayenta Formation at Dove Creek consists of a multistorey sandstone body, including the deposits of lateral- and downstream-accreted macroforms. The storeys show no internal cyclicity, neither within individual elements nor through the overall vertical thickness of the formation. Low paleocurrent variance indicates low sinuosity flow, whereas macroform geometry and orientation suggest low to moderate sinuosity. The many internal minor erosion surfaces draped with mud and followed by intraclast breccias imply frequent rapid stage fluctuation, consistent with variable (seasonal? monsonal? ephemmeral?) flow. The results suggest a fluvial architecture similar to that of the South Saskatchewan River, through with a three-dimensional geometry unlike that interpreted from surface studies of that river.

A Priori Bound on the Velocity in Axially Symmetric Navier-Stokes Equations

NASA Astrophysics Data System (ADS)

Lei, Zhen; Navas, Esteban A.; Zhang, Qi S.

2016-01-01

Let v be the velocity of Leray-Hopf solutions to the axially symmetric three-dimensional Navier-Stokes equations. Under suitable conditions for initial values, we prove the following a priori bound |v(x, t)| ≤ C |ln r|^{1/2}/r^2, qquad 0 < r ≤ 1/2, where r is the distance from x to the z axis, and C is a constant depending only on the initial value. This provides a pointwise upper bound (worst case scenario) for possible singularities, while the recent papers (Chiun-Chuan et al., Commun PDE 34(1-3):203-232, 2009; Koch et al., Acta Math 203(1):83-105, 2009) gave a lower bound. The gap is polynomial order 1 modulo a half log term.

Perpetual motion and driven dynamics of a mobile impurity in a quantum fluid

NASA Astrophysics Data System (ADS)

Lychkovskiy, O.

2015-04-01

We study the dynamics of a mobile impurity in a quantum fluid at zero temperature. Two related settings are considered. In the first setting, the impurity is injected in the fluid with some initial velocity v0, and we are interested in its velocity at infinite time, v∞. We derive a rigorous upper bound on | v0-v∞| for initial velocities smaller than the generalized critical velocity. In the limit of vanishing impurity-fluid coupling, this bound amounts to v∞=v0 , which can be regarded as a rigorous proof of the Landau criterion of superfluidity. In the case of a finite coupling, the velocity of the impurity can drop, but not to zero; the bound quantifies the maximal possible drop. In the second setting, a small constant force is exerted upon the impurity. We argue that two distinct dynamical regimes exist—backscattering oscillations of the impurity velocity and saturation of the velocity without oscillations. For fluids with vc L=vs (where vc L and vs are the Landau critical velocity and sound velocity, respectively), the latter regime is realized. For fluids with vc L

VizieR Online Data Catalog: Tracers of the Milky Way mass (Bratek+, 2014)

NASA Astrophysics Data System (ADS)

Bratek, L.; Sikora, S.; Jalocha, J.; Kutschera, M.

2013-11-01

We model the phase-space distribution of the kinematic tracers using general, smooth distribution functions to derive a conservative lower bound on the total mass within ~~150-200kpc. By approximating the potential as Keplerian, the phase-space distribution can be simplified to that of a smooth distribution of energies and eccentricities. Our approach naturally allows for calculating moments of the distribution function, such as the radial profile of the orbital anisotropy. We systematically construct a family of phase-space functions with the resulting radial velocity dispersion overlapping with the one obtained using data on radial motions of distant kinematic tracers, while making no assumptions about the density of the tracers and the velocity anisotropy parameter β regarded as a function of the radial variable. While there is no apparent upper bound for the Milky Way mass, at least as long as only the radial motions are concerned, we find a sharp lower bound for the mass that is small. In particular, a mass value of 2.4x1011M⊙, obtained in the past for lower and intermediate radii, is still consistent with the dispersion profile at larger radii. Compared with much greater mass values in the literature, this result shows that determining the Milky Way mass is strongly model-dependent. We expect a similar reduction of mass estimates in models assuming more realistic mass profiles. (1 data file).

Constraining the range of Yukawa gravity interaction from S2 star orbits II: bounds on graviton mass

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

Zakharov, A.F.; Jovanović, P.; Borka, D.

2016-05-01

Recently LIGO collaboration discovered gravitational waves [1] predicted 100 years ago by A. Einstein. Moreover, in the key paper reporting about the discovery, the joint LIGO and VIRGO team presented an upper limit on graviton mass such as m {sub g} < 1.2 × 10{sup −22} eV [2] (see also more details in another LIGO paper [3] dedicated to a data analysis to obtain such a small constraint on a graviton mass). Since the graviton mass limit is so small the authors concluded that their observational data do not show violations of classical general relativity. We consider another opportunity tomore » evaluate a graviton mass from phenomenological consequences of massive gravity and show that an analysis of bright star trajectories could bound graviton mass with a comparable accuracy with accuracies reached with gravitational wave interferometers and expected with forthcoming pulsar timing observations for gravitational wave detection. It gives an opportunity to treat observations of bright stars near the Galactic Center as a wonderful tool not only for an evaluation specific parameters of the black hole but also to obtain constraints on the fundamental gravity law such as a modifications of Newton gravity law in a weak field approximation. In particular, we obtain bounds on a graviton mass based on a potential reconstruction at the Galactic Center.« less

Uniqueness of First Order Post-Newtonian Collinear Solutions for Three-Body Problem under a Scalar-Tensor Theory

NASA Astrophysics Data System (ADS)

Cao, Wei-Guang; Zhou, Tian-Yi; Xie, Yi

2017-10-01

As a continuing investigation of an earlier work that establishes the collinear solutions to the three-body problem with general masses under a scalar-tensor theory, we study these solutions and prove their uniqueness up to the first order post-Newtonian approximation. With the help of observed bounds on the scalar field in the Solar System, we show that the seventh-order polynomial equation determining the distance ratio among the three masses has either one or three positive roots. However, in the case with three positive roots, it is found that two positive roots break down the slow-motion condition for the post-Newtonian approximation so that only one positive root is physically valid. The resulting uniqueness suggests that the locations of the three masses are very close to their Newtonian positions with post-Newtonian corrections of general relativity and the scalar field. We also prove that, in the framework of the scalar-tensor theory, the angular velocity of the collinear configuration is always less than the Newtonian one when all other parameters are fixed. These results are valid only for three-body systems where upper-bounds on the scalar field are compatible with those of the Solar System. Supported by the National Natural Science Foundation of China under Grant Nos. 11573015 and J1210039, and the Innovation Training Project for Undergraduates of Nanjing University, China

Dietary exposure and risk assessment of polychlorinated dibenzo-p-dioxins, polychlorinated dibenzofurans and dioxin-like polychlorinated biphenyls of the population in the Region of Valencia (Spain).

PubMed

Quijano, Leyre; Marín, Silvia; Millan, Encarnación; Yusà, Vicent; Font, Guillermina; Pardo, Olga

2018-04-01

Dietary exposure of the Valencia Region population to polychlorinated dibenzo-p-dioxins (PCDDs), polychlorinated dibenzofurans (PCDFs) and PCBs was assessed in the Region of Valencia in 2010-2011. A total of 7700 food samples were collected. Occurrence data were combined with consumption data to estimate dietary exposure in adults (>15 years of age) and young people (6-15 years of age). The estimated intake was calculated by a probabilistic approach. Average intake levels (upper-bound scenario) were 1.58 and 2.76 pg toxic equivalent (TEQ) kg -1 body weight (bw) day -1 for adults and young people, respectively. These average intakes are within range of the tolerable daily intake of 1-4 pg WHO-TEQ kg -1 bw day -1 recommended by WHO, and slightly above the tolerable weekly intake (TWI) of 14 pg TEQ kg -1 bw week -1 and the Provisional tolerable monthly intake of 70 pg TEQ kg -1 bw month -1 set by the Scientific Committee on Food and the Joint FAO/WHO Expert Committee on Food, respectively. These results show that the contamination levels in food and therefore the exposure of the general population to PCDD/Fs and PCBs have declined in this region and therefore show the efficiency of the European risk-management measures. In terms of risk characterisation, the results showed that, under the upper-bound scenario, 22% of the adult and 58% of the young people population could exceed the TWI.

Meta-food-chains as a many-layer epidemic process on networks

NASA Astrophysics Data System (ADS)

Barter, Edmund; Gross, Thilo

2016-02-01

Notable recent works have focused on the multilayer properties of coevolving diseases. We point out that very similar systems play an important role in population ecology. Specifically we study a meta-food-web model that was recently proposed by Pillai et al. [Theor. Ecol. 3, 223 (2009), 10.1007/s12080-009-0065-1]. This model describes a network of species connected by feeding interactions, which spread over a network of spatial patches. Focusing on the essential case, where the network of feeding interactions is a chain, we develop an analytical approach for the computation of the degree distributions of colonized spatial patches for the different species in the chain. This framework allows us to address ecologically relevant questions. Considering configuration model ensembles of spatial networks, we find that there is an upper bound for the fraction of patches that a given species can occupy, which depends only on the networks mean degree. For a given mean degree there is then an optimal degree distribution that comes closest to the upper bound. Notably scale-free degree distributions perform worse than more homogeneous degree distributions if the mean degree is sufficiently high. Because species experience the underlying network differently the optimal degree distribution for one particular species is generally not the optimal distribution for the other species in the same food web. These results are of interest for conservation ecology, where, for instance, the task of selecting areas of old-growth forest to preserve in an agricultural landscape, amounts to the design of a patch network.

Detection of Pneumonia Associated Pathogens Using a Prototype Multiplexed Pneumonia Test in Hospitalized Patients with Severe Pneumonia

PubMed Central

Schulte, Berit; Eickmeyer, Holm; Heininger, Alexandra; Juretzek, Stephanie; Karrasch, Matthias; Denis, Olivier; Roisin, Sandrine; Pletz, Mathias W.; Klein, Matthias; Barth, Sandra; Lüdke, Gerd H.; Thews, Anne; Torres, Antoni; Cillóniz, Catia; Straube, Eberhard; Autenrieth, Ingo B.; Keller, Peter M.

2014-01-01

Severe pneumonia remains an important cause of morbidity and mortality. Polymerase chain reaction (PCR) has been shown to be more sensitive than current standard microbiological methods – particularly in patients with prior antibiotic treatment – and therefore, may improve the accuracy of microbiological diagnosis for hospitalized patients with pneumonia. Conventional detection techniques and multiplex PCR for 14 typical bacterial pneumonia-associated pathogens were performed on respiratory samples collected from adult hospitalized patients enrolled in a prospective multi-center study. Patients were enrolled from March until September 2012. A total of 739 fresh, native samples were eligible for analysis, of which 75 were sputa, 421 aspirates, and 234 bronchial lavages. 276 pathogens were detected by microbiology for which a valid PCR result was generated (positive or negative detection result by Curetis prototype system). Among these, 120 were identified by the prototype assay, 50 pathogens were not detected. Overall performance of the prototype for pathogen identification was 70.6% sensitivity (95% confidence interval (CI) lower bound: 63.3%, upper bound: 76.9%) and 95.2% specificity (95% CI lower bound: 94.6%, upper bound: 95.7%). Based on the study results, device cut-off settings were adjusted for future series production. The overall performance with the settings of the CE series production devices was 78.7% sensitivity (95% CI lower bound: 72.1%) and 96.6% specificity (95% CI lower bound: 96.1%). Time to result was 5.2 hours (median) for the prototype test and 43.5 h for standard-of-care. The Pneumonia Application provides a rapid and moderately sensitive assay for the detection of pneumonia-causing pathogens with minimal hands-on time. Trial Registration Deutsches Register Klinischer Studien (DRKS) DRKS00005684 PMID:25397673

New exponential stability criteria for stochastic BAM neural networks with impulses

NASA Astrophysics Data System (ADS)

Sakthivel, R.; Samidurai, R.; Anthoni, S. M.

2010-10-01

In this paper, we study the global exponential stability of time-delayed stochastic bidirectional associative memory neural networks with impulses and Markovian jumping parameters. A generalized activation function is considered, and traditional assumptions on the boundedness, monotony and differentiability of activation functions are removed. We obtain a new set of sufficient conditions in terms of linear matrix inequalities, which ensures the global exponential stability of the unique equilibrium point for stochastic BAM neural networks with impulses. The Lyapunov function method with the Itô differential rule is employed for achieving the required result. Moreover, a numerical example is provided to show that the proposed result improves the allowable upper bound of delays over some existing results in the literature.

Locality of Temperature

NASA Astrophysics Data System (ADS)

Kliesch, M.; Gogolin, C.; Kastoryano, M. J.; Riera, A.; Eisert, J.

2014-07-01

This work is concerned with thermal quantum states of Hamiltonians on spin- and fermionic-lattice systems with short-range interactions. We provide results leading to a local definition of temperature, thereby extending the notion of "intensivity of temperature" to interacting quantum models. More precisely, we derive a perturbation formula for thermal states. The influence of the perturbation is exactly given in terms of a generalized covariance. For this covariance, we prove exponential clustering of correlations above a universal critical temperature that upper bounds physical critical temperatures such as the Curie temperature. As a corollary, we obtain that above the critical temperature, thermal states are stable against distant Hamiltonian perturbations. Moreover, our results imply that above the critical temperature, local expectation values can be approximated efficiently in the error and the system size.

Dominating Scale-Free Networks Using Generalized Probabilistic Methods

PubMed Central

Molnár,, F.; Derzsy, N.; Czabarka, É.; Székely, L.; Szymanski, B. K.; Korniss, G.

2014-01-01

We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for applications. We propose two novel probabilistic dominating set selection strategies that are applicable to heterogeneous networks. One of them obtains the smallest probabilistic dominating set and also outperforms the deterministic degree-ranked method. We show that a degree-dependent probabilistic selection method becomes optimal in its deterministic limit. In addition, we also find the precise limit where selecting high-degree nodes exclusively becomes inefficient for network domination. We validate our results on several real-world networks, and provide highly accurate analytical estimates for our methods. PMID:25200937

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

Sanchez-Moreno, P.; Instituto 'Carlos I' de Fisica Teorica y Computacional, Universidad de Granada, Granada; Zozor, S.

The Renyi and Shannon entropies are information-theoretic measures, which have enabled to formulate the position-momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation. Moreover, they are closely related to various energetic density functionals of quantum systems. Here we derive upper bounds on these quantities in terms of the second-order moment for general central potentials. This improves previous results of this type. The proof uses the Renyi maximization procedure with a covariance constraint due to Costa et al. [in Proceedings of the Fourth International Workshop on Energy Minimization Methods in Computer Visionmore » and Pattern Recognition (EMMCVPR), edited by A.Rangarajan, M.A. T.Figueiredo, and J.Zerubia (Springer-Verlag, Lisbon, 2003), [Lect. Notes Comput. Sci. 52, 211 (2003).

Real time estimation and prediction of ship motions using Kalman filtering techniques

NASA Technical Reports Server (NTRS)

Triantafyllou, M. A.; Bodson, M.; Athans, M.

1982-01-01

A landing scheme for landing V/STOL aircraft on rolling ships was sought using computerized simulations. The equations of motion as derived from hydrodynamics, their form and the physical mechanisms involved and the general form of the approximation are discussed. The modeling of the sea is discussed. The derivation of the state-space equations for the DD-963 destroyer is described. Kalman filter studies are presented and the influence of the various parameters is assessed. The effect of various modeling parameters on the rms error is assessed and simplifying conclusions are drawn. An upper bound for prediction time of about five seconds is established, with the exception of roll, which can be predicted up to ten seconds ahead.

Exact Large-Deviation Statistics for a Nonequilibrium Quantum Spin Chain

NASA Astrophysics Data System (ADS)

Žnidarič, Marko

2014-01-01

We consider a one-dimensional XX spin chain in a nonequilibrium setting with a Lindblad-type boundary driving. By calculating large-deviation rate function in the thermodynamic limit, a generalization of free energy to a nonequilibrium setting, we obtain a complete distribution of current, including closed expressions for lower-order cumulants. We also identify two phase-transition-like behaviors in either the thermodynamic limit, at which the current probability distribution becomes discontinuous, or at maximal driving, when the range of possible current values changes discontinuously. In the thermodynamic limit the current has a finite upper and lower bound. We also explicitly confirm nonequilibrium fluctuation relation and show that the current distribution is the same under mapping of the coupling strength Γ→1/Γ.

Pioneer Venus orbiter search for Venusian lightning

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

Borucki, W.J.; Dyer, J.W.; Phillips, J.R.

1991-07-01

During the 1988 and 1990, the star sensor aboard the Pioneer Venus orbiter (PVO) was used to search for optical pulses from lightning on the nightside of Venus. Useful data were obtained for 53 orbits in 1988 and 55 orbits in 1990. During this period, approximately 83 s of search time plus 7749 s of control data were obtained. The results again find no optical evidence for lightning activity. With the region that was observed during 1988, the results imply that the upper bound to short-duration flashes is 4 {times} 10{sup {minus}7} flashes/km{sup 2}/s for flashes that are at leastmore » 50% as bright as typical terrestrial lightning. During 1990, when the 2-Hz filter was used, the results imply an upper bound of 1 {times} 10{sup {minus}7} flashes/km{sup 2}/s for long-duration flashes at least 1.6% as bright as typical terrestrial lightning flashes or 33% as bright as the pulses observed by the Venera 9. The upper bounds to the flash rates for the 1988 and 1990 searches are twice and one half the global terrestrial rate, respectively. These two searches covered the region from 60{degrees}N latitude to 30{degrees}S latitude, 250{degrees} to 350{degrees} longitude, and the region from 45{degrees}N latitude to 55{degrees}S latitude, 155{degrees} to 300{degrees} longitude. Both searches sampled much of the nightside region from the dawn terminator to within 4 hours of the dusk terminator. These searches covered a much larger latitude range than any previous search. The results show that the Beat and Phoebe Regio areas previously identified by Russell et al. (1988) as areas with high rates of lightning activity were not active during the two seasons of the observations. When the authors assume that their upper bounds to the nightside flash rate are representative of the entire planet, the results imply that the global flash rate and energy dissipation rate derived by Krasnopol'sky (1983) from his observation of a single storm are too high.« less

Lieb-Robinson bound and locality for general markovian quantum dynamics.

PubMed

Poulin, David

2010-05-14

The Lieb-Robinson bound shows the existence of a maximum speed of signal propagation in discrete quantum mechanical systems with local interactions. This generalizes the concept of relativistic causality beyond field theory, and provides a powerful tool in theoretical condensed matter physics and quantum information science. Here, we extend the scope of this seminal result by considering general markovian quantum evolution, where we prove that an equivalent bound holds. In addition, we use the generalized bound to demonstrate that correlations in the stationary state of a Markov process decay on a length scale set by the Lieb-Robinson velocity and the system's relaxation time.

Alder Establishment and Channel Dynamics in a Tributary of the South Fork Eel River, Mendocino County, California

Treesearch

William J. Trush; Edward C. Connor; Knight Alan W.

1989-01-01

Riparian communities established along Elder Creek, a tributary of the upper South Fork Eel River, are bounded by two frequencies of periodic flooding. The upper limit for the riparian zone occurs at bankfull stage. The lower riparian limit is associated with a more frequent stage height, called the active channel, having an exceedance probability of 11 percent on a...

Variational bounds on the temperature distribution

NASA Astrophysics Data System (ADS)

Kalikstein, Kalman; Spruch, Larry; Baider, Alberto

1984-02-01

Upper and lower stationary or variational bounds are obtained for functions which satisfy parabolic linear differential equations. (The error in the bound, that is, the difference between the bound on the function and the function itself, is of second order in the error in the input function, and the error is of known sign.) The method is applicable to a range of functions associated with equalization processes, including heat conduction, mass diffusion, electric conduction, fluid friction, the slowing down of neutrons, and certain limiting forms of the random walk problem, under conditions which are not unduly restrictive: in heat conduction, for example, we do not allow the thermal coefficients or the boundary conditions to depend upon the temperature, but the thermal coefficients can be functions of space and time and the geometry is unrestricted. The variational bounds follow from a maximum principle obeyed by the solutions of these equations.

Long-distance measurement-device-independent quantum key distribution with coherent-state superpositions.

PubMed

Yin, H-L; Cao, W-F; Fu, Y; Tang, Y-L; Liu, Y; Chen, T-Y; Chen, Z-B

2014-09-15

Measurement-device-independent quantum key distribution (MDI-QKD) with decoy-state method is believed to be securely applied to defeat various hacking attacks in practical quantum key distribution systems. Recently, the coherent-state superpositions (CSS) have emerged as an alternative to single-photon qubits for quantum information processing and metrology. Here, in this Letter, CSS are exploited as the source in MDI-QKD. We present an analytical method that gives two tight formulas to estimate the lower bound of yield and the upper bound of bit error rate. We exploit the standard statistical analysis and Chernoff bound to perform the parameter estimation. Chernoff bound can provide good bounds in the long-distance MDI-QKD. Our results show that with CSS, both the security transmission distance and secure key rate are significantly improved compared with those of the weak coherent states in the finite-data case.

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

Wilson, E.B. Jr.

Various methods for the calculation of lower bounds for eigenvalues are examined, including those of Weinstein, Temple, Bazley and Fox, Gay, and Miller. It is shown how all of these can be derived in a unified manner by the projection technique. The alternate forms obtained for the Gay formula show how a considerably improved method can be readily obtained. Applied to the ground state of the helium atom with a simple screened hydrogenic trial function, this new method gives a lower bound closer to the true energy than the best upper bound obtained with this form of trial function. Possiblemore » routes to further improved methods are suggested.« less

Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information.

DTIC Science & Technology

1987-08-01

of the absolute difference between the random variable and its mean.Gassmann and Ziemba 119861 provide a weaker bound that does not require...2.8284, and EX4tV) -12 EX’iX) = -42. Hence C = -2 -€t* i-4’]= I-- . 1213. £1 2 5 COMPARISONS OF BOUNDS IN IIn Gassmann and Ziemba 11986) extend an idea...solution of the foLLowing Linear program: (see Gassmann, Ziemba (1986),Theorem 1) m m m-GZ=max(XT(vi) I: z. 1=1,Z vo=x io (5.1hk i-l i=i i=1 I I where 0

Bounds on Block Error Probability for Multilevel Concatenated Codes

NASA Technical Reports Server (NTRS)

Lin, Shu; Moorthy, Hari T.; Stojanovic, Diana

1996-01-01

Maximum likelihood decoding of long block codes is not feasable due to large complexity. Some classes of codes are shown to be decomposable into multilevel concatenated codes (MLCC). For these codes, multistage decoding provides good trade-off between performance and complexity. In this paper, we derive an upper bound on the probability of block error for MLCC. We use this bound to evaluate difference in performance for different decompositions of some codes. Examples given show that a significant reduction in complexity can be achieved when increasing number of stages of decoding. Resulting performance degradation varies for different decompositions. A guideline is given for finding good m-level decompositions.

New Anomalous Lieb-Robinson Bounds in Quasiperiodic XY Chains

NASA Astrophysics Data System (ADS)

Damanik, David; Lemm, Marius; Lukic, Milivoje; Yessen, William

2014-09-01

We announce and sketch the rigorous proof of a new kind of anomalous (or sub-ballistic) Lieb-Robinson (LR) bound for an isotropic XY chain in a quasiperiodic transversal magnetic field. Instead of the usual effective light cone |x|≤v|t|, we obtain |x|≤v|t|α for some 0<α <1. We can characterize the allowed values of α exactly as those exceeding the upper transport exponent αu+ of a one-body Schrödinger operator. To our knowledge, this is the first rigorous derivation of anomalous quantum many-body transport. We also discuss anomalous LR bounds with power-law tails for a random dimer field.

Precision Measurement of the Electron's Electric Dipole Moment Using Trapped Molecular Ions

NASA Astrophysics Data System (ADS)

Cairncross, William B.; Gresh, Daniel N.; Grau, Matt; Cossel, Kevin C.; Roussy, Tanya S.; Ni, Yiqi; Zhou, Yan; Ye, Jun; Cornell, Eric A.

2017-10-01

We describe the first precision measurement of the electron's electric dipole moment (de) using trapped molecular ions, demonstrating the application of spin interrogation times over 700 ms to achieve high sensitivity and stringent rejection of systematic errors. Through electron spin resonance spectroscopy on 180Hf 19F+ in its metastable 3Δ1 electronic state, we obtain de=(0.9 ±7. 7stat±1. 7syst)×10-29 e cm , resulting in an upper bound of |de|<1.3 ×10-28 e cm (90% confidence). Our result provides independent confirmation of the current upper bound of |de|<9.4 ×10-29 e cm [J. Baron et al., New J. Phys. 19, 073029 (2017), 10.1088/1367-2630/aa708e], and offers the potential to improve on this limit in the near future.

Limit cycles via higher order perturbations for some piecewise differential systems

NASA Astrophysics Data System (ADS)

Buzzi, Claudio A.; Lima, Maurício Firmino Silva; Torregrosa, Joan

2018-05-01

A classical perturbation problem is the polynomial perturbation of the harmonic oscillator, (x‧ ,y‧) =(- y + εf(x , y , ε) , x + εg(x , y , ε)) . In this paper we study the limit cycles that bifurcate from the period annulus via piecewise polynomial perturbations in two zones separated by a straight line. We prove that, for polynomial perturbations of degree n , no more than Nn - 1 limit cycles appear up to a study of order N. We also show that this upper bound is reached for orders one and two. Moreover, we study this problem in some classes of piecewise Liénard differential systems providing better upper bounds for higher order perturbation in ε, showing also when they are reached. The Poincaré-Pontryagin-Melnikov theory is the main technique used to prove all the results.

Non-localization of eigenfunctions for Sturm-Liouville operators and applications

NASA Astrophysics Data System (ADS)

Liard, Thibault; Lissy, Pierre; Privat, Yannick

2018-02-01

In this article, we investigate a non-localization property of the eigenfunctions of Sturm-Liouville operators Aa = -∂xx + a (ṡ) Id with Dirichlet boundary conditions, where a (ṡ) runs over the bounded nonnegative potential functions on the interval (0 , L) with L > 0. More precisely, we address the extremal spectral problem of minimizing the L2-norm of a function e (ṡ) on a measurable subset ω of (0 , L), where e (ṡ) runs over all eigenfunctions of Aa, at the same time with respect to all subsets ω having a prescribed measure and all L∞ potential functions a (ṡ) having a prescribed essentially upper bound. We provide some existence and qualitative properties of the minimizers, as well as precise lower and upper estimates on the optimal value. Several consequences in control and stabilization theory are then highlighted.

Fisher information of a single qubit interacts with a spin-qubit in the presence of a magnetic field

NASA Astrophysics Data System (ADS)

Metwally, N.

2018-06-01

In this contribution, quantum Fisher information is utilized to estimate the parameters of a central qubit interacting with a single-spin qubit. The effect of the longitudinal, transverse and the rotating strengths of the magnetic field on the estimation degree is discussed. It is shown that, in the resonance case, the number of peaks and consequently the size of the estimation regions increase as the rotating magnetic field strength increases. The precision estimation of the central qubit parameters depends on the initial state settings of the central and the spin-qubit, either encode classical or quantum information. It is displayed that, the upper bounds of the estimation degree are large if the two qubits encode classical information. In the non-resonance case, the estimation degree depends on which of the longitudinal/transverse strength is larger. The coupling constant between the central qubit and the spin-qubit has a different effect on the estimation degree of the weight and the phase parameters, where the possibility of estimating the weight parameter decreases as the coupling constant increases, while it increases for the phase parameter. For large number of spin-particles, namely, we have a spin-bath particles, the upper bounds of the Fisher information with respect to the weight parameter of the central qubit decreases as the number of the spin particle increases. As the interaction time increases, the upper bounds appear at different initial values of the weight parameter.

Simplest little Higgs model revisited: Hidden mass relation, unitarity, and naturalness

NASA Astrophysics Data System (ADS)

Cheung, Kingman; He, Shi-Ping; Mao, Ying-nan; Zhang, Chen; Zhou, Yang

2018-06-01

We analyze the scalar potential of the simplest little Higgs (SLH) model in an approach consistent with the spirit of continuum effective field theory (CEFT). By requiring correct electroweak symmetry breaking (EWSB) with the 125 GeV Higgs boson, we are able to derive a relation between the pseudoaxion mass mη and the heavy top mass mT, which serves as a crucial test of the SLH mechanism. By requiring mη2>0 an upper bound on mT can be obtained for any fixed SLH global symmetry breaking scale f . We also point out that an absolute upper bound on f can be obtained by imposing partial wave unitarity constraint, which in turn leads to absolute upper bounds of mT≲19 TeV , mη≲1.5 TeV , and mZ'≲48 TeV . We present the allowed region in the three-dimensional parameter space characterized by f ,tβ,mT, taking into account the requirement of valid EWSB and the constraint from perturbative unitarity. We also propose a strategy of analyzing the fine-tuning problem consistent with the spirit of CEFT and apply it to the SLH. We suggest that the scalar potential and fine-tuning analysis strategies adopted here should also be applicable to a wide class of little Higgs and twin Higgs models, which may reveal interesting relations as crucial tests of the related EWSB mechanism and provide a new perspective on assessing their degree of fine-tuning.

Reduced conservatism in stability robustness bounds by state transformation

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.; Liang, Z.

1986-01-01

This note addresses the issue of 'conservatism' in the time domain stability robustness bounds obtained by the Liapunov approach. A state transformation is employed to improve the upper bounds on the linear time-varying perturbation of an asymptotically stable linear time-invariant system for robust stability. This improvement is due to the variance of the conservatism of the Liapunov approach with respect to the basis of the vector space in which the Liapunov function is constructed. Improved bounds are obtained, using a transformation, on elemental and vector norms of perturbations (i.e., structured perturbations) as well as on a matrix norm of perturbations (i.e., unstructured perturbations). For the case of a diagonal transformation, an algorithm is proposed to find the 'optimal' transformation. Several examples are presented to illustrate the proposed analysis.

A Multi-Armed Bandit Approach to Following a Markov Chain

DTIC Science & Technology

2017-06-01

focus on the House to Café transition (p1,4). We develop a Multi-Armed Bandit approach for efficiently following this target, where each state takes the...and longitude (each state corresponding to a physical location and a small set of activities). The searcher would then apply our approach on this...the target’s transition probability and the true probability over time. Further, we seek to provide upper bounds (i.e., worst case bounds) on the

Hard and Soft Constraints in Reliability-Based Design Optimization

NASA Technical Reports Server (NTRS)

Crespo, L.uis G.; Giesy, Daniel P.; Kenny, Sean P.

2006-01-01

This paper proposes a framework for the analysis and design optimization of models subject to parametric uncertainty where design requirements in the form of inequality constraints are present. Emphasis is given to uncertainty models prescribed by norm bounded perturbations from a nominal parameter value and by sets of componentwise bounded uncertain variables. These models, which often arise in engineering problems, allow for a sharp mathematical manipulation. Constraints can be implemented in the hard sense, i.e., constraints must be satisfied for all parameter realizations in the uncertainty model, and in the soft sense, i.e., constraints can be violated by some realizations of the uncertain parameter. In regard to hard constraints, this methodology allows (i) to determine if a hard constraint can be satisfied for a given uncertainty model and constraint structure, (ii) to generate conclusive, formally verifiable reliability assessments that allow for unprejudiced comparisons of competing design alternatives and (iii) to identify the critical combination of uncertain parameters leading to constraint violations. In regard to soft constraints, the methodology allows the designer (i) to use probabilistic uncertainty models, (ii) to calculate upper bounds to the probability of constraint violation, and (iii) to efficiently estimate failure probabilities via a hybrid method. This method integrates the upper bounds, for which closed form expressions are derived, along with conditional sampling. In addition, an l(sub infinity) formulation for the efficient manipulation of hyper-rectangular sets is also proposed.

Entropy bound of local quantum field theory with generalized uncertainty principle

NASA Astrophysics Data System (ADS)

Kim, Yong-Wan; Lee, Hyung Won; Myung, Yun Soo

2009-03-01

We study the entropy bound for local quantum field theory (LQFT) with generalized uncertainty principle. The generalized uncertainty principle provides naturally a UV cutoff to the LQFT as gravity effects. Imposing the non-gravitational collapse condition as the UV-IR relation, we find that the maximal entropy of a bosonic field is limited by the entropy bound A 3 / 4 rather than A with A the boundary area.

Ionospheric Signatures in Radio Occultation Data

NASA Technical Reports Server (NTRS)

Mannucci, Anthony J.; Ao, Chi; Iijima, Byron A.; Kursinkski, E. Robert

2012-01-01

We can extend robustly the radio occultation data record by 6 years (+60%) by developing a singlefrequency processing method for GPS/MET data. We will produce a calibrated data set with profile-byprofile data characterization to determine robust upper bounds on ionospheric bias. Part of an effort to produce a calibrated RO data set addressing other key error sources such as upper boundary initialization. Planned: AIRS-GPS water vapor cross validation (water vapor climatology and trends).

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

DOE PAGES

Munoz, F. D.; Hobbs, B. F.; Watson, J. -P.

2016-02-01

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improvesmore » upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.« less

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

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

Munoz, F. D.; Hobbs, B. F.; Watson, J. -P.

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improvesmore » upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.« less

Fluorescence photon migration techniques for the on-farm measurement of somatic cell count in fresh cow's milk

NASA Astrophysics Data System (ADS)

Khoo, Geoffrey; Kuennemeyer, Rainer; Claycomb, Rod W.

2005-04-01

Currently, the state of the art of mastitis detection in dairy cows is the laboratory-based measurement of somatic cell count (SCC), which is time consuming and expensive. Alternative, rapid, and reliable on-farm measurement methods are required for effective farm management. We have investigated whether fluorescence lifetime measurements can determine SCC in fresh, unprocessed milk. The method is based on the change in fluorescence lifetime of ethidium bromide when it binds to DNA from the somatic cells. Milk samples were obtained from a Fullwood Merlin Automated Milking System and analysed within a twenty-four hour period, over which the SCC does not change appreciably. For reference, the milk samples were also sent to a testing laboratory where the SCC was determined by traditional methods. The results show that we can quantify SCC using the fluorescence photon migration method from a lower bound of 4x105 cells mL-1 to an upper bound of 1 x 107 cells mL-1. The upper bound is due to the reference method used while the cause of the lower boundary is unknown, yet.

Improving the efficiency of single and multiple teleportation protocols based on the direct use of partially entangled states

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

Fortes, Raphael; Rigolin, Gustavo, E-mail: rigolin@ifi.unicamp.br

We push the limits of the direct use of partially pure entangled states to perform quantum teleportation by presenting several protocols in many different scenarios that achieve the optimal efficiency possible. We review and put in a single formalism the three major strategies known to date that allow one to use partially entangled states for direct quantum teleportation (no distillation strategies permitted) and compare their efficiencies in real world implementations. We show how one can improve the efficiency of many direct teleportation protocols by combining these techniques. We then develop new teleportation protocols employing multipartite partially entangled states. The threemore » techniques are also used here in order to achieve the highest efficiency possible. Finally, we prove the upper bound for the optimal success rate for protocols based on partially entangled Bell states and show that some of the protocols here developed achieve such a bound. -- Highlights: •Optimal direct teleportation protocols using directly partially entangled states. •We put in a single formalism all strategies of direct teleportation. •We extend these techniques for multipartite partially entangle states. •We give upper bounds for the optimal efficiency of these protocols.« less

Performance analysis of optimal power allocation in wireless cooperative communication systems

NASA Astrophysics Data System (ADS)

Babikir Adam, Edriss E.; Samb, Doudou; Yu, Li

2013-03-01

Cooperative communication has been recently proposed in wireless communication systems for exploring the inherent spatial diversity in relay channels.The Amplify-and-Forward (AF) cooperation protocols with multiple relays have not been sufficiently investigated even if it has a low complexity in term of implementation. We consider in this work a cooperative diversity system in which a source transmits some information to a destination with the help of multiple relay nodes with AF protocols and investigate the optimality of allocating powers both at the source and the relays system by optimizing the symbol error rate (SER) performance in an efficient way. Firstly we derive a closedform SER formulation for MPSK signal using the concept of moment generating function and some statistical approximations in high signal to noise ratio (SNR) for the system under studied. We then find a tight corresponding lower bound which converges to the same limit as the theoretical upper bound and develop an optimal power allocation (OPA) technique with mean channel gains to minimize the SER. Simulation results show that our scheme outperforms the equal power allocation (EPA) scheme and is tight to the theoretical approximation based on the SER upper bound in high SNR for different number of relays.

Simulating the effect of vegetation cover on the sediment yield of mediterranean catchments using SHETRAN

NASA Astrophysics Data System (ADS)

Lukey, B. T.; Sheffield, J.; Bathurst, J. C.; Lavabre, J.; Mathys, N.; Martin, C.

1995-08-01

The sediment yield of two catchments in southern France was modelled using the newly developed sediment code of SHETRAN. A fire in August 1990 denuded the Rimbaud catchment, providing an opportunity to study the effect of vegetation cover on sediment yield by running the model for both pre-and post-fire cases. Model output is in the form of upper and lower bounds on sediment discharge, reflecting the uncertainty in the erodibility of the soil. The results are encouraging since measured sediment discharge falls largely between the predicted bounds, and simulated sediment yield is dramatically lower for the catchment before the fire which matches observation. SHETRAN is also applied to the Laval catchment, which is subject to Badlands gulley erosion. Again using the principle of generating upper and lower bounds on sediment discharge, the model is shown to be capable of predicting the bulk sediment discharge over periods of months. To simulate the effect of reforestation, the model is run with vegetation cover equivalent to a neighbouring fully forested basin. The results obtained indicate that SHETRAN provides a powerful tool for predicting the impact of environmental change and land management on sediment yield.

Existence and amplitude bounds for irrotational water waves in finite depth

NASA Astrophysics Data System (ADS)

Kogelbauer, Florian

2017-12-01

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

Entanglement polygon inequality in qubit systems

NASA Astrophysics Data System (ADS)

Qian, Xiao-Feng; Alonso, Miguel A.; Eberly, J. H.

2018-06-01

We prove a set of tight entanglement inequalities for arbitrary N-qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-class entangled states are presented to illustrate the results.

Quantum Speed Limits across the Quantum-to-Classical Transition

NASA Astrophysics Data System (ADS)

Shanahan, B.; Chenu, A.; Margolus, N.; del Campo, A.

2018-02-01

Quantum speed limits set an upper bound to the rate at which a quantum system can evolve. Adopting a phase-space approach, we explore quantum speed limits across the quantum-to-classical transition and identify equivalent bounds in the classical world. As a result, and contrary to common belief, we show that speed limits exist for both quantum and classical systems. As in the quantum domain, classical speed limits are set by a given norm of the generator of time evolution.

Bounds on the cross-correlation functions of state m-sequences

NASA Astrophysics Data System (ADS)

Woodcock, C. F.; Davies, Phillip A.; Shaar, Ahmed A.

1987-03-01

Lower and upper bounds on the peaks of the periodic Hamming cross-correlation function for state m-sequences, which are often used in frequency-hopped spread-spectrum systems, are derived. The state position mapped (SPM) sequences of the state m-sequences are described. The use of SPM sequences for OR-channel code division multiplexing is studied. The relation between the Hamming cross-correlation function and the correlation function of SPM sequence is examined. Numerical results which support the theoretical data are presented.

Hybrid Theory of Electron-Hydrogenic Systems Elastic Scattering

NASA Technical Reports Server (NTRS)

Bhatia, A. K.

2007-01-01

Accurate electron-hydrogen and electron-hydrogenic cross sections are required to interpret fusion experiments, laboratory plasma physics and properties of the solar and astrophysical plasmas. We have developed a method in which the short-range and long-range correlations can be included at the same time in the scattering equations. The phase shifts have rigorous lower bounds and the scattering lengths have rigorous upper bounds. The phase shifts in the resonance region can be used to calculate very accurately the resonance parameters.

DD-bar production and their interactions

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

Liu Yanrui; Oka, Makoto; Takizawa, Makoto

2011-05-23

We have explored the bound state problem and the scattering problem of the DD-bar pair in a meson exchange model. When considering their production in the e{sup +}e{sup -} process, we included the DD-bar rescattering effect. Although it is difficult to answer whether the S-wave DD-bar bound state exists or not from the binding energies and the phase shifts, one may get an upper limit of the binding energy from the production of the BB-bar, the bottom analog of DD-bar.

A Note on the Kirchhoff and Additive Degree-Kirchhoff Indices of Graphs

NASA Astrophysics Data System (ADS)

Yang, Yujun; Klein, Douglas J.

2015-06-01

Two resistance-distance-based graph invariants, namely, the Kirchhoff index and the additive degree-Kirchhoff index, are studied. A relation between them is established, with inequalities for the additive degree-Kirchhoff index arising via the Kirchhoff index along with minimum, maximum, and average degrees. Bounds for the Kirchhoff and additive degree-Kirchhoff indices are also determined, and extremal graphs are characterised. In addition, an upper bound for the additive degree-Kirchhoff index is established to improve a previously known result.

Magnitude error bounds for sampled-data frequency response obtained from the truncation of an infinite series, and compensator improvement program

NASA Technical Reports Server (NTRS)

Mitchell, J. R.

1972-01-01

The frequency response method of analyzing control system performance is discussed, and the difficulty of obtaining the sampled frequency response of the continuous system is considered. An upper bound magnitude error equation is obtained which yields reasonable estimates of the actual error. Finalization of the compensator improvement program is also reported, and the program was used to design compensators for Saturn 5/S1-C dry workshop and Saturn 5/S1-C Skylab.

On the boundedness and integration of non-oscillatory solutions of certain linear differential equations of second order.

PubMed

Tunç, Cemil; Tunç, Osman

2016-01-01

In this paper, certain system of linear homogeneous differential equations of second-order is considered. By using integral inequalities, some new criteria for bounded and [Formula: see text]-solutions, upper bounds for values of improper integrals of the solutions and their derivatives are established to the considered system. The obtained results in this paper are considered as extension to the results obtained by Kroopnick (2014) [1]. An example is given to illustrate the obtained results.

Blow-up of solutions to a quasilinear wave equation for high initial energy

NASA Astrophysics Data System (ADS)

Li, Fang; Liu, Fang

2018-05-01

This paper deals with blow-up solutions to a nonlinear hyperbolic equation with variable exponent of nonlinearities. By constructing a new control function and using energy inequalities, the authors obtain the lower bound estimate of the L2 norm of the solution. Furthermore, the concavity arguments are used to prove the nonexistence of solutions; at the same time, an estimate of the upper bound of blow-up time is also obtained. This result extends and improves those of [1,2].

Nonequilibrium localization and the interplay between disorder and interactions.

PubMed

Mascarenhas, Eduardo; Bragança, Helena; Drumond, R; Aguiar, M C O; França Santos, M

2016-05-18

We study the nonequilibrium interplay between disorder and interactions in a closed quantum system. We base our analysis on the notion of dynamical state-space localization, calculated via the Loschmidt echo. Although real-space and state-space localization are independent concepts in general, we show that both perspectives may be directly connected through a specific choice of initial states, namely, maximally localized states (ML-states). We show numerically that in the noninteracting case the average echo is found to be monotonically increasing with increasing disorder; these results are in agreement with an analytical evaluation in the single particle case in which the echo is found to be inversely proportional to the localization length. We also show that for interacting systems, the length scale under which equilibration may occur is upper bounded and such bound is smaller the greater the average echo of ML-states. When disorder and interactions, both being localization mechanisms, are simultaneously at play the echo features a non-monotonic behaviour indicating a non-trivial interplay of the two processes. This interplay induces delocalization of the dynamics which is accompanied by delocalization in real-space. This non-monotonic behaviour is also present in the effective integrability which we show by evaluating the gap statistics.

Coloring geographical threshold graphs

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

Bradonjic, Milan; Percus, Allon; Muller, Tobias

We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyzemore » the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.« less

Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results

PubMed Central

Anil Kumar, V.S.; Marathe, Madhav V.; Ravi, S.S.; Rosenkrantz, Daniel J.

2014-01-01

We consider the problem of inhibiting undesirable contagions (e.g. rumors, spread of mob behavior) in social networks. Much of the work in this context has been carried out under the 1-threshold model, where diffusion occurs when a node has just one neighbor with the contagion. We study the problem of inhibiting more complex contagions in social networks where nodes may have thresholds larger than 1. The goal is to minimize the propagation of the contagion by removing a small number of nodes (called critical nodes) from the network. We study several versions of this problem and prove that, in general, they cannot even be efficiently approximated to within any factor ρ ≥ 1, unless P = NP. We develop efficient and practical heuristics for these problems and carry out an experimental study of their performance on three well known social networks, namely epinions, wikipedia and slashdot. Our results show that these heuristics perform significantly better than five other known methods. We also establish an efficiently computable upper bound on the number of nodes to which a contagion can spread and evaluate this bound on many real and synthetic networks. PMID:25750583

Local conditions for the generalized covariant entropy bound

NASA Astrophysics Data System (ADS)

Gao, Sijie; Lemos, José P.

2005-04-01

A set of sufficient conditions for the generalized covariant entropy bound given by Strominger and Thompson is as follows: Suppose that the entropy of matter can be described by an entropy current sa. Let ka be any null vector along L and s≡-kasa. Then the generalized bound can be derived from the following conditions: (i) s'≤2πTabkakb, where s'=ka∇as and Tab is the stress-energy tensor; (ii) on the initial 2-surface B, s(0)≤-1/4θ(0), where θ is the expansion of ka. We prove that condition (ii) alone can be used to divide a spacetime into two regions: The generalized entropy bound holds for all light sheets residing in the region where s<-1/4θ and fails for those in the region where s>-1/4θ. We check the validity of these conditions in FRW flat universe and a scalar field spacetime. Some apparent violations of the entropy bounds in the two spacetimes are discussed. These holographic bounds are important in the formulation of the holographic principle.

Astrophysical applications of the post-Tolman-Oppenheimer-Volkoff formalism

NASA Astrophysics Data System (ADS)

Glampedakis, Kostas; Pappas, George; Silva, Hector O.; Berti, Emanuele

2016-08-01

The bulk properties of spherically symmetric stars in general relativity can be obtained by integrating the Tolman-Oppenheimer-Volkoff (TOV) equations. In previous work [K. Glampedakis, G. Pappas, H. O. Silva, and E. Berti, Phys. Rev. D 92, 024056 (2015)], we developed a "post-TOV" formalism—inspired by parametrized post-Newtonian theory—which allows us to classify in a parametrized, phenomenological form all possible perturbative deviations from the structure of compact stars in general relativity that may be induced by modified gravity at second post-Newtonian order. In this paper we extend the formalism to deal with the stellar exterior, and we compute several potential astrophysical observables within the post-TOV formalism: the surface redshift zs, the apparent radius Rapp, the Eddington luminosity at infinity LE∞ and the orbital frequencies. We show that, at leading order, all of these quantities depend on just two post-TOV parameters μ1 and χ , and we discuss the possibility to measure (or set upper bounds on) these parameters.

Support Vector Machine algorithm for regression and classification

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

Yu, Chenggang; Zavaljevski, Nela

2001-08-01

The software is an implementation of the Support Vector Machine (SVM) algorithm that was invented and developed by Vladimir Vapnik and his co-workers at AT&T Bell Laboratories. The specific implementation reported here is an Active Set method for solving a quadratic optimization problem that forms the major part of any SVM program. The implementation is tuned to specific constraints generated in the SVM learning. Thus, it is more efficient than general-purpose quadratic optimization programs. A decomposition method has been implemented in the software that enables processing large data sets. The size of the learning data is virtually unlimited by themore » capacity of the computer physical memory. The software is flexible and extensible. Two upper bounds are implemented to regulate the SVM learning for classification, which allow users to adjust the false positive and false negative rates. The software can be used either as a standalone, general-purpose SVM regression or classification program, or be embedded into a larger software system.« less

Vertical structure of tropospheric winds on gas giants

NASA Astrophysics Data System (ADS)

Scott, R. K.; Dunkerton, T. J.

2017-04-01

Zonal mean zonal velocity profiles from cloud-tracking observations on Jupiter and Saturn are used to infer latitudinal variations of potential temperature consistent with a shear stable potential vorticity distribution. Immediately below the cloud tops, density stratification is weaker on the poleward and stronger on the equatorward flanks of midlatitude jets, while at greater depth the opposite relation holds. Thermal wind balance then yields the associated vertical shears of midlatitude jets in an altitude range bounded above by the cloud tops and bounded below by the level where the latitudinal gradient of static stability changes sign. The inferred vertical shear below the cloud tops is consistent with existing thermal profiling of the upper troposphere. The sense of the associated mean meridional circulation in the upper troposphere is discussed, and expected magnitudes are given based on existing estimates of the radiative timescale on each planet.

Gravitating Q-balls in the Affleck-Dine mechanism

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

Tamaki, Takashi; Sakai, Nobuyuki; Department of Education, Yamagata University, Yamagata 990-8560

2011-04-15

We investigate how gravity affects ''Q-balls'' with the Affleck-Dine potential V{sub AD}({phi}):=(m{sup 2}/2){phi}{sup 2} [1+Kln(({phi}/M)){sup 2}]. Contrary to the flat case, in which equilibrium solutions exist only if K<0, we find three types of gravitating solutions as follows. In the case that K<0, ordinary Q-ball solutions exist; there is an upper bound of the charge due to gravity. In the case that K=0, equilibrium solutions called (mini-)boson stars appear due to gravity; there is an upper bound of the charge, too. In the case that K>0, equilibrium solutions appear, too. In this case, these solutions are not asymptotically flat butmore » surrounded by Q-matter. These solutions might be important in considering a dark matter scenario in the Affleck-Dine mechanism.« less

Precision Measurement of the Electron's Electric Dipole Moment Using Trapped Molecular Ions.

PubMed

Cairncross, William B; Gresh, Daniel N; Grau, Matt; Cossel, Kevin C; Roussy, Tanya S; Ni, Yiqi; Zhou, Yan; Ye, Jun; Cornell, Eric A

2017-10-13

We describe the first precision measurement of the electron's electric dipole moment (d_{e}) using trapped molecular ions, demonstrating the application of spin interrogation times over 700 ms to achieve high sensitivity and stringent rejection of systematic errors. Through electron spin resonance spectroscopy on ^{180}Hf^{19}F^{+} in its metastable ^{3}Δ_{1} electronic state, we obtain d_{e}=(0.9±7.7_{stat}±1.7_{syst})×10^{-29}  e cm, resulting in an upper bound of |d_{e}|<1.3×10^{-28}  e cm (90% confidence). Our result provides independent confirmation of the current upper bound of |d_{e}|<9.4×10^{-29}  e cm [J. Baron et al., New J. Phys. 19, 073029 (2017)NJOPFM1367-263010.1088/1367-2630/aa708e], and offers the potential to improve on this limit in the near future.

Insights into the Earth System mass variability from CSR-RL05 GRACE gravity fields

NASA Astrophysics Data System (ADS)

Bettadpur, S.

2012-04-01

The next-generation Release-05 GRACE gravity field data products are the result of extensive effort applied to the improvements to the GRACE Level-1 (tracking) data products, and to improvements in the background gravity models and processing methodology. As a result, the squared-error upper-bound in RL05 fields is half or less than the squared-error upper-bound in RL04 fields. The CSR-RL05 field release consists of unconstrained gravity fields as well as a regularized gravity field time-series that can be used for several applications without any post-processing error reduction. This paper will describe the background and the nature of these improvements in the data products, and provide an error characterization. We will describe the insights these new series offer in measuring the mass flux due to diverse Hydrologic, Oceanographic and Cryospheric processes.

Potential-field sounding using Euler's homogeneity equation and Zidarov bubbling

USGS Publications Warehouse

Cordell, Lindrith

1994-01-01

Potential-field (gravity) data are transformed into a physical-property (density) distribution in a lower half-space, constrained solely by assumed upper bounds on physical-property contrast and data error. A two-step process is involved. The data are first transformed to an equivalent set of line (2-D case) or point (3-D case) sources, using Euler's homogeneity equation evaluated iteratively on the largest residual data value. Then, mass is converted to a volume-density product, constrained to an upper density bound, by 'bubbling,' which exploits circular or radial expansion to redistribute density without changing the associated gravity field. The method can be developed for gravity or magnetic data in two or three dimensions. The results can provide a beginning for interpretation of potential-field data where few independent constraints exist, or more likely, can be used to develop models and confirm or extend interpretation of other geophysical data sets.

Search for violations of quantum mechanics

DOE PAGES

Ellis, John; Hagelin, John S.; Nanopoulos, D. V.; ...

1984-07-01

The treatment of quantum effects in gravitational fields indicates that pure states may evolve into mixed states, and Hawking has proposed modification of the axioms of field theory which incorporate the corresponding violation of quantum mechanics. In this study we propose a modified hamiltonian equation of motion for density matrices and use it to interpret upper bounds on the violation of quantum mechanics in different phenomenological situations. We apply our formalism to the K 0-K 0 system and to long baseline neutron interferometry experiments. In both cases we find upper bounds of about 2 × 10 -21 GeV on contributionsmore » to the single particle “hamiltonian” which violate quantum mechanical coherence. We discuss how these limits might be improved in the future, and consider the relative significance of other successful tests of quantum mechanics. Finally, an appendix contains model estimates of the magnitude of effects violating quantum mechanics.« less

DD production and their interactions

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

Liu Yanrui; Oka, Makoto; Takizawa, Makoto

2010-07-01

S- and P-wave DD scatterings are studied in a meson exchange model with the coupling constants obtained in the heavy quark effective theory. With the extracted P-wave phase shifts and the separable potential approximation, we include the DD rescattering effect and investigate the production process e{sup +}e{sup -{yields}}DD. We find that it is difficult to explain the anomalous line shape observed by the BES Collaboration with this mechanism. Combining our model calculation and the experimental measurement, we estimate the upper limit of the nearly universal cutoff parameter to be around 2 GeV. With this number, the upper limits of themore » binding energies of the S-wave DD and BB bound states are obtained. Assuming that the S-wave and P-wave interactions rely on the same cutoff, our study provides a way of extracting the information about S-wave molecular bound states from the P-wave meson pair production.« less

An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.

PubMed

Zhang, Yushan; Hu, Guiwu

2015-01-01

Although there have been many studies on the runtime of evolutionary algorithms in discrete optimization, relatively few theoretical results have been proposed on continuous optimization, such as evolutionary programming (EP). This paper proposes an analysis of the runtime of two EP algorithms based on Gaussian and Cauchy mutations, using an absorbing Markov chain. Given a constant variation, we calculate the runtime upper bound of special Gaussian mutation EP and Cauchy mutation EP. Our analysis reveals that the upper bounds are impacted by individual number, problem dimension number n, searching range, and the Lebesgue measure of the optimal neighborhood. Furthermore, we provide conditions whereby the average runtime of the considered EP can be no more than a polynomial of n. The condition is that the Lebesgue measure of the optimal neighborhood is larger than a combinatorial calculation of an exponential and the given polynomial of n.

Universal charge-radius relation for subatomic and astrophysical compact objects.

PubMed

Madsen, Jes

2008-04-18

Electron-positron pair creation in supercritical electric fields limits the net charge of any static, spherical object, such as superheavy nuclei, strangelets, and Q balls, or compact stars like neutron stars, quark stars, and black holes. For radii between 4 x 10(2) and 10(4) fm the upper bound on the net charge is given by the universal relation Z=0.71R(fm), and for larger radii (measured in femtometers or kilometers) Z=7 x 10(-5)R_(2)(fm)=7 x 10(31)R_(2)(km). For objects with nuclear density the relation corresponds to Z approximately 0.7A(1/3)( (10(8)10(12)), where A is the baryon number. For some systems this universal upper bound improves existing charge limits in the literature.

Crustal volumes of the continents and of oceanic and continental submarine plateaus

NASA Technical Reports Server (NTRS)

Schubert, G.; Sandwell, D.

1989-01-01

Using global topographic data and the assumption of Airy isostasy, it is estimated that the crustal volume of the continents is 7182 X 10 to the 6th cu km. The crustal volumes of the oceanic and continental submarine plateaus are calculated at 369 X 10 to the 6th cu km and 242 X 10 to the 6th cu km, respectively. The total continental crustal volume is found to be 7581 X 10 to the 6th cu km, 3.2 percent of which is comprised of continental submarine plateaus on the seafloor. An upper bound on the contintental crust addition rate by the accretion of oceanic plateaus is set at 3.7 cu km/yr. Subduction of continental submarine plateaus with the oceanic lithosphere on a 100 Myr time scale yields an upper bound to the continental crustal subtraction rate of 2.4 cu km/yr.

Comparison of various techniques for calibration of AIS data

NASA Technical Reports Server (NTRS)

Roberts, D. A.; Yamaguchi, Y.; Lyon, R. J. P.

1986-01-01

The Airborne Imaging Spectrometer (AIS) samples a region which is strongly influenced by decreasing solar irradiance at longer wavelengths and strong atmospheric absorptions. Four techniques, the Log Residual, the Least Upper Bound Residual, the Flat Field Correction and calibration using field reflectance measurements were investigated as a means for removing these two features. Of the four techniques field reflectance calibration proved to be superior in terms of noise and normalization. Of the other three techniques, the Log Residual was superior when applied to areas which did not contain one dominant cover type. In heavily vegetated areas, the Log Residual proved to be ineffective. After removing anomalously bright data values, the Least Upper Bound Residual proved to be almost as effective as the Log Residual in sparsely vegetated areas and much more effective in heavily vegetated areas. Of all the techniques, the Flat Field Correction was the noisest.

Isotope-abundance variations and atomic weights of selected elements: 2016 (IUPAC Technical Report)

USGS Publications Warehouse

Coplen, Tyler B.; Shrestha, Yesha

2016-01-01

There are 63 chemical elements that have two or more isotopes that are used to determine their standard atomic weights. The isotopic abundances and atomic weights of these elements can vary in normal materials due to physical and chemical fractionation processes (not due to radioactive decay). These variations are well known for 12 elements (hydrogen, lithium, boron, carbon, nitrogen, oxygen, magnesium, silicon, sulfur, chlorine, bromine, and thallium), and the standard atomic weight of each of these elements is given by IUPAC as an interval with lower and upper bounds. Graphical plots of selected materials and compounds of each of these elements have been published previously. Herein and at the URL http://dx.doi.org/10.5066/F7GF0RN2, we provide isotopic abundances, isotope-delta values, and atomic weights for each of the upper and lower bounds of these materials and compounds.

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

PubMed

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. © 2014 Society for Risk Analysis.

Fault-tolerant clock synchronization validation methodology. [in computer systems

NASA Technical Reports Server (NTRS)

Butler, Ricky W.; Palumbo, Daniel L.; Johnson, Sally C.

1987-01-01

A validation method for the synchronization subsystem of a fault-tolerant computer system is presented. The high reliability requirement of flight-crucial systems precludes the use of most traditional validation methods. The method presented utilizes formal design proof to uncover design and coding errors and experimentation to validate the assumptions of the design proof. The experimental method is described and illustrated by validating the clock synchronization system of the Software Implemented Fault Tolerance computer. The design proof of the algorithm includes a theorem that defines the maximum skew between any two nonfaulty clocks in the system in terms of specific system parameters. Most of these parameters are deterministic. One crucial parameter is the upper bound on the clock read error, which is stochastic. The probability that this upper bound is exceeded is calculated from data obtained by the measurement of system parameters. This probability is then included in a detailed reliability analysis of the system.

Achieving unequal error protection with convolutional codes

NASA Technical Reports Server (NTRS)

Mills, D. G.; Costello, D. J., Jr.; Palazzo, R., Jr.

1994-01-01

This paper examines the unequal error protection capabilities of convolutional codes. Both time-invariant and periodically time-varying convolutional encoders are examined. The effective free distance vector is defined and is shown to be useful in determining the unequal error protection (UEP) capabilities of convolutional codes. A modified transfer function is used to determine an upper bound on the bit error probabilities for individual input bit positions in a convolutional encoder. The bound is heavily dependent on the individual effective free distance of the input bit position. A bound relating two individual effective free distances is presented. The bound is a useful tool in determining the maximum possible disparity in individual effective free distances of encoders of specified rate and memory distribution. The unequal error protection capabilities of convolutional encoders of several rates and memory distributions are determined and discussed.

On the Inequalities of Babu\\vska-Aziz, Friedrichs and Horgan-Payne

NASA Astrophysics Data System (ADS)

Costabel, Martin; Dauge, Monique

2015-09-01

The equivalence between the inequalities of Babu\\vska-Aziz and Friedrichs for sufficiently smooth bounded domains in the plane was shown by Horgan and Payne 30 years ago. We prove that this equivalence, and the equality between the associated constants, is true without any regularity condition on the domain. For the Horgan-Payne inequality, which is an upper bound of the Friedrichs constant for plane star-shaped domains in terms of a geometric quantity known as the Horgan-Payne angle, we show that it is true for some classes of domains, but not for all bounded star-shaped domains. We prove a weaker inequality that is true in all cases.

Wave height estimates from pressure and velocity data at an intermediate depth in the presence of uniform currents

NASA Astrophysics Data System (ADS)

Basu, Biswajit

2017-12-01

Bounds on estimates of wave heights (valid for large amplitudes) from pressure and flow measurements at an arbitrary intermediate depth have been provided. Two-dimensional irrotational steady water waves over a flat bed with a finite depth in the presence of underlying uniform currents have been considered in the analysis. Five different upper bounds based on a combination of pressure and velocity field measurements have been derived, though there is only one available lower bound on the wave height in the case of the speed of current greater than or less than the wave speed. This article is part of the theme issue 'Nonlinear water waves'.

A communication channel model of the software process

NASA Technical Reports Server (NTRS)

Tausworthe, R. C.

1988-01-01

Reported here is beginning research into a noisy communication channel analogy of software development process productivity, in order to establish quantifiable behavior and theoretical bounds. The analogy leads to a fundamental mathematical relationship between human productivity and the amount of information supplied by the developers, the capacity of the human channel for processing and transmitting information, the software product yield (object size), the work effort, requirements efficiency, tool and process efficiency, and programming environment advantage. Also derived is an upper bound to productivity that shows that software reuse is the only means than can lead to unbounded productivity growth; practical considerations of size and cost of reusable components may reduce this to a finite bound.

A communication channel model of the software process

NASA Technical Reports Server (NTRS)

Tausworthe, Robert C.

1988-01-01

Beginning research into a noisy communication channel analogy of software development process productivity, in order to establish quantifiable behavior and theoretical bounds is discussed. The analogy leads to a fundamental mathematical relationship between human productivity and the amount of information supplied by the developers, the capacity of the human channel for processing and transmitting information, the software product yield (object size) the work effort, requirements efficiency, tool and process efficiency, and programming environment advantage. An upper bound to productivity is derived that shows that software reuse is the only means that can lead to unbounded productivity growth; practical considerations of size and cost of reusable components may reduce this to a finite bound.

A passivity criterion for sampled-data bilateral teleoperation systems.

PubMed

Jazayeri, Ali; Tavakoli, Mahdi

2013-01-01

A teleoperation system consists of a teleoperator, a human operator, and a remote environment. Conditions involving system and controller parameters that ensure the teleoperator passivity can serve as control design guidelines to attain maximum teleoperation transparency while maintaining system stability. In this paper, sufficient conditions for teleoperator passivity are derived for when position error-based controllers are implemented in discrete-time. This new analysis is necessary because discretization causes energy leaks and does not necessarily preserve the passivity of the system. The proposed criterion for sampled-data teleoperator passivity imposes lower bounds on the teleoperator's robots dampings, an upper bound on the sampling time, and bounds on the control gains. The criterion is verified through simulations and experiments.

Reliability Estimating Procedures for Electric and Thermochemical Propulsion Systems. Volume 1

DTIC Science & Technology

1977-02-01

Laboratories, The Marquardt Company, NASA Goddard Space Flight Center, RCA Astro Elec- tronics, Rockwell International, Applied Physics Laboratory...E fX ) 2.3 Failure Rate Means and Bounds 5% Lower Bound Median Mean 95% Upper Bound A.05 X.05 . AIA. 9 5 0.00025 0.0024 0.06 0.022 x10- 6 per cycle, 1...Iq IIt. Xg4 4l Wl ~ 4𔃺 L Q ൘ I1-269 I- I J N1- 74-i Liu I- (~J~~~jto 1-27 r4J > U 0 1-271 T 27 fX ~𔃽 0L 1-273 -- va VAv( 13 1-272 %J% ~ii 000 41

Endoreversible quantum heat engines in the linear response regime.

PubMed

Wang, Honghui; He, Jizhou; Wang, Jianhui

2017-07-01

We analyze general models of quantum heat engines operating a cycle of two adiabatic and two isothermal processes. We use the quantum master equation for a system to describe heat transfer current during a thermodynamic process in contact with a heat reservoir, with no use of phenomenological thermal conduction. We apply the endoreversibility description to such engine models working in the linear response regime and derive expressions of the efficiency and the power. By analyzing the entropy production rate along a single cycle, we identify the thermodynamic flux and force that a linear relation connects. From maximizing the power output, we find that such heat engines satisfy the tight-coupling condition and the efficiency at maximum power agrees with the Curzon-Ahlborn efficiency known as the upper bound in the linear response regime.

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games

NASA Astrophysics Data System (ADS)

de Keijzer, Bart; Schäfer, Guido; Telelis, Orestis A.

We study the inefficiency of equilibrium outcomes in bottleneck congestion games. These games model situations in which strategic players compete for a limited number of facilities. Each player allocates his weight to a (feasible) subset of the facilities with the goal to minimize the maximum (weight-dependent) latency that he experiences on any of these facilities. We derive upper and (asymptotically) matching lower bounds on the (strong) price of anarchy of linear bottleneck congestion games for a natural load balancing social cost objective (i.e., minimize the maximum latency of a facility). We restrict our studies to linear latency functions. Linear bottleneck congestion games still constitute a rich class of games and generalize, for example, load balancing games with identical or uniformly related machines with or without restricted assignments.

Transmit Designs for the MIMO Broadcast Channel With Statistical CSI

NASA Astrophysics Data System (ADS)

Wu, Yongpeng; Jin, Shi; Gao, Xiqi; McKay, Matthew R.; Xiao, Chengshan

2014-09-01

We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a near-optimal linear assignment matrix is derived. This reveals an interesting construction analogous to that of dirty-paper coding. In light of this, a low complexity transmission scheme is provided. Numerical examples illustrate the significant performance of the proposed low complexity scheme.

A critical examination of the validity of simplified models for radiant heat transfer analysis.

NASA Technical Reports Server (NTRS)

Toor, J. S.; Viskanta, R.

1972-01-01

Examination of the directional effects of the simplified models by comparing the experimental data with the predictions based on simple and more detailed models for the radiation characteristics of surfaces. Analytical results indicate that the constant property diffuse and specular models do not yield the upper and lower bounds on local radiant heat flux. In general, the constant property specular analysis yields higher values of irradiation than the constant property diffuse analysis. A diffuse surface in the enclosure appears to destroy the effect of specularity of the other surfaces. Semigray and gray analyses predict the irradiation reasonably well provided that the directional properties and the specularity of the surfaces are taken into account. The uniform and nonuniform radiosity diffuse models are in satisfactory agreement with each other.

Time Operator in Relativistic Quantum Mechanics

NASA Astrophysics Data System (ADS)

Khorasani, Sina

2017-07-01

It is first shown that the Dirac’s equation in a relativistic frame could be modified to allow discrete time, in agreement to a recently published upper bound. Next, an exact self-adjoint 4 × 4 relativistic time operator for spin-1/2 particles is found and the time eigenstates for the non-relativistic case are obtained and discussed. Results confirm the quantum mechanical speculation that particles can indeed occupy negative energy levels with vanishingly small but non-zero probablity, contrary to the general expectation from classical physics. Hence, Wolfgang Pauli’s objection regarding the existence of a self-adjoint time operator is fully resolved. It is shown that using the time operator, a bosonic field referred here to as energons may be created, whose number state representations in non-relativistic momentum space can be explicitly found.

Stability of a Unitary Bose Gas

NASA Astrophysics Data System (ADS)

Fletcher, Richard J.; Gaunt, Alexander L.; Navon, Nir; Smith, Robert P.; Hadzibabic, Zoran

2013-09-01

We study the stability of a thermal K39 Bose gas across a broad Feshbach resonance, focusing on the unitary regime, where the scattering length a exceeds the thermal wavelength λ. We measure the general scaling laws relating the particle-loss and heating rates to the temperature, scattering length, and atom number. Both at unitarity and for positive a≪λ we find agreement with three-body theory. However, for a<0 and away from unitarity, we observe significant four-body decay. At unitarity, the three-body loss coefficient, L3∝λ4, is 3 times lower than the universal theoretical upper bound. This reduction is a consequence of species-specific Efimov physics and makes K39 particularly promising for studies of many-body physics in a unitary Bose gas.

A polyhedral study of production ramping

DOE PAGES

Damci-Kurt, Pelin; Kucukyavuz, Simge; Rajan, Deepak; ...

2015-06-12

Here, we give strong formulations of ramping constraints—used to model the maximum change in production level for a generator or machine from one time period to the next—and production limits. For the two-period case, we give a complete description of the convex hull of the feasible solutions. The two-period inequalities can be readily used to strengthen ramping formulations without the need for separation. For the general case, we define exponential classes of multi-period variable upper bound and multi-period ramping inequalities, and give conditions under which these inequalities define facets of ramping polyhedra. Finally, we present exact polynomial separation algorithms formore » the inequalities and report computational experiments on using them in a branch-and-cut algorithm to solve unit commitment problems in power generation.« less

Umklapp scattering as the origin of T -linear resistivity in the normal state of high- T c cuprate superconductors

DOE PAGES

Rice, T. Maurice; Robinson, Neil J.; Tsvelik, Alexei M.

2017-12-11

Here, the high-temperature normal state of the unconventional cuprate superconductors has resistivity linear in temperature T, which persists to values well beyond the Mott-Ioffe-Regel upper bound. At low temperatures, within the pseudogap phase, the resistivity is instead quadratic in T, as would be expected from Fermi liquid theory. Developing an understanding of these normal phases of the cuprates is crucial to explain the unconventional superconductivity. We present a simple explanation for this behavior, in terms of the umklapp scattering of electrons. This fits within the general picture emerging from functional renormalization group calculations that spurred the Yang-Rice-Zhang ansatz: Umklapp scatteringmore » is at the heart of the behavior in the normal phase.« less

Performance of convolutionally encoded noncoherent MFSK modem in fading channels

NASA Technical Reports Server (NTRS)

Modestino, J. W.; Mui, S. Y.

1976-01-01

The performance of a convolutionally encoded noncoherent multiple-frequency shift-keyed (MFSK) modem utilizing Viterbi maximum-likelihood decoding and operating on a fading channel is described. Both the lognormal and classical Rician fading channels are considered for both slow and time-varying channel conditions. Primary interest is in the resulting bit error rate as a function of the ratio between the energy per transmitted information bit and noise spectral density, parameterized by both the fading channel and code parameters. Fairly general upper bounds on bit error probability are provided and compared with simulation results in the two extremes of zero and infinite channel memory. The efficacy of simple block interleaving in combatting channel memory effects are thoroughly explored. Both quantized and unquantized receiver outputs are considered.

Swarming behaviors in multi-agent systems with nonlinear dynamics

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

Yu, Wenwu, E-mail: wenwuyu@gmail.com; School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001; Chen, Guanrong

2013-12-15

The dynamic analysis of a continuous-time multi-agent swarm model with nonlinear profiles is investigated in this paper. It is shown that, under mild conditions, all agents in a swarm can reach cohesion within a finite time, where the upper bounds of the cohesion are derived in terms of the parameters of the swarm model. The results are then generalized by considering stochastic noise and switching between nonlinear profiles. Furthermore, swarm models with limited sensing range inducing changing communication topologies and unbounded repulsive interactions between agents are studied by switching system and nonsmooth analysis. Here, the sensing range of each agentmore » is limited and the possibility of collision among nearby agents is high. Finally, simulation results are presented to demonstrate the validity of the theoretical analysis.« less

Structure of the Tucson Basin, Arizona from gravity and aeromagnetic data

USGS Publications Warehouse

Rystrom, Victoria Louise

2003-01-01

Interpretation of gravity and high-resolution aeromagnetic data reveal the three-dimensional geometry of the Tuscson Basin, Arizona and the lithology of its basement. Limited drill hole and seismic data indicate that the maximum depth to the crystalline basement is approximately 3600 meters and that the sedimentary sequences in the upper ~2000 m of the basin were deposited during the most recent extensional episode that commenced about 13 Ma. The negative density contrasts between these upper Neogene and Quaternary sedimentary sequences and the adjacent country rock produce a Bouguer residual gravity low, whose steep gradients clearly define the lateral extent of the upper ~2000m of the basin. The aeromagnetic maps show large positive anomalies associated with deeply buried, late Cretaceous-early Tertiary and mid-Tertiary igneous rocks at and below the surface of the basin. These magnetic anomalies provide insight into the older (>13 Ma) and deeper structures of the basin. Simultaneous 2.5-dimensional modeling of both gravity and magnetic anomalies constrained by geologic and seismic data delineates the thickness of the basin and the dips of the buried faults that bound the basin. This geologic-based forward modeling approach to using geophysical data is shown to result in more information about the geologic and tectonic history of the basin as well as more accurate depth to basement determinations than using generalized geophysical inversion techniques.

Spume Drops: Their Potential Role in Air-Sea Gas Exchange

NASA Astrophysics Data System (ADS)

Monahan, Edward C.; Staniec, Allison; Vlahos, Penny

2017-12-01

After summarizing the time scales defining the change of the physical properties of spume and other droplets cast up from the sea surface, the time scales governing drop-atmosphere gas exchange are compared. Following a broad review of the spume drop production functions described in the literature, a subset of these functions is selected via objective criteria, to represent typical, upper bound, and lower bound production functions. Three complementary mechanisms driving spume-atmosphere gas exchange are described, and one is then used to estimate the relative importance, over a broad range of wind speeds, of this spume drop mechanism compared to the conventional, diffusional, sea surface mechanism in air-sea gas exchange. While remaining uncertainties in the wind dependence of the spume drop production flux, and in the immediate sea surface gas flux, preclude a definitive conclusion, the findings of this study strongly suggest that, at high wind speeds (>20 m s-1 for dimethyl sulfide and >30 m s-1 for gases such a carbon dioxide), spume drops do make a significant contribution to air-sea gas exchange.