Chance-Constrained Guidance With Non-Convex Constraints

NASA Technical Reports Server (NTRS)

Ono, Masahiro

2011-01-01

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

A Generalization of the Simultaneous Diagonalization of Hermitian Matrices and its Relation to Quantum Estimation Theory

NASA Astrophysics Data System (ADS)

Nagaoka, Hiroshi

We study the problem of minimizing a quadratic quantity defined for given two Hermitian matrices X, Y and a positive-definite Hermitian matrix. This problem is reduced to the simultaneous diagonalization of X, Y when XY = YX. We derive a lower bound for the quantity, and in some special cases solve the problem by showing that the lower bound is achievable. This problem is closely related to a simultaneous measurement of quantum mechanical observables which are not commuting and has an application in the theory of quantum state estimation.

Floquet resonant states and validity of the Floquet-Magnus expansion in the periodically driven Friedrichs models

NASA Astrophysics Data System (ADS)

Mori, Takashi

2015-02-01

The Floquet eigenvalue problem is analyzed for periodically driven Friedrichs models on discrete and continuous space. In the high-frequency regime, there exists a Floquet bound state consistent with the Floquet-Magnus expansion in the discrete Friedrichs model, while it is not the case in the continuous model. In the latter case, however, the bound state predicted by the Floquet-Magnus expansion appears as a metastable state whose lifetime diverges in the limit of large frequencies. We obtain the lifetime by evaluating the imaginary part of the quasienergy of the Floquet resonant state. In the low-frequency regime, there is no Floquet bound state and instead the Floquet resonant state with exponentially small imaginary part of the quasienergy appears, which is understood as the quantum tunneling in the energy space.

Explicit formula for the Holevo bound for two-parameter qubit-state estimation problem

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

Suzuki, Jun, E-mail: junsuzuki@uec.ac.jp

The main contribution of this paper is to derive an explicit expression for the fundamental precision bound, the Holevo bound, for estimating any two-parameter family of qubit mixed-states in terms of quantum versions of Fisher information. The obtained formula depends solely on the symmetric logarithmic derivative (SLD), the right logarithmic derivative (RLD) Fisher information, and a given weight matrix. This result immediately provides necessary and sufficient conditions for the following two important classes of quantum statistical models; the Holevo bound coincides with the SLD Cramér-Rao bound and it does with the RLD Cramér-Rao bound. One of the important results ofmore » this paper is that a general model other than these two special cases exhibits an unexpected property: the structure of the Holevo bound changes smoothly when the weight matrix varies. In particular, it always coincides with the RLD Cramér-Rao bound for a certain choice of the weight matrix. Several examples illustrate these findings.« less

Quantum state discrimination bounds for finite sample size

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

Audenaert, Koenraad M. R.; Mosonyi, Milan; Mathematical Institute, Budapest University of Technology and Economics, Egry Jozsef u 1., Budapest 1111

2012-12-15

In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of the two given and completely known states, {rho} or {sigma}. In general, it is not possible to decide the identity of the true state with certainty, and the optimal measurement strategy depends on whether the two possible errors (mistaking {rho} for {sigma}, or the other way around) are treated as of equal importance or not. Results on the quantum Chernoff and Hoeffding bounds and the quantum Stein'smore » lemma show that, if several copies of the system are available then the optimal error probabilities decay exponentially in the number of copies, and the decay rate is given by a certain statistical distance between {rho} and {sigma} (the Chernoff distance, the Hoeffding distances, and the relative entropy, respectively). While these results provide a complete solution to the asymptotic problem, they are not completely satisfying from a practical point of view. Indeed, in realistic scenarios one has access only to finitely many copies of a system, and therefore it is desirable to have bounds on the error probabilities for finite sample size. In this paper we provide finite-size bounds on the so-called Stein errors, the Chernoff errors, the Hoeffding errors, and the mixed error probabilities related to the Chernoff and the Hoeffding errors.« less

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.

Sensor selection cost optimisation for tracking structurally cyclic systems: a P-order solution

NASA Astrophysics Data System (ADS)

Doostmohammadian, M.; Zarrabi, H.; Rabiee, H. R.

2017-08-01

Measurements and sensing implementations impose certain cost in sensor networks. The sensor selection cost optimisation is the problem of minimising the sensing cost of monitoring a physical (or cyber-physical) system. Consider a given set of sensors tracking states of a dynamical system for estimation purposes. For each sensor assume different costs to measure different (realisable) states. The idea is to assign sensors to measure states such that the global cost is minimised. The number and selection of sensor measurements need to ensure the observability to track the dynamic state of the system with bounded estimation error. The main question we address is how to select the state measurements to minimise the cost while satisfying the observability conditions. Relaxing the observability condition for structurally cyclic systems, the main contribution is to propose a graph theoretic approach to solve the problem in polynomial time. Note that polynomial time algorithms are suitable for large-scale systems as their running time is upper-bounded by a polynomial expression in the size of input for the algorithm. We frame the problem as a linear sum assignment with solution complexity of ?.

Andreev bound states. Some quasiclassical reflections

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

Lin, Y., E-mail: yiriolin@illinois.edu; Leggett, A. J.

2014-12-15

We discuss a very simple and essentially exactly solvable model problem which illustrates some nice features of Andreev bound states, namely, the trapping of a single Bogoliubov quasiparticle in a neutral s-wave BCS superfluid by a wide and shallow Zeeman trap. In the quasiclassical limit, the ground state is a doublet with a splitting which is proportional to the exponentially small amplitude for “normal” reflection by the edges of the trap. We comment briefly on a prima facie paradox concerning the continuity equation and conjecture a resolution to it.

Andreev bound states. Some quasiclassical reflections

NASA Astrophysics Data System (ADS)

Lin, Y.; Leggett, A. J.

2014-12-01

We discuss a very simple and essentially exactly solvable model problem which illustrates some nice features of Andreev bound states, namely, the trapping of a single Bogoliubov quasiparticle in a neutral s-wave BCS superfluid by a wide and shallow Zeeman trap. In the quasiclassical limit, the ground state is a doublet with a splitting which is proportional to the exponentially small amplitude for "normal" reflection by the edges of the trap. We comment briefly on a prima facie paradox concerning the continuity equation and conjecture a resolution to it.

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

Finite-time H∞ control for linear continuous system with norm-bounded disturbance

NASA Astrophysics Data System (ADS)

Meng, Qingyi; Shen, Yanjun

2009-04-01

In this paper, the definition of finite-time H∞ control is presented. The system under consideration is subject to time-varying norm-bounded exogenous disturbance. The main aim of this paper is focused on the design a state feedback controller which ensures that the closed-loop system is finite-time bounded (FTB) and reduces the effect of the disturbance input on the controlled output to a prescribed level. A sufficient condition is presented for the solvability of this problem, which can be reduced to a feasibility problem involving linear matrix inequalities (LMIs). A detailed solving method is proposed for the restricted linear matrix inequalities. Finally, examples are given to show the validity of the methodology.

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

Relativistic bound-state problem in the light-front Yukawa model

NASA Astrophysics Data System (ADS)

Głazek, Stanisław; Harindranath, Avaroth; Pinsky, Stephen; Shigemitsu, Junko; Wilson, Kenneth

1993-02-01

We study the renormalization problem on the light front for the two-fermion bound state in the (3+1)-dimensional Yukawa model, working within the lowest-order Tamm-Dancoff approximation. In addition to traditional mass and wave-function renormalization, new types of counterterms are required. These are nonlocal and involve arbitrary functions of the longitudinal momenta. Their appearance is consistent with general power-counting arguments on the light front. We estimate the ``arbitrary function'' in two ways: (1) by using perturbation theory as a guide and (2) by considering the asymptotic large transverse momentum behavior of the kernel in the bound-state equations. The latter method, as it is currently implemented, is applicable only to the helicity-zero sector of the theory. Because of triviality, in the Yukawa model one must retain a finite cutoff Λ in order to have a nonvanishing renormalized coupling. For the range of renormalized couplings (and cutoffs) allowed by triviality, one finds that the perturbative counterterm does a good job in eliminating cutoff dependence in the low-energy spectrum (masses <<Λ).

Using State Merging and State Pruning to Address the Path Explosion Problem Faced by Symbolic Execution

DTIC Science & Technology

2014-06-19

urgent and compelling. Recent efforts in this area automate program analysis techniques using model checking and symbolic execution [2, 5–7]. These...bounded model checking tool for x86 binary programs developed at the Air Force Institute of Technology (AFIT). Jiseki creates a bit-vector logic model based...assume there are n different paths through the function foo . The program could potentially call the function foo a bound number of times, resulting in n

Quantum dynamics of relativistic bosons through nonminimal vector square potentials

NASA Astrophysics Data System (ADS)

de Oliveira, Luiz P.

2016-09-01

The dynamics of relativistic bosons (scalar and vectorial) through nonminimal vector square (well and barrier) potentials is studied in the Duffin-Kemmer-Petiau (DKP) formalism. We show that the problem can be mapped in effective Schrödinger equations for a component of the DKP spinor. An oscillatory transmission coefficient is found and there is total reflection. Additionally, the energy spectrum of bound states is obtained and reveals the Schiff-Snyder-Weinberg effect, for specific conditions the potential lodges bound states of particles and antiparticles.

The Tightness of the Kesten-Stigum Reconstruction Bound of Symmetric Model with Multiple Mutations

NASA Astrophysics Data System (ADS)

Liu, Wenjian; Jammalamadaka, Sreenivasa Rao; Ning, Ning

2018-02-01

It is well known that reconstruction problems, as the interdisciplinary subject, have been studied in numerous contexts including statistical physics, information theory and computational biology, to name a few. We consider a 2 q-state symmetric model, with two categories of q states in each category, and 3 transition probabilities: the probability to remain in the same state, the probability to change states but remain in the same category, and the probability to change categories. We construct a nonlinear second-order dynamical system based on this model and show that the Kesten-Stigum reconstruction bound is not tight when q ≥ 4.

Quantum key distribution with finite resources: Secret key rates via Renyi entropies

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

Abruzzo, Silvestre; Kampermann, Hermann; Mertz, Markus

A realistic quantum key distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem over Renyi entropies. Under the assumption of collective attacks by an eavesdropper, a computable estimate of our bound for the six-state protocol is provided. This bound leads to improved key rates in comparison to previous results.

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

A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

PubMed

Liu, Qingshan; Guo, Zhishan; Wang, Jun

2012-02-01

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Relativistic Coulomb Problem for Z Larger than 137

NASA Astrophysics Data System (ADS)

Alhaidari, A. D.

We propose a relativistic one-parameter Hermitian theory for the Coulomb problem with an electric charge greater than 137. In the nonrelativistic limit, the theory becomes identical to the Schrödinger-Coulomb problem for all Z. Moreover, it agrees with the Dirac-Coulomb problem to order (αZ)2, where α is the fine structure constant. The vacuum in the theory is stable and does not suffer from the "charged vacuum" problem for all Z. Moreover, transition between positive and negative energy states could be eliminated. The relativistic bound states energy spectrum and corresponding spinor wave functions are obtained.

Understanding the nucleon as a Borromean bound-state

DOE PAGES

Segovia, Jorge; Roberts, Craig D.; Schmidt, Sebastian M.

2015-08-20

Analyses of the three valence-quark bound-state problem in relativistic quantum field theory predict that the nucleon may be understood primarily as a Borromean bound-state, in which binding arises mainly from two separate effects. One originates in non-Abelian facets of QCD that are expressed in the strong running coupling and generate confined but strongly-correlated colourantitriplet diquark clusters in both the scalar-isoscalar and pseudovector-isotriplet channels. That attraction is magnified by quark exchange associated with diquark breakup and reformation. Diquark clustering is driven by the same mechanism which dynamically breaks chiral symmetry in the Standard Model. It has numerous observable consequences, the completemore » elucidation of which requires a framework that also simultaneously expresses the running of the coupling and masses in the strong interaction. Moreover, planned experiments are capable of validating this picture.« less

Direct Reactions with Exotic Nuclei

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

Baur, G.; Typel, S.

2005-10-14

We discuss recent work on Coulomb dissociation and an effective-range theory of low-lying electromagnetic strength of halo nuclei. We propose to study Coulomb dissociation of a halo nucleus bound by a zero-range potential as a homework problem. We study the transition from stripping to bound and unbound states and point out in this context that the Trojan-Horse method is a suitable tool to investigate subthreshold resonances.

Finite-time H∞ control for a class of discrete-time switched time-delay systems with quantized feedback

NASA Astrophysics Data System (ADS)

Song, Haiyu; Yu, Li; Zhang, Dan; Zhang, Wen-An

2012-12-01

This paper is concerned with the finite-time quantized H∞ control problem for a class of discrete-time switched time-delay systems with time-varying exogenous disturbances. By using the sector bound approach and the average dwell time method, sufficient conditions are derived for the switched system to be finite-time bounded and ensure a prescribed H∞ disturbance attenuation level, and a mode-dependent quantized state feedback controller is designed by solving an optimization problem. Two illustrative examples are provided to demonstrate the effectiveness of the proposed theoretical results.

A Study of Strong Stability of Distributed Systems. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Cataltepe, Tayfun

1989-01-01

The strong stability of distributed systems is studied and the problem of characterizing strongly stable semigroups of operators associated with distributed systems is addressed. Main emphasis is on contractive systems. Three different approaches to characterization of strongly stable contractive semigroups are developed. The first one is an operator theoretical approach. Using the theory of dilations, it is shown that every strongly stable contractive semigroup is related to the left shift semigroup on an L(exp 2) space. Then, a decomposition for the state space which identifies strongly stable and unstable states is introduced. Based on this decomposition, conditions for a contractive semigroup to be strongly stable are obtained. Finally, extensions of Lyapunov's equation for distributed parameter systems are investigated. Sufficient conditions for weak and strong stabilities of uniformly bounded semigroups are obtained by relaxing the equivalent norm condition on the right hand side of the Lyanupov equation. These characterizations are then applied to the problem of feedback stabilization. First, it is shown via the state space decomposition that under certain conditions a contractive system (A,B) can be strongly stabilized by the feedback -B(*). Then, application of the extensions of the Lyapunov equation results in sufficient conditions for weak, strong, and exponential stabilizations of contractive systems by the feedback -B(*). Finally, it is shown that for a contractive system, the first derivative of x with respect to time = Ax + Bu (where B is any linear bounded operator), there is a related linear quadratic regulator problem and a corresponding steady state Riccati equation which always has a bounded nonnegative solution.

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.

Data-based fault-tolerant control for affine nonlinear systems with actuator faults.

PubMed

Xie, Chun-Hua; Yang, Guang-Hong

2016-09-01

This paper investigates the fault-tolerant control (FTC) problem for unknown nonlinear systems with actuator faults including stuck, outage, bias and loss of effectiveness. The upper bounds of stuck faults, bias faults and loss of effectiveness faults are unknown. A new data-based FTC scheme is proposed. It consists of the online estimations of the bounds and a state-dependent function. The estimations are adjusted online to compensate automatically the actuator faults. The state-dependent function solved by using real system data helps to stabilize the system. Furthermore, all signals in the resulting closed-loop system are uniformly bounded and the states converge asymptotically to zero. Compared with the existing results, the proposed approach is data-based. Finally, two simulation examples are provided to show the effectiveness of the proposed approach. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Theoretical derivation of laser-dressed atomic states by using a fractal space

NASA Astrophysics Data System (ADS)

Duchateau, Guillaume

2018-05-01

The derivation of approximate wave functions for an electron submitted to both a Coulomb and a time-dependent laser electric fields, the so-called Coulomb-Volkov (CV) state, is addressed. Despite its derivation for continuum states does not exhibit any particular problem within the framework of the standard theory of quantum mechanics (QM), difficulties arise when considering an initially bound atomic state. Indeed the natural way of translating the unperturbed momentum by the laser vector potential is no longer possible since a bound state does not exhibit a plane wave form explicitly including a momentum. The use of a fractal space permits to naturally define a momentum for a bound wave function. Within this framework, it is shown how the derivation of laser-dressed bound states can be performed. Based on a generalized eikonal approach, a new expression for the laser-dressed states is also derived, fully symmetric relative to the continuum or bound nature of the initial unperturbed wave function. It includes an additional crossed term in the Volkov phase which was not obtained within the standard theory of quantum mechanics. The derivations within this fractal framework have highlighted other possible ways to derive approximate laser-dressed states in QM. After comparing the various obtained wave functions, an application to the prediction of the ionization probability of hydrogen targets by attosecond XUV pulses within the sudden approximation is provided. This approach allows to make predictions in various regimes depending on the laser intensity, going from the non-resonant multiphoton absorption to tunneling and barrier-suppression ionization.

Near-optimal energy transitions for energy-state trajectories of hypersonic aircraft

NASA Technical Reports Server (NTRS)

Ardema, M. D.; Bowles, J. V.; Terjesen, E. J.; Whittaker, T.

1992-01-01

A problem of the instantaneous energy transition that occurs in energy-state approximation is considered. The transitions are modeled as a sequence of two load-factor bounded paths (either climb-dive or dive-climb). The boundary-layer equations associated with the energy-state dynamic model are analyzed to determine the precise location of the transition.

The engine of microtubule dynamics comes into focus.

PubMed

Mitchison, T J

2014-05-22

In this issue, Alushin et al. report high-resolution structures of three states of the microtubule lattice: GTP-bound, which is stable to depolymerization; unstable GDP-bound; and stable Taxol and GDP-bound. By comparing these structures at near-atomic resolution, they are able to propose a detailed model for how GTP hydrolysis destabilizes the microtubule and thus powers dynamic instability and chromosome movement. Destabilization of cytoskeleton filaments by nucleotide hydrolysis is an important general principle in cell dynamics, and this work represents a major step forward on a problem with a long history. Copyright © 2014 Elsevier Inc. All rights reserved.

Approximate Model Checking of PCTL Involving Unbounded Path Properties

NASA Astrophysics Data System (ADS)

Basu, Samik; Ghosh, Arka P.; He, Ru

We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate methods have been proposed primarily to deal with state-space explosion that makes the exact model checking by numerical methods practically infeasible for large systems. However, the existing statistical methods either consider a restricted subset of PCTL, specifically, the subset that can only express bounded until properties; or rely on user-specified finite bound on the sample path length. We propose a new method that does not have such restrictions and can be effectively used to reason about unbounded until properties. We approximate probabilistic characteristics of an unbounded until property by that of a bounded until property for a suitably chosen value of the bound. In essence, our method is a two-phase process: (a) the first phase is concerned with identifying the bound k 0; (b) the second phase computes the probability of satisfying the k 0-bounded until property as an estimate for the probability of satisfying the corresponding unbounded until property. In both phases, it is sufficient to verify bounded until properties which can be effectively done using existing statistical techniques. We prove the correctness of our technique and present its prototype implementations. We empirically show the practical applicability of our method by considering different case studies including a simple infinite-state model, and large finite-state models such as IPv4 zeroconf protocol and dining philosopher protocol modeled as Discrete Time Markov chains.

Quantum Hamilton equations of motion for bound states of one-dimensional quantum systems

NASA Astrophysics Data System (ADS)

Köppe, J.; Patzold, M.; Grecksch, W.; Paul, W.

2018-06-01

On the basis of Nelson's stochastic mechanics derivation of the Schrödinger equation, a formal mathematical structure of non-relativistic quantum mechanics equivalent to the one in classical analytical mechanics has been established in the literature. We recently were able to augment this structure by deriving quantum Hamilton equations of motion by finding the Nash equilibrium of a stochastic optimal control problem, which is the generalization of Hamilton's principle of classical mechanics to quantum systems. We showed that these equations allow a description and numerical determination of the ground state of quantum problems without using the Schrödinger equation. We extend this approach here to deliver the complete discrete energy spectrum and related eigenfunctions for bound states of one-dimensional stationary quantum systems. We exemplify this analytically for the one-dimensional harmonic oscillator and numerically by analyzing a quartic double-well potential, a model of broad importance in many areas of physics. We furthermore point out a relation between the tunnel splitting of such models and mean first passage time concepts applied to Nelson's diffusion paths in the ground state.

State-independent uncertainty relations and entanglement detection

NASA Astrophysics Data System (ADS)

Qian, Chen; Li, Jun-Li; Qiao, Cong-Feng

2018-04-01

The uncertainty relation is one of the key ingredients of quantum theory. Despite the great efforts devoted to this subject, most of the variance-based uncertainty relations are state-dependent and suffering from the triviality problem of zero lower bounds. Here we develop a method to get uncertainty relations with state-independent lower bounds. The method works by exploring the eigenvalues of a Hermitian matrix composed by Bloch vectors of incompatible observables and is applicable for both pure and mixed states and for arbitrary number of N-dimensional observables. The uncertainty relation for the incompatible observables can be explained by geometric relations related to the parallel postulate and the inequalities in Horn's conjecture on Hermitian matrix sum. Practical entanglement criteria are also presented based on the derived uncertainty relations.

Delta-Complete Analysis for Bounded Reachability of Hybrid Systems

DTIC Science & Technology

2014-07-16

framework makes bounded reachability of hybrid systems a much more mathematically tractable problem and show that our practical implementation can handle...step i in the hybrid trajectory to an appropriate discrete mode in H , and make sure that the flow, jump, inv, init conditions are satisfied...trajectories start with some initial state satisfying initq(x0) for some q. In each step, it follows flowq(xi,xti, t) and makes a continuous flow from xi to x t

Powered Descent Guidance with General Thrust-Pointing Constraints

NASA Technical Reports Server (NTRS)

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

2013-01-01

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

Existence and uniqueness of steady state solutions of a nonlocal diffusive logistic equation

NASA Astrophysics Data System (ADS)

Sun, Linan; Shi, Junping; Wang, Yuwen

2013-08-01

In this paper, we consider a dynamical model of population biology which is of the classical Fisher type, but the competition interaction between individuals is nonlocal. The existence, uniqueness, and stability of the steady state solution of the nonlocal problem on a bounded interval with homogeneous Dirichlet boundary conditions are studied.

Adaptive Neural Networks Decentralized FTC Design for Nonstrict-Feedback Nonlinear Interconnected Large-Scale Systems Against Actuator Faults.

PubMed

Li, Yongming; Tong, Shaocheng

The problem of active fault-tolerant control (FTC) is investigated for the large-scale nonlinear systems in nonstrict-feedback form. The nonstrict-feedback nonlinear systems considered in this paper consist of unstructured uncertainties, unmeasured states, unknown interconnected terms, and actuator faults (e.g., bias fault and gain fault). A state observer is designed to solve the unmeasurable state problem. Neural networks (NNs) are used to identify the unknown lumped nonlinear functions so that the problems of unstructured uncertainties and unknown interconnected terms can be solved. By combining the adaptive backstepping design principle with the combination Nussbaum gain function property, a novel NN adaptive output-feedback FTC approach is developed. The proposed FTC controller can guarantee that all signals in all subsystems are bounded, and the tracking errors for each subsystem converge to a small neighborhood of zero. Finally, numerical results of practical examples are presented to further demonstrate the effectiveness of the proposed control strategy.The problem of active fault-tolerant control (FTC) is investigated for the large-scale nonlinear systems in nonstrict-feedback form. The nonstrict-feedback nonlinear systems considered in this paper consist of unstructured uncertainties, unmeasured states, unknown interconnected terms, and actuator faults (e.g., bias fault and gain fault). A state observer is designed to solve the unmeasurable state problem. Neural networks (NNs) are used to identify the unknown lumped nonlinear functions so that the problems of unstructured uncertainties and unknown interconnected terms can be solved. By combining the adaptive backstepping design principle with the combination Nussbaum gain function property, a novel NN adaptive output-feedback FTC approach is developed. The proposed FTC controller can guarantee that all signals in all subsystems are bounded, and the tracking errors for each subsystem converge to a small neighborhood of zero. Finally, numerical results of practical examples are presented to further demonstrate the effectiveness of the proposed control strategy.

Joint Chance-Constrained Dynamic Programming

NASA Technical Reports Server (NTRS)

Ono, Masahiro; Kuwata, Yoshiaki; Balaram, J. Bob

2012-01-01

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

A note on bound constraints handling for the IEEE CEC'05 benchmark function suite.

PubMed

Liao, Tianjun; Molina, Daniel; de Oca, Marco A Montes; Stützle, Thomas

2014-01-01

The benchmark functions and some of the algorithms proposed for the special session on real parameter optimization of the 2005 IEEE Congress on Evolutionary Computation (CEC'05) have played and still play an important role in the assessment of the state of the art in continuous optimization. In this article, we show that if bound constraints are not enforced for the final reported solutions, state-of-the-art algorithms produce infeasible best candidate solutions for the majority of functions of the IEEE CEC'05 benchmark function suite. This occurs even though the optima of the CEC'05 functions are within the specified bounds. This phenomenon has important implications on algorithm comparisons, and therefore on algorithm designs. This article's goal is to draw the attention of the community to the fact that some authors might have drawn wrong conclusions from experiments using the CEC'05 problems.

The Cramér-Rao Bounds and Sensor Selection for Nonlinear Systems with Uncertain Observations.

PubMed

Wang, Zhiguo; Shen, Xiaojing; Wang, Ping; Zhu, Yunmin

2018-04-05

This paper considers the problems of the posterior Cramér-Rao bound and sensor selection for multi-sensor nonlinear systems with uncertain observations. In order to effectively overcome the difficulties caused by uncertainty, we investigate two methods to derive the posterior Cramér-Rao bound. The first method is based on the recursive formula of the Cramér-Rao bound and the Gaussian mixture model. Nevertheless, it needs to compute a complex integral based on the joint probability density function of the sensor measurements and the target state. The computation burden of this method is relatively high, especially in large sensor networks. Inspired by the idea of the expectation maximization algorithm, the second method is to introduce some 0-1 latent variables to deal with the Gaussian mixture model. Since the regular condition of the posterior Cramér-Rao bound is unsatisfied for the discrete uncertain system, we use some continuous variables to approximate the discrete latent variables. Then, a new Cramér-Rao bound can be achieved by a limiting process of the Cramér-Rao bound of the continuous system. It avoids the complex integral, which can reduce the computation burden. Based on the new posterior Cramér-Rao bound, the optimal solution of the sensor selection problem can be derived analytically. Thus, it can be used to deal with the sensor selection of a large-scale sensor networks. Two typical numerical examples verify the effectiveness of the proposed methods.

Algebraic theory of molecules

NASA Technical Reports Server (NTRS)

Iachello, Franco

1995-01-01

An algebraic formulation of quantum mechanics is presented. In this formulation, operators of interest are expanded onto elements of an algebra, G. For bound state problems in nu dimensions the algebra G is taken to be U(nu + 1). Applications to the structure of molecules are presented.

Ground state sign-changing solutions for fractional Kirchhoff equations in bounded domains

NASA Astrophysics Data System (ADS)

Luo, Huxiao; Tang, Xianhua; Gao, Zu

2018-03-01

We study the existence of ground state sign-changing solutions for the fractional Kirchhoff problem. Under mild assumptions on the nonlinearity, by using some new analytical skills and the non-Nehari manifold method, we prove that the fractional Kirchhoff problem possesses a ground state sign-changing solution ub. Moreover, we show that the energy of ub is strictly larger than twice that of the ground state solutions of Nehari-type. Finally, we establish the convergence property of ub as the parameter b ↘ 0. Our results generalize some results obtained by Shuai [J. Differ. Equations 259, 1256 (2015)] and Tang and Cheng [J. Differ. Equations 261, 2384 (2016)].

Small Body GN&C Research Report: A Robust Model Predictive Control Algorithm with Guaranteed Resolvability

NASA Technical Reports Server (NTRS)

Acikmese, Behcet A.; Carson, John M., III

2005-01-01

A robustly stabilizing MPC (model predictive control) algorithm for uncertain nonlinear systems is developed that guarantees the resolvability of the associated finite-horizon optimal control problem in a receding-horizon implementation. The control consists of two components; (i) feedforward, and (ii) feedback part. Feed-forward control is obtained by online solution of a finite-horizon optimal control problem for the nominal system dynamics. The feedback control policy is designed off-line based on a bound on the uncertainty in the system model. The entire controller is shown to be robustly stabilizing with a region of attraction composed of initial states for which the finite-horizon optimal control problem is feasible. The controller design for this algorithm is demonstrated on a class of systems with uncertain nonlinear terms that have norm-bounded derivatives, and derivatives in polytopes. An illustrative numerical example is also provided.

A robust model predictive control algorithm for uncertain nonlinear systems that guarantees resolvability

NASA Technical Reports Server (NTRS)

Acikmese, Ahmet Behcet; Carson, John M., III

2006-01-01

A robustly stabilizing MPC (model predictive control) algorithm for uncertain nonlinear systems is developed that guarantees resolvability. With resolvability, initial feasibility of the finite-horizon optimal control problem implies future feasibility in a receding-horizon framework. The control consists of two components; (i) feed-forward, and (ii) feedback part. Feed-forward control is obtained by online solution of a finite-horizon optimal control problem for the nominal system dynamics. The feedback control policy is designed off-line based on a bound on the uncertainty in the system model. The entire controller is shown to be robustly stabilizing with a region of attraction composed of initial states for which the finite-horizon optimal control problem is feasible. The controller design for this algorithm is demonstrated on a class of systems with uncertain nonlinear terms that have norm-bounded derivatives and derivatives in polytopes. An illustrative numerical example is also provided.

Bound states and propagating modes in quantum wires with sharp bends and/or constrictions

NASA Astrophysics Data System (ADS)

Razavy, M.

1997-06-01

A number of interesting problems of quantum wires with different geometries can be studied with the help of conformal mapping. These include crossed wires, twisting wires, conductors with constrictions, and wires with a bend. Here the Helmholz equation with Dirichlet boundary condition on the surface of the wire is transformed to a Schröautdinger-like equation with an energy-dependent nonseparable potential but with boundary conditions given on two straight lines. By expanding the wave function in terms of the Fourier series of one of the variables one obtains an infinite set of coupled ordinary differential equations. Only the propagating modes plus a few of the localized modes contribute significantly to the total wave function. Once the problem is solved, one can express the results in terms of the original variables using the inverse conformal mapping. As an example, the total wave function, the components of the current density, and the bound-state energy for a Γ-shaped quantum wire is calculated in detail.

Adaptive Neural Networks Prescribed Performance Control Design for Switched Interconnected Uncertain Nonlinear Systems.

PubMed

Li, Yongming; Tong, Shaocheng

2017-06-28

In this paper, an adaptive neural networks (NNs)-based decentralized control scheme with the prescribed performance is proposed for uncertain switched nonstrict-feedback interconnected nonlinear systems. It is assumed that nonlinear interconnected terms and nonlinear functions of the concerned systems are unknown, and also the switching signals are unknown and arbitrary. A linear state estimator is constructed to solve the problem of unmeasured states. The NNs are employed to approximate unknown interconnected terms and nonlinear functions. A new output feedback decentralized control scheme is developed by using the adaptive backstepping design technique. The control design problem of nonlinear interconnected switched systems with unknown switching signals can be solved by the proposed scheme, and only a tuning parameter is needed for each subsystem. The proposed scheme can ensure that all variables of the control systems are semi-globally uniformly ultimately bounded and the tracking errors converge to a small residual set with the prescribed performance bound. The effectiveness of the proposed control approach is verified by some simulation results.

Joint estimation of phase and phase diffusion for quantum metrology.

PubMed

Vidrighin, Mihai D; Donati, Gaia; Genoni, Marco G; Jin, Xian-Min; Kolthammer, W Steven; Kim, M S; Datta, Animesh; Barbieri, Marco; Walmsley, Ian A

2014-04-14

Phase estimation, at the heart of many quantum metrology and communication schemes, can be strongly affected by noise, whose amplitude may not be known, or might be subject to drift. Here we investigate the joint estimation of a phase shift and the amplitude of phase diffusion at the quantum limit. For several relevant instances, this multiparameter estimation problem can be effectively reshaped as a two-dimensional Hilbert space model, encompassing the description of an interferometer phase probed with relevant quantum states--split single-photons, coherent states or N00N states. For these cases, we obtain a trade-off bound on the statistical variances for the joint estimation of phase and phase diffusion, as well as optimum measurement schemes. We use this bound to quantify the effectiveness of an actual experimental set-up for joint parameter estimation for polarimetry. We conclude by discussing the form of the trade-off relations for more general states and measurements.

Decision Making: Rational, Nonrational, and Irrational.

ERIC Educational Resources Information Center

Simon, Herbert A.

1993-01-01

Describes the current state of knowledge about human decision-making and problem-solving processes, explaining recent developments and their implications for management and management training. Rational goal-setting is the key to effective decision making and accomplishment. Bounded rationality is a realistic orientation, because the world is too…

Quantum dynamics of relativistic bosons through nonminimal vector square potentials

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

Oliveira, Luiz P. de, E-mail: oliveira.phys@gmail.com

The dynamics of relativistic bosons (scalar and vectorial) through nonminimal vector square (well and barrier) potentials is studied in the Duffin–Kemmer–Petiau (DKP) formalism. We show that the problem can be mapped in effective Schrödinger equations for a component of the DKP spinor. An oscillatory transmission coefficient is found and there is total reflection. Additionally, the energy spectrum of bound states is obtained and reveals the Schiff–Snyder–Weinberg effect, for specific conditions the potential lodges bound states of particles and antiparticles. - Highlights: • DKP bosons in a nonminimal vector square potential are studied. • Spin zero and spin one bosons havemore » the same results. • The Schiff–Snyder–Weinberg effect is observed.« less

Magnetic field effect on the energy levels of an exciton in a GaAs quantum dot: Application for excitonic lasers.

PubMed

Jahan, K Luhluh; Boda, A; Shankar, I V; Raju, Ch Narasimha; Chatterjee, Ashok

2018-03-22

The problem of an exciton trapped in a Gaussian quantum dot (QD) of GaAs is studied in both two and three dimensions in the presence of an external magnetic field using the Ritz variational method, the 1/N expansion method and the shifted 1/N expansion method. The ground state energy and the binding energy of the exciton are obtained as a function of the quantum dot size, confinement strength and the magnetic field and compared with those available in the literature. While the variational method gives the upper bound to the ground state energy, the 1/N expansion method gives the lower bound. The results obtained from the shifted 1/N expansion method are shown to match very well with those obtained from the exact diagonalization technique. The variation of the exciton size and the oscillator strength of the exciton are also studied as a function of the size of the quantum dot. The excited states of the exciton are computed using the shifted 1/N expansion method and it is suggested that a given number of stable excitonic bound states can be realized in a quantum dot by tuning the quantum dot parameters. This can open up the possibility of having quantum dot lasers using excitonic states.

Classification of billiard motions in domains bounded by confocal parabolas

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

Fokicheva, V V

2014-08-01

We consider the billiard dynamical system in a domain bounded by confocal parabolas. We describe such domains in which the billiard problem can be correctly stated. In each such domain we prove the integrability for the system, analyse the arising Liouville foliation, and calculate the invariant of Liouville equivalence--the so-called marked molecule. It turns out that billiard systems in certain parabolic domains have the same closures of solutions (integral trajectories) as the systems of Goryachev-Chaplygin-Sretenskii and Joukowski at suitable energy levels. We also describe the billiard motion in noncompact domains bounded by confocal parabolas, namely, we describe the topology of themore » Liouville foliation in terms of rough molecules. Bibliography: 16 titles.« less

A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

NASA Astrophysics Data System (ADS)

Ebrahimnejad, Ali

2015-08-01

There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

Pure state `really' informationally complete with rank-1 POVM

NASA Astrophysics Data System (ADS)

Wang, Yu; Shang, Yun

2018-03-01

What is the minimal number of elements in a rank-1 positive operator-valued measure (POVM) which can uniquely determine any pure state in d-dimensional Hilbert space H_d? The known result is that the number is no less than 3d-2. We show that this lower bound is not tight except for d=2 or 4. Then we give an upper bound 4d-3. For d=2, many rank-1 POVMs with four elements can determine any pure states in H_2. For d=3, we show eight is the minimal number by construction. For d=4, the minimal number is in the set of {10,11,12,13}. We show that if this number is greater than 10, an unsettled open problem can be solved that three orthonormal bases cannot distinguish all pure states in H_4. For any dimension d, we construct d+2k-2 adaptive rank-1 positive operators for the reconstruction of any unknown pure state in H_d, where 1≤ k ≤ d.

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

Demkowicz-Dobrzanski, Rafal; Lewenstein, Maciej; Institut fuer Theoretische Physik, Universitaet Hannover, D-30167 Hannover

We solve the problem of the optimal cloning of pure entangled two-qubit states with a fixed degree of entanglement using local operations and classical communication. We show that, amazingly, classical communication between the parties can improve the fidelity of local cloning if and only if the initial entanglement is higher than a certain critical value. It is completely useless for weakly entangled states. We also show that bound entangled states with positive partial transpose are not useful as a resource to improve the best local cloning fidelity.

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.

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

Post-prior equivalence for transfer reactions with complex potentials

NASA Astrophysics Data System (ADS)

Lei, Jin; Moro, Antonio M.

2018-01-01

In this paper, we address the problem of the post-prior equivalence in the calculation of inclusive breakup and transfer cross sections. For that, we employ the model proposed by Ichimura et al. [Phys. Rev. C 32, 431 (1985), 10.1103/PhysRevC.32.431], conveniently generalized to include the part of the cross section corresponding the transfer to bound states. We pay particular attention to the case in which the unobserved particle is left in a bound state of the residual nucleus, in which case the theory prescribes the use of a complex potential, responsible for the spreading width of the populated single-particle states. We see that the introduction of this complex potential gives rise to an additional term in the prior cross-section formula, not present in the usual case of real binding potentials. The equivalence is numerically tested for the 58Ni(d ,p X ) reaction.

Postselection technique for quantum channels with applications to quantum cryptography.

PubMed

Christandl, Matthias; König, Robert; Renner, Renato

2009-01-16

We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. Our technique can be applied to the analysis of information-theoretic problems. For example, in quantum cryptography, we get a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks. The resulting security bounds are tighter than previously known bounds obtained with help of the exponential de Finetti theorem.

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

Horowitz, Scott; Salmon, Loïc; Koldewey, Philipp

We present that challenges in determining the structures of heterogeneous and dynamic protein complexes have greatly hampered past efforts to obtain a mechanistic understanding of many important biological processes. One such process is chaperone-assisted protein folding. Obtaining structural ensembles of chaperone–substrate complexes would ultimately reveal how chaperones help proteins fold into their native state. To address this problem, we devised a new structural biology approach based on X-ray crystallography, termed residual electron and anomalous density (READ). READ enabled us to visualize even sparsely populated conformations of the substrate protein immunity protein 7 (Im7) in complex with the Escherichia coli chaperonemore » Spy, and to capture a series of snapshots depicting the various folding states of Im7 bound to Spy. The ensemble shows that Spy-associated Im7 samples conformations ranging from unfolded to partially folded to native-like states and reveals how a substrate can explore its folding landscape while being bound to a chaperone.« less

Leading-twist parton distribution amplitudes of S-wave heavy-quarkonia

DOE PAGES

Ding, Minghui; Gao, Fei; Chang, Lei; ...

2015-12-08

Here, the leading-twist parton distribution amplitudes (PDAs) of ground-state 1S 0 and 3S 1 cc¯- and bb¯quarkonia are calculated using a symmetry-preserving continuum treatment of the meson bound-state problem which unifies the properties of these heavy-quark systems with those of light-quark bound-states, including QCD's Goldstone modes. Analysing the evolution of 1S 0 and 3S 1 PDAs with current-quark mass, m^ q, increasing away from the chiral limit, it is found that in all cases there is a value of m^ q for which the PDA matches the asymptotic form appropriate to QCD's conformal limit and hence is insensitive to changesmore » in renormalisation scale, ζ. This mass lies just above that associated with the s-quark. At current-quark masses associated with heavy-quarkonia, on the other hand, the PDAs are piecewise convex–concave–convex.« less

The Schwinger Variational Method

NASA Technical Reports Server (NTRS)

Huo, Winifred M.

1995-01-01

Variational methods have proven invaluable in theoretical physics and chemistry, both for bound state problems and for the study of collision phenomena. For collisional problems they can be grouped into two types: those based on the Schroedinger equation and those based on the Lippmann-Schwinger equation. The application of the Schwinger variational (SV) method to e-molecule collisions and photoionization has been reviewed previously. The present chapter discusses the implementation of the SV method as applied to e-molecule collisions.

GreedyMAX-type Algorithms for the Maximum Independent Set Problem

NASA Astrophysics Data System (ADS)

Borowiecki, Piotr; Göring, Frank

A maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued function p defined on the vertex set V(G) and called a potential function of a graph G, while P(G) = max v ∈ V(G) p(v) is called a potential of G. For any graph P(G) ≤ Δ(G), where Δ(G) is the maximum degree of G. Moreover, Δ(G) - P(G) may be arbitrarily large. A potential of a vertex lets us get a closer insight into the properties of its neighborhood which leads to the definition of the family of GreedyMAX-type algorithms having the classical GreedyMAX algorithm as their origin. We establish a lower bound 1/(P + 1) for the performance ratio of GreedyMAX-type algorithms which favorably compares with the bound 1/(Δ + 1) known to hold for GreedyMAX. The cardinality of an independent set generated by any GreedyMAX-type algorithm is at least sum_{vin V(G)} (p(v)+1)^{-1}, which strengthens the bounds of Turán and Caro-Wei stated in terms of vertex degrees.

Optimality of semiquantum nonlocality in the presence of high inconclusive rates

DOE PAGES

Lim, Charles Ci Wen

2016-02-01

Quantum nonlocality is a counterintuitive phenomenon that lies beyond the purview of causal influences. Recently, Bell inequalities have been generalized to the case of quantum inputs, leading to a powerful family of semiquantum Bell inequalities that are capable of detecting any entangled state. We focus on a different problem and investigate how the local indistinguishability of quantum inputs and postselection may affect the requirements to detect semiquantum nonlocality. Moreover, we consider a semiquantum nonlocal game based on locally indistinguishable qubit inputs, and derive its postselected local and quantum bounds by using a connection to the local distinguishability of quantum states.more » Interestingly, we find that the postselected local bound is independent of the measurement efficiency, and the achievable postselected Bell violation increases with decreasing measurement efficiency.« less

Regularized maximum pure-state input-output fidelity of a quantum channel

NASA Astrophysics Data System (ADS)

Ernst, Moritz F.; Klesse, Rochus

2017-12-01

As a toy model for the capacity problem in quantum information theory we investigate finite and asymptotic regularizations of the maximum pure-state input-output fidelity F (N ) of a general quantum channel N . We show that the asymptotic regularization F ˜(N ) is lower bounded by the maximum output ∞ -norm ν∞(N ) of the channel. For N being a Pauli channel, we find that both quantities are equal.

Discontinuous Observers Design for Finite-Time Consensus of Multiagent Systems With External Disturbances.

PubMed

Liu, Xiaoyang; Ho, Daniel W C; Cao, Jinde; Xu, Wenying

This brief investigates the problem of finite-time robust consensus (FTRC) for second-order nonlinear multiagent systems with external disturbances. Based on the global finite-time stability theory of discontinuous homogeneous systems, a novel finite-time convergent discontinuous disturbed observer (DDO) is proposed for the leader-following multiagent systems. The states of the designed DDO are then used to design the control inputs to achieve the FTRC of nonlinear multiagent systems in the presence of bounded disturbances. The simulation results are provided to validate the effectiveness of these theoretical results.This brief investigates the problem of finite-time robust consensus (FTRC) for second-order nonlinear multiagent systems with external disturbances. Based on the global finite-time stability theory of discontinuous homogeneous systems, a novel finite-time convergent discontinuous disturbed observer (DDO) is proposed for the leader-following multiagent systems. The states of the designed DDO are then used to design the control inputs to achieve the FTRC of nonlinear multiagent systems in the presence of bounded disturbances. The simulation results are provided to validate the effectiveness of these theoretical results.

DNA bubble dynamics as a quantum Coulomb problem.

PubMed

Fogedby, Hans C; Metzler, Ralf

2007-02-16

We study the dynamics of denaturation bubbles in double-stranded DNA. Demonstrating that the associated Fokker-Planck equation is equivalent to a Coulomb problem, we derive expressions for the bubble survival distribution W(t). Below Tm, W(t) is associated with the continuum of scattering states of the repulsive Coulomb potential. At Tm, the Coulomb potential vanishes and W(t) assumes a power-law tail with nontrivial dynamic exponents: the critical exponent of the entropy loss factor may cause a finite mean lifetime. Above Tm (attractive potential), the long-time dynamics is controlled by the lowest bound state. Correlations and finite size effects are discussed.

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.

Parallel algorithms for the molecular conformation problem

NASA Astrophysics Data System (ADS)

Rajan, Kumar

Given a set of objects, and some of the pairwise distances between them, the problem of identifying the positions of the objects in the Euclidean space is referred to as the molecular conformation problem. This problem is known to be computationally difficult. One of the most important applications of this problem is the determination of the structure of molecules. In the case of molecular structure determination, usually only the lower and upper bounds on some of the interatomic distances are available. The process of obtaining a tighter set of bounds between all pairs of atoms, using the available interatomic distance bounds is referred to as bound-smoothing . 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. The sequential tetrangle-inequality bound-smoothing algorithm considers a quadruple of atoms at a time, and tightens the bounds on each of its six distances. The sequential algorithm is computationally expensive, and its application is limited to molecules with up to a few hundred atoms. Here, we conduct an experimental study of tetrangle-inequality bound-smoothing and reduce the sequential time by identifying the most computationally expensive portions of the process. We also present a simple criterion to determine which of the quadruples of atoms are likely to be tightened the most by tetrangle-inequality bound-smoothing. This test could be used to enhance the applicability of this process to large molecules. We map the problem of parallelizing tetrangle-inequality bound-smoothing to that of generating disjoint packing designs of a certain kind. We map this, in turn, to a regular-graph coloring problem, and present a simple, parallel algorithm for tetrangle-inequality bound-smoothing. We implement the parallel algorithm on the Intel Paragon X/PS, and apply it to real-life molecules. Our results show that with this parallel algorithm, tetrangle inequality can be applied to large molecules in a reasonable amount of time. We extend the regular graph to represent more general packing designs, and present a coloring algorithm for this graph. This can be used to generate constant-weight binary codes in parallel. Once a tighter set of distance bounds is obtained, the molecular conformation problem is usually formulated as a non-linear optimization problem, and a global optimization algorithm is then used to solve the problem. Here we present a parallel, deterministic algorithm for the optimization problem based on Interval Analysis. We implement our algorithm, using dynamic load balancing, on a network of Sun Ultra-Sparc workstations. Our experience with this algorithm shows that its application is limited to small instances of the molecular conformation problem, where the number of measured, pairwise distances is close to the maximum value. However, since the interval method eliminates a substantial portion of the initial search space very quickly, it can be used to prune the search space before any of the more efficient, nondeterministic methods can be applied.

Ground-state energy of an exciton-(LO) phonon system in a parabolic quantum well

NASA Astrophysics Data System (ADS)

Gerlach, B.; Wüsthoff, J.; Smondyrev, M. A.

1999-12-01

This paper presents a variational study of the ground-state energy of an exciton-(LO) phonon system, which is spatially confined to a quantum well. The exciton-phonon interaction is of Fröhlich type, the confinement potentials are assumed to be parabolic functions of the coordinates. Making use of functional integral techniques, the phonon part of the problem can be eliminated exactly, leading us to an effective two-particle system, which has the same spectral properties as the original one. Subsequently, Jensen's inequality is applied to obtain an upper bound on the ground-state energy. The main intention of this paper is to analyze the influence of the quantum-well-induced localization of the exciton on its ground-state energy (or its binding energy, respectively). To do so, we neglect any mismatch of the masses or the dielectric constants, but admit an arbitrary strength of the confinement potentials. Our approach allows for a smooth interpolation of the ultimate limits of vanishing and infinite confinement, corresponding to the cases of a free three-dimensional and a free two-dimensional exciton-phonon system. The interpolation formula for the ground-state energy bound corresponds to similar formulas for the free polaron or the free exciton-phonon system. These bounds in turn are known to compare favorably with all previous ones, which we are aware of.

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.

Bound state and localization of excitation in many-body open systems

NASA Astrophysics Data System (ADS)

Cui, H. T.; Shen, H. Z.; Hou, S. C.; Yi, X. X.

2018-04-01

We study the exact bound state and time evolution for single excitations in one-dimensional X X Z spin chains within a non-Markovian reservoir. For the bound state, a common feature is the localization of single excitations, which means the spontaneous emission of excitations into the reservoir is prohibited. Exceptionally, the pseudo-bound state can be found, for which the single excitation has a finite probability of emission into the reservoir. In addition, a critical energy scale for bound states is also identified, below which only one bound state exists, and it is also the pseudo-bound state. The effect of quasirandom disorder in the spin chain is also discussed; such disorder induces the single excitation to locate at some spin sites. Furthermore, to display the effect of bound state and disorder on the preservation of quantum information, the time evolution of single excitations in spin chains is studied exactly. An interesting observation is that the excitation can stay at its initial location with high probability only when the bound state and disorder coexist. In contrast, when either one of them is absent, the information of the initial state can be erased completely or becomes mixed. This finding shows that the combination of bound state and disorder can provide an ideal mechanism for quantum memory.

An analysis of spectral envelope-reduction via quadratic assignment problems

NASA Technical Reports Server (NTRS)

George, Alan; Pothen, Alex

1994-01-01

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

Global robust output regulation control for cascaded nonlinear systems using the internal model principle

NASA Astrophysics Data System (ADS)

Yu, Jiang-Bo; Zhao, Yan; Wu, Yu-Qiang

2014-04-01

This article considers the global robust output regulation problem via output feedback for a class of cascaded nonlinear systems with input-to-state stable inverse dynamics. The system uncertainties depend not only on the measured output but also all the unmeasurable states. By introducing an internal model, the output regulation problem is converted into a stabilisation problem for an appropriately augmented system. The designed dynamic controller could achieve the global asymptotic tracking control for a class of time-varying reference signals for the system output while keeping all other closed-loop signals bounded. It is of interest to note that the developed control approach can be applied to the speed tracking control of the fan speed control system. The simulation results demonstrate its effectiveness.

Computation of diverging sums based on a finite number of terms

NASA Astrophysics Data System (ADS)

Lv, Q. Z.; Norris, S.; Pelphrey, R.; Su, Q.; Grobe, R.

2017-10-01

We propose a numerical method that permits us to compute the sum of a diverging series from only the first N terms by generalizing the traditional Borel technique. The method is rather robust and can be used to recover the ground state energy from the diverging perturbation theory for quantum field theoretical systems that are spatially constrained. Surprisingly, even the corresponding eigenvectors can be generated despite the intrinsic non-perturbative nature of bound state problems.

Regularization by Functions of Bounded Variation and Applications to Image Enhancement

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

Casas, E.; Kunisch, K.; Pola, C.

1999-09-15

Optimization problems regularized by bounded variation seminorms are analyzed. The optimality system is obtained and finite-dimensional approximations of bounded variation function spaces as well as of the optimization problems are studied. It is demonstrated that the choice of the vector norm in the definition of the bounded variation seminorm is of special importance for approximating subspaces consisting of piecewise constant functions. Algorithms based on a primal-dual framework that exploit the structure of these nondifferentiable optimization problems are proposed. Numerical examples are given for denoising of blocky images with very high noise.

Illustrating chaos: a schematic discretization of the general three-body problem in Newtonian gravity

NASA Astrophysics Data System (ADS)

Leigh, Nathan W. C.; Wegsman, Shalma

2018-05-01

We present a formalism for constructing schematic diagrams to depict chaotic three-body interactions in Newtonian gravity. This is done by decomposing each interaction into a series of discrete transformations in energy- and angular momentum-space. Each time a transformation is applied, the system changes state as the particles re-distribute their energy and angular momenta. These diagrams have the virtue of containing all of the quantitative information needed to fully characterize most bound or unbound interactions through time and space, including the total duration of the interaction, the initial and final stable states in addition to every intervening temporary meta-stable state. As shown via an illustrative example for the bound case, prolonged excursions of one of the particles, which by far dominates the computational cost of the simulations, are reduced to a single discrete transformation in energy- and angular momentum-space, thereby potentially mitigating any computational expense. We further generalize our formalism to sequences of (unbound) three-body interactions, as occur in dense stellar environments during binary hardening. Finally, we provide a method for dynamically evolving entire populations of binaries via three-body scattering interactions, using a purely analytic formalism. In principle, the techniques presented here are adaptable to other three-body problems that conserve energy and angular momentum.

Density matrix renormalization group study of Y-junction spin systems

NASA Astrophysics Data System (ADS)

Guo, Haihui

Junction systems are important to understand both from the fundamental and the practical point of view, as they are essential components in existing and future electronic and spintronic devices. With the continuous advance of technology, device size will eventual reach the atomic scale. Some of the most interesting and useful junction systems will be strongly correlated. We chose the Density Matrix Renormalization Group method to study two types of Y-junction systems, the Y and YDelta junctions, on strongly correlated spin chains. With new ideas coming from the quantum information field, we have made a very efficient. Y-junction DMRG algorithm, which improves the overall CUB cost from O(m6) to O(m4), where m is the number of states kept per block. We studied the ground state properties, the correlation length, and investigated the degeneracy problem on the Y and YDelta junctions. For the excited states, we researched the existence of magnon bound states for various conditions, and have shown that the bound state exists when the central coupling constant is small.

Neutron whispering gallery

NASA Astrophysics Data System (ADS)

Nesvizhevsky, Valery V.; Voronin, Alexei Yu.; Cubitt, Robert; Protasov, Konstantin V.

2010-02-01

The `whispering gallery' effect has been known since ancient times for sound waves in air, later in water and more recently for a broad range of electromagnetic waves: radio, optics, Roentgen and so on. It consists of wave localization near a curved reflecting surface and is expected for waves of various natures, for instance, for atoms and neutrons. For matter waves, it would include a new feature: a massive particle would be settled in quantum states, with parameters depending on its mass. Here, we present for the first time the quantum whispering-gallery effect for cold neutrons. This phenomenon provides an example of an exactly solvable problem analogous to the `quantum bouncer'; it is complementary to the recently discovered gravitationally bound quantum states of neutrons . These two phenomena provide a direct demonstration of the weak equivalence principle for a massive particle in a pure quantum state. Deeply bound whispering-gallery states are long-living and weakly sensitive to surface potential; highly excited states are short-living and very sensitive to the wall potential shape. Therefore, they are a promising tool for studying fundamental neutron-matter interactions, quantum neutron optics and surface physics effects.

Gauss Seidel-type methods for energy states of a multi-component Bose Einstein condensate

NASA Astrophysics Data System (ADS)

Chang, Shu-Ming; Lin, Wen-Wei; Shieh, Shih-Feng

2005-01-01

In this paper, we propose two iterative methods, a Jacobi-type iteration (JI) and a Gauss-Seidel-type iteration (GSI), for the computation of energy states of the time-independent vector Gross-Pitaevskii equation (VGPE) which describes a multi-component Bose-Einstein condensate (BEC). A discretization of the VGPE leads to a nonlinear algebraic eigenvalue problem (NAEP). We prove that the GSI method converges locally and linearly to a solution of the NAEP if and only if the associated minimized energy functional problem has a strictly local minimum. The GSI method can thus be used to compute ground states and positive bound states, as well as the corresponding energies of a multi-component BEC. Numerical experience shows that the GSI converges much faster than JI and converges globally within 10-20 steps.

Robustness of linear quadratic state feedback designs in the presence of system uncertainty. [applied to STOL autopilot design

NASA Technical Reports Server (NTRS)

Patel, R. V.; Toda, M.; Sridhar, B.

1977-01-01

In connection with difficulties concerning an accurate mathematical representation of a linear quadratic state feedback (LQSF) system, it is often necessary to investigate the robustness (stability) of an LQSF design in the presence of system uncertainty and obtain some quantitative measure of the perturbations which such a design can tolerate. A study is conducted concerning the problem of expressing the robustness property of an LQSF design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices. Bounds are obtained for the general case of nonlinear, time-varying perturbations. It is pointed out that most of the presented results are readily applicable to practical situations for which a designer has estimates of the bounds on the system parameter perturbations. Relations are provided which help the designer to select appropriate weighting matrices in the quadratic performance index to attain a robust design. The developed results are employed in the design of an autopilot logic for the flare maneuver of the Augmentor Wing Jet STOL Research Aircraft.

Entanglement of a class of non-Gaussian states in disordered harmonic oscillator systems

NASA Astrophysics Data System (ADS)

Abdul-Rahman, Houssam

2018-03-01

For disordered harmonic oscillator systems over the d-dimensional lattice, we consider the problem of finding the bipartite entanglement of the uniform ensemble of the energy eigenstates associated with a particular number of modes. Such an ensemble defines a class of mixed, non-Gaussian entangled states that are labeled, by the energy of the system, in an increasing order. We develop a novel approach to find the exact logarithmic negativity of this class of states. We also prove entanglement bounds and demonstrate that the low energy states follow an area law.

Use of the Wigner representation in scattering problems

NASA Technical Reports Server (NTRS)

Bemler, E. A.

1975-01-01

The basic equations of quantum scattering were translated into the Wigner representation, putting quantum mechanics in the form of a stochastic process in phase space, with real valued probability distributions and source functions. The interpretative picture associated with this representation is developed and stressed and results used in applications published elsewhere are derived. The form of the integral equation for scattering as well as its multiple scattering expansion in this representation are derived. Quantum corrections to classical propagators are briefly discussed. The basic approximation used in the Monte-Carlo method is derived in a fashion which allows for future refinement and which includes bound state production. Finally, as a simple illustration of some of the formalism, scattering is treated by a bound two body problem. Simple expressions for single and double scattering contributions to total and differential cross-sections as well as for all necessary shadow corrections are obtained.

Nonperturbative dynamics of scalar field theories through the Feynman-Schwinger representation

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

Cetin Savkli; Franz Gross; John Tjon

2004-04-01

In this paper we present a summary of results obtained for scalar field theories using the Feynman-Schwinger (FSR) approach. Specifically, scalar QED and {chi}{sup 2}{phi} theories are considered. The motivation behind the applications discussed in this paper is to use the FSR method as a rigorous tool for testing the quality of commonly used approximations in field theory. Exact calculations in a quenched theory are presented for one-, two-, and three-body bound states. Results obtained indicate that some of the commonly used approximations, such as Bethe-Salpeter ladder summation for bound states and the rainbow summation for one body problems, producemore » significantly different results from those obtained from the FSR approach. We find that more accurate results can be obtained using other, simpler, approximation schemes.« less

Global stabilization analysis of inertial memristive recurrent neural networks with discrete and distributed delays.

PubMed

Wang, Leimin; Zeng, Zhigang; Ge, Ming-Feng; Hu, Junhao

2018-05-02

This paper deals with the stabilization problem of memristive recurrent neural networks with inertial items, discrete delays, bounded and unbounded distributed delays. First, for inertial memristive recurrent neural networks (IMRNNs) with second-order derivatives of states, an appropriate variable substitution method is invoked to transfer IMRNNs into a first-order differential form. Then, based on nonsmooth analysis theory, several algebraic criteria are established for the global stabilizability of IMRNNs under proposed feedback control, where the cases with both bounded and unbounded distributed delays are successfully addressed. Finally, the theoretical results are illustrated via the numerical simulations. Copyright © 2018 Elsevier Ltd. All rights reserved.

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.

Functional Analyses of the Plant Photosystem I–Light-Harvesting Complex II Supercomplex Reveal That Light-Harvesting Complex II Loosely Bound to Photosystem II Is a Very Efficient Antenna for Photosystem I in State II[W

PubMed Central

Galka, Pierre; Santabarbara, Stefano; Khuong, Thi Thu Huong; Degand, Hervé; Morsomme, Pierre; Jennings, Robert C.; Boekema, Egbert J.; Caffarri, Stefano

2012-01-01

State transitions are an important photosynthetic short-term response that allows energy distribution balancing between photosystems I (PSI) and II (PSII). In plants when PSII is preferentially excited compared with PSI (State II), part of the major light-harvesting complex LHCII migrates to PSI to form a PSI-LHCII supercomplex. So far, little is known about this complex, mainly due to purification problems. Here, a stable PSI-LHCII supercomplex is purified from Arabidopsis thaliana and maize (Zea mays) plants. It is demonstrated that LHCIIs loosely bound to PSII in State I are the trimers mainly involved in state transitions and become strongly bound to PSI in State II. Specific Lhcb1-3 isoforms are differently represented in the mobile LHCII compared with S and M trimers. Fluorescence analyses indicate that excitation energy migration from mobile LHCII to PSI is rapid and efficient, and the quantum yield of photochemical conversion of PSI-LHCII is substantially unaffected with respect to PSI, despite a sizable increase of the antenna size. An updated PSI-LHCII structural model suggests that the low-energy chlorophylls 611 and 612 in LHCII interact with the chlorophyll 11145 at the interface of PSI. In contrast with the common opinion, we suggest that the mobile pool of LHCII may be considered an intimate part of the PSI antenna system that is displaced to PSII in State I. PMID:22822202

A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints.

PubMed

Liang, X B; Wang, J

2000-01-01

This paper presents a continuous-time recurrent neural-network model for nonlinear optimization with any continuously differentiable objective function and bound constraints. Quadratic optimization with bound constraints is a special problem which can be solved by the recurrent neural network. The proposed recurrent neural network has the following characteristics. 1) It is regular in the sense that any optimum of the objective function with bound constraints is also an equilibrium point of the neural network. If the objective function to be minimized is convex, then the recurrent neural network is complete in the sense that the set of optima of the function with bound constraints coincides with the set of equilibria of the neural network. 2) The recurrent neural network is primal and quasiconvergent in the sense that its trajectory cannot escape from the feasible region and will converge to the set of equilibria of the neural network for any initial point in the feasible bound region. 3) The recurrent neural network has an attractivity property in the sense that its trajectory will eventually converge to the feasible region for any initial states even at outside of the bounded feasible region. 4) For minimizing any strictly convex quadratic objective function subject to bound constraints, the recurrent neural network is globally exponentially stable for almost any positive network parameters. Simulation results are given to demonstrate the convergence and performance of the proposed recurrent neural network for nonlinear optimization with bound constraints.

An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem

NASA Astrophysics Data System (ADS)

Afshar Nadjafi, Behrouz; Shadrokh, Shahram

This research considers a project scheduling problem with the object of minimizing weighted earliness-tardiness penalty costs, taking into account a deadline for the project and precedence relations among the activities. An exact recursive method has been proposed for solving the basic form of this problem. We present a new depth-first branch and bound algorithm for extended form of the problem, which time value of money is taken into account by discounting the cash flows. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported.

Flocking with connectivity preservation for disturbed nonlinear multi-agent systems by output feedback

NASA Astrophysics Data System (ADS)

Li, Ping; Zhang, Baoyong; Ma, Qian; Xu, Shengyuan; Chen, Weimin; Zhang, Zhengqiang

2018-05-01

This paper considers the problem of flocking with connectivity preservation for a class of disturbed nonlinear multi-agent systems. In order to deal with the nonlinearities in the dynamic of all agents, some auxiliary variables are introduced into the state observer for stability analysis. By proposing a bounded potential function and using adaptive theory, a novel output feedback consensus algorithm is developed to guarantee that the states of all agents achieve flocking with connectivity preservation.

Silica-coated gold nanorods as saturable absorber for bound-state pulse generation in a fiber laser with near-zero dispersion

NASA Astrophysics Data System (ADS)

Wang, Xude; Luo, Aiping; Luo, Zhichao; Liu, Meng; Zou, Feng; Zhu, Yanfang; Xue, Jianping; Xu, Wencheng

2017-11-01

We presented a bound-state operation in a fiber laser with near-zero anomalous dispersion based on a silica-coated gold nanorods (GNRs@SiO2) saturable absorber (SA). Using a balanced twin detector measurement technique, the modulation depth and nonsaturable loss of the GNRs@SiO2 SA were measured to be approximately 3.5% and 39.3%, respectively. By virtue of the highly nonlinear effect of the GNRs@SiO2 SA, the bound-state pulses could be easily observed. Besides the lower-order bound-state pulses with two, three, and four solitons, the higher-order bound states with up to 12 solitons were also obtained in the laser cavity. The pulse profiles of the higher-order bound states were further reconstructed theoretically. The experimental results would give further insight towards understanding the complex nonlinear dynamics of bound-state pulses in fiber lasers.

Visualizing chaperone-assisted protein folding

DOE PAGES

Horowitz, Scott; Salmon, Loïc; Koldewey, Philipp; ...

2016-05-30

We present that challenges in determining the structures of heterogeneous and dynamic protein complexes have greatly hampered past efforts to obtain a mechanistic understanding of many important biological processes. One such process is chaperone-assisted protein folding. Obtaining structural ensembles of chaperone–substrate complexes would ultimately reveal how chaperones help proteins fold into their native state. To address this problem, we devised a new structural biology approach based on X-ray crystallography, termed residual electron and anomalous density (READ). READ enabled us to visualize even sparsely populated conformations of the substrate protein immunity protein 7 (Im7) in complex with the Escherichia coli chaperonemore » Spy, and to capture a series of snapshots depicting the various folding states of Im7 bound to Spy. The ensemble shows that Spy-associated Im7 samples conformations ranging from unfolded to partially folded to native-like states and reveals how a substrate can explore its folding landscape while being bound to a chaperone.« less

Nature of a single doped hole in two-leg Hubbard and t - J ladders

DOE PAGES

Liu, Shenxiu; Jiang, Hong -Chen; Devereaux, Thomas P.

2016-10-15

In this study, we have systematically studied the single-hole problem in two-leg Hubbard and t–J ladders by large-scale density-matrix renormalization-group calculations. We found that the doped holes in both models behave similarly, while the three-site correlated hopping term is not important in determining the ground-state properties. For more insights, we have also calculated the elementary excitations, i.e., the energy gaps to the excited states of the system. In the strong-rung limit, we found that the doped hole behaves as a Bloch quasiparticle in both systems where the spin and charge of the doped hole are tightly bound together. In themore » isotropic limit, while the hole still behaves like a quasiparticle in the long-wavelength limit, our results show that its spin and charge components are only loosely bound together inside the quasiparticle, whose internal structure can lead to a visible residual effect which dramatically changes the local structure of the ground-state wave function.« less

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

Liu, Shenxiu; Jiang, Hong -Chen; Devereaux, Thomas P.

In this study, we have systematically studied the single-hole problem in two-leg Hubbard and t–J ladders by large-scale density-matrix renormalization-group calculations. We found that the doped holes in both models behave similarly, while the three-site correlated hopping term is not important in determining the ground-state properties. For more insights, we have also calculated the elementary excitations, i.e., the energy gaps to the excited states of the system. In the strong-rung limit, we found that the doped hole behaves as a Bloch quasiparticle in both systems where the spin and charge of the doped hole are tightly bound together. In themore » isotropic limit, while the hole still behaves like a quasiparticle in the long-wavelength limit, our results show that its spin and charge components are only loosely bound together inside the quasiparticle, whose internal structure can lead to a visible residual effect which dramatically changes the local structure of the ground-state wave function.« less

Consideration of plant behaviour in optimal servo-compensator design

NASA Astrophysics Data System (ADS)

Moase, W. H.; Manzie, C.

2016-07-01

Where the most prevalent optimal servo-compensator formulations penalise the behaviour of an error system, this paper considers the problem of additionally penalising the actual states and inputs of the plant. Doing so has the advantage of enabling the penalty function to better resemble an economic cost. This is especially true of problems where control effort needs to be sensibly allocated across weakly redundant inputs or where one wishes to use penalties to soft-constrain certain states or inputs. It is shown that, although the resulting cost function grows unbounded as its horizon approaches infinity, it is possible to formulate an equivalent optimisation problem with a bounded cost. The resulting optimisation problem is similar to those in earlier studies but has an additional 'correction term' in the cost function, and a set of equality constraints that arise when there are redundant inputs. A numerical approach to solve the resulting optimisation problem is presented, followed by simulations on a micro-macro positioner that illustrate the benefits of the proposed servo-compensator design approach.

New Mathematical Strategy Using Branch and Bound Method

NASA Astrophysics Data System (ADS)

Tarray, Tanveer Ahmad; Bhat, Muzafar Rasool

In this paper, the problem of optimal allocation in stratified random sampling is used in the presence of nonresponse. The problem is formulated as a nonlinear programming problem (NLPP) and is solved using Branch and Bound method. Also the results are formulated through LINGO.

Distributed Event-Based Set-Membership Filtering for a Class of Nonlinear Systems With Sensor Saturations Over Sensor Networks.

PubMed

Ma, Lifeng; Wang, Zidong; Lam, Hak-Keung; Kyriakoulis, Nikos

2017-11-01

In this paper, the distributed set-membership filtering problem is investigated for a class of discrete time-varying system with an event-based communication mechanism over sensor networks. The system under consideration is subject to sector-bounded nonlinearity, unknown but bounded noises and sensor saturations. Each intelligent sensing node transmits the data to its neighbors only when certain triggering condition is violated. By means of a set of recursive matrix inequalities, sufficient conditions are derived for the existence of the desired distributed event-based filter which is capable of confining the system state in certain ellipsoidal regions centered at the estimates. Within the established theoretical framework, two additional optimization problems are formulated: one is to seek the minimal ellipsoids (in the sense of matrix trace) for the best filtering performance, and the other is to maximize the triggering threshold so as to reduce the triggering frequency with satisfactory filtering performance. A numerically attractive chaos algorithm is employed to solve the optimization problems. Finally, an illustrative example is presented to demonstrate the effectiveness and applicability of the proposed algorithm.

The Biharmonic Oscillator and Asymmetric Linear Potentials: From Classical Trajectories to Momentum-Space Probability Densities in the Extreme Quantum Limit

ERIC Educational Resources Information Center

Ruckle, L. J.; Belloni, M.; Robinett, R. W.

2012-01-01

The biharmonic oscillator and the asymmetric linear well are two confining power-law-type potentials for which complete bound-state solutions are possible in both classical and quantum mechanics. We examine these problems in detail, beginning with studies of their trajectories in position and momentum space, evaluation of the classical probability…

Robustness of linear quadratic state feedback designs in the presence of system uncertainty. [application to Augmentor Wing Jet STOL Research Aircraft flare control autopilot design

NASA Technical Reports Server (NTRS)

Patel, R. V.; Toda, M.; Sridhar, B.

1977-01-01

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

Adaptive estimation of a time-varying phase with coherent states: Smoothing can give an unbounded improvement over filtering

NASA Astrophysics Data System (ADS)

Laverick, Kiarn T.; Wiseman, Howard M.; Dinani, Hossein T.; Berry, Dominic W.

2018-04-01

The problem of measuring a time-varying phase, even when the statistics of the variation is known, is considerably harder than that of measuring a constant phase. In particular, the usual bounds on accuracy, such as the 1 /(4 n ¯) standard quantum limit with coherent states, do not apply. Here, by restricting to coherent states, we are able to analytically obtain the achievable accuracy, the equivalent of the standard quantum limit, for a wide class of phase variation. In particular, we consider the case where the phase has Gaussian statistics and a power-law spectrum equal to κp -1/|ω| p for large ω , for some p >1 . For coherent states with mean photon flux N , we give the quantum Cramér-Rao bound on the mean-square phase error as [psin(π /p ) ] -1(4N /κ ) -(p -1 )/p . Next, we consider whether the bound can be achieved by an adaptive homodyne measurement in the limit N /κ ≫1 , which allows the photocurrent to be linearized. Applying the optimal filtering for the resultant linear Gaussian system, we find the same scaling with N , but with a prefactor larger by a factor of p . By contrast, if we employ optimal smoothing we can exactly obtain the quantum Cramér-Rao bound. That is, contrary to previously considered (p =2 ) cases of phase estimation, here the improvement offered by smoothing over filtering is not limited to a factor of 2 but rather can be unbounded by a factor of p . We also study numerically the performance of these estimators for an adaptive measurement in the limit where N /κ is not large and find a more complicated picture.

Monte Carlo simulation of a dynamical fermion problem: The light q sup 2 q sup 2 system

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

Grondin, G.

1991-01-01

We present results from a Guided Random Walk Monte Carlo simulation of the light q{sup 2}{bar q}{sup 2} system in a Coulomb-plus-linear quark potential model using an Intel iPSC/860 hypercube. A solvable model problem is first considered, after which we study the full q{sup 2}{bar q}{sup 2} system in (J,I) = (2,2) and (2,0) sectors. We find evidence for no bound states below the vector-vector threshold in these systems. 17 refs., 6 figs.

Completing the physical representation of quantum algorithms provides a retrocausal explanation of the speedup

NASA Astrophysics Data System (ADS)

Castagnoli, Giuseppe

2017-05-01

The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete as it lacks the initial measurement. We extend it to the process of setting the problem. An initial measurement selects a problem setting at random, and a unitary transformation sends it into the desired setting. The extended representation must be with respect to Bob, the problem setter, and any external observer. It cannot be with respect to Alice, the problem solver. It would tell her the problem setting and thus the solution of the problem implicit in it. In the representation to Alice, the projection of the quantum state due to the initial measurement should be postponed until the end of the quantum algorithm. In either representation, there is a unitary transformation between the initial and final measurement outcomes. As a consequence, the final measurement of any ℛ-th part of the solution could select back in time a corresponding part of the random outcome of the initial measurement; the associated projection of the quantum state should be advanced by the inverse of that unitary transformation. This, in the representation to Alice, would tell her, before she begins her problem solving action, that part of the solution. The quantum algorithm should be seen as a sum over classical histories in each of which Alice knows in advance one of the possible ℛ-th parts of the solution and performs the oracle queries still needed to find it - this for the value of ℛ that explains the algorithm's speedup. We have a relation between retrocausality ℛ and the number of oracle queries needed to solve an oracle problem quantumly. All the oracle problems examined can be solved with any value of ℛ up to an upper bound attained by the optimal quantum algorithm. This bound is always in the vicinity of 1/2 . Moreover, ℛ =1/2 always provides the order of magnitude of the number of queries needed to solve the problem in an optimal quantum way. If this were true for any oracle problem, as plausible, it would solve the quantum query complexity problem.

Faithful Squashed Entanglement

NASA Astrophysics Data System (ADS)

Brandão, Fernando G. S. L.; Christandl, Matthias; Yard, Jon

2011-09-01

Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, it is strictly positive if and only if the state is entangled. We derive the lower bound on squashed entanglement from a lower bound on the quantum conditional mutual information which is used to define squashed entanglement. The quantum conditional mutual information corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof is based on two recent results from quantum information theory: the operational interpretation of the quantum mutual information as the optimal rate for state redistribution and the interpretation of the regularised relative entropy of entanglement as an error exponent in hypothesis testing. The distance to the set of separable states is measured in terms of the LOCC norm, an operationally motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shared by two parties, using any protocol formed by local quantum operations and classical communication (LOCC) between the parties. A similar result for the Frobenius or Euclidean norm follows as an immediate consequence. The result has two applications in complexity theory. The first application is a quasipolynomial-time algorithm solving the weak membership problem for the set of separable states in LOCC or Euclidean norm. The second application concerns quantum Merlin-Arthur games. Here we show that multiple provers are not more powerful than a single prover when the verifier is restricted to LOCC operations thereby providing a new characterisation of the complexity class QMA.

Biology's built-in Faraday cages

NASA Astrophysics Data System (ADS)

Klee, Maurice M.

2014-05-01

Biological fluids are water-based, ionic conductors. As such, they have both high relative dielectric constants and substantial conductivities, meaning they are lossy dielectrics. These fluids contain charged molecules (free charges), whose movements play roles in essentially all cellular processes from metabolism to communication with other cells. Using the problem of a point source in air above a biological fluid of semi-infinite extent, the bound charges in the fluid are shown to perform the function of a fast-acting Faraday cage, which protects the interior of the fluid from external electric fields. Free charges replace bound charges in accordance with the fluid's relaxation time, thereby providing a smooth transition between the initial protection provided by the bound charges and the steady state protection provided by the free charges. The electric fields within the biological fluid are thus small for all times just as they would be inside a classical Faraday cage.

Disturbance observer-based adaptive sliding mode hybrid projective synchronisation of identical fractional-order financial systems

NASA Astrophysics Data System (ADS)

Khan, Ayub; Tyagi, Arti

2018-05-01

In this paper, we have studied the hybrid projective synchronisation for incommensurate, integer and commensurate fractional-order financial systems with unknown disturbance. To tackle the problem of unknown bounded disturbance, fractional-order disturbance observer is designed to approximate the unknown disturbance. Further, we have introduced simple sliding mode surface and designed adaptive sliding mode controllers incorporating with the designed fractional-order disturbance observer to achieve a bounded hybrid projective synchronisation between two identical fractional-order financial model with different initial conditions. It is shown that the slave system with disturbance can be synchronised with the projection of the master system generated through state transformation. Simulation results are presented to ensure the validity and effectiveness of the proposed sliding mode control scheme in the presence of external bounded unknown disturbance. Also, synchronisation error for commensurate, integer and incommensurate fractional-order financial systems is studied in numerical simulation.

Comments on Samal and Henderson: Parallel consistent labeling algorithms

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

Swain, M.J.

Samal and Henderson claim that any parallel algorithm for enforcing arc consistency in the worst case must have {Omega}(na) sequential steps, where n is the number of nodes, and a is the number of labels per node. The authors argue that Samal and Henderon's argument makes assumptions about how processors are used and give a counterexample that enforces arc consistency in a constant number of steps using O(n{sup 2}a{sup 2}2{sup na}) processors. It is possible that the lower bound holds for a polynomial number of processors; if such a lower bound were to be proven it would answer an importantmore » open question in theoretical computer science concerning the relation between the complexity classes P and NC. The strongest existing lower bound for the arc consistency problem states that it cannot be solved in polynomial log time unless P = NC.« less

Sanity check for NN bound states in lattice QCD with Lüscher's finite volume formula - Disclosing Symptoms of Fake Plateaux -

NASA Astrophysics Data System (ADS)

Aoki, Sinya; Doi, Takumi; Iritani, Takumi

2018-03-01

The sanity check is to rule out certain classes of obviously false results, not to catch every possible error. After reviewing such a sanity check for NN bound states with the Lüscher's finite volume formula [1-3], we give further evidences for the operator dependence of plateaux, a symptom of the fake plateau problem, against the claim [4]. We then present our critical comments on [5] by NPLQCD: (i) Operator dependences of plateaux in NPL2013 [6, 7] exist with the P value of 4-5%. (ii) The volume independence of plateaux in NPL2013 does not prove their correctness. (iii) Effective range expansions (EREs) in NPL2013 violate the physical pole condition. (iv) Their comment is partly based on new data and analysis different from the original ones. (v) Their new ERE does not satisfy the Lüscher's finite volume formula.

Bounds on complex polarizabilities and a new perspective on scattering by a lossy inclusion

NASA Astrophysics Data System (ADS)

Milton, Graeme W.

2017-09-01

Here, we obtain explicit formulas for bounds on the complex electrical polarizability at a given frequency of an inclusion with known volume that follow directly from the quasistatic bounds of Bergman and Milton on the effective complex dielectric constant of a two-phase medium. We also describe how analogous bounds on the orientationally averaged bulk and shear polarizabilities at a given frequency can be obtained from bounds on the effective complex bulk and shear moduli of a two-phase medium obtained by Milton, Gibiansky, and Berryman, using the quasistatic variational principles of Cherkaev and Gibiansky. We also show how the polarizability problem and the acoustic scattering problem can both be reformulated in an abstract setting as "Y problems." In the acoustic scattering context, to avoid explicit introduction of the Sommerfeld radiation condition, we introduce auxiliary fields at infinity and an appropriate "constitutive law" there, which forces the Sommerfeld radiation condition to hold. As a consequence, we obtain minimization variational principles for acoustic scattering that can be used to obtain bounds on the complex backwards scattering amplitude. Some explicit elementary bounds are given.

Universal bounds on charged states in 2d CFT and 3d gravity

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

Benjamin, Nathan; Dyer, Ethan; Fitzpatrick, A. Liam

2016-08-04

We derive an explicit bound on the dimension of the lightest charged state in two dimensional conformal field theories with a global abelian symmetry. We find that the bound scales with c and provide examples that parametrically saturate this bound. We also prove that any such theory must contain a state with charge-to-mass ratio above a minimal lower bound. As a result, we comment on the implications for charged states in three dimensional theories of gravity.

Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks

NASA Astrophysics Data System (ADS)

Luo, Ming-Xing

2018-04-01

The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The main problem is that no computationally efficient method is available for constructing useful Bell inequalities for general quantum networks. In this work, we show a significant improvement by presenting new, explicit Bell-type inequalities for general networks including cyclic networks. These nonlinear inequalities are related to the matching problem of an equivalent unweighted bipartite graph that allows constructing a polynomial-time algorithm. For the quantum resources consisting of bipartite entangled pure states and generalized Greenberger-Horne-Zeilinger (GHZ) states, we prove the generic nonmultilocality of quantum networks with multiple independent observers using new Bell inequalities. The violations are maximal with respect to the presented Tsirelson's bound for Einstein-Podolsky-Rosen states and GHZ states. Moreover, these violations hold for Werner states or some general noisy states. Our results suggest that the presented Bell inequalities can be used to characterize experimental quantum networks.

Photon-assisted tunneling through a topological superconductor with Majorana bound states

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

Tang, Han-Zhao; Zhang, Ying-Tao, E-mail: zhangyt@mail.hebtu.edu.cn; Liu, Jian-Jun, E-mail: liujj@mail.hebtu.edu.cn

Employing the Keldysh Nonequilibrium Green’s function method, we investigate time-dependent transport through a topological superconductor with Majorana bound states in the presence of a high frequency microwave field. It is found that Majorana bound states driven by photon-assisted tunneling can absorb(emit) photons and the resulting photon-assisted tunneling side band peaks can split the Majorana bound state that then appears at non-zero bias. This splitting breaks from the current opinion that Majorana bound states appear only at zero bias and thus provides a new experimental method for detecting Majorana bound states in the Non-zero-energy mode. We not only demonstrate that themore » photon-assisted tunneling side band peaks are due to Non-zero-energy Majorana bound states, but also that the height of the photon-assisted tunneling side band peaks is related to the intensity of the microwave field. It is further shown that the time-varying conductance induced by the Majorana bound states shows negative values for a certain period of time, which corresponds to a manifestation of the phase coherent time-varying behavior in mesoscopic systems.« less

Control of discrete event systems modeled as hierarchical state machines

NASA Technical Reports Server (NTRS)

Brave, Y.; Heymann, M.

1991-01-01

The authors examine a class of discrete event systems (DESs) modeled as asynchronous hierarchical state machines (AHSMs). For this class of DESs, they provide an efficient method for testing reachability, which is an essential step in many control synthesis procedures. This method utilizes the asynchronous nature and hierarchical structure of AHSMs, thereby illustrating the advantage of the AHSM representation as compared with its equivalent (flat) state machine representation. An application of the method is presented where an online minimally restrictive solution is proposed for the problem of maintaining a controlled AHSM within prescribed legal bounds.

Convergence of Distributed Optimal Controls on the Internal Energy in Mixed Elliptic Problems when the Heat Transfer Coefficient Goes to Infinity

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

Gariboldi, C.; E-mail: cgariboldi@exa.unrc.edu.ar; Tarzia, D.

2003-05-21

We consider a steady-state heat conduction problem P{sub {alpha}} with mixed boundary conditions for the Poisson equation depending on a positive parameter {alpha} , which represents the heat transfer coefficient on a portion {gamma} {sub 1} of the boundary of a given bounded domain in R{sup n} . We formulate distributed optimal control problems over the internal energy g for each {alpha}. We prove that the optimal control g{sub o}p{sub {alpha}} and its corresponding system u{sub go}p{sub {alpha}}{sub {alpha}} and adjoint p{sub go}p{sub {alpha}}{sub {alpha}} states for each {alpha} are strongly convergent to g{sub op},u{sub gop} and p{sub gop} ,more » respectively, in adequate functional spaces. We also prove that these limit functions are respectively the optimal control, and the system and adjoint states corresponding to another distributed optimal control problem for the same Poisson equation with a different boundary condition on the portion {gamma}{sub 1} . We use the fixed point and elliptic variational inequality theories.« less

Quantum dynamics modeled by interacting trajectories

NASA Astrophysics Data System (ADS)

Cruz-Rodríguez, L.; Uranga-Piña, L.; Martínez-Mesa, A.; Meier, C.

2018-03-01

We present quantum dynamical simulations based on the propagation of interacting trajectories where the effect of the quantum potential is mimicked by effective pseudo-particle interactions. The method is applied to several quantum systems, both for bound and scattering problems. For the bound systems, the quantum ground state density and zero point energy are shown to be perfectly obtained by the interacting trajectories. In the case of time-dependent quantum scattering, the Eckart barrier and uphill ramp are considered, with transmission coefficients in very good agreement with standard quantum calculations. Finally, we show that via wave function synthesis along the trajectories, correlation functions and energy spectra can be obtained based on the dynamics of interacting trajectories.

Nonlinear Thermal Instability in Compressible Viscous Flows Without Heat Conductivity

NASA Astrophysics Data System (ADS)

Jiang, Fei

2018-04-01

We investigate the thermal instability of a smooth equilibrium state, in which the density function satisfies Schwarzschild's (instability) condition, to a compressible heat-conducting viscous flow without heat conductivity in the presence of a uniform gravitational field in a three-dimensional bounded domain. We show that the equilibrium state is linearly unstable by a modified variational method. Then, based on the constructed linearly unstable solutions and a local well-posedness result of classical solutions to the original nonlinear problem, we further construct the initial data of linearly unstable solutions to be the one of the original nonlinear problem, and establish an appropriate energy estimate of Gronwall-type. With the help of the established energy estimate, we finally show that the equilibrium state is nonlinearly unstable in the sense of Hadamard by a careful bootstrap instability argument.

Search-based optimization

NASA Technical Reports Server (NTRS)

Wheeler, Ward C.

2003-01-01

The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

Reformulation of the covering and quantizer problems as ground states of interacting particles.

PubMed

Torquato, S

2010-11-01

It is known that the sphere-packing problem and the number-variance problem (closely related to an optimization problem in number theory) can be posed as energy minimizations associated with an infinite number of point particles in d-dimensional Euclidean space R(d) interacting via certain repulsive pair potentials. We reformulate the covering and quantizer problems as the determination of the ground states of interacting particles in R(d) that generally involve single-body, two-body, three-body, and higher-body interactions. This is done by linking the covering and quantizer problems to certain optimization problems involving the "void" nearest-neighbor functions that arise in the theory of random media and statistical mechanics. These reformulations, which again exemplify the deep interplay between geometry and physics, allow one now to employ theoretical and numerical optimization techniques to analyze and solve these energy minimization problems. The covering and quantizer problems have relevance in numerous applications, including wireless communication network layouts, the search of high-dimensional data parameter spaces, stereotactic radiation therapy, data compression, digital communications, meshing of space for numerical analysis, and coding and cryptography, among other examples. In the first three space dimensions, the best known solutions of the sphere-packing and number-variance problems (or their "dual" solutions) are directly related to those of the covering and quantizer problems, but such relationships may or may not exist for d≥4 , depending on the peculiarities of the dimensions involved. Our reformulation sheds light on the reasons for these similarities and differences. We also show that disordered saturated sphere packings provide relatively thin (economical) coverings and may yield thinner coverings than the best known lattice coverings in sufficiently large dimensions. In the case of the quantizer problem, we derive improved upper bounds on the quantizer error using sphere-packing solutions, which are generally substantially sharper than an existing upper bound in low to moderately large dimensions. We also demonstrate that disordered saturated sphere packings yield relatively good quantizers. Finally, we remark on possible applications of our results for the detection of gravitational waves.

Reformulation of the covering and quantizer problems as ground states of interacting particles

NASA Astrophysics Data System (ADS)

Torquato, S.

2010-11-01

It is known that the sphere-packing problem and the number-variance problem (closely related to an optimization problem in number theory) can be posed as energy minimizations associated with an infinite number of point particles in d -dimensional Euclidean space Rd interacting via certain repulsive pair potentials. We reformulate the covering and quantizer problems as the determination of the ground states of interacting particles in Rd that generally involve single-body, two-body, three-body, and higher-body interactions. This is done by linking the covering and quantizer problems to certain optimization problems involving the “void” nearest-neighbor functions that arise in the theory of random media and statistical mechanics. These reformulations, which again exemplify the deep interplay between geometry and physics, allow one now to employ theoretical and numerical optimization techniques to analyze and solve these energy minimization problems. The covering and quantizer problems have relevance in numerous applications, including wireless communication network layouts, the search of high-dimensional data parameter spaces, stereotactic radiation therapy, data compression, digital communications, meshing of space for numerical analysis, and coding and cryptography, among other examples. In the first three space dimensions, the best known solutions of the sphere-packing and number-variance problems (or their “dual” solutions) are directly related to those of the covering and quantizer problems, but such relationships may or may not exist for d≥4 , depending on the peculiarities of the dimensions involved. Our reformulation sheds light on the reasons for these similarities and differences. We also show that disordered saturated sphere packings provide relatively thin (economical) coverings and may yield thinner coverings than the best known lattice coverings in sufficiently large dimensions. In the case of the quantizer problem, we derive improved upper bounds on the quantizer error using sphere-packing solutions, which are generally substantially sharper than an existing upper bound in low to moderately large dimensions. We also demonstrate that disordered saturated sphere packings yield relatively good quantizers. Finally, we remark on possible applications of our results for the detection of gravitational waves.

I. Aspects of the Dark Matter Problem. II. Fermion Balls

NASA Astrophysics Data System (ADS)

Tetradis, Nikolaos Athanassiou

The first part of this thesis deals with the dark matter problem. A simple non-supersymmetric extension of the standard model is presented, which provides dark matter candidates not excluded by the existing dark matter searches. The simplest candidate is the neutral component of a zero hypercharge triplet, with vector gauge interactions. The upper bound on its mass is a few TeV. We also discuss possible modifications of the standard freeze-out scenario, induced by the presence of a phase transition. More specifically, if the critical temperature of the electroweak phase transition is sufficiently small, it can change the final abundances of heavy dark matter particles, by keeping them massless for a long time. Recent experimental bounds on the Higgs mass from LEP imply that this is not the case in the minimal standard model. In the second part we discuss non-trivial configurations, involving fermions which obtain their mass through Yukawa interactions with a scalar field. Under certain conditions, the vacuum expectation value of the scalar field is shifted from the minimum of the effective potential, in regions of high fermion density. This may result in the formation of fermion bound states. We study two such cases: (a) Using the non-linear SU(3)L times SU(3)R chiral Lagrangian coupled to a field theory of nuclear forces, we show that a bound state of baryons with a well defined surface may concievably form in the presence of kaon condensation. This state is of similar density to ordinary nuclei, but has net strangeness equal to about two thirds the baryon number. We discuss the properties of lumps of strange baryon matter with baryon number between ~20 and ~10 57 where gravitational effects become important. (b) The Higgs field near a very heavy top quark or any other heavy fermion is expected to be significantly deformed. By computing explicit solutions of the classical equations of motion for a spherically symmetric configuration without gauge fields, we show that in the standard model this cannot happen without violating either vacuum stability or perturbation theory at energies very close to the top quark mass.

Distributing Earthquakes Among California's Faults: A Binary Integer Programming Approach

NASA Astrophysics Data System (ADS)

Geist, E. L.; Parsons, T.

2016-12-01

Statement of the problem is simple: given regional seismicity specified by a Gutenber-Richter (G-R) relation, how are earthquakes distributed to match observed fault-slip rates? The objective is to determine the magnitude-frequency relation on individual faults. The California statewide G-R b-value and a-value are estimated from historical seismicity, with the a-value accounting for off-fault seismicity. UCERF3 consensus slip rates are used, based on geologic and geodetic data and include estimates of coupling coefficients. The binary integer programming (BIP) problem is set up such that each earthquake from a synthetic catalog spanning millennia can occur at any location along any fault. The decision vector, therefore, consists of binary variables, with values equal to one indicating the location of each earthquake that results in an optimal match of slip rates, in an L1-norm sense. Rupture area and slip associated with each earthquake are determined from a magnitude-area scaling relation. Uncertainty bounds on the UCERF3 slip rates provide explicit minimum and maximum constraints to the BIP model, with the former more important to feasibility of the problem. There is a maximum magnitude limit associated with each fault, based on fault length, providing an implicit constraint. Solution of integer programming problems with a large number of variables (>105 in this study) has been possible only since the late 1990s. In addition to the classic branch-and-bound technique used for these problems, several other algorithms have been recently developed, including pre-solving, sifting, cutting planes, heuristics, and parallelization. An optimal solution is obtained using a state-of-the-art BIP solver for M≥6 earthquakes and California's faults with slip-rates > 1 mm/yr. Preliminary results indicate a surprising diversity of on-fault magnitude-frequency relations throughout the state.

A Simple Algorithm for the Metric Traveling Salesman Problem

NASA Technical Reports Server (NTRS)

Grimm, M. J.

1984-01-01

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Structural and dynamical properties of recombining ultracold neutral plasma

NASA Astrophysics Data System (ADS)

Tiwari, Sanat Kumar; Shaffer, Nathaniel R.; Baalrud, Scott D.

2017-10-01

An ultracold plasma (UCP) is an evolving collection of free charges and bound charges (Rydberg atoms). Over time, bound species concentration increases due to recombination. We present the structural and dynamical properties of an evolving UCP using classical molecular dynamics simulation. Coulomb collapse is avoided using a repulsive core with the attractive Coulomb potential. The repulsive core size controls the concentration of bound states, as it determines the depth of the potential well between opposite charges. We vary the repulsive core size to emulate the quasi-static state of plasma at different time during the evolution. Binary, chain and ring-like bound states are observed in the simulation carried out at different coupling strengths and repulsive core size. The effect of bound states can be seen as molecular peaks in the radial distribution function (RDF). The thermodynamic properties associated with the free charges can be analyzed from RDF by separating free from bound states. These bound states also change the dynamical properties of the plasma. The electron velocity auto-correlation displays oscillations due to the orbital motion in bound states. These bound states act like a neutral species, damping electron plasmon modes and broadening the ion acoustic mode. This work is supported by AFOSR Grant Number FA9550-16-1-0221. It used computational resources by XSEDE, which is supported by NSF Grant Number ACI-1053575.

Towards the Solution of the Many-Electron Problem in Real Materials: Equation of State of the Hydrogen Chain with State-of-the-Art Many-Body Methods

DOE PAGES

Motta, Mario; Ceperley, David M.; Chan, Garnet Kin-Lic; ...

2017-09-28

We present numerical results for the equation of state of an infinite chain of hydrogen atoms. A variety of modern many-body methods are employed, with exhaustive cross-checks and validation. Approaches for reaching the continuous space limit and the thermodynamic limit are investigated, proposed, and tested. The detailed comparisons provide a benchmark for assessing the current state of the art in many-body computation, and for the development of new methods. The ground-state energy per atom in the linear chain is accurately determined versus bond length, with a confidence bound given on all uncertainties.

Towards the Solution of the Many-Electron Problem in Real Materials: Equation of State of the Hydrogen Chain with State-of-the-Art Many-Body Methods

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

Motta, Mario; Ceperley, David M.; Chan, Garnet Kin-Lic

We present numerical results for the equation of state of an infinite chain of hydrogen atoms. A variety of modern many-body methods are employed, with exhaustive cross-checks and validation. Approaches for reaching the continuous space limit and the thermodynamic limit are investigated, proposed, and tested. The detailed comparisons provide a benchmark for assessing the current state of the art in many-body computation, and for the development of new methods. The ground-state energy per atom in the linear chain is accurately determined versus bond length, with a confidence bound given on all uncertainties.

The analytical transfer matrix method for PT-symmetric complex potential

NASA Astrophysics Data System (ADS)

Naceri, Leila; Hammou, Amine B.

2017-07-01

We have extended the analytical transfer matrix (ATM) method to solve quantum mechanical bound state problems with complex PT-symmetric potentials. Our work focuses on a class of models studied by Bender and Jones, we calculate the energy eigenvalues, discuss the critical values of g and compare the results with those obtained from other methods such as exact numerical computation and WKB approximation method.

Discrete diffraction managed solitons: Threshold phenomena and rapid decay for general nonlinearities

NASA Astrophysics Data System (ADS)

Choi, Mi-Ran; Hundertmark, Dirk; Lee, Young-Ran

2017-10-01

We prove a threshold phenomenon for the existence/non-existence of energy minimizing solitary solutions of the diffraction management equation for strictly positive and zero average diffraction. Our methods allow for a large class of nonlinearities; they are, for example, allowed to change sign, and the weakest possible condition, it only has to be locally integrable, on the local diffraction profile. The solutions are found as minimizers of a nonlinear and nonlocal variational problem which is translation invariant. There exists a critical threshold λcr such that minimizers for this variational problem exist if their power is bigger than λcr and no minimizers exist with power less than the critical threshold. We also give simple criteria for the finiteness and strict positivity of the critical threshold. Our proof of existence of minimizers is rather direct and avoids the use of Lions' concentration compactness argument. Furthermore, we give precise quantitative lower bounds on the exponential decay rate of the diffraction management solitons, which confirm the physical heuristic prediction for the asymptotic decay rate. Moreover, for ground state solutions, these bounds give a quantitative lower bound for the divergence of the exponential decay rate in the limit of vanishing average diffraction. For zero average diffraction, we prove quantitative bounds which show that the solitons decay much faster than exponentially. Our results considerably extend and strengthen the results of Hundertmark and Lee [J. Nonlinear Sci. 22, 1-38 (2012) and Commun. Math. Phys. 309(1), 1-21 (2012)].

Optimal Recall from Bounded Metaplastic Synapses: Predicting Functional Adaptations in Hippocampal Area CA3

PubMed Central

Savin, Cristina; Dayan, Peter; Lengyel, Máté

2014-01-01

A venerable history of classical work on autoassociative memory has significantly shaped our understanding of several features of the hippocampus, and most prominently of its CA3 area, in relation to memory storage and retrieval. However, existing theories of hippocampal memory processing ignore a key biological constraint affecting memory storage in neural circuits: the bounded dynamical range of synapses. Recent treatments based on the notion of metaplasticity provide a powerful model for individual bounded synapses; however, their implications for the ability of the hippocampus to retrieve memories well and the dynamics of neurons associated with that retrieval are both unknown. Here, we develop a theoretical framework for memory storage and recall with bounded synapses. We formulate the recall of a previously stored pattern from a noisy recall cue and limited-capacity (and therefore lossy) synapses as a probabilistic inference problem, and derive neural dynamics that implement approximate inference algorithms to solve this problem efficiently. In particular, for binary synapses with metaplastic states, we demonstrate for the first time that memories can be efficiently read out with biologically plausible network dynamics that are completely constrained by the synaptic plasticity rule, and the statistics of the stored patterns and of the recall cue. Our theory organises into a coherent framework a wide range of existing data about the regulation of excitability, feedback inhibition, and network oscillations in area CA3, and makes novel and directly testable predictions that can guide future experiments. PMID:24586137

Graphs and matroids weighted in a bounded incline algebra.

PubMed

Lu, Ling-Xia; Zhang, Bei

2014-01-01

Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.

Bound states in string nets

NASA Astrophysics Data System (ADS)

Schulz, Marc Daniel; Dusuel, Sébastien; Vidal, Julien

2016-11-01

We discuss the emergence of bound states in the low-energy spectrum of the string-net Hamiltonian in the presence of a string tension. In the ladder geometry, we show that a single bound state arises either for a finite tension or in the zero-tension limit depending on the theory considered. In the latter case, we perturbatively compute the binding energy as a function of the total quantum dimension. We also address this issue in the honeycomb lattice where the number of bound states in the topological phase depends on the total quantum dimension. Finally, the internal structure of these bound states is analyzed in the zero-tension limit.

Study of molecular N D bound states in the Bethe-Salpeter equation approach

NASA Astrophysics Data System (ADS)

Wang, Zhen-Yang; Qi, Jing-Juan; Guo, Xin-Heng; Wei, Ke-Wei

2018-05-01

We study the Λc(2595 )+ and Σc(2800 )0 states as the N D bound systems in the Bethe-Salpeter formalism in the ladder and instantaneous approximations. With the kernel induced by ρ , ω and σ exchanges, we solve the Bethe-Salpeter equations for the N D bound systems numerically and find that the bound states may exist. We assume that the observed states Λc(2595 )+ and Σc(2800 )0 are S -wave N D molecular bound states and calculate the decay widths of Λc(2595 )+→Σc0π+ and Σc(2800 )0→Λc+π-.

Adaptive Fuzzy Output-Constrained Fault-Tolerant Control of Nonlinear Stochastic Large-Scale Systems With Actuator Faults.

PubMed

Li, Yongming; Ma, Zhiyao; Tong, Shaocheng

2017-09-01

The problem of adaptive fuzzy output-constrained tracking fault-tolerant control (FTC) is investigated for the large-scale stochastic nonlinear systems of pure-feedback form. The nonlinear systems considered in this paper possess the unstructured uncertainties, unknown interconnected terms and unknown nonaffine nonlinear faults. The fuzzy logic systems are employed to identify the unknown lumped nonlinear functions so that the problems of structured uncertainties can be solved. An adaptive fuzzy state observer is designed to solve the nonmeasurable state problem. By combining the barrier Lyapunov function theory, adaptive decentralized and stochastic control principles, a novel fuzzy adaptive output-constrained FTC approach is constructed. All the signals in the closed-loop system are proved to be bounded in probability and the system outputs are constrained in a given compact set. Finally, the applicability of the proposed controller is well carried out by a simulation example.

(Quasi)-convexification of Barta's (multi-extrema) bounding theorem: Inf_x\\big(\\ssty\\frac{H\\Phi(x)}{\\Phi(x)} \\big) \\le E_gr \\le Sup_x \\big(\\ssty\\frac{H\\Phi(x)}{\\Phi(x)} \\big)

NASA Astrophysics Data System (ADS)

Handy, C. R.

2006-03-01

There has been renewed interest in the exploitation of Barta's configuration space theorem (BCST) (Barta 1937 C. R. Acad. Sci. Paris 204 472) which bounds the ground-state energy, Inf_x\\big({{H\\Phi(x)}\\over {\\Phi(x)}} \\big ) \\leq E_gr \\leq Sup_x \\big({{H\\Phi(x)}\\over {\\Phi(x)}}\\big) , by using any Φ lying within the space of positive, bounded, and sufficiently smooth functions, {\\cal C} . Mouchet's (Mouchet 2005 J. Phys. A: Math. Gen. 38 1039) BCST analysis is based on gradient optimization (GO). However, it overlooks significant difficulties: (i) appearance of multi-extrema; (ii) inefficiency of GO for stiff (singular perturbation/strong coupling) problems; (iii) the nonexistence of a systematic procedure for arbitrarily improving the bounds within {\\cal C} . These deficiencies can be corrected by transforming BCST into a moments' representation equivalent, and exploiting a generalization of the eigenvalue moment method (EMM), within the context of the well-known generalized eigenvalue problem (GEP), as developed here. EMM is an alternative eigenenergy bounding, variational procedure, overlooked by Mouchet, which also exploits the positivity of the desired physical solution. Furthermore, it is applicable to Hermitian and non-Hermitian systems with complex-number quantization parameters (Handy and Bessis 1985 Phys. Rev. Lett. 55 931, Handy et al 1988 Phys. Rev. Lett. 60 253, Handy 2001 J. Phys. A: Math. Gen. 34 5065, Handy et al 2002 J. Phys. A: Math. Gen. 35 6359). Our analysis exploits various quasi-convexity/concavity theorems common to the GEP representation. We outline the general theory, and present some illustrative examples.

Relaxation versus adiabatic quantum steady-state preparation

NASA Astrophysics Data System (ADS)

Venuti, Lorenzo Campos; Albash, Tameem; Marvian, Milad; Lidar, Daniel; Zanardi, Paolo

2017-04-01

Adiabatic preparation of the ground states of many-body Hamiltonians in the closed-system limit is at the heart of adiabatic quantum computation, but in reality systems are always open. This motivates a natural comparison between, on the one hand, adiabatic preparation of steady states of Lindbladian generators and, on the other hand, relaxation towards the same steady states subject to the final Lindbladian of the adiabatic process. In this work we thus adopt the perspective that the goal is the most efficient possible preparation of such steady states, rather than ground states. Using known rigorous bounds for the open-system adiabatic theorem and for mixing times, we are then led to a disturbing conclusion that at first appears to doom efforts to build physical quantum annealers: relaxation seems to always converge faster than adiabatic preparation. However, by carefully estimating the adiabatic preparation time for Lindbladians describing thermalization in the low-temperature limit, we show that there is, after all, room for an adiabatic speedup over relaxation. To test the analytically derived bounds for the adiabatic preparation time and the relaxation time, we numerically study three models: a dissipative quasifree fermionic chain, a single qubit coupled to a thermal bath, and the "spike" problem of n qubits coupled to a thermal bath. Via these models we find that the answer to the "which wins" question depends for each model on the temperature and the system-bath coupling strength. In the case of the "spike" problem we find that relaxation during the adiabatic evolution plays an important role in ensuring a speedup over the final-time relaxation procedure. Thus, relaxation-assisted adiabatic preparation can be more efficient than both pure adiabatic evolution and pure relaxation.

Distinguishing topological Majorana bound states from trivial Andreev bound states: Proposed tests through differential tunneling conductance spectroscopy

NASA Astrophysics Data System (ADS)

Liu, Chun-Xiao; Sau, Jay D.; Das Sarma, S.

2018-06-01

Trivial Andreev bound states arising from chemical-potential variations could lead to zero-bias tunneling conductance peaks at finite magnetic field in class-D nanowires, precisely mimicking the predicted zero-bias conductance peaks arising from the topological Majorana bound states. This finding raises a serious question on the efficacy of using zero-bias tunneling conductance peaks, by themselves, as evidence supporting the existence of topological Majorana bound states in nanowires. In the current work, we provide specific experimental protocols for tunneling spectroscopy measurements to distinguish between Andreev and Majorana bound states without invoking more demanding nonlocal measurements which have not yet been successfully performed in nanowire systems. In particular, we discuss three distinct experimental schemes involving the response of the zero-bias peak to local perturbations of the tunnel barrier, the overlap of bound states from the wire ends, and, most compellingly, introducing a sharp localized potential in the wire itself to perturb the zero-bias tunneling peaks. We provide extensive numerical simulations clarifying and supporting our theoretical predictions.

Microscopic observation of magnon bound states and their dynamics.

PubMed

Fukuhara, Takeshi; Schauß, Peter; Endres, Manuel; Hild, Sebastian; Cheneau, Marc; Bloch, Immanuel; Gross, Christian

2013-10-03

The existence of bound states of elementary spin waves (magnons) in one-dimensional quantum magnets was predicted almost 80 years ago. Identifying signatures of magnon bound states has so far remained the subject of intense theoretical research, and their detection has proved challenging for experiments. Ultracold atoms offer an ideal setting in which to find such bound states by tracking the spin dynamics with single-spin and single-site resolution following a local excitation. Here we use in situ correlation measurements to observe two-magnon bound states directly in a one-dimensional Heisenberg spin chain comprising ultracold bosonic atoms in an optical lattice. We observe the quantum dynamics of free and bound magnon states through time-resolved measurements of two spin impurities. The increased effective mass of the compound magnon state results in slower spin dynamics as compared to single-magnon excitations. We also determine the decay time of bound magnons, which is probably limited by scattering on thermal fluctuations in the system. Our results provide a new way of studying fundamental properties of quantum magnets and, more generally, properties of interacting impurities in quantum many-body systems.

Gaussian Mean Field Lattice Gas

NASA Astrophysics Data System (ADS)

Scoppola, Benedetto; Troiani, Alessio

2018-03-01

We study rigorously a lattice gas version of the Sherrington-Kirckpatrick spin glass model. In discrete optimization literature this problem is known as unconstrained binary quadratic programming and it belongs to the class NP-hard. We prove that the fluctuations of the ground state energy tend to vanish in the thermodynamic limit, and we give a lower bound of such ground state energy. Then we present a heuristic algorithm, based on a probabilistic cellular automaton, which seems to be able to find configurations with energy very close to the minimum, even for quite large instances.

A game theoretic approach to a finite-time disturbance attenuation problem

NASA Technical Reports Server (NTRS)

Rhee, Ihnseok; Speyer, Jason L.

1991-01-01

A disturbance attenuation problem over a finite-time interval is considered by a game theoretic approach where the control, restricted to a function of the measurement history, plays against adversaries composed of the process and measurement disturbances, and the initial state. A zero-sum game, formulated as a quadratic cost criterion subject to linear time-varying dynamics and measurements, is solved by a calculus of variation technique. By first maximizing the quadratic cost criterion with respect to the process disturbance and initial state, a full information game between the control and the measurement residual subject to the estimator dynamics results. The resulting solution produces an n-dimensional compensator which expresses the controller as a linear combination of the measurement history. A disturbance attenuation problem is solved based on the results of the game problem. For time-invariant systems it is shown that under certain conditions the time-varying controller becomes time-invariant on the infinite-time interval. The resulting controller satisfies an H(infinity) norm bound.

Generation of bound states of pulses in a SESAM mode-locked Cr:ZnSe laser

NASA Astrophysics Data System (ADS)

Bu, Xiangbao; Shi, Yuhang; Xu, Jia; Li, Huijuan; Wang, Pu

2018-06-01

We report on the generation of bound states of pulses in a SESAM mode-locked Cr:ZnSe laser around 2415 nm. A thulium-doped double-clad fiber laser at 1908 nm was used as the pump source. Bound states with various pulse separations at different dispersion regimes were obtained. Especially, in the anomalous dispersion regime, vibrating bound state of solitons exhibiting an evolving phase was obtained.

Bound entangled states with a private key and their classical counterpart.

PubMed

Ozols, Maris; Smith, Graeme; Smolin, John A

2014-03-21

Entanglement is a fundamental resource for quantum information processing. In its pure form, it allows quantum teleportation and sharing classical secrets. Realistic quantum states are noisy and their usefulness is only partially understood. Bound-entangled states are central to this question--they have no distillable entanglement, yet sometimes still have a private classical key. We present a construction of bound-entangled states with a private key based on classical probability distributions. From this emerge states possessing a new classical analogue of bound entanglement, distinct from the long-sought bound information. We also find states of smaller dimensions and higher key rates than previously known. Our construction has implications for classical cryptography: we show that existing protocols are insufficient for extracting private key from our distributions due to their "bound-entangled" nature. We propose a simple extension of existing protocols that can extract a key from them.

BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks

PubMed Central

Li, Peng; Huang, Chuanhe; Liu, Qin

2014-01-01

In vehicular ad hoc networks, roadside units (RSUs) placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP) for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU) and wireless RSU (w-RSU). c-RSUs are interconnected through wired lines, and they form the backbone of VANETs, while w-RSUs connect to other RSUs through wireless communication and serve as an economical extension of the coverage of c-RSUs. The delay-bounded coverage range and deployment cost of these two cases are totally different. We are given a budget constraint and a delay bound, the problem is how to find the optimal candidate sites with the maximal delay-bounded coverage to place RSUs such that a message from any c-RSU in the region can be disseminated to the more vehicles within the given budget constraint and delay bound. We first prove that the BCDP problem is NP-hard. Then we propose several algorithms to solve the BCDP problem. Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods. PMID:25436656

77 FR 31830 - Opportunity for Designation in the West Sacramento, CA; Frankfort, IN; Indianapolis, IN; and...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-30

... eastern California State line; Bounded on the East by the eastern California State line south to the... lines west to the western California State line; and Bounded on the West by the western California State...; Bounded on the East by the eastern Fulton County line south to State Route 19; State Route 19 south to...

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.

The U(1)-Kepler Problems

NASA Astrophysics Data System (ADS)

Meng, Guowu

2010-12-01

Let n ⩾ 2 be a positive integer. To each irreducible representation σ of U(1), a U(1)-Kepler problem in dimension (2n - 1) is constructed and analyzed. This system is superintegrable and when n = 2 it is equivalent to a MICZ-Kepler problem. The dynamical symmetry group of this system is widetildeU(n, n), and the Hilbert space of bound states {{H}}(σ ) is the unitary highest weight representation of widetildeU(n, n) with the minimal positive Gelfand-Kirillov dimension. Furthermore, it is shown that the correspondence between σ ^* (the dual of σ) and {H}(σ ) is the theta-correspondence for dual pair (U(1), U(n,n))subseteq Sp_{4n}({R}).

Distributed Optimization

NASA Technical Reports Server (NTRS)

Macready, William; Wolpert, David

2005-01-01

We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.

The Bound to Bound State Contribution to the Electric Polarizability of a Relativbistic Particle

NASA Astrophysics Data System (ADS)

Vidnovic, Theodore, III; Anis Maize, Mohamed

1998-04-01

We calculate, in our study, the contribution of the transition between bound energy states to the electric polarizability of a relativistic particle. The particle is moving under the influence of a one-dimensional delta potential. Our work is done in the case of the scalar potential. The solution of Dirac's equation and the calculation of the particles total electric polarizability has been done in references (1-3). The transitions contributing to the electric polarizability are: Continuum to continuum, bound to bound, negative energy bound states to continuum, and positive energy bound states to continuum. Our task is to study the bound to bound state contribution to the electric polarizability. We will also investigate the effect of the strength of the potential on the contribution. 1. T.H. Solomon and S. Fallieros, "Relativistic One Dimensional Binding and Two Dimensional Motion." J. Franklin Inst. 320, 323-344 (1985) 2. M.A. Maize and C.A. Burkholder, "Electric Polarizability and the Solution of an Inhomogenous Differential Equation." Am.J.Phys. 63, 244-247 (1995) 3. M.A. Maize, S. Paulson, and A. D'Avanti, "Electric Polarizability of a Relativistic Particle." Am.J.Phys. 65, 888-892 (1997)

Distinguishing Majorana bound states and Andreev bound states with microwave spectra

NASA Astrophysics Data System (ADS)

Zhang, Zhen-Tao

2018-04-01

Majorana fermions are a fascinating and not yet confirmed quasiparticles in condensed matter physics. Here we propose using microwave spectra to distinguish Majorana bound states (MBSs) from topological trivial Andreev bound states. By numerically calculating the transmission and Zeeman field dependence of the many-body excitation spectrum of a 1D Josephson junction, we find that the two kinds of bound states have distinct responses to variations in the related parameters. Furthermore, the singular behaviors of the MBSs spectrum could be attributed to the robust fractional Josephson coupling and nonlocality of MBSs. Our results provide a feasible method to verify the existence of MBSs and could accelerate its application to topological quantum computation.

A Review of Methods for Moving Boundary Problems

DTIC Science & Technology

2009-07-01

the bound- ary value problem for the eikonal equation: ‖∇u‖ = 1 for x ∈ Ω (29) u = 0 for x ∈ Γ (30) ERDC/CHL TR-09-10 8 where ‖ ‖ is the Euclidean norm...Solutions of the eikonal equation can in turn be characterized as steady state solutions of the initial value prob- lem ut + sgn(u0)(‖∇u‖ − 1) = 0...LS using the eikonal equation and use the NCI equation for the LS dynam- ics. The complete system of equations in weak form is ∫ Ω (‖∇u‖ − 1)wdV = 0

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

Zhang, Fu-Lin, E-mail: flzhang@tju.edu.cn; Chen, Jing-Ling, E-mail: chenjl@nankai.edu.cn; Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543

Recent experimental progress in prolonging the coherence time of a quantum system prompts us to explore the behavior of quantum entanglement at the beginning of the decoherence process. The response of the entanglement under an infinitesimal noise can serve as a signature of the robustness of entangled states. A crucial problem of this topic in multipartite systems is to compute the degree of entanglement in a mixed state. We find a family of global noise in three-qubit systems, which is composed of four W states. Under its influence, the linear response of the tripartite entanglement of a symmetrical three-qubit puremore » state is studied. A lower bound of the linear response is found to depend completely on the initial tripartite and bipartite entanglement. This result shows that the decay of tripartite entanglement is hastened by the bipartite one. - Highlights: • We study a set of W-type noise and its linear effect on symmetric pure states. • Its effect on two-qubit entanglement depends only on the initial concurrence. • A lower bound of the effect on 3-tangle is found in terms of initial entanglements. • We obtain the time of three-tangle sudden death for two families of typical states. • These reveal that the bipartite entanglement speeds up the decay of the tripartite one.« less

Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose.

PubMed

Wang, Xin; Duan, Runyao

2017-11-03

We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key tool is a new efficiently computable additive lower bound for the asymptotic relative entropy of entanglement with respect to PPT states, which can be used to evaluate the entanglement cost under local operations and classical communication (LOCC). We find that for any rank-two mixed state supporting on the 3⊗3 antisymmetric subspace, the amount of distillable entanglement by PPT operations is strictly smaller than one entanglement bit (ebit) while its entanglement cost under PPT operations is exactly one ebit. As a by-product, we find that for this class of states, both the Rains's bound and its regularization are strictly less than the asymptotic relative entropy of entanglement. So, in general, there is no unique entanglement measure for the manipulation of entanglement by PPT operations. We further show a computable sufficient condition for the irreversibility of entanglement distillation by LOCC (or PPT) operations.

Concrete Behavior under Dynamic Tensile-Compressive Load.

DTIC Science & Technology

1984-01-01

be reviewed as well. Although structural concrete does not possess the thermal cracking problems during curing to the extent that mass concrete does...reasonable bounds for these unknown properties were assumed, suggests that the extent of cracking induced by seismic ground motion can be very...space. But an understanding of biaxial tension-compression be- havior is the foremost concern, since the stress state of a dam’s cracked regions occur in

L1 adaptive control of uncertain gear transmission servo systems with deadzone nonlinearity.

PubMed

Zuo, Zongyu; Li, Xiao; Shi, Zhiguang

2015-09-01

This paper deals with the adaptive control problem of Gear Transmission Servo (GTS) systems in the presence of unknown deadzone nonlinearity and viscous friction. A global differential homeomorphism based on a novel differentiable deadzone model is proposed first. Since there exist both matched and unmatched state-dependent unknown nonlinearities, a full-state feedback L1 adaptive controller is constructed to achieve uniformly bounded transient response in addition to steady-state performance. Finally, simulation results are included to show the elimination of limit cycles, in addition to demonstrating the main results in this paper. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

A Self-Stabilizing Hybrid-Fault Tolerant Synchronization Protocol

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2014-01-01

In this report we present a strategy for solving the Byzantine general problem for self-stabilizing a fully connected network from an arbitrary state and in the presence of any number of faults with various severities including any number of arbitrary (Byzantine) faulty nodes. Our solution applies to realizable systems, while allowing for differences in the network elements, provided that the number of arbitrary faults is not more than a third of the network size. The only constraint on the behavior of a node is that the interactions with other nodes are restricted to defined links and interfaces. Our solution does not rely on assumptions about the initial state of the system and no central clock nor centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. We also present a mechanical verification of a proposed protocol. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV). The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirming claims of determinism and linear convergence with respect to the self-stabilization period. We believe that our proposed solution solves the general case of the clock synchronization problem.

An improved error bound for linear complementarity problems for B-matrices.

PubMed

Gao, Lei; Li, Chaoqian

2017-01-01

A new error bound for the linear complementarity problem when the matrix involved is a B -matrix is presented, which improves the corresponding result in (Li et al. in Electron. J. Linear Algebra 31(1):476-484, 2016). In addition some sufficient conditions such that the new bound is sharper than that in (García-Esnaola and Peña in Appl. Math. Lett. 22(7):1071-1075, 2009) are provided.

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.

1992-01-01

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection

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

Nair, Ranjith

2011-09-15

We consider the problem of distinguishing, with minimum probability of error, two optical beam-splitter channels with unequal complex-valued reflectivities using general quantum probe states entangled over M signal and M' idler mode pairs of which the signal modes are bounced off the beam splitter while the idler modes are retained losslessly. We obtain a lower bound on the output state fidelity valid for any pure input state. We define number-diagonal signal (NDS) states to be input states whose density operator in the signal modes is diagonal in the multimode number basis. For such input states, we derive series formulas formore » the optimal error probability, the output state fidelity, and the Chernoff-type upper bounds on the error probability. For the special cases of quantum reading of a classical digital memory and target detection (for which the reflectivities are real valued), we show that for a given input signal photon probability distribution, the fidelity is minimized by the NDS states with that distribution and that for a given average total signal energy N{sub s}, the fidelity is minimized by any multimode Fock state with N{sub s} total signal photons. For reading of an ideal memory, it is shown that Fock state inputs minimize the Chernoff bound. For target detection under high-loss conditions, a no-go result showing the lack of appreciable quantum advantage over coherent state transmitters is derived. A comparison of the error probability performance for quantum reading of number state and two-mode squeezed vacuum state (or EPR state) transmitters relative to coherent state transmitters is presented for various values of the reflectances. While the nonclassical states in general perform better than the coherent state, the quantitative performance gains differ depending on the values of the reflectances. The experimental outlook for realizing nonclassical gains from number state transmitters with current technology at moderate to high values of the reflectances is argued to be good.« less

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.

Stationary and oscillatory bound states of dissipative solitons created by third-order dispersion

NASA Astrophysics Data System (ADS)

Sakaguchi, Hidetsugu; Skryabin, Dmitry V.; Malomed, Boris A.

2018-06-01

We consider the model of fiber-laser cavities near the zero-dispersion point, based on the complex Ginzburg-Landau equation with the cubic-quintic nonlinearity, including the third-order dispersion (TOD) term. It is well known that this model supports stable dissipative solitons. We demonstrate that the same model gives rise to several families of robust bound states of the solitons, which exists only in the presence of the TOD. There are both stationary and dynamical bound states, with oscillating separation between the bound solitons. Stationary states are multistable, corresponding to different values of the separation. With the increase of the TOD coefficient, the bound state with the smallest separation gives rise the oscillatory state through the Hopf bifurcation. Further growth of TOD leads to a bifurcation transforming the oscillatory limit cycle into a strange attractor, which represents a chaotically oscillating dynamical bound state. Families of multistable three- and four-soliton complexes are found too, the ones with the smallest separation between the solitons again ending by a transition to oscillatory states through the Hopf bifurcation.

Reservoir computing on the hypersphere

NASA Astrophysics Data System (ADS)

Andrecut, M.

Reservoir Computing (RC) refers to a Recurrent Neural Network (RNNs) framework, frequently used for sequence learning and time series prediction. The RC system consists of a random fixed-weight RNN (the input-hidden reservoir layer) and a classifier (the hidden-output readout layer). Here, we focus on the sequence learning problem, and we explore a different approach to RC. More specifically, we remove the nonlinear neural activation function, and we consider an orthogonal reservoir acting on normalized states on the unit hypersphere. Surprisingly, our numerical results show that the system’s memory capacity exceeds the dimensionality of the reservoir, which is the upper bound for the typical RC approach based on Echo State Networks (ESNs). We also show how the proposed system can be applied to symmetric cryptography problems, and we include a numerical implementation.

Impurity bound states in d-wave superconductors with subdominant order parameters

NASA Astrophysics Data System (ADS)

Mashkoori, Mahdi; Björnson, Kristofer; Black-Schaffer, Annica

Single magnetic impurity induces intra-gap bound states in conventional s-wave superconductors (SCs) but, in d-wave SCs only virtual bound states can be induced. However, in small cuprate islands a fully gapped spectrum has recently been discovered. In this work, we investigate the real bound states due to potential and magnetic impurities in the two candidate fully gapped states for this system: the topologically trivial d + is -wave state and the topologically non-trivial d + id' -wave (chiral d-wave state). Using the analytic T-matrix formalism and self-consistent numerical tight-binding lattice calculations, we show that potential and magnetic impurities create entirely different intra-gap bound states in d + is -wave and chiral d-wave SCs. Therefore, our results suggest that the bound states mainly depend on the subdominant order parameter. Considering that recent experiments have demonstrated an access to adjustable coupling J, impurities thus offer an intriguing way to clearly distinguish between the chiral d-wave and topologically trivial d + is -wave state. This work was supported by Swedish Research Council, Swedish Foundation for Strategic Research, the Wallenberg Academy Fellows program and the Göran Gustafsson Foundation. The computations were performed on resources provided by SNIC at LUNARC.

Structured Uncertainty Bound Determination From Data for Control and Performance Validation

NASA Technical Reports Server (NTRS)

Lim, Kyong B.

2003-01-01

This report attempts to document the broad scope of issues that must be satisfactorily resolved before one can expect to methodically obtain, with a reasonable confidence, a near-optimal robust closed loop performance in physical applications. These include elements of signal processing, noise identification, system identification, model validation, and uncertainty modeling. Based on a recently developed methodology involving a parameterization of all model validating uncertainty sets for a given linear fractional transformation (LFT) structure and noise allowance, a new software, Uncertainty Bound Identification (UBID) toolbox, which conveniently executes model validation tests and determine uncertainty bounds from data, has been designed and is currently available. This toolbox also serves to benchmark the current state-of-the-art in uncertainty bound determination and in turn facilitate benchmarking of robust control technology. To help clarify the methodology and use of the new software, two tutorial examples are provided. The first involves the uncertainty characterization of a flexible structure dynamics, and the second example involves a closed loop performance validation of a ducted fan based on an uncertainty bound from data. These examples, along with other simulation and experimental results, also help describe the many factors and assumptions that determine the degree of success in applying robust control theory to practical problems.

A Linear Kernel for Co-Path/Cycle Packing

NASA Astrophysics Data System (ADS)

Chen, Zhi-Zhong; Fellows, Michael; Fu, Bin; Jiang, Haitao; Liu, Yang; Wang, Lusheng; Zhu, Binhai

Bounded-Degree Vertex Deletion is a fundamental problem in graph theory that has new applications in computational biology. In this paper, we address a special case of Bounded-Degree Vertex Deletion, the Co-Path/Cycle Packing problem, which asks to delete as few vertices as possible such that the graph of the remaining (residual) vertices is composed of disjoint paths and simple cycles. The problem falls into the well-known class of 'node-deletion problems with hereditary properties', is hence NP-complete and unlikely to admit a polynomial time approximation algorithm with approximation factor smaller than 2. In the framework of parameterized complexity, we present a kernelization algorithm that produces a kernel with at most 37k vertices, improving on the super-linear kernel of Fellows et al.'s general theorem for Bounded-Degree Vertex Deletion. Using this kernel,and the method of bounded search trees, we devise an FPT algorithm that runs in time O *(3.24 k ). On the negative side, we show that the problem is APX-hard and unlikely to have a kernel smaller than 2k by a reduction from Vertex Cover.

Electron teleportation via Majorana bound states in a mesoscopic superconductor.

PubMed

Fu, Liang

2010-02-05

Zero-energy Majorana bound states in superconductors have been proposed to be potential building blocks of a topological quantum computer, because quantum information can be encoded nonlocally in the fermion occupation of a pair of spatially separated Majorana bound states. However, despite intensive efforts, nonlocal signatures of Majorana bound states have not been found in charge transport. In this work, we predict a striking nonlocal phase-coherent electron transfer process by virtue of tunneling in and out of a pair of Majorana bound states. This teleportation phenomenon only exists in a mesoscopic superconductor because of an all-important but previously overlooked charging energy. We propose an experimental setup to detect this phenomenon in a superconductor-quantum-spin-Hall-insulator-magnetic-insulator hybrid system.

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.

Bound states of moving potential wells in discrete wave mechanics

NASA Astrophysics Data System (ADS)

Longhi, S.

2017-10-01

Discrete wave mechanics describes the evolution of classical or matter waves on a lattice, which is governed by a discretized version of the Schrödinger equation. While for a vanishing lattice spacing wave evolution of the continuous Schrödinger equation is retrieved, spatial discretization and lattice effects can deeply modify wave dynamics. Here we discuss implications of breakdown of exact Galilean invariance of the discrete Schrödinger equation on the bound states sustained by a smooth potential well which is uniformly moving on the lattice with a drift velocity v. While in the continuous limit the number of bound states does not depend on the drift velocity v, as one expects from the covariance of ordinary Schrödinger equation for a Galilean boost, lattice effects can lead to a larger number of bound states for the moving potential well as compared to the potential well at rest. Moreover, for a moving potential bound states on a lattice become rather generally quasi-bound (resonance) states.

Interacting quantum walkers: two-body bosonic and fermionic bound states

NASA Astrophysics Data System (ADS)

Krapivsky, P. L.; Luck, J. M.; Mallick, K.

2015-11-01

We investigate the dynamics of bound states of two interacting particles, either bosons or fermions, performing a continuous-time quantum walk on a one-dimensional lattice. We consider the situation where the distance between both particles has a hard bound, and the richer situation where the particles are bound by a smooth confining potential. The main emphasis is on the velocity characterizing the ballistic spreading of these bound states, and on the structure of the asymptotic distribution profile of their center-of-mass coordinate. The latter profile generically exhibits many internal fronts.

Approximate solution of the p-median minimization problem

NASA Astrophysics Data System (ADS)

Il'ev, V. P.; Il'eva, S. D.; Navrotskaya, A. A.

2016-09-01

A version of the facility location problem (the well-known p-median minimization problem) and its generalization—the problem of minimizing a supermodular set function—is studied. These problems are NP-hard, and they are approximately solved by a gradient algorithm that is a discrete analog of the steepest descent algorithm. A priori bounds on the worst-case behavior of the gradient algorithm for the problems under consideration are obtained. As a consequence, a bound on the performance guarantee of the gradient algorithm for the p-median minimization problem in terms of the production and transportation cost matrix is obtained.

New Hardness Results for Diophantine Approximation

NASA Astrophysics Data System (ADS)

Eisenbrand, Friedrich; Rothvoß, Thomas

We revisit simultaneous Diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input to the decision version of this problem consists of a rational vector α ∈ ℚ n , an error bound ɛ and a denominator bound N ∈ ℕ + . One has to decide whether there exists an integer, called the denominator Q with 1 ≤ Q ≤ N such that the distance of each number Q ·α i to its nearest integer is bounded by ɛ. Lagarias has shown that this problem is NP-complete and optimization versions have been shown to be hard to approximate within a factor n c/ loglogn for some constant c > 0. We strengthen the existing hardness results and show that the optimization problem of finding the smallest denominator Q ∈ ℕ + such that the distances of Q·α i to the nearest integer are bounded by ɛ is hard to approximate within a factor 2 n unless {textrm{P}} = NP.

Probing quantum state space: does one have to learn everything to learn something?

PubMed

Carmeli, Claudio; Heinosaari, Teiko; Schultz, Jussi; Toigo, Alessandro

2017-05-01

Determining the state of a quantum system is a consuming procedure. For this reason, whenever one is interested only in some particular property of a state, it would be desirable to design a measurement set-up that reveals this property with as little effort as possible. Here, we investigate whether, in order to successfully complete a given task of this kind, one needs an informationally complete measurement, or if something less demanding would suffice. The first alternative means that in order to complete the task, one needs a measurement which fully determines the state. We formulate the task as a membership problem related to a partitioning of the quantum state space and, in doing so, connect it to the geometry of the state space. For a general membership problem, we prove various sufficient criteria that force informational completeness, and we explicitly treat several physically relevant examples. For the specific cases that do not require informational completeness, we also determine bounds on the minimal number of measurement outcomes needed to ensure success in the task.

Probing quantum state space: does one have to learn everything to learn something?

PubMed Central

Carmeli, Claudio; Schultz, Jussi; Toigo, Alessandro

2017-01-01

Determining the state of a quantum system is a consuming procedure. For this reason, whenever one is interested only in some particular property of a state, it would be desirable to design a measurement set-up that reveals this property with as little effort as possible. Here, we investigate whether, in order to successfully complete a given task of this kind, one needs an informationally complete measurement, or if something less demanding would suffice. The first alternative means that in order to complete the task, one needs a measurement which fully determines the state. We formulate the task as a membership problem related to a partitioning of the quantum state space and, in doing so, connect it to the geometry of the state space. For a general membership problem, we prove various sufficient criteria that force informational completeness, and we explicitly treat several physically relevant examples. For the specific cases that do not require informational completeness, we also determine bounds on the minimal number of measurement outcomes needed to ensure success in the task. PMID:28588404

Near optimal discrimination of binary coherent signals via atom–light interaction

NASA Astrophysics Data System (ADS)

Han, Rui; Bergou, János A.; Leuchs, Gerd

2018-04-01

We study the discrimination of weak coherent states of light with significant overlaps by nondestructive measurements on the light states through measuring atomic states that are entangled to the coherent states via dipole coupling. In this way, the problem of measuring and discriminating coherent light states is shifted to finding the appropriate atom–light interaction and atomic measurements. We show that this scheme allows us to attain a probability of error extremely close to the Helstrom bound, the ultimate quantum limit for discriminating binary quantum states, through the simple Jaynes–Cummings interaction between the field and ancilla with optimized light–atom coupling and projective measurements on the atomic states. Moreover, since the measurement is nondestructive on the light state, information that is not detected by one measurement can be extracted from the post-measurement light states through subsequent measurements.

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.

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.

Adaptive Neural Tracking Control for Switched High-Order Stochastic Nonlinear Systems.

PubMed

Zhao, Xudong; Wang, Xinyong; Zong, Guangdeng; Zheng, Xiaolong

2017-10-01

This paper deals with adaptive neural tracking control design for a class of switched high-order stochastic nonlinear systems with unknown uncertainties and arbitrary deterministic switching. The considered issues are: 1) completely unknown uncertainties; 2) stochastic disturbances; and 3) high-order nonstrict-feedback system structure. The considered mathematical models can represent many practical systems in the actual engineering. By adopting the approximation ability of neural networks, common stochastic Lyapunov function method together with adding an improved power integrator technique, an adaptive state feedback controller with multiple adaptive laws is systematically designed for the systems. Subsequently, a controller with only two adaptive laws is proposed to solve the problem of over parameterization. Under the designed controllers, all the signals in the closed-loop system are bounded-input bounded-output stable in probability, and the system output can almost surely track the target trajectory within a specified bounded error. Finally, simulation results are presented to show the effectiveness of the proposed approaches.

Impurity bound states in fully gapped d-wave superconductors with subdominant order parameters

PubMed Central

Mashkoori, Mahdi; Björnson, Kristofer; Black-Schaffer, Annica M.

2017-01-01

Impurities in superconductors and their induced bound states are important both for engineering novel states such as Majorana zero-energy modes and for probing bulk properties of the superconducting state. The high-temperature cuprates offer a clear advantage in a much larger superconducting order parameter, but the nodal energy spectrum of a pure d-wave superconductor only allows virtual bound states. Fully gapped d-wave superconducting states have, however, been proposed in several cuprate systems thanks to subdominant order parameters producing d + is- or d + id′-wave superconducting states. Here we study both magnetic and potential impurities in these fully gapped d-wave superconductors. Using analytical T-matrix and complementary numerical tight-binding lattice calculations, we show that magnetic and potential impurities behave fundamentally different in d + is- and d + id′-wave superconductors. In a d + is-wave superconductor, there are no bound states for potential impurities, while a magnetic impurity produces one pair of bound states, with a zero-energy level crossing at a finite scattering strength. On the other hand, a d + id′-wave symmetry always gives rise to two pairs of bound states and only produce a reachable zero-energy level crossing if the normal state has a strong particle-hole asymmetry. PMID:28281570

Unary probabilistic and quantum automata on promise problems

NASA Astrophysics Data System (ADS)

Gainutdinova, Aida; Yakaryılmaz, Abuzer

2018-02-01

We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error unary QFAs are more powerful than bounded-error unary PFAs, and, contrary to the binary language case, the computational power of Las-Vegas QFAs and bounded-error PFAs is equivalent to the computational power of deterministic finite automata (DFAs). Then, we present a new family of unary promise problems defined with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.

Dynamic State Estimation of Power Systems With Quantization Effects: A Recursive Filter Approach.

PubMed

Hu, Liang; Wang, Zidong; Liu, Xiaohui

2016-08-01

In this paper, a recursive filter algorithm is developed to deal with the state estimation problem for power systems with quantized nonlinear measurements. The measurements from both the remote terminal units and the phasor measurement unit are subject to quantizations described by a logarithmic quantizer. Attention is focused on the design of a recursive filter such that, in the simultaneous presence of nonlinear measurements and quantization effects, an upper bound for the estimation error covariance is guaranteed and subsequently minimized. Instead of using the traditional approximation methods in nonlinear estimation that simply ignore the linearization errors, we treat both the linearization and quantization errors as norm-bounded uncertainties in the algorithm development so as to improve the performance of the estimator. For the power system with such kind of introduced uncertainties, a filter is designed in the framework of robust recursive estimation, and the developed filter algorithm is tested on the IEEE benchmark power system to demonstrate its effectiveness.

Partonic structure of neutral pseudoscalars via two photon transition form factors

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

Raya, Khepani; Ding, Minghui; Bashir, Adnan

Here, the γγ* → η c,b transition form factors are computed using a continuum approach to the two valence-body bound-state problem in relativistic quantum field theory, and thereby unified with equivalent calculations of electromagnetic pion elastic and transition form factors. The resulting γγ* → η c form factor, G ηc(Q 2), is consistent with available data; significantly, at accessible momentum transfers, Q 2G ηc(Q 2) lies well below its conformal limit. These observations confirm that the leading-twist parton distribution amplitudes of heavy-heavy bound states are compressed relative to the conformal limit. A clear understanding of the distribution of valence quarksmore » within mesons thus emerges, a picture which connects Goldstone modes, built from the lightest quarks in nature, with systems containing the heaviest valence quarks that can now be studied experimentally, and highlights basic facts about manifestations of mass within the Standard Model.« less

Partonic structure of neutral pseudoscalars via two photon transition form factors

DOE PAGES

Raya, Khepani; Ding, Minghui; Bashir, Adnan; ...

2017-04-10

Here, the γγ* → η c,b transition form factors are computed using a continuum approach to the two valence-body bound-state problem in relativistic quantum field theory, and thereby unified with equivalent calculations of electromagnetic pion elastic and transition form factors. The resulting γγ* → η c form factor, G ηc(Q 2), is consistent with available data; significantly, at accessible momentum transfers, Q 2G ηc(Q 2) lies well below its conformal limit. These observations confirm that the leading-twist parton distribution amplitudes of heavy-heavy bound states are compressed relative to the conformal limit. A clear understanding of the distribution of valence quarksmore » within mesons thus emerges, a picture which connects Goldstone modes, built from the lightest quarks in nature, with systems containing the heaviest valence quarks that can now be studied experimentally, and highlights basic facts about manifestations of mass within the Standard Model.« less

Solution of two-body relativistic bound state equations with confining plus Coulomb interactions

NASA Technical Reports Server (NTRS)

Maung, Khin Maung; Kahana, David E.; Norbury, John W.

1992-01-01

Studies of meson spectroscopy have often employed a nonrelativistic Coulomb plus Linear Confining potential in position space. However, because the quarks in mesons move at an appreciable fraction of the speed of light, it is necessary to use a relativistic treatment of the bound state problem. Such a treatment is most easily carried out in momentum space. However, the position space Linear and Coulomb potentials lead to singular kernels in momentum space. Using a subtraction procedure we show how to remove these singularities exactly and thereby solve the Schroedinger equation in momentum space for all partial waves. Furthermore, we generalize the Linear and Coulomb potentials to relativistic kernels in four dimensional momentum space. Again we use a subtraction procedure to remove the relativistic singularities exactly for all partial waves. This enables us to solve three dimensional reductions of the Bethe-Salpeter equation. We solve six such equations for Coulomb plus Confining interactions for all partial waves.

Activating distillation with an infinitesimal amount of bound entanglement.

PubMed

Vollbrecht, Karl Gerd H; Wolf, Michael M

2002-06-17

We show that bipartite quantum states of any dimension, which do not have a positive partial transpose (NPPT), become 1-distillable when one adds an infinitesimal amount of bound entanglement. To this end we investigate the activation properties of a new class of symmetric bound entangled states of full rank. It is shown that in this set there exist universal activator states capable of activating the distillation of any NPPT state. The result shows that even a small amount of bound entanglement can be useful for quantum information purposes.

Search for bound states of the eta-meson in light nuclei

NASA Technical Reports Server (NTRS)

Chrien, R. E.; Bart, S.; Pile, P.; Sutter, R.; Tsoupas, N.; Funsten, H. O.; Finn, J. M.; Lyndon, C.; Punjabi, V.; Perdrisat, C. F.

1988-01-01

A search for nuclear-bound states of the eta meson was carried out. Targets of lithium, carbon, oxygen, and aluminum were placed in a pion(+) beam at 800 MeV/c. A predicted eta bound state in O-15* (E sub x approx. = 540 MeV) with a width of approx. 9 MeV was not observed. A bound state of a size 1/3 of the predicted cross section would have been seen in this experiment at a confidence level of 3sigma (P is greater than 0.9987).

State Estimation Using Dependent Evidence Fusion: Application to Acoustic Resonance-Based Liquid Level Measurement.

PubMed

Xu, Xiaobin; Li, Zhenghui; Li, Guo; Zhou, Zhe

2017-04-21

Estimating the state of a dynamic system via noisy sensor measurement is a common problem in sensor methods and applications. Most state estimation methods assume that measurement noise and state perturbations can be modeled as random variables with known statistical properties. However in some practical applications, engineers can only get the range of noises, instead of the precise statistical distributions. Hence, in the framework of Dempster-Shafer (DS) evidence theory, a novel state estimatation method by fusing dependent evidence generated from state equation, observation equation and the actual observations of the system states considering bounded noises is presented. It can be iteratively implemented to provide state estimation values calculated from fusion results at every time step. Finally, the proposed method is applied to a low-frequency acoustic resonance level gauge to obtain high-accuracy measurement results.

World oil

NASA Astrophysics Data System (ADS)

Sweeney, J. L.

1982-06-01

Results obtained through the application of 10 prominent world oil or world energy models to 12 scenarios are reported. These scenarios were designed to bound the range of likely future world oil market outcomes. Conclusions relate to oil market trends, impacts of policies on oil prices, security of oil supplies, impacts of policies on oil security problems, use of the oil import premium in policymaking, the transition to oil substitutes, and the state of the art of world oil modeling.

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.

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.

Asymptotic Behaviour of the Ground State of Singularly Perturbed Elliptic Equations

NASA Astrophysics Data System (ADS)

Piatnitski, Andrey L.

The ground state of a singularly perturbed nonselfadjoint elliptic operator defined on a smooth compact Riemannian manifold with metric aij(x)=(aij(x))-1, is studied. We investigate the limiting behaviour of the first eigenvalue of this operator as μ goes to zero, and find the logarithmic asymptotics of the first eigenfunction everywhere on the manifold. The results are formulated in terms of auxiliary variational problems on the manifold. This approach also allows to study the general singularly perturbed second order elliptic operator on a bounded domain in Rn.

Wentzel-Kramers-Brillouin method in the Bargmann representation. [of quantum mechanics

NASA Technical Reports Server (NTRS)

Voros, A.

1989-01-01

It is demonstrated that the Bargmann representation of quantum mechanics is ideally suited for semiclassical analysis, using as an example the WKB method applied to the bound-state problem in a single well of one degree of freedom. For the harmonic oscillator, this WKB method trivially gives the exact eigenfunctions in addition to the exact eigenvalues. For an anharmonic well, a self-consistent variational choice of the representation greatly improves the accuracy of the semiclassical ground state. Also, a simple change of scale illuminates the relationship of semiclassical versus linear perturbative expansions, allowing a variety of multidimensional extensions.

Classical subharmonic resonances in microwave ionization of lithium Rydberg atoms

NASA Astrophysics Data System (ADS)

Noel, Michael W.; Griffith, W. M.; Gallagher, T. F.

2000-12-01

We have studied the ionization of lithium Rydberg atoms by pulsed microwave fields in the regime in which the microwave frequency is equal to or a subharmonic of the classical Kepler frequency of the two-body Coulomb problem. We have observed a series of resonances where the atom is relatively stable against ionization. The resonances are similar to those seen previously in hydrogen, but with significant quantitative differences. We also present measurements of the distribution of states that remain bound after the microwave interaction for initial states near one of the classical subharmonic resonances.

Ensemble-based characterization of unbound and bound states on protein energy landscape

PubMed Central

Ruvinsky, Anatoly M; Kirys, Tatsiana; Tuzikov, Alexander V; Vakser, Ilya A

2013-01-01

Physicochemical description of numerous cell processes is fundamentally based on the energy landscapes of protein molecules involved. Although the whole energy landscape is difficult to reconstruct, increased attention to particular targets has provided enough structures for mapping functionally important subspaces associated with the unbound and bound protein structures. The subspace mapping produces a discrete representation of the landscape, further called energy spectrum. We compiled and characterized ensembles of bound and unbound conformations of six small proteins and explored their spectra in implicit solvent. First, the analysis of the unbound-to-bound changes points to conformational selection as the binding mechanism for four proteins. Second, results show that bound and unbound spectra often significantly overlap. Moreover, the larger the overlap the smaller the root mean square deviation (RMSD) between the bound and unbound conformational ensembles. Third, the center of the unbound spectrum has a higher energy than the center of the corresponding bound spectrum of the dimeric and multimeric states for most of the proteins. This suggests that the unbound states often have larger entropy than the bound states. Fourth, the exhaustively long minimization, making small intrarotamer adjustments (all-atom RMSD ≤ 0.7 Å), dramatically reduces the distance between the centers of the bound and unbound spectra as well as the spectra extent. It condenses unbound and bound energy levels into a thin layer at the bottom of the energy landscape with the energy spacing that varies between 0.8–4.6 and 3.5–10.5 kcal/mol for the unbound and bound states correspondingly. Finally, the analysis of protein energy fluctuations showed that protein vibrations itself can excite the interstate transitions, including the unbound-to-bound ones. PMID:23526684

The problem of hole localization in inner-shell states of N2 and CO2 revisited with complete active space self-consistent field approach.

PubMed

Rocha, Alexandre B; de Moura, Carlos E V

2011-12-14

Potential energy curves for inner-shell states of nitrogen and carbon dioxide molecules are calculated by inner-shell complete active space self-consistent field (CASSCF) method, which is a protocol, recently proposed, to obtain specifically converged inner-shell states at multiconfigurational level. This is possible since the collapse of the wave function to a low-lying state is avoided by a sequence of constrained optimization in the orbital mixing step. The problem of localization of K-shell states is revisited by calculating their energies at CASSCF level based on both localized and delocalized orbitals. The localized basis presents the best results at this level of calculation. Transition energies are also calculated by perturbation theory, by taking the above mentioned MCSCF function as zeroth order wave function. Values for transition energy are in fairly good agreement with experimental ones. Bond dissociation energies for N(2) are considerably high, which means that these states are strongly bound. Potential curves along ground state normal modes of CO(2) indicate the occurrence of Renner-Teller effect in inner-shell states. © 2011 American Institute of Physics

A fast numerical method for the valuation of American lookback put options

NASA Astrophysics Data System (ADS)

Song, Haiming; Zhang, Qi; Zhang, Ran

2015-10-01

A fast and efficient numerical method is proposed and analyzed for the valuation of American lookback options. American lookback option pricing problem is essentially a two-dimensional unbounded nonlinear parabolic problem. We reformulate it into a two-dimensional parabolic linear complementary problem (LCP) on an unbounded domain. The numeraire transformation and domain truncation technique are employed to convert the two-dimensional unbounded LCP into a one-dimensional bounded one. Furthermore, the variational inequality (VI) form corresponding to the one-dimensional bounded LCP is obtained skillfully by some discussions. The resulting bounded VI is discretized by a finite element method. Meanwhile, the stability of the semi-discrete solution and the symmetric positive definiteness of the full-discrete matrix are established for the bounded VI. The discretized VI related to options is solved by a projection and contraction method. Numerical experiments are conducted to test the performance of the proposed method.

Performance bounds for nonlinear systems with a nonlinear ℒ2-gain property

NASA Astrophysics Data System (ADS)

Zhang, Huan; Dower, Peter M.

2012-09-01

Nonlinear ℒ2-gain is a finite gain concept that generalises the notion of conventional (linear) finite ℒ2-gain to admit the application of ℒ2-gain analysis tools of a broader class of nonlinear systems. The computation of tight comparison function bounds for this nonlinear ℒ2-gain property is important in applications such as small gain design. This article presents an approximation framework for these comparison function bounds through the formulation and solution of an optimal control problem. Key to the solution of this problem is the lifting of an ℒ2-norm input constraint, which is facilitated via the introduction of an energy saturation operator. This admits the solution of the optimal control problem of interest via dynamic programming and associated numerical methods, leading to the computation of the proposed bounds. Two examples are presented to demonstrate this approach.

Error bounds of adaptive dynamic programming algorithms for solving undiscounted optimal control problems.

PubMed

Liu, Derong; Li, Hongliang; Wang, Ding

2015-06-01

In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.

Decentralized state estimation for a large-scale spatially interconnected system.

PubMed

Liu, Huabo; Yu, Haisheng

2018-03-01

A decentralized state estimator is derived for the spatially interconnected systems composed of many subsystems with arbitrary connection relations. An optimization problem on the basis of linear matrix inequality (LMI) is constructed for the computations of improved subsystem parameter matrices. Several computationally effective approaches are derived which efficiently utilize the block-diagonal characteristic of system parameter matrices and the sparseness of subsystem connection matrix. Moreover, this decentralized state estimator is proved to converge to a stable system and obtain a bounded covariance matrix of estimation errors under certain conditions. Numerical simulations show that the obtained decentralized state estimator is attractive in the synthesis of a large-scale networked system. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Optimum measurement for unambiguously discriminating two mixed states: General considerations and special cases

NASA Astrophysics Data System (ADS)

Herzog, Ulrike; Bergou, János A.

2006-04-01

Based on our previous publication [U. Herzog and J. A. Bergou, Phys. Rev. A 71, 050301(R)(2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.

Reaching the Quantum Cramér-Rao Bound for Transmission Measurements

NASA Astrophysics Data System (ADS)

Woodworth, Timothy; Chan, Kam Wai Clifford; Marino, Alberto

2017-04-01

The quantum Cramér-Rao bound (QCRB) is commonly used to quantify the lower bound for the uncertainty in the estimation of a given parameter. Here, we calculate the QCRB for transmission measurements of an optical system probed by a beam of light. Estimating the transmission of an optical element is important as it is required for the calibration of optimal states for interferometers, characterization of high efficiency photodetectors, or as part of other measurements, such as those in plasmonic sensors or in ellipsometry. We use a beam splitter model for the losses introduced by the optical system to calculate the QCRB for different input states. We compare the bound for a coherent state, a two-mode squeezed-state (TMSS), a single-mode squeezed-state (SMSS), and a Fock state and show that it is possible to obtain an ultimate lower bound, regardless of the state used to probe the system. We prove that the Fock state gives the lowest possible uncertainty in estimating the transmission for any state and demonstrate that the TMSS and SMSS approach this ultimate bound for large levels of squeezing. Finally, we show that a simple measurement strategy for the TMSS, namely an intensity difference measurement, is able to saturate the QCRB. Work supported by the W.M. Keck Foundation.

Search for a hidden strange baryon-meson bound state from ϕ production in a nuclear medium

NASA Astrophysics Data System (ADS)

Gao, Haiyan; Huang, Hongxia; Liu, Tianbo; Ping, Jialun; Wang, Fan; Zhao, Zhiwen

2017-05-01

We investigate the hidden strange light baryon-meson system. With the resonating-group method, two bound states, η'-N and ϕ -N , are found in the quark delocalization color screening model. Focusing on the ϕ -N bound state around 1950 MeV, we obtain the total decay width of about 4 MeV by calculating the phase shifts in the resonance scattering processes. To study the feasibility of an experimental search for the ϕ -N bound state, we perform a Monte Carlo simulation of the bound state production with an electron beam and a gold target. In the simulation, we use the CLAS12 detector with the Forward Tagger and the BONUS12 detector in Hall B at Jefferson Lab. Both the signal and the background channels are estimated. We demonstrate that the signal events can be separated from the background with some momentum cuts. Therefore it is feasible to experimentally search for the ϕ -N bound state through the near threshold ϕ meson production from heavy nuclei.

Gaussian basis functions for highly oscillatory scattering wavefunctions

NASA Astrophysics Data System (ADS)

Mant, B. P.; Law, M. M.

2018-04-01

We have applied a basis set of distributed Gaussian functions within the S-matrix version of the Kohn variational method to scattering problems involving deep potential energy wells. The Gaussian positions and widths are tailored to the potential using the procedure of Bačić and Light (1986 J. Chem. Phys. 85 4594) which has previously been applied to bound-state problems. The placement procedure is shown to be very efficient and gives scattering wavefunctions and observables in agreement with direct numerical solutions. We demonstrate the basis function placement method with applications to hydrogen atom–hydrogen atom scattering and antihydrogen atom–hydrogen atom scattering.

A nonperturbative light-front coupled-cluster method

NASA Astrophysics Data System (ADS)

Hiller, J. R.

2012-10-01

The nonperturbative Hamiltonian eigenvalue problem for bound states of a quantum field theory is formulated in terms of Dirac's light-front coordinates and then approximated by the exponential-operator technique of the many-body coupled-cluster method. This approximation eliminates any need for the usual approximation of Fock-space truncation. Instead, the exponentiated operator is truncated, and the terms retained are determined by a set of nonlinear integral equations. These equations are solved simultaneously with an effective eigenvalue problem in the valence sector, where the number of constituents is small. Matrix elements can be calculated, with extensions of techniques from standard coupled-cluster theory, to obtain form factors and other observables.

Approximation-Based Adaptive Neural Tracking Control of Nonlinear MIMO Unknown Time-Varying Delay Systems With Full State Constraints.

PubMed

Li, Da-Peng; Li, Dong-Juan; Liu, Yan-Jun; Tong, Shaocheng; Chen, C L Philip

2017-10-01

This paper deals with the tracking control problem for a class of nonlinear multiple input multiple output unknown time-varying delay systems with full state constraints. To overcome the challenges which cause by the appearances of the unknown time-varying delays and full-state constraints simultaneously in the systems, an adaptive control method is presented for such systems for the first time. The appropriate Lyapunov-Krasovskii functions and a separation technique are employed to eliminate the effect of unknown time-varying delays. The barrier Lyapunov functions are employed to prevent the violation of the full state constraints. The singular problems are dealt with by introducing the signal function. Finally, it is proven that the proposed method can both guarantee the good tracking performance of the systems output, all states are remained in the constrained interval and all the closed-loop signals are bounded in the design process based on choosing appropriate design parameters. The practicability of the proposed control technique is demonstrated by a simulation study in this paper.

Bound states for magic state distillation in fault-tolerant quantum computation.

PubMed

Campbell, Earl T; Browne, Dan E

2010-01-22

Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure nonstabilizer states which can be distilled from certain mixed nonstabilizer states via Clifford group operations alone. Because of the Gottesman-Knill theorem, mixtures of Pauli eigenstates are not expected to be magic state distillable, but it has been an open question whether all mixed states outside this set may be distilled. In this Letter we show that, when resources are finitely limited, nondistillable states exist outside the stabilizer octahedron. In analogy with the bound entangled states, which arise in entanglement theory, we call such states bound states for magic state distillation.

Effects of bias and temperature on the intersubband absorption in very long wavelength GaAs/AlGaAs quantum well infrared photodetectors

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

Liu, X. H.; Zhou, X. H., E-mail: xhzhou@mail.sitp.ac.cn; Li, N.

2014-03-28

The temperature- and bias-dependent photocurrent spectra of very long wavelength GaAs/AlGaAs quantum well infrared photodetectors (QWIPs) are studied using spectroscopic measurements and corresponding theoretical calculations. It is found that the peak response wavelength will shift as the bias and temperature change. Aided by band structure calculations, we propose a model of the double excited states and explain the experimental observations very well. In addition, the working mechanisms of the quasi-bound state confined in the quantum well, including the processes of tunneling and thermionic emission, are also investigated in detail. We confirm that the first excited state, which belongs to themore » quasi-bound state, can be converted into a quasi-continuum state induced by bias and temperature. These obtained results provide a full understanding of the bound-to-quasi-bound state and the bound-to-quasi-continuum state transition, and thus allow for a better optimization of QWIPs performance.« less

Propagating bound states in the continuum in dielectric gratings

NASA Astrophysics Data System (ADS)

Bulgakov, E. N.; Maksimov, D. N.; Semina, P. N.; Skorobogatov, S. A.

2018-06-01

We consider propagating bound states in the continuum in dielectric gratings. The gratings consist of a slab with ridges periodically arranged ether on top or on the both sides of the slab. Based on the Fourier modal approach we recover the leaky zones above the line of light to identify the geometries of the gratings supporting Bloch bound states propagating in the direction perpendicular to the ridges. Most importantly, it is demonstrated that if a two-side grating possesses either mirror or glide symmetry the Bloch bound states are stable to variation of parameters as far as the above symmetries are preserved.

Degenerate quantum codes and the quantum Hamming bound

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

Sarvepalli, Pradeep; Klappenecker, Andreas

2010-03-15

The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this article we show that Calderbank-Shor-Steane (CSS) codes, over a prime power alphabet q{>=}5, cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes, which allows us to strengthen the Rains' bound that an [[n,k,d

An Algorithm for Efficient Maximum Likelihood Estimation and Confidence Interval Determination in Nonlinear Estimation Problems

NASA Technical Reports Server (NTRS)

Murphy, Patrick Charles

1985-01-01

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The algorithm was developed for airplane parameter estimation problems but is well suited for most nonlinear, multivariable, dynamic systems. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort. MNRES determines the sensitivities with less computational effort than using either a finite-difference method or integrating the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, thus eliminating algorithm reformulation with each new model and providing flexibility to use model equations in any format that is convenient. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. It is observed that the degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. The CR bounds were found to be close to the bounds determined by the search when the degree of nonlinearity was small. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels for the parameter confidence limits. The primary utility of the measure, however, was found to be in predicting the degree of agreement between Cramer-Rao bounds and search estimates.

Exact zeros of entanglement for arbitrary rank-two mixtures derived from a geometric view of the zero polytope

NASA Astrophysics Data System (ADS)

Osterloh, Andreas

2016-12-01

Here I present a method for how intersections of a certain density matrix of rank 2 with the zero polytope can be calculated exactly. This is a purely geometrical procedure which thereby is applicable to obtaining the zeros of SL- and SU-invariant entanglement measures of arbitrary polynomial degree. I explain this method in detail for a recently unsolved problem. In particular, I show how a three-dimensional view, namely, in terms of the Bloch-sphere analogy, solves this problem immediately. To this end, I determine the zero polytope of the three-tangle, which is an exact result up to computer accuracy, and calculate upper bounds to its convex roof which are below the linearized upper bound. The zeros of the three-tangle (in this case) induced by the zero polytope (zero simplex) are exact values. I apply this procedure to a superposition of the four-qubit Greenberger-Horne-Zeilinger and W state. It can, however, be applied to every case one has under consideration, including an arbitrary polynomial convex-roof measure of entanglement and for arbitrary local dimension.

Approximate labeling via graph cuts based on linear programming.

PubMed

Komodakis, Nikos; Tziritas, Georgios

2007-08-01

A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \\alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \\alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems.

Better bounds on optimal measurement and entanglement recovery, with applications to uncertainty and monogamy relations

NASA Astrophysics Data System (ADS)

Renes, Joseph M.

2017-10-01

We extend the recent bounds of Sason and Verdú relating Rényi entropy and Bayesian hypothesis testing (arXiv:1701.01974.) to the quantum domain and show that they have a number of different applications. First, we obtain a sharper bound relating the optimal probability of correctly distinguishing elements of an ensemble of states to that of the pretty good measurement, and an analogous bound for optimal and pretty good entanglement recovery. Second, we obtain bounds relating optimal guessing and entanglement recovery to the fidelity of the state with a product state, which then leads to tight tripartite uncertainty and monogamy relations.

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.

Chaotification of complex networks with impulsive control.

PubMed

Guan, Zhi-Hong; Liu, Feng; Li, Juan; Wang, Yan-Wu

2012-06-01

This paper investigates the chaotification problem of complex dynamical networks (CDN) with impulsive control. Both the discrete and continuous cases are studied. The method is presented to drive all states of every node in CDN to chaos. The proposed impulsive control strategy is effective for both the originally stable and unstable CDN. The upper bound of the impulse intervals for originally stable networks is derived. Finally, the effectiveness of the theoretical results is verified by numerical examples.

Consensus of satellite cluster flight using an energy-matching optimal control method

NASA Astrophysics Data System (ADS)

Luo, Jianjun; Zhou, Liang; Zhang, Bo

2017-11-01

This paper presents an optimal control method for consensus of satellite cluster flight under a kind of energy matching condition. Firstly, the relation between energy matching and satellite periodically bounded relative motion is analyzed, and the satellite energy matching principle is applied to configure the initial conditions. Then, period-delayed errors are adopted as state variables to establish the period-delayed errors dynamics models of a single satellite and the cluster. Next a novel satellite cluster feedback control protocol with coupling gain is designed, so that the satellite cluster periodically bounded relative motion consensus problem (period-delayed errors state consensus problem) is transformed to the stability of a set of matrices with the same low dimension. Based on the consensus region theory in the research of multi-agent system consensus issues, the coupling gain can be obtained to satisfy the requirement of consensus region and decouple the satellite cluster information topology and the feedback control gain matrix, which can be determined by Linear quadratic regulator (LQR) optimal method. This method can realize the consensus of satellite cluster period-delayed errors, leading to the consistency of semi-major axes (SMA) and the energy-matching of satellite cluster. Then satellites can emerge the global coordinative cluster behavior. Finally the feasibility and effectiveness of the present energy-matching optimal consensus for satellite cluster flight is verified through numerical simulations.

Observation of topologically protected bound states in photonic quantum walks.

PubMed

Kitagawa, Takuya; Broome, Matthew A; Fedrizzi, Alessandro; Rudner, Mark S; Berg, Erez; Kassal, Ivan; Aspuru-Guzik, Alán; Demler, Eugene; White, Andrew G

2012-06-06

Topological phases exhibit some of the most striking phenomena in modern physics. Much of the rich behaviour of quantum Hall systems, topological insulators, and topological superconductors can be traced to the existence of robust bound states at interfaces between different topological phases. This robustness has applications in metrology and holds promise for future uses in quantum computing. Engineered quantum systems--notably in photonics, where wavefunctions can be observed directly--provide versatile platforms for creating and probing a variety of topological phases. Here we use photonic quantum walks to observe bound states between systems with different bulk topological properties and demonstrate their robustness to perturbations--a signature of topological protection. Although such bound states are usually discussed for static (time-independent) systems, here we demonstrate their existence in an explicitly time-dependent situation. Moreover, we discover a new phenomenon: a topologically protected pair of bound states unique to periodically driven systems.

Distributed Constrained Optimization with Semicoordinate Transformations

NASA Technical Reports Server (NTRS)

Macready, William; Wolpert, David

2006-01-01

Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used to solve constrained optimization problems. This is done by translating the problem into an iterated game, where each agent controls a different variable of the problem, so that the joint probability distribution across the agents moves gives an expected value of the objective function. The dynamics of the agents is designed to minimize a Lagrangian function of that joint distribution. Here we illustrate how the updating of the Lagrange parameters in the Lagrangian is a form of automated annealing, which focuses the joint distribution more and more tightly about the joint moves that optimize the objective function. We then investigate the use of "semicoordinate" variable transformations. These separate the joint state of the agents from the variables of the optimization problem, with the two connected by an onto mapping. We present experiments illustrating the ability of such transformations to facilitate optimization. We focus on the special kind of transformation in which the statistically independent states of the agents induces a mixture distribution over the optimization variables. Computer experiment illustrate this for &sat constraint satisfaction problems and for unconstrained minimization of NK functions.

A Model-Free No-arbitrage Price Bound for Variance Options

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

Bonnans, J. Frederic, E-mail: frederic.bonnans@inria.fr; Tan Xiaolu, E-mail: xiaolu.tan@polytechnique.edu

2013-08-01

We suggest a numerical approximation for an optimization problem, motivated by its applications in finance to find the model-free no-arbitrage bound of variance options given the marginal distributions of the underlying asset. A first approximation restricts the computation to a bounded domain. Then we propose a gradient projection algorithm together with the finite difference scheme to solve the optimization problem. We prove the general convergence, and derive some convergence rate estimates. Finally, we give some numerical examples to test the efficiency of the algorithm.

Quantifying entanglement in two-mode Gaussian states

NASA Astrophysics Data System (ADS)

Tserkis, Spyros; Ralph, Timothy C.

2017-12-01

Entangled two-mode Gaussian states are a key resource for quantum information technologies such as teleportation, quantum cryptography, and quantum computation, so quantification of Gaussian entanglement is an important problem. Entanglement of formation is unanimously considered a proper measure of quantum correlations, but for arbitrary two-mode Gaussian states no analytical form is currently known. In contrast, logarithmic negativity is a measure that is straightforward to calculate and so has been adopted by most researchers, even though it is a less faithful quantifier. In this work, we derive an analytical lower bound for entanglement of formation of generic two-mode Gaussian states, which becomes tight for symmetric states and for states with balanced correlations. We define simple expressions for entanglement of formation in physically relevant situations and use these to illustrate the problematic behavior of logarithmic negativity, which can lead to spurious conclusions.

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

NASA Technical Reports Server (NTRS)

Rea, Jeremy R.; Bishop, Robert H.

2010-01-01

Current renewed interest in exploration of the moon, Mars, and other planetary objects is driving technology development in many fields of space system design. In particular, there is a desire to land both robotic and human missions on the moon and elsewhere. The landing guidance system must be able to deliver the vehicle to a desired soft landing while meeting several constraints necessary for the safety of the vehicle. Due to performance limitations of current launch vehicles, it is desired to minimize the amount of fuel used. In addition, the landing site may change in real-time in order to avoid previously undetected hazards which become apparent during the landing maneuver. This complicated maneuver can be broken into simpler subproblems that bound the full problem. One such subproblem is to find a minimum-fuel landing solution that meets constraints on the initial state, final state, and bounded thrust acceleration magnitude. With the assumptions of constant gravity and negligible atmosphere, the form of the optimal steering law is known, and the equations of motion can be integrated analytically, resulting in a system of five equations in five unknowns. It is shown that this system of equations can be reduced analytically to two equations in two unknowns. With an additional assumption of constant thrust acceleration magnitude, this system can be reduced further to one equation in one unknown. It is shown that these unknowns can be bounded analytically. An algorithm is developed to quickly and reliably solve the resulting one-dimensional bounded search, and it is used as a real-time guidance applied to a lunar landing test case.

Comparative Effect of an Addition of a Surface Term to Woods-Saxon Potential on Thermodynamics of a Nucleon

NASA Astrophysics Data System (ADS)

Lütfüoğlu, B. C.

2018-01-01

In this study, we reveal the difference between Woods-Saxon (WS) and Generalized Symmetric Woods-Saxon (GSWS) potentials in order to describe the physical properties of a nucleon, by means of solving Schrödinger equation for the two potentials. The additional term squeezes the WS potential well, which leads an upward shift in the spectrum, resulting in a more realistic picture. The resulting GSWS potential does not merely accommodate extra quasi bound states, but also has modified bound state spectrum. As an application, we apply the formalism to a real problem, an α particle confined in Bohrium-270 nucleus. The thermodynamic functions Helmholtz energy, entropy, internal energy, specific heat of the system are calculated and compared for both wells. The internal energy and the specific heat capacity increase as a result of upward shift in the spectrum. The shift of the Helmholtz free energy is a direct consequence of the shift of the spectrum. The entropy decreases because of a decrement in the number of available states. Supported by the Turkish Science and Research Council (TÜBİTAK) and Akdeniz University

Gravitationally self-bound quantum states in unstable potentials

NASA Astrophysics Data System (ADS)

Jääskeläinen, Markku

2018-04-01

Quantum mechanics at present cannot be unified with the theory of gravity at the deepest level, and to guide research towards the solution of this fundamental problem, we need to look for ways to observe or refute predictions originating from attempts to combine quantum theory with gravity. The influence of the gravitational field created by the material density given by the wave function itself gives rise to nontrivial phenomena. In this study I consider the wave function for the center-of-mass coordinate of a spherical mass distribution under the influence of the self-interaction of Newtonian gravity. I solve numerically for the ground state in the presence of an unstable potential and find that the energy of the free-space bound state can be lowered despite the nontrapping character of the potential. The center-of-mass ground state becomes increasingly localized for the used unstable potentials, although only in a limited parameter regime. The feebleness of the energy shift makes the observation of these effects demanding and requires further developments in the cooling of material particles. In addition, the influence of gravitational perturbations that are present in typical laboratory settings necessitates the use of extremely quiet and controlled environments such as those provided by recently proposed space-borne experiments.

PLA realizations for VLSI state machines

NASA Technical Reports Server (NTRS)

Gopalakrishnan, S.; Whitaker, S.; Maki, G.; Liu, K.

1990-01-01

A major problem associated with state assignment procedures for VLSI controllers is obtaining an assignment that produces minimal or near minimal logic. The key item in Programmable Logic Array (PLA) area minimization is the number of unique product terms required by the design equations. This paper presents a state assignment algorithm for minimizing the number of product terms required to implement a finite state machine using a PLA. Partition algebra with predecessor state information is used to derive a near optimal state assignment. A maximum bound on the number of product terms required can be obtained by inspecting the predecessor state information. The state assignment algorithm presented is much simpler than existing procedures and leads to the same number of product terms or less. An area-efficient PLA structure implemented in a 1.0 micron CMOS process is presented along with a summary of the performance for a controller implemented using this design procedure.

Tunable hybridization of Majorana bound states at the quantum spin Hall edge

NASA Astrophysics Data System (ADS)

Keidel, Felix; Burset, Pablo; Trauzettel, Björn

2018-02-01

Confinement at the helical edge of a topological insulator is possible in the presence of proximity-induced magnetic (F) or superconducting (S) order. The interplay of both phenomena leads to the formation of localized Majorana bound states (MBS) or likewise (under certain resonance conditions) the formation of ordinary Andreev bound states (ABS). We investigate the properties of bound states in junctions composed of alternating regions of F or S barriers. Interestingly, the direction of magnetization in F regions and the relative superconducting phase between S regions can be exploited to hybridize MBS or ABS at will. We show that the local properties of MBS translate into a particular nonlocal superconducting pairing amplitude. Remarkably, the symmetry of the pairing amplitude contains information about the nature of the bound state that it stems from. Hence this symmetry can in principle be used to distinguish MBS from ABS, owing to the strong connection between local density of states and nonlocal pairing in our setup.

STATIC QUARK ANTI-QUARK FREE AND INTERNAL ENERGY IN 2-FLAVOR QCD AND BOUND STATES IN THE QGP.

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

ZANTOW, F.; KACZMAREK, O.

2005-07-25

We present results on heavy quark free energies in 2-flavour QCD. The temperature dependence of the interaction between static quark anti-quark pairs will be analyzed in terms of temperature dependent screening radii, which give a first estimate on the medium modification of (heavy quark) bound states in the quark gluon plasma. Comparing those radii to the (zero temperature) mean squared charge radii of chasmonium states indicates that the J/{Psi} may survive the phase transition as a bound state, while {chi}{sub c} and {Psi}{prime} are expected to show significant thermal modifications at temperatures close to the transition. Furthermore we will analyzemore » the relation between heavy quark free energies, entropy contributions and internal energy and discuss their relation to potential models used to analyze the melting of heavy quark bound states above the deconfinement temperature. Results of different groups and various potential models for bound states in the deconfined phase of QCD are compared.« less

Observation of three-photon bound states in a quantum nonlinear medium

NASA Astrophysics Data System (ADS)

Liang, Qi-Yu; Venkatramani, Aditya V.; Cantu, Sergio H.; Nicholson, Travis L.; Gullans, Michael J.; Gorshkov, Alexey V.; Thompson, Jeff D.; Chin, Cheng; Lukin, Mikhail D.; Vuletić, Vladan

2018-02-01

Bound states of massive particles, such as nuclei, atoms, or molecules, constitute the bulk of the visible world around us. By contrast, photons typically only interact weakly. We report the observation of traveling three-photon bound states in a quantum nonlinear medium where the interactions between photons are mediated by atomic Rydberg states. Photon correlation and conditional phase measurements reveal the distinct bunching and phase features associated with three-photon and two-photon bound states. Such photonic trimers and dimers possess shape-preserving wave functions that depend on the constituent photon number. The observed bunching and strongly nonlinear optical phase are described by an effective field theory of Rydberg-induced photon-photon interactions. These observations demonstrate the ability to realize and control strongly interacting quantum many-body states of light.

Transfer Function Bounds for Partial-unit-memory Convolutional Codes Based on Reduced State Diagram

NASA Technical Reports Server (NTRS)

Lee, P. J.

1984-01-01

The performance of a coding system consisting of a convolutional encoder and a Viterbi decoder is analytically found by the well-known transfer function bounding technique. For the partial-unit-memory byte-oriented convolutional encoder with m sub 0 binary memory cells and (k sub 0 m sub 0) inputs, a state diagram of 2(K) (sub 0) was for the transfer function bound. A reduced state diagram of (2 (m sub 0) +1) is used for easy evaluation of transfer function bounds for partial-unit-memory codes.

Distinguishing Majorana bound states from localized Andreev bound states by interferometry

NASA Astrophysics Data System (ADS)

Hell, Michael; Flensberg, Karsten; Leijnse, Martin

2018-04-01

Experimental evidence for Majorana bound states (MBSs) is so far mainly based on the robustness of a zero-bias conductance peak. However, similar features can also arise due to Andreev bound states (ABSs) localized at the end of an island. We show that these two scenarios can be distinguished by an interferometry experiment based on embedding a Coulomb-blockaded island into an Aharonov-Bohm ring. For two ABSs, when the ground state is nearly degenerate, cotunneling can change the state of the island, and interference is suppressed. By contrast, for two MBSs the ground state is nondegenerate, and cotunneling has to preserve the island state, which leads to h /e -periodic conductance oscillations with magnetic flux. Such interference setups can be realized with semiconducting nanowires or two-dimensional electron gases with proximity-induced superconductivity and may also be a useful spectroscopic tool for parity-flip mechanisms.

Universal bounds on current fluctuations.

PubMed

Pietzonka, Patrick; Barato, Andre C; Seifert, Udo

2016-05-01

For current fluctuations in nonequilibrium steady states of Markovian processes, we derive four different universal bounds valid beyond the Gaussian regime. Different variants of these bounds apply to either the entropy change or any individual current, e.g., the rate of substrate consumption in a chemical reaction or the electron current in an electronic device. The bounds vary with respect to their degree of universality and tightness. A universal parabolic bound on the generating function of an arbitrary current depends solely on the average entropy production. A second, stronger bound requires knowledge both of the thermodynamic forces that drive the system and of the topology of the network of states. These two bounds are conjectures based on extensive numerics. An exponential bound that depends only on the average entropy production and the average number of transitions per time is rigorously proved. This bound has no obvious relation to the parabolic bound but it is typically tighter further away from equilibrium. An asymptotic bound that depends on the specific transition rates and becomes tight for large fluctuations is also derived. This bound allows for the prediction of the asymptotic growth of the generating function. Even though our results are restricted to networks with a finite number of states, we show that the parabolic bound is also valid for three paradigmatic examples of driven diffusive systems for which the generating function can be calculated using the additivity principle. Our bounds provide a general class of constraints for nonequilibrium systems.

Family of nonlocal bound entangled states

NASA Astrophysics Data System (ADS)

Yu, Sixia; Oh, C. H.

2017-03-01

Bound entanglement, being entangled yet not distillable, is essential to our understanding of the relations between nonlocality and entanglement besides its applications in certain quantum information tasks. Recently, bound entangled states that violate a Bell inequality have been constructed for a two-qutrit system, disproving a conjecture by Peres that bound entanglement is local. Here we construct this kind of nonlocal bound entangled state for all finite dimensions larger than two, making possible their experimental demonstration in most general systems. We propose a Bell inequality, based on a Hardy-type argument for nonlocality, and a steering inequality to identify their nonlocality. We also provide a family of entanglement witnesses to detect their entanglement beyond the Bell inequality and the steering inequality.

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.

Single-particle trajectories reveal two-state diffusion-kinetics of hOGG1 proteins on DNA.

PubMed

Vestergaard, Christian L; Blainey, Paul C; Flyvbjerg, Henrik

2018-03-16

We reanalyze trajectories of hOGG1 repair proteins diffusing on DNA. A previous analysis of these trajectories with the popular mean-squared-displacement approach revealed only simple diffusion. Here, a new optimal estimator of diffusion coefficients reveals two-state kinetics of the protein. A simple, solvable model, in which the protein randomly switches between a loosely bound, highly mobile state and a tightly bound, less mobile state is the simplest possible dynamic model consistent with the data. It yields accurate estimates of hOGG1's (i) diffusivity in each state, uncorrupted by experimental errors arising from shot noise, motion blur and thermal fluctuations of the DNA; (ii) rates of switching between states and (iii) rate of detachment from the DNA. The protein spends roughly equal time in each state. It detaches only from the loosely bound state, with a rate that depends on pH and the salt concentration in solution, while its rates for switching between states are insensitive to both. The diffusivity in the loosely bound state depends primarily on pH and is three to ten times higher than in the tightly bound state. We propose and discuss some new experiments that take full advantage of the new tools of analysis presented here.

Maximum Relative Entropy of Coherence: An Operational Coherence Measure.

PubMed

Bu, Kaifeng; Singh, Uttam; Fei, Shao-Ming; Pati, Arun Kumar; Wu, Junde

2017-10-13

The operational characterization of quantum coherence is the cornerstone in the development of the resource theory of coherence. We introduce a new coherence quantifier based on maximum relative entropy. We prove that the maximum relative entropy of coherence is directly related to the maximum overlap with maximally coherent states under a particular class of operations, which provides an operational interpretation of the maximum relative entropy of coherence. Moreover, we show that, for any coherent state, there are examples of subchannel discrimination problems such that this coherent state allows for a higher probability of successfully discriminating subchannels than that of all incoherent states. This advantage of coherent states in subchannel discrimination can be exactly characterized by the maximum relative entropy of coherence. By introducing a suitable smooth maximum relative entropy of coherence, we prove that the smooth maximum relative entropy of coherence provides a lower bound of one-shot coherence cost, and the maximum relative entropy of coherence is equivalent to the relative entropy of coherence in the asymptotic limit. Similar to the maximum relative entropy of coherence, the minimum relative entropy of coherence has also been investigated. We show that the minimum relative entropy of coherence provides an upper bound of one-shot coherence distillation, and in the asymptotic limit the minimum relative entropy of coherence is equivalent to the relative entropy of coherence.

Adaptive NN Control Using Integral Barrier Lyapunov Functionals for Uncertain Nonlinear Block-Triangular Constraint Systems.

PubMed

Liu, Yan-Jun; Tong, Shaocheng; Chen, C L Philip; Li, Dong-Juan

2017-11-01

A neural network (NN) adaptive control design problem is addressed for a class of uncertain multi-input-multi-output (MIMO) nonlinear systems in block-triangular form. The considered systems contain uncertainty dynamics and their states are enforced to subject to bounded constraints as well as the couplings among various inputs and outputs are inserted in each subsystem. To stabilize this class of systems, a novel adaptive control strategy is constructively framed by using the backstepping design technique and NNs. The novel integral barrier Lyapunov functionals (BLFs) are employed to overcome the violation of the full state constraints. The proposed strategy can not only guarantee the boundedness of the closed-loop system and the outputs are driven to follow the reference signals, but also can ensure all the states to remain in the predefined compact sets. Moreover, the transformed constraints on the errors are used in the previous BLF, and accordingly it is required to determine clearly the bounds of the virtual controllers. Thus, it can relax the conservative limitations in the traditional BLF-based controls for the full state constraints. This conservatism can be solved in this paper and it is for the first time to control this class of MIMO systems with the full state constraints. The performance of the proposed control strategy can be verified through a simulation example.

High precision optical spectroscopy and quantum state selected photodissociation of ultracold 88Sr2 molecules in an optical lattice

NASA Astrophysics Data System (ADS)

McDonald, Mickey Patrick

Over the past several decades, rapid progress has been made toward the accurate characterization and control of atoms, made possible largely by the development of narrow-linewidth lasers and techniques for trapping and cooling at ultracold temperatures. Extending this progress to molecules will have exciting implications for chemistry, condensed matter physics, and precision tests of physics beyond the Standard Model. These possibilities are all consequences of the richness of molecular structure, which is governed by physics substantially different from that characterizing atomic structure. This same richness of structure, however, increases the complexity of any molecular experiment manyfold over its atomic counterpart, magnifying the difficulty of everything from trapping and cooling to the comparison of theory with experiment. This thesis describes work performed over the past six years to establish the state of the art in manipulation and quantum control of ultracold molecules. Our molecules are produced via photoassociation of ultracold strontium atoms followed by spontaneous decay to a stable ground state. We describe a thorough set of measurements characterizing the rovibrational structure of very weakly bound (and therefore very large) 88Sr2 molecules from several different perspectives, including determinations of binding energies; linear, quadratic, and higher order Zeeman shifts; transition strengths between bound states; and lifetimes of narrow subradiant states. The physical intuition gained in these experiments applies generally to weakly bound diatomic molecules, and suggests extensive applications in precision measurement and metrology. In addition, we present a detailed analysis of the thermally broadened spectroscopic lineshape of molecules in a non-magic optical lattice trap, showing how such lineshapes can be used to directly determine the temperature of atoms or molecules in situ, addressing a long-standing problem in ultracold physics. Finally, we discuss the measurement of photofragment angular distributions produced by photodissociation, leading to an exploration of quantum-state-resolved ultracold chemistry.

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.

The nucleotide-free state of heterotrimeric G proteins α-subunit adopts a highly stable conformation.

PubMed

Andhirka, Sai Krishna; Vignesh, Ravichandran; Aradhyam, Gopala Krishna

2017-08-01

Deciphering the mechanism of activation of heterotrimeric G proteins by their cognate receptors continues to be an intriguing area of research. The recently solved crystal structure of the ternary complex captured the receptor-bound α-subunit in an open conformation, without bound nucleotide has improved our understanding of the activation process. Despite these advancements, the mechanism by which the receptor causes GDP release from the α-subunit remains elusive. To elucidate the mechanism of activation, we studied guanine nucleotide-induced structural stability of the α-subunit (in response to thermal/chaotrope-mediated stress). Inherent stabilities of the inactive (GDP-bound) and active (GTP-bound) forms contribute antagonistically to the difference in conformational stability whereas the GDP-bound protein is able to switch to a stable intermediate state, GTP-bound protein loses this ability. Partial perturbation of the protein fold reveals the underlying influence of the bound nucleotide providing an insight into the mechanism of activation. An extra stable, pretransition intermediate, 'empty pocket' state (conformationally active-state like) in the unfolding pathway of GDP-bound protein mimics a gating system - the activation process having to overcome this stable intermediate state. We demonstrate that a relatively more complex conformational fold of the GDP-bound protein is at the core of the gating system. We report capturing this threshold, 'metastable empty pocket' conformation (the gate) of α-subunit of G protein and hypothesize that the receptor activates the G protein by enabling it to achieve this structure through mild structural perturbation. © 2017 Federation of European Biochemical Societies.

A Posteriori Bounds for Linear-Functional Outputs of Crouzeix-Raviart Finite Element Discretizations of the Incompressible Stokes Problem

NASA Technical Reports Server (NTRS)

Patera, Anthony T.; Paraschivoiu, Marius

1998-01-01

We present a finite element technique for the efficient generation of lower and upper bounds to outputs which are linear functionals of the solutions to the incompressible Stokes equations in two space dimensions; the finite element discretization is effected by Crouzeix-Raviart elements, the discontinuous pressure approximation of which is central to our approach. The bounds are based upon the construction of an augmented Lagrangian: the objective is a quadratic "energy" reformulation of the desired output; the constraints are the finite element equilibrium equations (including the incompressibility constraint), and the intersubdomain continuity conditions on velocity. Appeal to the dual max-min problem for appropriately chosen candidate Lagrange multipliers then yields inexpensive bounds for the output associated with a fine-mesh discretization; the Lagrange multipliers are generated by exploiting an associated coarse-mesh approximation. In addition to the requisite coarse-mesh calculations, the bound technique requires solution only of local subdomain Stokes problems on the fine-mesh. The method is illustrated for the Stokes equations, in which the outputs of interest are the flowrate past, and the lift force on, a body immersed in a channel.

A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization

NASA Astrophysics Data System (ADS)

Quan, Ning; Kim, Harrison M.

2018-03-01

The 0-1 quadratic knapsack problem (QKP) in wind farm layout optimization models possible turbine locations as nodes, and power loss due to wake effects between pairs of turbines as edges in a complete graph. The goal is to select up to a certain number of turbine locations such that the sum of selected node and edge coefficients is maximized. Finding the optimal solution to the QKP is difficult in general, but it is possible to obtain a tight upper bound on the QKP's optimal value which facilitates the use of heuristics to solve QKPs by giving a good estimate of the optimality gap of any feasible solution. This article applies an upper bound method that is especially well-suited to QKPs in wind farm layout optimization due to certain features of the formulation that reduce the computational complexity of calculating the upper bound. The usefulness of the upper bound was demonstrated by assessing the performance of the greedy algorithm for solving QKPs in wind farm layout optimization. The results show that the greedy algorithm produces good solutions within 4% of the optimal value for small to medium sized problems considered in this article.

Finite-time and fixed-time leader-following consensus for multi-agent systems with discontinuous inherent dynamics

NASA Astrophysics Data System (ADS)

Ning, Boda; Jin, Jiong; Zheng, Jinchuan; Man, Zhihong

2018-06-01

This paper is concerned with finite-time and fixed-time consensus of multi-agent systems in a leader-following framework. Different from conventional leader-following tracking approaches where inherent dynamics satisfying the Lipschitz continuous condition is required, a more generalised case is investigated: discontinuous inherent dynamics. By nonsmooth techniques, a nonlinear protocol is first proposed to achieve the finite-time leader-following consensus. Then, based on fixed-time stability strategies, the fixed-time leader-following consensus problem is solved. An upper bound of settling time is obtained by using a new protocol, and such a bound is independent of initial states, thereby providing additional options for designers in practical scenarios where initial conditions are unavailable. Finally, numerical simulations are provided to demonstrate the effectiveness of the theoretical results.

Adaptive Neural Output Feedback Control for Nonstrict-Feedback Stochastic Nonlinear Systems With Unknown Backlash-Like Hysteresis and Unknown Control Directions.

PubMed

Yu, Zhaoxu; Li, Shugang; Yu, Zhaosheng; Li, Fangfei

2018-04-01

This paper investigates the problem of output feedback adaptive stabilization for a class of nonstrict-feedback stochastic nonlinear systems with both unknown backlashlike hysteresis and unknown control directions. A new linear state transformation is applied to the original system, and then, control design for the new system becomes feasible. By combining the neural network's (NN's) parameterization, variable separation technique, and Nussbaum gain function method, an input-driven observer-based adaptive NN control scheme, which involves only one parameter to be updated, is developed for such systems. All closed-loop signals are bounded in probability and the error signals remain semiglobally bounded in the fourth moment (or mean square). Finally, the effectiveness and the applicability of the proposed control design are verified by two simulation examples.

Stability of Matter-Antimatter Molecules

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

Wong, Cheuk-Yin; Lee, Teck-Ghee

2011-01-01

We examine the stability of matter-antimatter molecules by reducing the four-body problem into a simpler two-body problem with residual interactions. We find that matter-antimatter molecules with constituents (m{sub 1}{sup +}, m{sub 2}{sup -}, {bar m}{sub 2}{sup +}, {bar m}{sub 1}{sup -}) possess bound states if their constituent mass ratio m{sub 1}/m{sub 2} is greater than about 4. This stability condition suggests that the binding of matter-antimatter molecules is a rather common phenomenon. We evaluate the binding energies and eigenstates of matter-antimatter molecules ({mu}{sup +}e{sup 0})-(e{sup +}{mu}{sup -}), ({pi}{sup +}e{sup -})-(e{sup +}{pi}{sup -}), (K{sup +}e{sup -})-(e{sup +}K{sup -}), (pe{sup -})-(e{sup +}{barmore » p}), (p{mu}{sup -})-({mu}{sup +}{bar p}), and (K{sup +}{mu}{sup -})-({mu}{sup +}K{sup -}), which satisfy the stability condition. We estimate the molecular annihilation lifetimes in their s states.« less

Dynamics of DNA breathing: weak noise analysis, finite time singularity, and mapping onto the quantum Coulomb problem.

PubMed

Fogedby, Hans C; Metzler, Ralf

2007-12-01

We study the dynamics of denaturation bubbles in double-stranded DNA on the basis of the Poland-Scheraga model. We show that long time distributions for the survival of DNA bubbles and the size autocorrelation function can be derived from an asymptotic weak noise approach. In particular, below the melting temperature the bubble closure corresponds to a noisy finite time singularity. We demonstrate that the associated Fokker-Planck equation is equivalent to a quantum Coulomb problem. Below the melting temperature, the bubble lifetime is associated with the continuum of scattering states of the repulsive Coulomb potential; at the melting temperature, the Coulomb potential vanishes and the underlying first exit dynamics exhibits a long time power law tail; above the melting temperature, corresponding to an attractive Coulomb potential, the long time dynamics is controlled by the lowest bound state. Correlations and finite size effects are discussed.

Adaptive suboptimal second-order sliding mode control for microgrids

NASA Astrophysics Data System (ADS)

Incremona, Gian Paolo; Cucuzzella, Michele; Ferrara, Antonella

2016-09-01

This paper deals with the design of adaptive suboptimal second-order sliding mode (ASSOSM) control laws for grid-connected microgrids. Due to the presence of the inverter, of unpredicted load changes, of switching among different renewable energy sources, and of electrical parameters variations, the microgrid model is usually affected by uncertain terms which are bounded, but with unknown upper bounds. To theoretically frame the control problem, the class of second-order systems in Brunovsky canonical form, characterised by the presence of matched uncertain terms with unknown bounds, is first considered. Four adaptive strategies are designed, analysed and compared to select the most effective ones to be applied to the microgrid case study. In the first two strategies, the control amplitude is continuously adjusted, so as to arrive at dominating the effect of the uncertainty on the controlled system. When a suitable control amplitude is attained, the origin of the state space of the auxiliary system becomes attractive. In the other two strategies, a suitable blend between two components, one mainly working during the reaching phase, the other being the predominant one in a vicinity of the sliding manifold, is generated, so as to reduce the control amplitude in steady state. The microgrid system in a grid-connected operation mode, controlled via the selected ASSOSM control strategies, exhibits appreciable stability properties, as proved theoretically and shown in simulation.

Bifurcation Analysis Using Rigorous Branch and Bound Methods

NASA Technical Reports Server (NTRS)

Smith, Andrew P.; Crespo, Luis G.; Munoz, Cesar A.; Lowenberg, Mark H.

2014-01-01

For the study of nonlinear dynamic systems, it is important to locate the equilibria and bifurcations occurring within a specified computational domain. This paper proposes a new approach for solving these problems and compares it to the numerical continuation method. The new approach is based upon branch and bound and utilizes rigorous enclosure techniques to yield outer bounding sets of both the equilibrium and local bifurcation manifolds. These sets, which comprise the union of hyper-rectangles, can be made to be as tight as desired. Sufficient conditions for the existence of equilibrium and bifurcation points taking the form of algebraic inequality constraints in the state-parameter space are used to calculate their enclosures directly. The enclosures for the bifurcation sets can be computed independently of the equilibrium manifold, and are guaranteed to contain all solutions within the computational domain. A further advantage of this method is the ability to compute a near-maximally sized hyper-rectangle of high dimension centered at a fixed parameter-state point whose elements are guaranteed to exclude all bifurcation points. This hyper-rectangle, which requires a global description of the bifurcation manifold within the computational domain, cannot be obtained otherwise. A test case, based on the dynamics of a UAV subject to uncertain center of gravity location, is used to illustrate the efficacy of the method by comparing it with numerical continuation and to evaluate its computational complexity.

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.

Observer-based distributed adaptive fault-tolerant containment control of multi-agent systems with general linear dynamics.

PubMed

Ye, Dan; Chen, Mengmeng; Li, Kui

2017-11-01

In this paper, we consider the distributed containment control problem of multi-agent systems with actuator bias faults based on observer method. The objective is to drive the followers into the convex hull spanned by the dynamic leaders, where the input is unknown but bounded. By constructing an observer to estimate the states and bias faults, an effective distributed adaptive fault-tolerant controller is developed. Different from the traditional method, an auxiliary controller gain is designed to deal with the unknown inputs and bias faults together. Moreover, the coupling gain can be adjusted online through the adaptive mechanism without using the global information. Furthermore, the proposed control protocol can guarantee that all the signals of the closed-loop systems are bounded and all the followers converge to the convex hull with bounded residual errors formed by the dynamic leaders. Finally, a decoupled linearized longitudinal motion model of the F-18 aircraft is used to demonstrate the effectiveness. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

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

Dufour, F., E-mail: dufour@math.u-bordeaux1.fr; Prieto-Rumeau, T., E-mail: tprieto@ccia.uned.es

We consider a discrete-time constrained discounted Markov decision process (MDP) with Borel state and action spaces, compact action sets, and lower semi-continuous cost functions. We introduce a set of hypotheses related to a positive weight function which allow us to consider cost functions that might not be bounded below by a constant, and which imply the solvability of the linear programming formulation of the constrained MDP. In particular, we establish the existence of a constrained optimal stationary policy. Our results are illustrated with an application to a fishery management problem.

Confining potential in momentum space

NASA Technical Reports Server (NTRS)

Norbury, John W.; Kahana, David E.; Maung, Khin Maung

1992-01-01

A method is presented for the solution in momentum space of the bound state problem with a linear potential in r space. The potential is unbounded at large r leading to a singularity at small q. The singularity is integrable, when regulated by exponentially screening the r-space potential, and is removed by a subtraction technique. The limit of zero screening is taken analytically, and the numerical solution of the subtracted integral equation gives eigenvalues and wave functions in good agreement with position space calculations.

Boson-boson effective nonrelativistic potential for higher-derivative electromagnetic theories in D dimensions

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

Accioly, Antonio; Dias, Marco

2004-11-15

The problem of computing the effective nonrelativistic potential U{sub D} for the interaction of charged-scalar bosons, within the context of D-dimensional electromagnetism with a cutoff, is reduced to quadratures. It is shown that U{sub 3} cannot bind a pair of identical charged-scalar bosons; nevertheless, numerical calculations indicate that boson-boson bound states do exist in the framework of three-dimensional higher-derivative electromagnetism augmented by a topological Chern-Simons term.

Magnetoconductance signatures of chiral domain-wall bound states in magnetic topological insulators

NASA Astrophysics Data System (ADS)

Tiwari, Kunal L.; Coish, W. A.; Pereg-Barnea, T.

2017-12-01

Recent magnetoconductance measurements performed on magnetic topological insulator candidates have revealed butterfly-shaped hysteresis. This hysteresis has been attributed to the formation of gapless chiral domain-wall bound states during a magnetic-field sweep. We treat this phenomenon theoretically, providing a link between microscopic magnetization dynamics and butterfly hysteresis in magnetoconductance. Further, we illustrate how a spatially resolved conductance measurement can probe the most striking feature of the domain-wall bound states: their chirality. This work establishes a regime where a definitive link between butterfly hysteresis in longitudinal magneto-conductance and domain-wall bound states can be made. This analysis provides an important tool for the identification of magnetic topological insulators.

Cosmological implications of Dark Matter bound states

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

Mitridate, Andrea; Redi, Michele; Smirnov, Juri

2017-05-01

We present generic formulæ for computing how Sommerfeld corrections together with bound-state formation affects the thermal abundance of Dark Matter with non-abelian gauge interactions. We consider DM as a fermion 3plet (wino) or 5plet under SU(2) {sub L} . In the latter case bound states raise to 11.5 TeV the DM mass required to reproduce the cosmological DM abundance and give indirect detection signals such as (for this mass) a dominant γ-line around 70 GeV. Furthermore, we consider DM co-annihilating with a colored particle, such as a squark or a gluino, finding that bound state effects are especially relevant inmore » the latter case.« less

Quantum sensing of the phase-space-displacement parameters using a single trapped ion

NASA Astrophysics Data System (ADS)

Ivanov, Peter A.; Vitanov, Nikolay V.

2018-03-01

We introduce a quantum sensing protocol for detecting the parameters characterizing the phase-space displacement by using a single trapped ion as a quantum probe. We show that, thanks to the laser-induced coupling between the ion's internal states and the motion mode, the estimation of the two conjugated parameters describing the displacement can be efficiently performed by a set of measurements of the atomic state populations. Furthermore, we introduce a three-parameter protocol capable of detecting the magnitude, the transverse direction, and the phase of the displacement. We characterize the uncertainty of the two- and three-parameter problems in terms of the Fisher information and show that state projective measurement saturates the fundamental quantum Cramér-Rao bound.

Multistate and multihypothesis discrimination with open quantum systems

NASA Astrophysics Data System (ADS)

Kiilerich, Alexander Holm; Mølmer, Klaus

2018-05-01

We show how an upper bound for the ability to discriminate any number N of candidates for the Hamiltonian governing the evolution of an open quantum system may be calculated by numerically efficient means. Our method applies an effective master-equation analysis to evaluate the pairwise overlaps between candidate full states of the system and its environment pertaining to the Hamiltonians. These overlaps are then used to construct an N -dimensional representation of the states. The optimal positive-operator valued measure (POVM) and the corresponding probability of assigning a false hypothesis may subsequently be evaluated by phrasing optimal discrimination of multiple nonorthogonal quantum states as a semidefinite programming problem. We provide three realistic examples of multihypothesis testing with open quantum systems.

On increasing stability in the two dimensional inverse source scattering problem with many frequencies

NASA Astrophysics Data System (ADS)

Entekhabi, Mozhgan Nora; Isakov, Victor

2018-05-01

In this paper, we will study the increasing stability in the inverse source problem for the Helmholtz equation in the plane when the source term is assumed to be compactly supported in a bounded domain Ω with a sufficiently smooth boundary. Using the Fourier transform in the frequency domain, bounds for the Hankel functions and for scattering solutions in the complex plane, improving bounds for the analytic continuation, and the exact observability for the wave equation led us to our goals which are a sharp uniqueness and increasing stability estimate when the wave number interval is growing.

Probing Gαi1 Protein Activation at Single Amino Acid Resolution

PubMed Central

Sun, Dawei; Maeda, Shoji; Matkovic, Milos; Mendieta, Sandro; Mayer, Daniel; Dawson, Roger; Schertler, Gebhard F.X.; Madan Babu, M.; Veprintsev, Dmitry B.

2016-01-01

We present comprehensive single amino acid resolution maps of the residues stabilising the human Gαi1 subunit in nucleotide- and receptor-bound states. We generated these maps by measuring the effects of alanine mutations on the stability of Gαi1 and of the rhodopsin-Gαi1 complex. We identified stabilization clusters in the GTPase and helical domains responsible for structural integrity and the conformational changes associated with activation. In activation cluster I, helices α1 and α5 pack against strands β1-3 to stabilize the nucleotide-bound states. In the receptor-bound state, these interactions are replaced by interactions between α5 and strands β4-6. Key residues in this cluster are Y320, crucial for the stabilization of the receptor-bound state, and F336, which stabilizes nucleotide-bound states. Destabilization of helix α1, caused by rearrangement of this activation cluster, leads to the weakening of the inter-domain interface and release of GDP. PMID:26258638

Lower bounds of concurrence for N-qubit systems and the detection of k-nonseparability of multipartite quantum systems

NASA Astrophysics Data System (ADS)

Qi, Xianfei; Gao, Ting; Yan, Fengli

2017-01-01

Concurrence, as one of the entanglement measures, is a useful tool to characterize quantum entanglement in various quantum systems. However, the computation of the concurrence involves difficult optimizations and only for the case of two qubits, an exact formula was found. We investigate the concurrence of four-qubit quantum states and derive analytical lower bound of concurrence using the multiqubit monogamy inequality. It is shown that this lower bound is able to improve the existing bounds. This approach can be generalized to arbitrary qubit systems. We present an exact formula of concurrence for some mixed quantum states. For even-qubit states, we derive an improved lower bound of concurrence using a monogamy equality for qubit systems. At the same time, we show that a multipartite state is k-nonseparable if the multipartite concurrence is larger than a constant related to the value of k, the qudit number and the dimension of the subsystems. Our results can be applied to detect the multipartite k-nonseparable states.

Data layer integration for the national map of the united states

USGS Publications Warehouse

Usery, E.L.; Finn, M.P.; Starbuck, M.

2009-01-01

The integration of geographic data layers in multiple raster and vector formats, from many different organizations and at a variety of resolutions and scales, is a significant problem for The National Map of the United States being developed by the U.S. Geological Survey. Our research has examined data integration from a layer-based approach for five of The National Map data layers: digital orthoimages, elevation, land cover, hydrography, and transportation. An empirical approach has included visual assessment by a set of respondents with statistical analysis to establish the meaning of various types of integration. A separate theoretical approach with established hypotheses tested against actual data sets has resulted in an automated procedure for integration of specific layers and is being tested. The empirical analysis has established resolution bounds on meanings of integration with raster datasets and distance bounds for vector data. The theoretical approach has used a combination of theories on cartographic transformation and generalization, such as T??pfer's radical law, and additional research concerning optimum viewing scales for digital images to establish a set of guiding principles for integrating data of different resolutions.

Nucleon Viewed as a Borromean Bound-State

NASA Astrophysics Data System (ADS)

Segovia, Jorge; Mezrag, Cédric; Chang, Lei; Roberts, Craig D.

2018-05-01

We explain how the emergent phenomenon of dynamical chiral symmetry breaking ensures that Poincaré covariant analyses of the three valence-quark scattering problem in continuum quantum field theory yield a picture of the nucleon as a Borromean bound-state, in which binding arises primarily through the sum of two separate contributions. One involves aspects of the non-Abelian character of Quantum Chromodynamics that are expressed in the strong running coupling and generate tight, dynamical color-antitriplet quark-quark correlations in the scalar-isoscalar and pseudovector-isotriplet channels. This attraction is magnified by quark exchange associated with diquark breakup and reformation, which is required in order to ensure that each valence-quark participates in all diquark correlations to the complete extent allowed by its quantum numbers. Combining these effects, we arrive at a properly antisymmetrised Faddeev wave function for the nucleon and calculate, e.g. the flavor-separated versions of the Dirac and Pauli form factors and the proton's leading-twist parton distribution amplitude. We conclude that available data and planned experiments are capable of validating the proposed picture.

Intelligent robust tracking control for a class of uncertain strict-feedback nonlinear systems.

PubMed

Chang, Yeong-Chan

2009-02-01

This paper addresses the problem of designing robust tracking controls for a large class of strict-feedback nonlinear systems involving plant uncertainties and external disturbances. The input and virtual input weighting matrices are perturbed by bounded time-varying uncertainties. An adaptive fuzzy-based (or neural-network-based) dynamic feedback tracking controller will be developed such that all the states and signals of the closed-loop system are bounded and the trajectory tracking error should be as small as possible. First, the adaptive approximators with linearly parameterized models are designed, and a partitioned procedure with respect to the developed adaptive approximators is proposed such that the implementation of the fuzzy (or neural network) basis functions depends only on the state variables but does not depend on the tuning approximation parameters. Furthermore, we extend to design the nonlinearly parameterized adaptive approximators. Consequently, the intelligent robust tracking control schemes developed in this paper possess the properties of computational simplicity and easy implementation. Finally, simulation examples are presented to demonstrate the effectiveness of the proposed control algorithms.

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.

Confidence set inference with a prior quadratic bound

NASA Technical Reports Server (NTRS)

Backus, George E.

1988-01-01

In the uniqueness part of a geophysical inverse problem, the observer wants to predict all likely values of P unknown numerical properties z = (z sub 1,...,z sub p) of the earth from measurement of D other numerical properties y(0)=(y sub 1(0),...,y sub D(0)) knowledge of the statistical distribution of the random errors in y(0). The data space Y containing y(0) is D-dimensional, so when the model space X is infinite-dimensional the linear uniqueness problem usually is insoluble without prior information about the correct earth model x. If that information is a quadratic bound on x (e.g., energy or dissipation rate), Bayesian inference (BI) and stochastic inversion (SI) inject spurious structure into x, implied by neither the data nor the quadratic bound. Confidence set inference (CSI) provides an alternative inversion technique free of this objection. CSI is illustrated in the problem of estimating the geomagnetic field B at the core-mantle boundary (CMB) from components of B measured on or above the earth's surface. Neither the heat flow nor the energy bound is strong enough to permit estimation of B(r) at single points on the CMB, but the heat flow bound permits estimation of uniform averages of B(r) over discs on the CMB, and both bounds permit weighted disc-averages with continous weighting kernels. Both bounds also permit estimation of low-degree Gauss coefficients at the CMB. The heat flow bound resolves them up to degree 8 if the crustal field at satellite altitudes must be treated as a systematic error, but can resolve to degree 11 under the most favorable statistical treatment of the crust. These two limits produce circles of confusion on the CMB with diameters of 25 deg and 19 deg respectively.

Symmetry-breaking instability of quadratic soliton bound states

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

Delque, Michaeel; Departement d'Optique P.M. Duffieux, Institut FEMTO-ST, Universite de Franche-Comte, CNRS UMR 6174, F-25030 Besancon; Fanjoux, Gil

We study both numerically and experimentally two-dimensional soliton bound states in quadratic media and demonstrate their symmetry-breaking instability. The experiment is performed in a potassium titanyl phosphate crystal in a type-II configuration. The bound state is generated by the copropagation of the antisymmetric fundamental beam locked in phase with the symmetrical second harmonic one. Experimental results are in good agreement with numerical simulations of the nonlinear wave 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.

Antiproton--neutron bound state

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

Ju, I.; Tomozawa, Y.

1972-08-01

The possibility of an antiproton-neutron bound state for explaining a narrow peak which was found recently in the experiment p + n yields 4 pi and 6 pi is discussed. It is pointed out that the state is likely to be a /sup 1/P/ sub 1/ state or a higher angular momentum state. (auth)

Decoding communities in networks

NASA Astrophysics Data System (ADS)

Radicchi, Filippo

2018-02-01

According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

Decoding communities in networks.

PubMed

Radicchi, Filippo

2018-02-01

According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

Secure key from bound entanglement.

PubMed

Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Oppenheim, Jonathan

2005-04-29

We characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states that have less distillable private keys than the entanglement cost of the state. In general, the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of states which have Bell states correlated to separable hiding states. We also describe a technique for finding states exhibiting irreversibility in entanglement distillation.

Ab initio investigation on the valence and dipole-bound states of CNa - and SiNa -

NASA Astrophysics Data System (ADS)

Kalcher, Josef; Sax, Alexander F.

2000-08-01

CNa - and SiNa - have been studied by the CAS-ACPF method. The 3Σ- ground states have binding energies of 5420 and 7517 cm -1, respectively. The 5Σ- excited states are 494 and 1551 cm -1 above the respective ground states. The 1Δ , 3Π , and 1Π valence-excited states for SiNa - should be at least metastable. CNa - and SiNa - possess dipole-bound 5Σ- and 3Σ- states. Binding energies of these states in CNa - are 217 and 236 cm -1, respectively. SiNa - has two stable 5Σ- dipole-bound states, whose binding energies are 246 and 118 cm -1, respectively.

The cost-constrained traveling salesman problem

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

Sokkappa, P.R.

1990-10-01

The Cost-Constrained Traveling Salesman Problem (CCTSP) is a variant of the well-known Traveling Salesman Problem (TSP). In the TSP, the goal is to find a tour of a given set of cities such that the total cost of the tour is minimized. In the CCTSP, each city is given a value, and a fixed cost-constraint is specified. The objective is to find a subtour of the cities that achieves maximum value without exceeding the cost-constraint. Thus, unlike the TSP, the CCTSP requires both selection and sequencing. As a consequence, most results for the TSP cannot be extended to the CCTSP.more » We show that the CCTSP is NP-hard and that no K-approximation algorithm or fully polynomial approximation scheme exists, unless P = NP. We also show that several special cases are polynomially solvable. Algorithms for the CCTSP, which outperform previous methods, are developed in three areas: upper bounding methods, exact algorithms, and heuristics. We found that a bounding strategy based on the knapsack problem performs better, both in speed and in the quality of the bounds, than methods based on the assignment problem. Likewise, we found that a branch-and-bound approach using the knapsack bound was superior to a method based on a common branch-and-bound method for the TSP. In our study of heuristic algorithms, we found that, when selecting modes for inclusion in the subtour, it is important to consider the neighborhood'' of the nodes. A node with low value that brings the subtour near many other nodes may be more desirable than an isolated node of high value. We found two types of repetition to be desirable: repetitions based on randomization in the subtour buildings process, and repetitions encouraging the inclusion of different subsets of the nodes. By varying the number and type of repetitions, we can adjust the computation time required by our method to obtain algorithms that outperform previous methods.« less

Partial branch and bound algorithm for improved data association in multiframe processing

NASA Astrophysics Data System (ADS)

Poore, Aubrey B.; Yan, Xin

1999-07-01

A central problem in multitarget, multisensor, and multiplatform tracking remains that of data association. Lagrangian relaxation methods have shown themselves to yield near optimal answers in real-time. The necessary improvement in the quality of these solutions warrants a continuing interest in these methods. These problems are NP-hard; the only known methods for solving them optimally are enumerative in nature with branch-and-bound being most efficient. Thus, the development of methods less than a full branch-and-bound are needed for improving the quality. Such methods as K-best, local search, and randomized search have been proposed to improve the quality of the relaxation solution. Here, a partial branch-and-bound technique along with adequate branching and ordering rules are developed. Lagrangian relaxation is used as a branching method and as a method to calculate the lower bound for subproblems. The result shows that the branch-and-bound framework greatly improves the resolution quality of the Lagrangian relaxation algorithm and yields better multiple solutions in less time than relaxation alone.

Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation

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

Smolinski, B.

The 0-1 multiple knapsack problem appears in many domains from financial portfolio management to cargo ship stowing. Methods for solving it range from approximate algorithms, such as greedy algorithms, to exact algorithms, such as branch and bound. Approximate algorithms have no bounds on how poorly they perform and exact algorithms can suffer from exponential time and space complexities with large data sets. This paper introduces a market model based on agent decomposition and market auctions for approximating the 0-1 multiple knapsack problem, and an algorithm that implements the model (M(x)). M(x) traverses the solution space rather than getting caught inmore » a local maximum, overcoming an inherent problem of many greedy algorithms. The use of agents ensures that infeasible solutions are not considered while traversing the solution space and that traversal of the solution space is not just random, but is also directed. M(x) is compared to a bound and bound algorithm (BB) and a simple greedy algorithm with a random shuffle (G(x)). The results suggest that M(x) is a good algorithm for approximating the 0-1 Multiple Knapsack problem. M(x) almost always found solutions that were close to optimal in a fraction of the time it took BB to run and with much less memory on large test data sets. M(x) usually performed better than G(x) on hard problems with correlated data.« less

Numerical Solutions of One Reduced Bethe-Salpeter Equation for the Coulombic Bound States Composed of Virtual Constituents

NASA Astrophysics Data System (ADS)

Chen, Jiao-Kai

2018-04-01

We present one reduction of the Bethe-Salpeter equation for the bound states composed of two off-mass-shell constituents. Both the relativistic effects and the virtuality effects can be considered in the obtained spinless virtuality distribution equation. The eigenvalues of the spinless virtuality distribution equation are perturbatively calculated and the bound states e+e-, μ+μ-, τ+τ-, μ+e-, and τ+e- are discussed.

Goldstonic pseudoscalar mesons in Bethe-Salpeter-inspired setting

NASA Astrophysics Data System (ADS)

Lucha, Wolfgang; Schöberl, Franz F.

2018-03-01

For a two-particle bound-state equation closer to its Bethe-Salpeter origins than Salpeter’s equation, with effective interaction kernel deliberately forged such as to ensure, in the limit of zero mass of the bound-state constituents, the vanishing of the arising bound-state mass, we scrutinize the emerging features of the lightest pseudoscalar mesons for their agreement with the behavior predicted by a generalization of the Gell-Mann-Oakes-Renner relation.

Limits on efficient computation in the physical world

NASA Astrophysics Data System (ADS)

Aaronson, Scott Joel

More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which. In the first part of the thesis, I attack the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known. In particular, any quantum algorithm that solves the collision problem---that of deciding whether a sequence of n integers is one-to-one or two-to-one---must query the sequence O (n1/5) times. This resolves a question that was open for years; previously no lower bound better than constant was known. A corollary is that there is no "black-box" quantum algorithm to break cryptographic hash functions or solve the Graph Isomorphism problem in polynomial time. I also show that relative to an oracle, quantum computers could not solve NP-complete problems in polynomial time, even with the help of nonuniform "quantum advice states"; and that any quantum algorithm needs O (2n/4/n) queries to find a local minimum of a black-box function on the n-dimensional hypercube. Surprisingly, the latter result also leads to new classical lower bounds for the local search problem. Finally, I give new lower bounds on quantum one-way communication complexity, and on the quantum query complexity of total Boolean functions and recursive Fourier sampling. The second part of the thesis studies the relationship of the quantum computing model to physical reality. I first examine the arguments of Leonid Levin, Stephen Wolfram, and others who believe quantum computing to be fundamentally impossible. I find their arguments unconvincing without a "Sure/Shor separator"---a criterion that separates the already-verified quantum states from those that appear in Shor's factoring algorithm. I argue that such a separator should be based on a complexity classification of quantum states, and go on to create such a classification. Next I ask what happens to the quantum computing model if we take into account that the speed of light is finite---and in particular, whether Grover's algorithm still yields a quadratic speedup for searching a database. Refuting a claim by Benioff, I show that the surprising answer is yes. Finally, I analyze hypothetical models of computation that go even beyond quantum computing. I show that many such models would be as powerful as the complexity class PP, and use this fact to give a simple, quantum computing based proof that PP is closed under intersection. On the other hand, I also present one model---wherein we could sample the entire history of a hidden variable---that appears to be more powerful than standard quantum computing, but only slightly so.

Minimum-error quantum distinguishability bounds from matrix monotone functions: A comment on 'Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds' [J. Math. Phys. 50, 032106 (2009)

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

Tyson, Jon

2009-06-15

Matrix monotonicity is used to obtain upper bounds on minimum-error distinguishability of arbitrary ensembles of mixed quantum states. This generalizes one direction of a two-sided bound recently obtained by the author [J. Tyson, J. Math. Phys. 50, 032106 (2009)]. It is shown that the previously obtained special case has unique properties.

Unliganded HIV-1 gp120 core structures assume the CD4-bound conformation with regulation by quaternary interactions and variable loops

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

Kwon, Young Do; Finzi, Andrés; Wu, Xueling

2013-03-04

The HIV-1 envelope (Env) spike (gp120{sub 3}/gp41{sub 3}) undergoes considerable structural rearrangements to mediate virus entry into cells and to evade the host immune response. Engagement of CD4, the primary human receptor, fixes a particular conformation and primes Env for entry. The CD4-bound state, however, is prone to spontaneous inactivation and susceptible to antibody neutralization. How does unliganded HIV-1 maintain CD4-binding capacity and regulate transitions to the CD4-bound state? To define this mechanistically, we determined crystal structures of unliganded core gp120 from HIV-1 clades B, C, and E. Notably, all of these unliganded HIV-1 structures resembled the CD4-bound state. Conformationalmore » fixation with ligand selection and thermodynamic analysis of full-length and core gp120 interactions revealed that the tendency of HIV-1 gp120 to adopt the CD4-bound conformation was restrained by the V1/V2- and V3-variable loops. In parallel, we determined the structure of core gp120 in complex with the small molecule, NBD-556, which specifically recognizes the CD4-bound conformation of gp120. Neutralization by NBD-556 indicated that Env spikes on primary isolates rarely assume the CD4-bound conformation spontaneously, although they could do so when quaternary restraints were loosened. Together, the results suggest that the CD4-bound conformation represents a 'ground state' for the gp120 core, with variable loop and quaternary interactions restraining unliganded gp120 from 'snapping' into this conformation. A mechanism of control involving deformations in unliganded structure from a functionally critical state (e.g., the CD4-bound state) provides advantages in terms of HIV-1 Env structural diversity and resistance to antibodies and inhibitors, while maintaining elements essential for entry.« less

Impact of iron-site defects on superconductivity in LiFeAs

DOE PAGES

Chi, Shun; Aluru, Ramakrishna; Singh, Udai Raj; ...

2016-10-19

In conventional s -wave superconductors, only magnetic impurities exhibit impurity bound states, whereas for an s ± order parameter they can occur for both magnetic and nonmagnetic impurities. Impurity bound states in superconductors can thus provide important insight into the order parameter. We present a combined experimental and theoretical study of native and engineered iron-site defects in LiFeAs. A detailed comparison of tunneling spectra measured on impurities with spin-fluctuation theory reveals a continuous evolution from negligible impurity-bound-state features for weaker scattering potential to clearly detectable states for somewhat stronger scattering potentials. Furthermore, all bound states for these intermediate strengthmore » potentials are pinned at or close to the gap edge of the smaller gap, a phenomenon that we explain and ascribe to multiorbital physics.« less

Tunneling spectroscopy of quasiparticle bound states in a spinful Josephson junction.

PubMed

Chang, W; Manucharyan, V E; Jespersen, T S; Nygård, J; Marcus, C M

2013-05-24

The spectrum of a segment of InAs nanowire, confined between two superconducting leads, was measured as function of gate voltage and superconducting phase difference using a third normal-metal tunnel probe. Subgap resonances for odd electron occupancy-interpreted as bound states involving a confined electron and a quasiparticle from the superconducting leads, reminiscent of Yu-Shiba-Rusinov states-evolve into Kondo-related resonances at higher magnetic fields. An additional zero-bias peak of unknown origin is observed to coexist with the quasiparticle bound states.

Perspective on the Origin of Hadron Masses

NASA Astrophysics Data System (ADS)

Roberts, Craig D.

2017-01-01

The energy-momentum tensor in chiral QCD, T_{μ ν }, exhibits an anomaly, viz. \\varTheta _0 := T_{μ μ } ne 0. Measured in the proton, this anomaly yields m_p^2, where m_p is the proton's mass; but, at the same time, when computed in the pion, the answer is m_π ^2=0. Any attempt to understand the origin and nature of mass, and identify observable expressions thereof, must explain and unify these two apparently contradictory results, which are fundamental to the nature of our Universe. Given the importance of Poincaré-invariance in modern physics, the utility of a frame-dependent approach to this problem seems limited. That is especially true of any approach tied to a rest-frame decomposition of T_{μ ν } because a massless particle does not possess a rest-frame. On the other hand, the dynamical chiral symmetry breaking paradigm, connected with a Poincaré-covariant treatment of the continuum bound-state problem, provides a straightforward, simultaneous explanation of both these identities, and also a diverse array of predictions, testable at existing and proposed facilities. From this perspective, < π | \\varTheta _0 |π rangle =0 owing to exact, symmetry-driven cancellations which occur between one-body dressing effects and two-body-irreducible binding interactions in any well-defined computation of the forward scattering amplitude that defines this expectation value in the pseudoscalar meson. The cancellation is incomplete in any other hadronic bound state, with a remainder whose scale is set by the size of one-body dressing effects.

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

Roberts, Craig D.

The energy-momentum tensor in chiral QCD, T-mu nu, exhibits an anomaly, viz. Theta(0) := T-mu mu not equal 0. Measured in the proton, this anomaly yields m(p)(2), where m(p) is the proton's mass; but, at the same time, when computed in the pion, the answer is m(pi)(2) = 0. Any attempt to understand the origin and nature of mass, and identify observable expressions thereof, must explain and unify these two apparently contradictory results, which are fundamental to the nature of our Universe. Given the importance of Poincare-invariance in modern physics, the utility of a frame-dependent approach to this problem seemsmore » limited. That is especially true of any approach tied to a rest-frame decomposition of T-mu nu because a massless particle does not possess a rest-frame. On the other hand, the dynamical chiral symmetry breaking paradigm, connected with a Poincare-covariant treatment of the continuum bound-state problem, provides a straightforward, simultaneous explanation of both these identities, and also a diverse array of predictions, testable at existing and proposed facilities. From this perspective, = 0 owing to exact, symmetry-driven cancellations which occur between one-body dressing effects and two-body-irreducible binding interactions in any well-defined computation of the forward scattering amplitude that defines this expectation value in the pseudoscalar meson. The cancellation is incomplete in any other hadronic bound state, with a remainder whose scale is set by the size of one-body dressing effects.« less

A Self-Stabilizing Hybrid Fault-Tolerant Synchronization Protocol

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2015-01-01

This paper presents a strategy for solving the Byzantine general problem for self-stabilizing a fully connected network from an arbitrary state and in the presence of any number of faults with various severities including any number of arbitrary (Byzantine) faulty nodes. The strategy consists of two parts: first, converting Byzantine faults into symmetric faults, and second, using a proven symmetric-fault tolerant algorithm to solve the general case of the problem. A protocol (algorithm) is also present that tolerates symmetric faults, provided that there are more good nodes than faulty ones. The solution applies to realizable systems, while allowing for differences in the network elements, provided that the number of arbitrary faults is not more than a third of the network size. The only constraint on the behavior of a node is that the interactions with other nodes are restricted to defined links and interfaces. The solution does not rely on assumptions about the initial state of the system and no central clock nor centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. A mechanical verification of a proposed protocol is also present. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV). The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirming claims of determinism and linear convergence with respect to the self-stabilization period.

Decision theory with resource-bounded agents.

PubMed

Halpern, Joseph Y; Pass, Rafael; Seeman, Lior

2014-04-01

There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein (), charges an agent for doing costly computation; the second, initiated by Neyman (), does not charge for computation, but limits the computation that agents can do, typically by modeling agents as finite automata. We review recent work on applying both approaches in the context of decision theory. For the first approach, we take the objects of choice in a decision problem to be Turing machines, and charge players for the "complexity" of the Turing machine chosen (e.g., its running time). This approach can be used to explain well-known phenomena like first-impression-matters biases (i.e., people tend to put more weight on evidence they hear early on) and belief polarization (two people with different prior beliefs, hearing the same evidence, can end up with diametrically opposed conclusions) as the outcomes of quite rational decisions. For the second approach, we model people as finite automata, and provide a simple algorithm that, on a problem that captures a number of settings of interest, provably performs optimally as the number of states in the automaton increases. Copyright © 2014 Cognitive Science Society, Inc.

Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

NASA Technical Reports Server (NTRS)

Ono, Masahiro; Kuwata, Yoshiaki

2013-01-01

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

Kodiak: An Implementation Framework for Branch and Bound Algorithms

NASA Technical Reports Server (NTRS)

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

2015-01-01

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

The isolation limits of stochastic vibration

NASA Technical Reports Server (NTRS)

Knopse, C. R.; Allaire, P. E.

1993-01-01

The vibration isolation problem is formulated as a 1D kinematic problem. The geometry of the stochastic wall trajectories arising from the stroke constraint is defined in terms of their significant extrema. An optimal control solution for the minimum acceleration return path determines a lower bound on platform mean square acceleration. This bound is expressed in terms of the probability density function on the significant maxima and the conditional fourth moment of the first passage time inverse. The first of these is found analytically while the second is found using a Monte Carlo simulation. The rms acceleration lower bound as a function of available space is then determined through numerical quadrature.

Asymptotic expansions of solutions of the heat conduction equation in internally bounded cylindrical geometry

USGS Publications Warehouse

Ritchie, R.H.; Sakakura, A.Y.

1956-01-01

The formal solutions of problems involving transient heat conduction in infinite internally bounded cylindrical solids may be obtained by the Laplace transform method. Asymptotic series representing the solutions for large values of time are given in terms of functions related to the derivatives of the reciprocal gamma function. The results are applied to the case of the internally bounded infinite cylindrical medium with, (a) the boundary held at constant temperature; (b) with constant heat flow over the boundary; and (c) with the "radiation" boundary condition. A problem in the flow of gas through a porous medium is considered in detail.

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings

DOE PAGES

Lin, Fu; Leyffer, Sven; Munson, Todd

2016-04-12

We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semi-coarse model is guaranteed to find a feasible solution of the original problem and hence providesmore » an upper bound on the optimal solution. We show that solving a sequence of coarse models converges to the same upper bound with proven finite steps. This is achieved by adding violated constraints to coarse models until all constraints in the semi-coarse model are satisfied. We demonstrate the effectiveness of our approach in cogeneration for buildings. Here, the coarsened models allow us to obtain good approximate solutions at a fraction of the time required by solving the original problem. Extensive numerical experiments show that the two-level approach scales to large problems that are beyond the capacity of state-of-the-art commercial MILP solvers.« less

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings

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

Lin, Fu; Leyffer, Sven; Munson, Todd

We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semi-coarse model is guaranteed to find a feasible solution of the original problem and hence providesmore » an upper bound on the optimal solution. We show that solving a sequence of coarse models converges to the same upper bound with proven finite steps. This is achieved by adding violated constraints to coarse models until all constraints in the semi-coarse model are satisfied. We demonstrate the effectiveness of our approach in cogeneration for buildings. Here, the coarsened models allow us to obtain good approximate solutions at a fraction of the time required by solving the original problem. Extensive numerical experiments show that the two-level approach scales to large problems that are beyond the capacity of state-of-the-art commercial MILP solvers.« less

Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs

NASA Astrophysics Data System (ADS)

Fu, Junjie; Wang, Jin-zhi

2017-09-01

In this paper, we study the finite-time consensus problems with globally bounded convergence time also known as fixed-time consensus problems for multi-agent systems subject to directed communication graphs. Two new distributed control strategies are proposed such that leaderless and leader-follower consensus are achieved with convergence time independent on the initial conditions of the agents. Fixed-time formation generation and formation tracking problems are also solved as the generalizations. Simulation examples are provided to demonstrate the performance of the new controllers.

A Direct Adaptive Control Approach in the Presence of Model Mismatch

NASA Technical Reports Server (NTRS)

Joshi, Suresh M.; Tao, Gang; Khong, Thuan

2009-01-01

This paper considers the problem of direct model reference adaptive control when the plant-model matching conditions are violated due to abnormal changes in the plant or incorrect knowledge of the plant's mathematical structure. The approach consists of direct adaptation of state feedback gains for state tracking, and simultaneous estimation of the plant-model mismatch. Because of the mismatch, the plant can no longer track the state of the original reference model, but may be able to track a new reference model that still provides satisfactory performance. The reference model is updated if the estimated plant-model mismatch exceeds a bound that is determined via robust stability and/or performance criteria. The resulting controller is a hybrid direct-indirect adaptive controller that offers asymptotic state tracking in the presence of plant-model mismatch as well as parameter deviations.

Coherent state coding approaches the capacity of non-Gaussian bosonic channels

NASA Astrophysics Data System (ADS)

Huber, Stefan; König, Robert

2018-05-01

The additivity problem asks if the use of entanglement can boost the information-carrying capacity of a given channel beyond what is achievable by coding with simple product states only. This has recently been shown not to be the case for phase-insensitive one-mode Gaussian channels, but remains unresolved in general. Here we consider two general classes of bosonic noise channels, which include phase-insensitive Gaussian channels as special cases: these are attenuators with general, potentially non-Gaussian environment states and classical noise channels with general probabilistic noise. We show that additivity violations, if existent, are rather minor for all these channels: the maximal gain in classical capacity is bounded by a constant independent of the input energy. Our proof shows that coding by simple classical modulation of coherent states is close to optimal.

Tightening Quantum Speed Limits for Almost All States.

PubMed

Campaioli, Francesco; Pollock, Felix A; Binder, Felix C; Modi, Kavan

2018-02-09

Conventional quantum speed limits perform poorly for mixed quantum states: They are generally not tight and often significantly underestimate the fastest possible evolution speed. To remedy this, for unitary driving, we derive two quantum speed limits that outperform the traditional bounds for almost all quantum states. Moreover, our bounds are significantly simpler to compute as well as experimentally more accessible. Our bounds have a clear geometric interpretation; they arise from the evaluation of the angle between generalized Bloch vectors.

Two-polariton bound states in the Jaynes-Cummings-Hubbard model

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

Wong, Max T. C.; Law, C. K.

2011-05-15

We examine the eigenstates of the one-dimensional Jaynes-Cummings-Hubbard model in the two-excitation subspace. We discover that two-excitation bound states emerge when the ratio of vacuum Rabi frequency to the tunneling rate between cavities exceeds a critical value. We determine the critical value as a function of the quasimomentum quantum number, and indicate that the bound states carry a strong correlation in which the two polaritons appear to be spatially confined together.

The light bound states of N=1 supersymmetric SU(3) Yang-Mills theory on the lattice

NASA Astrophysics Data System (ADS)

Ali, Sajid; Bergner, Georg; Gerber, Henning; Giudice, Pietro; Montvay, Istvan; Münster, Gernot; Piemonte, Stefano; Scior, Philipp

2018-03-01

In this article we summarise our results from numerical simulations of N=1 supersymmetric Yang-Mills theory with gauge group SU(3). We use the formulation of Curci and Veneziano with clover-improved Wilson fermions. The masses of various bound states have been obtained at different values of the gluino mass and gauge coupling. Extrapolations to the limit of vanishing gluino mass indicate that the bound states form mass-degenerate supermultiplets.

New effects of a long-lived negatively charged massive particle on big bang nucleosynthesis

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

Kusakabe, Motohiko; Kim, K. S.; Cheoun, Myung-Ki

Primordial {sup 7}Li abundance inferred from observations of metal-poor stars is a factor of about 3 lower than the theoretical value of standard big bang nucleosynthesis (BBN) model. One of the solutions to the Li problem is {sup 7}Be destruction during the BBN epoch caused by a long-lived negatively charged massive particle, X{sup −}. The particle can bind to nuclei, and X-bound nuclei (X-nuclei) can experience new reactions. The radiative X{sup −} capture by {sup 7}Be nuclei followed by proton capture of the bound state of {sup 7}Be and X{sup −} ({sup 7}Be{sub x}) is a possible {sup 7}Be destructionmore » reaction. Since the primordial abundance of {sup 7}Li originates mainly from {sup 7}Li produced via the electron capture of {sup 7}Be after BBN, the {sup 7}Be destruction provides a solution to the {sup 7}Li problem. We suggest a new route of {sup 7}Be{sub x} formation, that is the {sup 7}Be charge exchange at the reaction of {sup 7}Be{sup 3+} ion and X{sup −}. The formation rate depends on the ionization fraction of {sup 7}Be{sup 3+} ion, the charge exchange cross section of {sup 7}Be{sup 3+}, and the probability that excited states {sup 7}Be{sub x}* produced at the charge exchange are converted to the ground state. We find that this reaction can be equally important as or more important than ordinary radiative recombination of {sup 7}Be and X{sup −}. The effect of this new route is shown in a nuclear reaction network calculation.« less

A Partitioning and Bounded Variable Algorithm for Linear Programming

ERIC Educational Resources Information Center

Sheskin, Theodore J.

2006-01-01

An interesting new partitioning and bounded variable algorithm (PBVA) is proposed for solving linear programming problems. The PBVA is a variant of the simplex algorithm which uses a modified form of the simplex method followed by the dual simplex method for bounded variables. In contrast to the two-phase method and the big M method, the PBVA does…

Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming

ERIC Educational Resources Information Center

Brusco, Michael J.; Stahl, Stephanie

2005-01-01

There are two well-known methods for obtaining a guaranteed globally optimal solution to the problem of least-squares unidimensional scaling of a symmetric dissimilarity matrix: (a) dynamic programming, and (b) branch-and-bound. Dynamic programming is generally more efficient than branch-and-bound, but the former is limited to matrices with…

Quantum and classical dynamics in adiabatic computation

NASA Astrophysics Data System (ADS)

Crowley, P. J. D.; Äńurić, T.; Vinci, W.; Warburton, P. A.; Green, A. G.

2014-10-01

Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialized state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible. Moreover, a judicious choice of final Hamiltonian whose ground state encodes the solution to a problem allows adiabatic transport to be used for universal quantum computation. However, the dephasing effects of the environment limit the quantum correlations that an open system can support and degrade the power of such adiabatic computation. We quantify this effect by allowing the system to evolve over a restricted set of quantum states, providing a link between physically inspired classical optimization algorithms and quantum adiabatic optimization. This perspective allows us to develop benchmarks to bound the quantum correlations harnessed by an adiabatic computation. We apply these to the D-Wave Vesuvius machine with revealing—though inconclusive—results.

On dual and three space problems for the compact approximation property

NASA Astrophysics Data System (ADS)

Choi, Changsun; Kim, Ju Myung

2006-11-01

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

Testing Lorentz and C P T invariance with ultracold neutrons

NASA Astrophysics Data System (ADS)

Martín-Ruiz, A.; Escobar, C. A.

2018-05-01

In this paper we investigate, within the standard model extension framework, the influence of Lorentz- and C P T -violating terms on gravitational quantum states of ultracold neutrons. Using a semiclassical wave packet, we derive the effective nonrelativistic Hamiltonian which describes the neutrons vertical motion by averaging the contributions from the perpendicular coordinates to the free falling axis. We compute the physical implications of the Lorentz- and C P T -violating terms on the spectra. The comparison of our results with those obtained in the GRANIT experiment leads to an upper bound for the symmetries-violation cμν n coefficients. We find that ultracold neutrons are sensitive to the ain and ein coefficients, which thus far are unbounded by experiments in the neutron sector. We propose two additional problems involving ultracold neutrons which could be relevant for improving our current bounds; namely, gravity-resonance spectroscopy and neutron whispering gallery wave.

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.

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.

Fuzzy Adaptive Control Design and Discretization for a Class of Nonlinear Uncertain Systems.

PubMed

Zhao, Xudong; Shi, Peng; Zheng, Xiaolong

2016-06-01

In this paper, tracking control problems are investigated for a class of uncertain nonlinear systems in lower triangular form. First, a state-feedback controller is designed by using adaptive backstepping technique and the universal approximation ability of fuzzy logic systems. During the design procedure, a developed method with less computation is proposed by constructing one maximum adaptive parameter. Furthermore, adaptive controllers with nonsymmetric dead-zone are also designed for the systems. Then, a sampled-data control scheme is presented to discretize the obtained continuous-time controller by using the forward Euler method. It is shown that both proposed continuous and discrete controllers can ensure that the system output tracks the target signal with a small bounded error and the other closed-loop signals remain bounded. Two simulation examples are presented to verify the effectiveness and applicability of the proposed new design techniques.

Dynamic spin injection into a quantum well coupled to a spin-split bound state

NASA Astrophysics Data System (ADS)

Maslova, N. S.; Rozhansky, I. V.; Mantsevich, V. N.; Arseyev, P. I.; Averkiev, N. S.; Lähderanta, E.

2018-05-01

We present a theoretical analysis of dynamic spin injection due to spin-dependent tunneling between a quantum well (QW) and a bound state split in spin projection due to an exchange interaction or external magnetic field. We focus on the impact of Coulomb correlations at the bound state on spin polarization and sheet density kinetics of the charge carriers in the QW. The theoretical approach is based on kinetic equations for the electron occupation numbers taking into account high order correlation functions for the bound state electrons. It is shown that the on-site Coulomb repulsion leads to an enhanced dynamic spin polarization of the electrons in the QW and a delay in the carriers tunneling into the bound state. The interplay of these two effects leads to nontrivial dependence of the spin polarization degree, which can be probed experimentally using time-resolved photoluminescence experiments. It is demonstrated that the influence of the Coulomb interactions can be controlled by adjusting the relaxation rates. These findings open a new way of studying the Hubbard-like electron interactions experimentally.

Mathematical properties and bounds on haplotyping populations by pure parsimony.

PubMed

Wang, I-Lin; Chang, Chia-Yuan

2011-06-01

Although the haplotype data can be used to analyze the function of DNA, due to the significant efforts required in collecting the haplotype data, usually the genotype data is collected and then the population haplotype inference (PHI) problem is solved to infer haplotype data from genotype data for a population. This paper investigates the PHI problem based on the pure parsimony criterion (HIPP), which seeks the minimum number of distinct haplotypes to infer a given genotype data. We analyze the mathematical structure and properties for the HIPP problem, propose techniques to reduce the given genotype data into an equivalent one of much smaller size, and analyze the relations of genotype data using a compatible graph. Based on the mathematical properties in the compatible graph, we propose a maximal clique heuristic to obtain an upper bound, and a new polynomial-sized integer linear programming formulation to obtain a lower bound for the HIPP problem. Copyright © 2011 Elsevier Inc. All rights reserved.

Maximum and minimum entropy states yielding local continuity bounds

NASA Astrophysics Data System (ADS)

Hanson, Eric P.; Datta, Nilanjana

2018-04-01

Given an arbitrary quantum state (σ), we obtain an explicit construction of a state ρɛ * ( σ ) [respectively, ρ * , ɛ ( σ ) ] which has the maximum (respectively, minimum) entropy among all states which lie in a specified neighborhood (ɛ-ball) of σ. Computing the entropy of these states leads to a local strengthening of the continuity bound of the von Neumann entropy, i.e., the Audenaert-Fannes inequality. Our bound is local in the sense that it depends on the spectrum of σ. The states ρɛ * ( σ ) and ρ * , ɛ (σ) depend only on the geometry of the ɛ-ball and are in fact optimizers for a larger class of entropies. These include the Rényi entropy and the minimum- and maximum-entropies, providing explicit formulas for certain smoothed quantities. This allows us to obtain local continuity bounds for these quantities as well. In obtaining this bound, we first derive a more general result which may be of independent interest, namely, a necessary and sufficient condition under which a state maximizes a concave and Gâteaux-differentiable function in an ɛ-ball around a given state σ. Examples of such a function include the von Neumann entropy and the conditional entropy of bipartite states. Our proofs employ tools from the theory of convex optimization under non-differentiable constraints, in particular Fermat's rule, and majorization theory.

Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound

NASA Astrophysics Data System (ADS)

Saad, Shakila; Wan Jaafar, Wan Nurhadani; Jamil, Siti Jasmida

2013-04-01

The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented.

Resonances in Positronium Hydride

NASA Technical Reports Server (NTRS)

DiRienzi, Joseph; Drachman, Richard J.; Fisher, Richard R. (Technical Monitor)

2001-01-01

We re-examine the problem of calculating the positions and widths of the lowest-lying resonances in the Ps + H scattering system which consists of two electrons, one positron and one proton. The first of these resonances, for L=0, was found by the methods of complex rotation and stabilization, and later described as a Feshbach resonance lying close to a bound state in the closed-channel e (+) + H (-) system. Recently, results for the L=1 and 2 scattering states were published, and it was found, surprisingly, that there is a larae shift in the positions of these resonances. In this work we repeat the analysis for L=1 and find an unexpected explanation for the shift.

Temperature of the inflaton and duration of inflation from Wilkinson microwave anisotropy probe data.

PubMed

Bhattacharya, Kaushik; Mohanty, Subhendra; Rangarajan, Raghavan

2006-03-31

If the initial state of the inflaton field is taken to have a thermal distribution instead of the conventional zero particle vacuum state then the curvature power spectrum gets modified by a temperature dependent factor such that the fluctuation spectrum of the microwave background radiation is enhanced at larger angles. We compare this modified cosmic microwave background spectrum with Wilkinson microwave anisotropy probe data to obtain an upper bound on the temperature of the inflaton at the time our current horizon crossed the horizon during inflation. We further conclude that there must be additional -foldings of inflation beyond what is needed to solve the horizon problem.

Adaptive Fuzzy Control for Nonstrict Feedback Systems With Unmodeled Dynamics and Fuzzy Dead Zone via Output Feedback.

PubMed

Wang, Lijie; Li, Hongyi; Zhou, Qi; Lu, Renquan

2017-09-01

This paper investigates the problem of observer-based adaptive fuzzy control for a category of nonstrict feedback systems subject to both unmodeled dynamics and fuzzy dead zone. Through constructing a fuzzy state observer and introducing a center of gravity method, unmeasurable states are estimated and the fuzzy dead zone is defuzzified, respectively. By employing fuzzy logic systems to identify the unknown functions. And combining small-gain approach with adaptive backstepping control technique, a novel adaptive fuzzy output feedback control strategy is developed, which ensures that all signals involved are semi-globally uniformly bounded. Simulation results are given to demonstrate the effectiveness of the presented method.

Bounds on the entanglement entropy of droplet states in the XXZ spin chain

NASA Astrophysics Data System (ADS)

Beaud, V.; Warzel, S.

2018-01-01

We consider a class of one-dimensional quantum spin systems on the finite lattice Λ ⊂Z , related to the XXZ spin chain in its Ising phase. It includes in particular the so-called droplet Hamiltonian. The entanglement entropy of energetically low-lying states over a bipartition Λ = B ∪ Bc is investigated and proven to satisfy a logarithmic bound in terms of min{n, |B|, |Bc|}, where n denotes the maximal number of down spins in the considered state. Upon addition of any (positive) random potential, the bound becomes uniformly constant on average, thereby establishing an area law. The proof is based on spectral methods: a deterministic bound on the local (many-body integrated) density of states is derived from an energetically motivated Combes-Thomas estimate.

Insight and analysis problem solving in microbes to machines.

PubMed

Clark, Kevin B

2015-11-01

A key feature for obtaining solutions to difficult problems, insight is oftentimes vaguely regarded as a special discontinuous intellectual process and/or a cognitive restructuring of problem representation or goal approach. However, this nearly century-old state of art devised by the Gestalt tradition to explain the non-analytical or non-trial-and-error, goal-seeking aptitude of primate mentality tends to neglect problem-solving capabilities of lower animal phyla, Kingdoms other than Animalia, and advancing smart computational technologies built from biological, artificial, and composite media. Attempting to provide an inclusive, precise definition of insight, two major criteria of insight, discontinuous processing and problem restructuring, are here reframed using terminology and statistical mechanical properties of computational complexity classes. Discontinuous processing becomes abrupt state transitions in algorithmic/heuristic outcomes or in types of algorithms/heuristics executed by agents using classical and/or quantum computational models. And problem restructuring becomes combinatorial reorganization of resources, problem-type substitution, and/or exchange of computational models. With insight bounded by computational complexity, humans, ciliated protozoa, and complex technological networks, for example, show insight when restructuring time requirements, combinatorial complexity, and problem type to solve polynomial and nondeterministic polynomial decision problems. Similar effects are expected from other problem types, supporting the idea that insight might be an epiphenomenon of analytical problem solving and consequently a larger information processing framework. Thus, this computational complexity definition of insight improves the power, external and internal validity, and reliability of operational parameters with which to classify, investigate, and produce the phenomenon for computational agents ranging from microbes to man-made devices. Copyright © 2015 Elsevier Ltd. All rights reserved.

Defining Primary Care Shortage Areas: Do GIS-based Measures Yield Different Results?

PubMed

Daly, Michael R; Mellor, Jennifer M; Millones, Marco

2018-02-12

To examine whether geographic information systems (GIS)-based physician-to-population ratios (PPRs) yield determinations of geographic primary care shortage areas that differ from those based on bounded-area PPRs like those used in the Health Professional Shortage Area (HPSA) designation process. We used geocoded data on primary care physician (PCP) locations and census block population counts from 1 US state to construct 2 shortage area indicators. The first is a bounded-area shortage indicator defined without GIS methods; the second is a GIS-based measure that measures the populations' spatial proximity to PCP locations. We examined agreement and disagreement between bounded shortage areas and GIS-based shortage areas. Bounded shortage area indicators and GIS-based shortage area indicators agree for the census blocks where the vast majority of our study populations reside. Specifically, 95% and 98% of the populations in our full and urban samples, respectively, reside in census blocks where the 2 indicators agree. Although agreement is generally high in rural areas (ie, 87% of the rural population reside in census blocks where the 2 indicators agree), agreement is significantly lower compared to urban areas. One source of disagreement suggests that bounded-area measures may "overlook" some shortages in rural areas; however, other aspects of the HPSA designation process likely mitigate this concern. Another source of disagreement arises from the border-crossing problem, and it is more prevalent. The GIS-based PPRs we employed would yield shortage area determinations that are similar to those based on bounded-area PPRs defined for Primary Care Service Areas. Disagreement rates were lower than previous studies have found. © 2018 National Rural Health Association.

Absorption enhancement in type-II coupled quantum rings due to existence of quasi-bound states

NASA Astrophysics Data System (ADS)

Hsieh, Chi-Ti; Lin, Shih-Yen; Chang, Shu-Wei

2018-02-01

The absorption of type-II nanostructures is often weaker than type-I counterpart due to spatially separated electrons and holes. We model the bound-to-continuum absorption of type-II quantum rings (QRs) using a multiband source-radiation approach using the retarded Green function in the cylindrical coordinate system. The selection rules due to the circular symmetry for allowed transitions of absorption are utilized. The bound-tocontinuum absorptions of type-II GaSb coupled and uncoupled QRs embedded in GaAs matrix are compared here. The GaSb QRs act as energy barriers for electrons but potential wells for holes. For the coupled QR structure, the region sandwiched between two QRs forms a potential reservoir of quasi-bound electrons. Electrons in these states, though look like bound ones, would ultimately tunnel out of the reservoir through barriers. Multiband perfectly-matched layers are introduced to model the tunneling of quasi-bound states into open space. Resonance peaks are observed on the absorption spectra of type-II coupled QRs due to the formation of quasi-bound states in conduction bands, but no resonance exist in the uncoupled QR. The tunneling time of these metastable states can be extracted from the resonance and is in the order of ten femtoseconds. Absorption of coupled QRs is significantly enhanced as compared to that of uncoupled ones in certain spectral windows of interest. These features may improve the performance of photon detectors and photovoltaic devices based on type-II semiconductor nanostructures.

Search for weakly decaying Λn ‾ and ΛΛ exotic bound states in central Pb-Pb collisions at √{sNN} = 2.76 TeV

NASA Astrophysics Data System (ADS)

Adam, J.; Adamová, D.; Aggarwal, M. M.; Aglieri Rinella, G.; Agnello, M.; Agrawal, N.; Ahammed, Z.; Ahmed, I.; Ahn, S. U.; Aimo, I.; Aiola, S.; Ajaz, M.; Akindinov, A.; Alam, S. N.; Aleksandrov, D.; Alessandro, B.; Alexandre, D.; Alfaro Molina, R.; Alici, A.; Alkin, A.; Alme, J.; Alt, T.; Altinpinar, S.; Altsybeev, I.; Alves Garcia Prado, C.; Andrei, C.; Andronic, A.; Anguelov, V.; Anielski, J.; Antičić, T.; Antinori, F.; Antonioli, P.; Aphecetche, L.; Appelshäuser, H.; Arcelli, S.; Armesto, N.; Arnaldi, R.; Aronsson, T.; Arsene, I. C.; Arslandok, M.; Augustinus, A.; Averbeck, R.; Azmi, M. D.; Bach, M.; Badalà, A.; Baek, Y. W.; Bagnasco, S.; Bailhache, R.; Bala, R.; Baldisseri, A.; Ball, M.; Baltasar Dos Santos Pedrosa, F.; Baral, R. C.; Barbano, A. M.; Barbera, R.; Barile, F.; Barnaföldi, G. G.; Barnby, L. S.; Barret, V.; Bartalini, P.; Bartke, J.; Bartsch, E.; Basile, M.; Bastid, N.; Basu, S.; Bathen, B.; Batigne, G.; Batista Camejo, A.; Batyunya, B.; Batzing, P. C.; Bearden, I. G.; Beck, H.; Bedda, C.; Behera, N. K.; Belikov, I.; Bellini, F.; Bello Martinez, H.; Bellwied, R.; Belmont, R.; Belmont-Moreno, E.; Belyaev, V.; Bencedi, G.; Beole, S.; Berceanu, I.; Bercuci, A.; Berdnikov, Y.; Berenyi, D.; Bertens, R. A.; Berzano, D.; Betev, L.; Bhasin, A.; Bhat, I. R.; Bhati, A. K.; Bhattacharjee, B.; Bhom, J.; Bianchi, L.; Bianchi, N.; Bianchin, C.; Bielčík, J.; Bielčíková, J.; Bilandzic, A.; Biswas, S.; Bjelogrlic, S.; Blanco, F.; Blau, D.; Blume, C.; Bock, F.; Bogdanov, A.; Bøggild, H.; Boldizsár, L.; Bombara, M.; Book, J.; Borel, H.; Borissov, A.; Borri, M.; Bossú, F.; Botje, M.; Botta, E.; Böttger, S.; Braun-Munzinger, P.; Bregant, M.; Breitner, T.; Broker, T. A.; Browning, T. A.; Broz, M.; Brucken, E. J.; Bruna, E.; Bruno, G. E.; Budnikov, D.; Buesching, H.; Bufalino, S.; Buncic, P.; Busch, O.; Buthelezi, Z.; Buxton, J. T.; Caffarri, D.; Cai, X.; Caines, H.; Calero Diaz, L.; Caliva, A.; Calvo Villar, E.; Camerini, P.; Carena, F.; Carena, W.; Castillo Castellanos, J.; Castro, A. J.; Casula, E. A. R.; Cavicchioli, C.; Ceballos Sanchez, C.; Cepila, J.; Cerello, P.; Chang, B.; Chapeland, S.; Chartier, M.; Charvet, J. L.; Chattopadhyay, S.; Chattopadhyay, S.; Chelnokov, V.; Cherney, M.; Cheshkov, C.; Cheynis, B.; Chibante Barroso, V.; Chinellato, D. D.; Chochula, P.; Choi, K.; Chojnacki, M.; Choudhury, S.; Christakoglou, P.; Christensen, C. H.; Christiansen, P.; Chujo, T.; Chung, S. U.; Cicalo, C.; Cifarelli, L.; Cindolo, F.; Cleymans, J.; Colamaria, F.; Colella, D.; Collu, A.; Colocci, M.; Conesa Balbastre, G.; Conesa del Valle, Z.; Connors, M. E.; Contreras, J. G.; Cormier, T. M.; Corrales Morales, Y.; Cortés Maldonado, I.; Cortese, P.; Cosentino, M. R.; Costa, F.; Crochet, P.; Cruz Albino, R.; Cuautle, E.; Cunqueiro, L.; Dahms, T.; Dainese, A.; Danu, A.; Das, D.; Das, I.; Das, S.; Dash, A.; Dash, S.; De, S.; De Caro, A.; de Cataldo, G.; de Cuveland, J.; De Falco, A.; De Gruttola, D.; De Marco, N.; De Pasquale, S.; Deisting, A.; Deloff, A.; Dénes, E.; D'Erasmo, G.; Di Bari, D.; Di Mauro, A.; Di Nezza, P.; Diaz Corchero, M. A.; Dietel, T.; Dillenseger, P.; Divià, R.; Djuvsland, Ø.; Dobrin, A.; Dobrowolski, T.; Domenicis Gimenez, D.; Dönigus, B.; Dordic, O.; Dubey, A. K.; Dubla, A.; Ducroux, L.; Dupieux, P.; Ehlers, R. J.; Elia, D.; Engel, H.; Erazmus, B.; Erhardt, F.; Eschweiler, D.; Espagnon, B.; Estienne, M.; Esumi, S.; Evans, D.; Evdokimov, S.; Eyyubova, G.; Fabbietti, L.; Fabris, D.; Faivre, J.; Fantoni, A.; Fasel, M.; Feldkamp, L.; Felea, D.; Feliciello, A.; Feofilov, G.; Ferencei, J.; Fernández Téllez, A.; Ferreiro, E. G.; Ferretti, A.; Festanti, A.; Figiel, J.; Figueredo, M. A. S.; Filchagin, S.; Finogeev, D.; Fionda, F. M.; Fiore, E. M.; Fleck, M. G.; Floris, M.; Foertsch, S.; Foka, P.; Fokin, S.; Fragiacomo, E.; Francescon, A.; Frankenfeld, U.; Fuchs, U.; Furget, C.; Furs, A.; Fusco Girard, M.; Gaardhøje, J. J.; Gagliardi, M.; Gago, A. M.; Gallio, M.; Gangadharan, D. R.; Ganoti, P.; Gao, C.; Garabatos, C.; Garcia-Solis, E.; Gargiulo, C.; Gasik, P.; Germain, M.; Gheata, A.; Gheata, M.; Ghosh, P.; Ghosh, S. K.; Gianotti, P.; Giubellino, P.; Giubilato, P.; Gladysz-Dziadus, E.; Glässel, P.; Gomez Ramirez, A.; González-Zamora, P.; Gorbunov, S.; Görlich, L.; Gotovac, S.; Grabski, V.; Graczykowski, L. K.; Grelli, A.; Grigoras, A.; Grigoras, C.; Grigoriev, V.; Grigoryan, A.; Grigoryan, S.; Grinyov, B.; Grion, N.; Grosse-Oetringhaus, J. F.; Grossiord, J.-Y.; Grosso, R.; Guber, F.; Guernane, R.; Guerzoni, B.; Gulbrandsen, K.; Gulkanyan, H.; Gunji, T.; Gupta, A.; Gupta, R.; Haake, R.; Haaland, Ø.; Hadjidakis, C.; Haiduc, M.; Hamagaki, H.; Hamar, G.; Hanratty, L. D.; Hansen, A.; Harris, J. W.; Hartmann, H.; Harton, A.; Hatzifotiadou, D.; Hayashi, S.; Heckel, S. T.; Heide, M.; Helstrup, H.; Herghelegiu, A.; Herrera Corral, G.; Hess, B. A.; Hetland, K. F.; Hilden, T. E.; Hillemanns, H.; Hippolyte, B.; Hristov, P.; Huang, M.; Humanic, T. J.; Hussain, N.; Hussain, T.; Hutter, D.; Hwang, D. S.; Ilkaev, R.; Ilkiv, I.; Inaba, M.; Ionita, C.; Ippolitov, M.; Irfan, M.; Ivanov, M.; Ivanov, V.; Izucheev, V.; Jachołkowski, A.; Jacobs, P. M.; Jahnke, C.; Jang, H. J.; Janik, M. A.; Jayarathna, P. H. S. Y.; Jena, C.; Jena, S.; Jimenez Bustamante, R. T.; Jones, P. G.; Jung, H.; Jusko, A.; Kalinak, P.; Kalweit, A.; Kamin, J.; Kang, J. H.; Kaplin, V.; Kar, S.; Karasu Uysal, A.; Karavichev, O.; Karavicheva, T.; Karpechev, E.; Kebschull, U.; Keidel, R.; Keijdener, D. L. D.; Keil, M.; Khan, K. H.; Khan, M. M.; Khan, P.; Khan, S. A.; Khanzadeev, A.; Kharlov, Y.; Kileng, B.; Kim, B.; Kim, D. W.; Kim, D. J.; Kim, H.; Kim, J. S.; Kim, M.; Kim, M.; Kim, S.; Kim, T.; Kirsch, S.; Kisel, I.; Kiselev, S.; Kisiel, A.; Kiss, G.; Klay, J. L.; Klein, C.; Klein, J.; Klein-Bösing, C.; Kluge, A.; Knichel, M. L.; Knospe, A. G.; Kobayashi, T.; Kobdaj, C.; Kofarago, M.; Köhler, M. K.; Kollegger, T.; Kolojvari, A.; Kondratiev, V.; Kondratyeva, N.; Kondratyuk, E.; Konevskikh, A.; Kouzinopoulos, C.; Kovalenko, V.; Kowalski, M.; Kox, S.; Koyithatta Meethaleveedu, G.; Kral, J.; Králik, I.; Kravčáková, A.; Krelina, M.; Kretz, M.; Krivda, M.; Krizek, F.; Kryshen, E.; Krzewicki, M.; Kubera, A. M.; Kučera, V.; Kucheriaev, Y.; Kugathasan, T.; Kuhn, C.; Kuijer, P. G.; Kulakov, I.; Kumar, J.; Kumar, L.; Kurashvili, P.; Kurepin, A.; Kurepin, A. B.; Kuryakin, A.; Kushpil, S.; Kweon, M. J.; Kwon, Y.; La Pointe, S. L.; La Rocca, P.; Lagana Fernandes, C.; Lakomov, I.; Langoy, R.; Lara, C.; Lardeux, A.; Lattuca, A.; Laudi, E.; Lea, R.; Leardini, L.; Lee, G. R.; Lee, S.; Legrand, I.; Lehnert, J.; Lemmon, R. C.; Lenti, V.; Leogrande, E.; León Monzón, I.; Leoncino, M.; Lévai, P.; Li, S.; Li, X.; Lien, J.; Lietava, R.; Lindal, S.; Lindenstruth, V.; Lippmann, C.; Lisa, M. A.; Ljunggren, H. M.; Lodato, D. F.; Loenne, P. I.; Loggins, V. R.; Loginov, V.; Loizides, C.; Lopez, X.; López Torres, E.; Lowe, A.; Lu, X.-G.; Luettig, P.; Lunardon, M.; Luparello, G.; Maevskaya, A.; Mager, M.; Mahajan, S.; Mahmood, S. M.; Maire, A.; Majka, R. D.; Malaev, M.; Maldonado Cervantes, I.; Malinina, L.; Mal'Kevich, D.; Malzacher, P.; Mamonov, A.; Manceau, L.; Manko, V.; Manso, F.; Manzari, V.; Marchisone, M.; Mareš, J.; Margagliotti, G. V.; Margotti, A.; Margutti, J.; Marín, A.; Markert, C.; Marquard, M.; Martashvili, I.; Martin, N. A.; Martin Blanco, J.; Martinengo, P.; Martínez, M. I.; Martínez García, G.; Martinez Pedreira, M.; Martynov, Y.; Mas, A.; Masciocchi, S.; Masera, M.; Masoni, A.; Massacrier, L.; Mastroserio, A.; Matyja, A.; Mayer, C.; Mazer, J.; Mazzoni, M. A.; Mcdonald, D.; Meddi, F.; Menchaca-Rocha, A.; Meninno, E.; Mercado Pérez, J.; Meres, M.; Miake, Y.; Mieskolainen, M. M.; Mikhaylov, K.; Milano, L.; Milosevic, J.; Minervini, L. M.; Mischke, A.; Mishra, A. N.; Miśkowiec, D.; Mitra, J.; Mitu, C. M.; Mohammadi, N.; Mohanty, B.; Molnar, L.; Montaño Zetina, L.; Montes, E.; Morando, M.; Moretto, S.; Morreale, A.; Morsch, A.; Muccifora, V.; Mudnic, E.; Mühlheim, D.; Muhuri, S.; Mukherjee, M.; Müller, H.; Mulligan, J. D.; Munhoz, M. G.; Murray, S.; Musa, L.; Musinsky, J.; Nandi, B. K.; Nania, R.; Nappi, E.; Naru, M. U.; Nattrass, C.; Nayak, K.; Nayak, T. K.; Nazarenko, S.; Nedosekin, A.; Nellen, L.; Ng, F.; Nicassio, M.; Niculescu, M.; Niedziela, J.; Nielsen, B. S.; Nikolaev, S.; Nikulin, S.; Nikulin, V.; Noferini, F.; Nomokonov, P.; Nooren, G.; Norman, J.; Nyanin, A.; Nystrand, J.; Oeschler, H.; Oh, S.; Oh, S. K.; Ohlson, A.; Okatan, A.; Okubo, T.; Olah, L.; Oleniacz, J.; Oliveira Da Silva, A. C.; Oliver, M. H.; Onderwaater, J.; Oppedisano, C.; Ortiz Velasquez, A.; Oskarsson, A.; Otwinowski, J.; Oyama, K.; Ozdemir, M.; Pachmayer, Y.; Pagano, P.; Paić, G.; Pajares, C.; Pal, S. K.; Pan, J.; Pandey, A. K.; Pant, D.; Papikyan, V.; Pappalardo, G. S.; Pareek, P.; Park, W. J.; Parmar, S.; Passfeld, A.; Paticchio, V.; Paul, B.; Pawlak, T.; Peitzmann, T.; Pereira Da Costa, H.; Pereira De Oliveira Filho, E.; Peresunko, D.; Pérez Lara, C. E.; Peskov, V.; Pestov, Y.; Petráček, V.; Petrov, V.; Petrovici, M.; Petta, C.; Piano, S.; Pikna, M.; Pillot, P.; Pinazza, O.; Pinsky, L.; Piyarathna, D. B.; Płoskoń, M.; Planinic, M.; Pluta, J.; Pochybova, S.; Podesta-Lerma, P. L. M.; Poghosyan, M. G.; Polichtchouk, B.; Poljak, N.; Poonsawat, W.; Pop, A.; Porteboeuf-Houssais, S.; Porter, J.; Pospisil, J.; Prasad, S. K.; Preghenella, R.; Prino, F.; Pruneau, C. A.; Pshenichnov, I.; Puccio, M.; Puddu, G.; Pujahari, P.; Punin, V.; Putschke, J.; Qvigstad, H.; Rachevski, A.; Raha, S.; Rajput, S.; Rak, J.; Rakotozafindrabe, A.; Ramello, L.; Raniwala, R.; Raniwala, S.; Räsänen, S. S.; Rascanu, B. T.; Rathee, D.; Razazi, V.; Read, K. F.; Real, J. S.; Redlich, K.; Reed, R. J.; Rehman, A.; Reichelt, P.; Reicher, M.; Reidt, F.; Ren, X.; Renfordt, R.; Reolon, A. R.; Reshetin, A.; Rettig, F.; Revol, J.-P.; Reygers, K.; Riabov, V.; Ricci, R. A.; Richert, T.; Richter, M.; Riedler, P.; Riegler, W.; Riggi, F.; Ristea, C.; Rivetti, A.; Rocco, E.; Rodríguez Cahuantzi, M.; Rodriguez Manso, A.; Røed, K.; Rogochaya, E.; Rohr, D.; Röhrich, D.; Romita, R.; Ronchetti, F.; Ronflette, L.; Rosnet, P.; Rossi, A.; Roukoutakis, F.; Roy, A.; Roy, C.; Roy, P.; Rubio Montero, A. J.; Rui, R.; Russo, R.; Ryabinkin, E.; Ryabov, Y.; Rybicki, A.; Sadovsky, S.; Šafařík, K.; Sahlmuller, B.; Sahoo, P.; Sahoo, R.; Sahoo, S.; Sahu, P. K.; Saini, J.; Sakai, S.; Saleh, M. A.; Salgado, C. A.; Salzwedel, J.; Sambyal, S.; Samsonov, V.; Sanchez Castro, X.; Šándor, L.; Sandoval, A.; Sano, M.; Santagati, G.; Sarkar, D.; Scapparone, E.; Scarlassara, F.; Scharenberg, R. P.; Schiaua, C.; Schicker, R.; Schmidt, C.; Schmidt, H. R.; Schuchmann, S.; Schukraft, J.; Schulc, M.; Schuster, T.; Schutz, Y.; Schwarz, K.; Schweda, K.; Scioli, G.; Scomparin, E.; Scott, R.; Seeder, K. S.; Seger, J. E.; Sekiguchi, Y.; Selyuzhenkov, I.; Senosi, K.; Seo, J.; Serradilla, E.; Sevcenco, A.; Shabanov, A.; Shabetai, A.; Shadura, O.; Shahoyan, R.; Shangaraev, A.; Sharma, A.; Sharma, N.; Shigaki, K.; Shtejer, K.; Sibiriak, Y.; Siddhanta, S.; Sielewicz, K. M.; Siemiarczuk, T.; Silvermyr, D.; Silvestre, C.; Simatovic, G.; Simonetti, G.; Singaraju, R.; Singh, R.; Singha, S.; Singhal, V.; Sinha, B. C.; Sinha, T.; Sitar, B.; Sitta, M.; Skaali, T. B.; Slupecki, M.; Smirnov, N.; Snellings, R. J. M.; Snellman, T. W.; Søgaard, C.; Soltz, R.; Song, J.; Song, M.; Song, Z.; Soramel, F.; Sorensen, S.; Spacek, M.; Spiriti, E.; Sputowska, I.; Spyropoulou-Stassinaki, M.; Srivastava, B. K.; Stachel, J.; Stan, I.; Stefanek, G.; Steinpreis, M.; Stenlund, E.; Steyn, G.; Stiller, J. H.; Stocco, D.; Strmen, P.; Suaide, A. A. P.; Sugitate, T.; Suire, C.; Suleymanov, M.; Sultanov, R.; Šumbera, M.; Symons, T. J. M.; Szabo, A.; Szanto de Toledo, A.; Szarka, I.; Szczepankiewicz, A.; Szymanski, M.; Takahashi, J.; Tanaka, N.; Tangaro, M. A.; Tapia Takaki, J. D.; Tarantola Peloni, A.; Tariq, M.; Tarzila, M. G.; Tauro, A.; Tejeda Muñoz, G.; Telesca, A.; Terasaki, K.; Terrevoli, C.; Teyssier, B.; Thäder, J.; Thomas, D.; Tieulent, R.; Timmins, A. R.; Toia, A.; Trogolo, S.; Trubnikov, V.; Trzaska, W. H.; Tsuji, T.; Tumkin, A.; Turrisi, R.; Tveter, T. S.; Ullaland, K.; Uras, A.; Usai, G. L.; Utrobicic, A.; Vajzer, M.; Vala, M.; Valencia Palomo, L.; Vallero, S.; Van Der Maarel, J.; Van Hoorne, J. W.; van Leeuwen, M.; Vanat, T.; Vande Vyvre, P.; Varga, D.; Vargas, A.; Vargyas, M.; Varma, R.; Vasileiou, M.; Vasiliev, A.; Vauthier, A.; Vechernin, V.; Veen, A. M.; Veldhoen, M.; Velure, A.; Venaruzzo, M.; Vercellin, E.; Vergara Limón, S.; Vernet, R.; Verweij, M.; Vickovic, L.; Viesti, G.; Viinikainen, J.; Vilakazi, Z.; Villalobos Baillie, O.; Vinogradov, A.; Vinogradov, L.; Vinogradov, Y.; Virgili, T.; Vislavicius, V.; Viyogi, Y. P.; Vodopyanov, A.; Völkl, M. A.; Voloshin, K.; Voloshin, S. A.; Volpe, G.; von Haller, B.; Vorobyev, I.; Vranic, D.; Vrláková, J.; Vulpescu, B.; Vyushin, A.; Wagner, B.; Wagner, J.; Wang, H.; Wang, M.; Wang, Y.; Watanabe, D.; Weber, M.; Weber, S. G.; Wessels, J. P.; Westerhoff, U.; Wiechula, J.; Wikne, J.; Wilde, M.; Wilk, G.; Wilkinson, J.; Williams, M. C. S.; Windelband, B.; Winn, M.; Yaldo, C. G.; Yamaguchi, Y.; Yang, H.; Yang, P.; Yano, S.; Yasnopolskiy, S.; Yin, Z.; Yokoyama, H.; Yoo, I.-K.; Yurchenko, V.; Yushmanov, I.; Zaborowska, A.; Zaccolo, V.; Zaman, A.; Zampolli, C.; Zanoli, H. J. C.; Zaporozhets, S.; Zarochentsev, A.; Závada, P.; Zaviyalov, N.; Zbroszczyk, H.; Zgura, I. S.; Zhalov, M.; Zhang, H.; Zhang, X.; Zhang, Y.; Zhao, C.; Zhigareva, N.; Zhou, D.; Zhou, Y.; Zhou, Z.; Zhu, H.; Zhu, J.; Zhu, X.; Zichichi, A.; Zimmermann, A.; Zimmermann, M. B.; Zinovjev, G.; Zyzak, M.

2016-01-01

We present results of a search for two hypothetical strange dibaryon states, i.e. the H-dibaryon and the possible Λn ‾ bound state. The search is performed with the ALICE detector in central (0-10%) Pb-Pb collisions at √{sNN} = 2.76 TeV, by invariant mass analysis in the decay modes Λn ‾ → d ‾π+ and H-dibaryon → Λpπ-. No evidence for these bound states is observed. Upper limits are determined at 99% confidence level for a wide range of lifetimes and for the full range of branching ratios. The results are compared to thermal, coalescence and hybrid UrQMD model expectations, which describe correctly the production of other loosely bound states, like the deuteron and the hypertriton.

Search for weakly decaying Λ n - and ΛΛ exotic bound states in central Pb–Pb collisions at s NN = 2.76  TeV

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

Adam, J.; Adamová, D.; Aggarwal, M. M.

Here, we present results of a search for two hypothetical strange dibaryon states, i.e. the H-dibaryon and the possiblemore » $$\\overline{Λn}$$ bound state. The search is performed with the ALICE detector in central (0-10%) Pb-Pb collisions at $$\\sqrt{s}$$$_ {NN}$$ = 2.76 TeV, by invariant mass analysis in the decay modes $$\\overline{Λn}$$ → $$\\bar{d}$$π + and H-dibaryon →Λpπ -. No evidence for these bound states is observed. Upper limits are determined at 99% confidence level for a wide range of lifetimes and for the full range of branching ratios. The results are compared to thermal, coalescence and hybrid UrQMD model expectations, which describe correctly the production of other loosely bound states, like the deuteron and the hypertriton.« less

Emergent gauge field for a chiral bound state on curved surface

NASA Astrophysics Data System (ADS)

Shi, Zhe-Yu; Zhai, Hui

2017-09-01

Emergent physics is one of the most important concepts in modern physics, and one of the most intriguing examples is the emergent gauge field. Here we show that a gauge field emerges for a chiral bound state formed by two attractively interacting particles on a curved surface. We demonstrate explicitly that the center-of-mass wave function of such a deeply bound state is monopole harmonic instead of spherical harmonic, which means that the bound state experiences a magnetic monopole at the center of the sphere. This emergent gauge field is due to the coupling between the center-of-mass and the relative motion on a curved surface, and our results can be generalized to an arbitrary curved surface. This result establishes an intriguing connection between the space curvature and gauge field, and paves an alternative way to engineer a topological state with space curvature, and may be observed in a cold atom system.

Search for weakly decaying Λ n - and ΛΛ exotic bound states in central Pb–Pb collisions at s NN = 2.76  TeV

DOE PAGES

Adam, J.; Adamová, D.; Aggarwal, M. M.; ...

2016-11-28

Here, we present results of a search for two hypothetical strange dibaryon states, i.e. the H-dibaryon and the possiblemore » $$\\overline{Λn}$$ bound state. The search is performed with the ALICE detector in central (0-10%) Pb-Pb collisions at $$\\sqrt{s}$$$_ {NN}$$ = 2.76 TeV, by invariant mass analysis in the decay modes $$\\overline{Λn}$$ → $$\\bar{d}$$π + and H-dibaryon →Λpπ -. No evidence for these bound states is observed. Upper limits are determined at 99% confidence level for a wide range of lifetimes and for the full range of branching ratios. The results are compared to thermal, coalescence and hybrid UrQMD model expectations, which describe correctly the production of other loosely bound states, like the deuteron and the hypertriton.« less

Emergent Fermi Sea in A System of Interacting Bosons

NASA Astrophysics Data System (ADS)

Wu, Yinghai; Jain, Jainendra

2015-03-01

An understanding of the possible ways in which interactions can produce fundamentally new emergent many-body states is a central problem of condensed matter physics. We ask if a Fermi sea can arise in a system of bosons subject to contact interaction. Based on exact diagonalization studies and variational wave functions, we predict that such a state is likely to occur when a system of two-component bosons in two dimensions, interacting via a species independent contact interaction, is exposed to a synthetic magnetic field of strength that corresponds to a filling factor of unity. The bosons each bind a single vortex as a result of the repulsive interaction, and these fermionic bound states, namely composite fermions, form a spin-singlet Fermi sea. Financial support from the DOE under Grant No. DE-SC0005042.

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.

Distributed formation control of nonholonomic autonomous vehicle via RBF neural network

NASA Astrophysics Data System (ADS)

Yang, Shichun; Cao, Yaoguang; Peng, Zhaoxia; Wen, Guoguang; Guo, Konghui

2017-03-01

In this paper, RBF neural network consensus-based distributed control scheme is proposed for nonholonomic autonomous vehicles in a pre-defined formation along the specified reference trajectory. A variable transformation is first designed to convert the formation control problem into a state consensus problem. Then, the complete dynamics of the vehicles including inertia, Coriolis, friction model and unmodeled bounded disturbances are considered, which lead to the formation unstable when the distributed kinematic controllers are proposed based on the kinematics. RBF neural network torque controllers are derived to compensate for them. Some sufficient conditions are derived to accomplish the asymptotically stability of the systems based on algebraic graph theory, matrix theory, and Lyapunov theory. Finally, simulation examples illustrate the effectiveness of the proposed controllers.

Entanglement verification with detection efficiency mismatch

NASA Astrophysics Data System (ADS)

Zhang, Yanbao; Lütkenhaus, Norbert

Entanglement is a necessary condition for secure quantum key distribution (QKD). When there is an efficiency mismatch between various detectors used in the QKD system, it is still an open problem how to verify entanglement. Here we present a method to address this problem, given that the detection efficiency mismatch is characterized and known. The method works without assuming an upper bound on the number of photons going to each threshold detector. Our results suggest that the efficiency mismatch affects the ability to verify entanglement: the larger the efficiency mismatch is, the smaller the set of entangled states that can be verified becomes. When there is no mismatch, our method can verify entanglement even if the method based on squashing maps [PRL 101, 093601 (2008)] fails.

Ballistic Transport for Limit-Periodic Jacobi Matrices with Applications to Quantum Many-Body Problems

NASA Astrophysics Data System (ADS)

Fillman, Jake

2017-03-01

We study Jacobi matrices that are uniformly approximated by periodic operators. We show that if the rate of approximation is sufficiently rapid, then the associated quantum dynamics are ballistic in a rather strong sense; namely, the (normalized) Heisenberg evolution of the position operator converges strongly to a self-adjoint operator that is injective on the space of absolutely summable sequences. In particular, this means that all transport exponents corresponding to well-localized initial states are equal to one. Our result may be applied to a class of quantum many-body problems. Specifically, we establish a lower bound on the Lieb-Robinson velocity for an isotropic XY spin chain on the integers with limit-periodic couplings.

S-matrix method for the numerical determination of bound states.

NASA Technical Reports Server (NTRS)

Bhatia, A. K.; Madan, R. N.

1973-01-01

A rapid numerical technique for the determination of bound states of a partial-wave-projected Schroedinger equation is presented. First, one needs to integrate the equation only outwards as in the scattering case, and second, the number of trials necessary to determine the eigenenergy and the corresponding eigenfunction is considerably less than in the usual method. As a nontrivial example of the technique, bound states are calculated in the exchange approximation for the e-/He+ system and l equals 1 partial wave.

On bound-states of the Gross Neveu model with massive fundamental fermions

NASA Astrophysics Data System (ADS)

Frishman, Yitzhak; Sonnenschein, Jacob

2018-01-01

In the search for QFT's that admit boundstates, we reinvestigate the two dimensional Gross-Neveu model, but with massive fermions. By computing the self-energy for the auxiliary boundstate field and the effective potential, we show that there are no bound states around the lowest minimum, but there is a meta-stable bound state around the other minimum, a local one. The latter decays by tunneling. We determine the dependence of its lifetime on the fermion mass and coupling constant.

Bound and resonance states of the dipolar anion of hydrogen cyanide: Competition between threshold effects and rotation in an open quantum system

DOE PAGES

Fossez, K.; Michel, N.; Nazarewicz, W.; ...

2015-01-12

In this paper, bound and resonance states of the dipole-bound anion of hydrogen cyanide HCN – are studied using a nonadiabatic pseudopotential method and the Berggren expansion technique involving bound states, decaying resonant states, and nonresonant scattering continuum. We devise an algorithm to identify the resonant states in the complex energy plane. To characterize spatial distributions of electronic wave functions, we introduce the body-fixed density and use it to assign families of resonant states into collective rotational bands. We find that the nonadiabatic coupling of electronic motion to molecular rotation results in a transition from the strong-coupling to weak-coupling regime.more » In the strong-coupling limit, the electron moving in a subthreshold, spatially extended halo state follows the rotational motion of the molecule. Above the ionization threshold, the electron's motion in a resonance state becomes largely decoupled from molecular rotation. Finally, the widths of resonance-band members depend primarily on the electron orbital angular momentum.« less

Ionic effects on the temperature-force phase diagram of DNA.

PubMed

Amnuanpol, Sitichoke

2017-12-01

Double-stranded DNA (dsDNA) undergoes a structural transition to single-stranded DNA (ssDNA) in many biologically important processes such as replication and transcription. This strand separation arises in response either to thermal fluctuations or to external forces. The roles of ions are twofold, shortening the range of the interstrand potential and renormalizing the DNA elastic modulus. The dsDNA-to-ssDNA transition is studied on the basis that dsDNA is regarded as a bound state while ssDNA is regarded as an unbound state. The ground state energy of DNA is obtained by mapping the statistical mechanics problem to the imaginary time quantum mechanics problem. In the temperature-force phase diagram the critical force F c (T) increases logarithmically with the Na + concentration in the range from 32 to 110 mM. Discussing this logarithmic dependence of F c (T) within the framework of polyelectrolyte theory, it inevitably suggests a constraint on the difference between the interstrand separation and the length per unit charge during the dsDNA-to-ssDNA transition.

Finite-time resilient decentralized control for interconnected impulsive switched systems with neutral delay.

PubMed

Ren, Hangli; Zong, Guangdeng; Hou, Linlin; Yang, Yi

2017-03-01

This paper is concerned with the problem of finite-time control for a class of interconnected impulsive switched systems with neutral delay in which the time-varying delay appears in both the state and the state derivative. The concepts of finite-time boundedness and finite-time stability are respectively extended to interconnected impulsive switched systems with neutral delay for the first time. By applying the average dwell time method, sufficient conditions are first derived to cope with the problem of finite-time boundedness and finite-time stability for interconnected impulsive switched systems with neutral delay. In addition, the purpose of finite-time resilient decentralized control is to construct a resilient decentralized state-feedback controller such that the closed-loop system is finite-time bounded and finite-time stable. All the conditions are formulated in terms of linear matrix inequalities to ensure finite-time boundedness and finite-time stability of the given system. Finally, an example is presented to illustrate the effectiveness of the proposed approach. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Performance analysis of parallel branch and bound search with the hypercube architecture

NASA Technical Reports Server (NTRS)

Mraz, Richard T.

1987-01-01

With the availability of commercial parallel computers, researchers are examining new classes of problems which might benefit from parallel computing. This paper presents results of an investigation of the class of search intensive problems. The specific problem discussed is the Least-Cost Branch and Bound search method of deadline job scheduling. The object-oriented design methodology was used to map the problem into a parallel solution. While the initial design was good for a prototype, the best performance resulted from fine-tuning the algorithm for a specific computer. The experiments analyze the computation time, the speed up over a VAX 11/785, and the load balance of the problem when using loosely coupled multiprocessor system based on the hypercube architecture.

Robust control design with real parameter uncertainty using absolute stability theory. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

How, Jonathan P.; Hall, Steven R.

1993-01-01

The purpose of this thesis is to investigate an extension of mu theory for robust control design by considering systems with linear and nonlinear real parameter uncertainties. In the process, explicit connections are made between mixed mu and absolute stability theory. In particular, it is shown that the upper bounds for mixed mu are a generalization of results from absolute stability theory. Both state space and frequency domain criteria are developed for several nonlinearities and stability multipliers using the wealth of literature on absolute stability theory and the concepts of supply rates and storage functions. The state space conditions are expressed in terms of Riccati equations and parameter-dependent Lyapunov functions. For controller synthesis, these stability conditions are used to form an overbound of the H2 performance objective. A geometric interpretation of the equivalent frequency domain criteria in terms of off-axis circles clarifies the important role of the multiplier and shows that both the magnitude and phase of the uncertainty are considered. A numerical algorithm is developed to design robust controllers that minimize the bound on an H2 cost functional and satisfy an analysis test based on the Popov stability multiplier. The controller and multiplier coefficients are optimized simultaneously, which avoids the iteration and curve-fitting procedures required by the D-K procedure of mu synthesis. Several benchmark problems and experiments on the Middeck Active Control Experiment at M.I.T. demonstrate that these controllers achieve good robust performance and guaranteed stability bounds.

Performance analysis for bounded persistent disturbances in PD/PID-controlled robotic systems with its experimental demonstrations

NASA Astrophysics Data System (ADS)

Kim, Jung Hoon; Hur, Sung-Moon; Oh, Yonghwan

2018-03-01

This paper is concerned with performance analysis of proportional-derivative/proportional-integral-derivative (PD/PID) controller for bounded persistent disturbances in a robotic manipulator. Even though the notion of input-to-state stability (ISS) has been widely used to deal with the effect of disturbances in control of a robotic manipulator, the corresponding studies cannot be directly applied to the treatment of persistent disturbances occurred in robotic manipulators. This is because the conventional studies relevant to ISS consider the H∞ performance for robotic systems, which is confined to the treatment of decaying disturbances, i.e. the disturbances those in the L2 space. To deal with the effect of persistent disturbances in robotic systems, we first provide a new treatment of ISS in the L∞ sense because bounded persistent disturbances should be intrinsically regarded as elements of the L∞ space. We next derive state-space representations of trajectory tracking control in the robotic systems which allow us to define the problem formulations more clearly. We then propose a novel control law that has a PD/PID control form, by which the trajectory tracking system satisfies the reformulated ISS. Furthermore, we can obtain a theoretical argument about the L∞ gain from the disturbance to the regulated output through the proposed control law. Finally, experimental studies for a typical 3-degrees of freedom robotic manipulator are given to demonstrate the effectiveness of the method introduced in this paper.

Majorana bound states in the finite-length chain

NASA Astrophysics Data System (ADS)

Zvyagin, A. A.

2015-08-01

Recent experiments investigating edge states in ferromagnetic atomic chains on superconducting substrate are analyzed. In particular, finite size effects are considered. It is shown how the energy of the Majorana bound state depends on the length of the chain, as well as on the parameters of the model. Oscillations of the energy of the bound edge state in the chain as a function of the length of the chain, and as a function of the applied voltage (or the chemical potential) are studied. In particular, it has been shown that oscillations can exist only for some values of the effective potential.

Evolution of complexity following a global quench

NASA Astrophysics Data System (ADS)

Moosa, Mudassir

2018-03-01

The rate of complexification of a quantum state is conjectured to be bounded from above by the average energy of the state. A different conjecture relates the complexity of a holographic CFT state to the on-shell gravitational action of a certain bulk region. We use `complexity equals action' conjecture to study the time evolution of the complexity of the CFT state after a global quench. We find that the rate of growth of complexity is not only consistent with the conjectured bound, but it also saturates the bound soon after the system has achieved local equilibrium.

Subgap in the Surface Bound States Spectrum of Superfluid (3) 3 He-B with Rough Surface

NASA Astrophysics Data System (ADS)

Nagato, Y.; Higashitani, S.; Nagai, K.

2018-03-01

The subgap structure in the surface bound states spectrum of superfluid ^3He-B with rough surface is discussed. The subgap is formed by the level repulsion between the surface bound state and the continuum states in the course of multiple scattering by the surface roughness. We show that the level repulsion is originated from the nature of the wave function of the surface bound state that is now recognized as Majorana fermion. We study the superfluid ^3He-B with a rough surface and in a magnetic field perpendicular to the surface using the quasi-classical Green function together with a random S-matrix model. We calculate the self-consistent order parameters, the spin polarization density and the surface density of states. It is shown that the subgap is found also in a magnetic field perpendicular to the surface. The magnetic field dependence of the transverse acoustic impedance is also discussed.

Shooting quasiparticles from Andreev bound states in a superconducting constriction

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

Riwar, R.-P.; Houzet, M.; Meyer, J. S.

2014-12-15

A few-channel superconducting constriction provides a set of discrete Andreev bound states that may be populated with quasiparticles. Motivated by recent experimental research, we study the processes in an a.c. driven constriction whereby a quasiparticle is promoted to the delocalized states outside the superconducting gap and flies away. We distinguish two processes of this kind. In the process of ionization, a quasiparticle present in the Andreev bound state is transferred to the delocalized states leaving the constriction. The refill process involves two quasiparticles: one flies away while another one appears in the Andreev bound state. We notice an interesting asymmetrymore » of these processes. The electron-like quasiparticles are predominantly emitted to one side of the constriction while the hole-like ones are emitted to the other side. This produces a charge imbalance of accumulated quasiparticles, that is opposite on opposite sides of the junction. The imbalance may be detected with a tunnel contact to a normal metal lead.« less

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

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.

Phonon coupling in optical transitions for singlet-triplet pairs of bound excitons in semiconductors

NASA Astrophysics Data System (ADS)

Pistol, M. E.; Monemar, B.

1986-05-01

A model is presented for the observed strong difference in selection rules for coupling of phonons in the one-phonon sideband of optical spectra related to bound excitons in semiconductors. The present treatment is specialized to the case of a closely spaced pair of singlet-triplet character as the lowest electronic states, as is common for bound excitons associated with neutral complexes in materials like GaP and Si. The optical transition for the singlet bound-exciton state is found to couple strongly only to symmetric A1 modes. The triplet state has a similar coupling strength to A1 modes, but in addition strong contributions are found for replicas corresponding to high-density-of-states phonons TAX, LAX, and TOX. This can be explained by a treatment of particle-phonon coupling beyond the ordinary adiabatic approximation. A weak mixing between the singlet and triplet states is mediated by the phonon coupling, as described in first-order perturbation theory. The model derived in this work, for such phonon-induced mixing of closely spaced electronic states, is shown to explain the observed phonon coupling for several bound-exciton systems of singlet-triplet character in GaP. In addition, the observed oscillator strength of the forbidden triplet state may be explained as partly derived from phonon-induced mixing with the singlet state, which has a much larger oscillator strength.

Generalization bounds of ERM-based learning processes for continuous-time Markov chains.

PubMed

Zhang, Chao; Tao, Dacheng

2012-12-01

Many existing results on statistical learning theory are based on the assumption that samples are independently and identically distributed (i.i.d.). However, the assumption of i.i.d. samples is not suitable for practical application to problems in which samples are time dependent. In this paper, we are mainly concerned with the empirical risk minimization (ERM) based learning process for time-dependent samples drawn from a continuous-time Markov chain. This learning process covers many kinds of practical applications, e.g., the prediction for a time series and the estimation of channel state information. Thus, it is significant to study its theoretical properties including the generalization bound, the asymptotic convergence, and the rate of convergence. It is noteworthy that, since samples are time dependent in this learning process, the concerns of this paper cannot (at least straightforwardly) be addressed by existing methods developed under the sample i.i.d. assumption. We first develop a deviation inequality for a sequence of time-dependent samples drawn from a continuous-time Markov chain and present a symmetrization inequality for such a sequence. By using the resultant deviation inequality and symmetrization inequality, we then obtain the generalization bounds of the ERM-based learning process for time-dependent samples drawn from a continuous-time Markov chain. Finally, based on the resultant generalization bounds, we analyze the asymptotic convergence and the rate of convergence of the learning process.

Empowering Schools and Teachers: A New Link to Jobs for the Non-College Bound. Background Paper No. 4.

ERIC Educational Resources Information Center

Rosenbaum, James E.

Many work-bound youths have poor work habits and poor basic skills in reading, writing, and mathematics. Many work-bound youths, especially minorities and females, spend their first years after school unemployed or job hopping, with consequent loss of training and productivity. These problems are becoming more serious because minorities and…

Robust root clustering for linear uncertain systems using generalized Lyapunov theory

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.

1993-01-01

Consideration is given to the problem of matrix root clustering in subregions of a complex plane for linear state space models with real parameter uncertainty. The nominal matrix root clustering theory of Gutman & Jury (1981) using the generalized Liapunov equation is extended to the perturbed matrix case, and bounds are derived on the perturbation to maintain root clustering inside a given region. The theory makes it possible to obtain an explicit relationship between the parameters of the root clustering region and the uncertainty range of the parameter space.

Efficient constraint handling in electromagnetism-like algorithm for traveling salesman problem with time windows.

PubMed

Yurtkuran, Alkın; Emel, Erdal

2014-01-01

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

PubMed Central

Yurtkuran, Alkın

2014-01-01

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms. PMID:24723834

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.

Global optimization algorithm for heat exchanger networks

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

Quesada, I.; Grossmann, I.E.

This paper deals with the global optimization of heat exchanger networks with fixed topology. It is shown that if linear area cost functions are assumed, as well as arithmetic mean driving force temperature differences in networks with isothermal mixing, the corresponding nonlinear programming (NLP) optimization problem involves linear constraints and a sum of linear fractional functions in the objective which are nonconvex. A rigorous algorithm is proposed that is based on a convex NLP underestimator that involves linear and nonlinear estimators for fractional and bilinear terms which provide a tight lower bound to the global optimum. This NLP problem ismore » used within a spatial branch and bound method for which branching rules are given. Basic properties of the proposed method are presented, and its application is illustrated with several example problems. The results show that the proposed method only requires few nodes in the branch and bound search.« less

Transforming graph states using single-qubit operations.

PubMed

Dahlberg, Axel; Wehner, Stephanie

2018-07-13

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool-for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ' is a vertex-minor of another graph G The vertex-minor problem is, in general, [Formula: see text]-Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ' are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'. © 2018 The Author(s).

Real-time spectral interferometry probes the internal dynamics of femtosecond soliton molecules

NASA Astrophysics Data System (ADS)

Herink, G.; Kurtz, F.; Jalali, B.; Solli, D. R.; Ropers, C.

2017-04-01

Solitons, particle-like excitations ubiquitous in many fields of physics, have been shown to exhibit bound states akin to molecules. The formation of such temporal soliton bound states and their internal dynamics have escaped direct experimental observation. By means of an emerging time-stretch technique, we resolve the evolution of femtosecond soliton molecules in the cavity of a few-cycle mode-locked laser. We track two- and three-soliton bound states over hundreds of thousands of consecutive cavity roundtrips, identifying fixed points and periodic and aperiodic molecular orbits. A class of trajectories acquires a path-dependent geometrical phase, implying that its dynamics may be topologically protected. These findings highlight the importance of real-time detection in resolving interactions in complex nonlinear systems, including the dynamics of soliton bound states, breathers, and rogue waves.

Internal structure of acceptor-bound excitons in wide-band-gap wurtzite semiconductors

NASA Astrophysics Data System (ADS)

Gil, Bernard; Bigenwald, Pierre; Paskov, Plamen P.; Monemar, Bo

2010-02-01

We describe the internal structure of acceptor-bound excitons in wurtzite semiconductors. Our approach consists in first constructing, in the context of angular momentum algebra, the wave functions of the two-hole system that fulfill Pauli’s exclusion’s principle. Second, we construct the acceptor-bound exciton states by adding the electron states in a similar manner that two-hole states are constructed. We discuss the optical selection rules for the acceptor-bound exciton recombination. Finally, we compare our theory with experimental data for CdS and GaN. In the specific case of CdS for which much experimental information is available, we demonstrate that, compared with cubic semiconductors, the sign of the short-range hole-exchange interaction is reversed and more than one order of magnitude larger. The whole set of data is interpreted in the context of a large value of the short-range hole-exchange interaction Ξ0=3.4±0.2meV . This value dictates the splitting between the ground-state line I1 and the other transitions. The values we find for the electron-hole spin-exchange interaction and of the crystal-field splitting of the two-hole state are, respectively, -0.4±0.1 and 0.2±0.1meV . In the case of GaN, the experimental data for the acceptor-bound excitons in the case of Mg and Zn acceptors, show more than one bound-exciton line. We discuss a possible assignment of these states.

Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data

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

Di, Sheng; Cappello, Franck

Since today’s scientific applications are producing vast amounts of data, compressing them before storage/transmission is critical. Results of existing compressors show two types of HPC data sets: highly compressible and hard to compress. In this work, we carefully design and optimize the error-bounded lossy compression for hard-tocompress scientific data. We propose an optimized algorithm that can adaptively partition the HPC data into best-fit consecutive segments each having mutually close data values, such that the compression condition can be optimized. Another significant contribution is the optimization of shifting offset such that the XOR-leading-zero length between two consecutive unpredictable data points canmore » be maximized. We finally devise an adaptive method to select the best-fit compressor at runtime for maximizing the compression factor. We evaluate our solution using 13 benchmarks based on real-world scientific problems, and we compare it with 9 other state-of-the-art compressors. Experiments show that our compressor can always guarantee the compression errors within the user-specified error bounds. Most importantly, our optimization can improve the compression factor effectively, by up to 49% for hard-tocompress data sets with similar compression/decompression time cost.« less

The Quantum Measurement Problem and Physical reality: A Computation Theoretic Perspective

NASA Astrophysics Data System (ADS)

Srikanth, R.

2006-11-01

Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP-complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical means. We suggest that this close correspondence between the efficiency and power of abstract algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete sub-physical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor's quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper-bounded. If this bound is associated with the quantum-classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.

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

Some Surprises and Paradoxes Revealed by Inverse Problem Approach and Notion about Qualitative Solutions of SCHRÖDINGER Equations “IN MIND”

NASA Astrophysics Data System (ADS)

Zakhariev, B. N.; Chabanov, V. M.

It was an important examination to give a review talk at the previous Conference on Inverse Quantum Scattering (1996, Lake Balaton) about computer visualization of this science in front of its fathers — creators, B. M. Levitan and V. A. Marchenko. We have achieved a new understanding that the discovered main rules of transformations of a single wave function bump, e.g., for the ground bound states of one dimensional quantum systems are applicable to any state of any potential with arbitrary number of bumps from finite to unlimited ones as scattering states and bound states embedded into continuum. It appeared that we need only to repeat the rule mentally the necessary number of times. That uttermost simplification and unification of physical notion of spectral, scattering and decay control for any potential have got an obligatory praise from B. M. Levitan at the conference and was a mighty stimulus for our further research After that we have written both Russian (2002) and improved English editions of “Submissive Quantum Mechanics. New Status of the Theory in Inverse Problem Approach”1 (appeared at the very end of 2007). This book was written for correction of the present defect in quantum education throughout the world. Recently the quantum IP intuition helped us to discover a new concept of permanent wave resonance with potential spatial oscillations.2 This means the constant wave swinging frequency on the whole energy intervals of spectral forbidden zones destroying physical solutions and deepening the theory of waves in periodic potentials. It also shows the other side of strengthening the fundamentally important magic structures. A ‘new language’ of wave bending will be presented to enrich our quantum intuition, e.g., the paradoxical effective attraction of barriers and repulsion of wells in multichannel systems, etc.

Atom-field dressed states in slow-light waveguide QED

NASA Astrophysics Data System (ADS)

Calajó, Giuseppe; Ciccarello, Francesco; Chang, Darrick; Rabl, Peter

2016-03-01

We discuss the properties of atom-photon bound states in waveguide QED systems consisting of single or multiple atoms coupled strongly to a finite-bandwidth photonic channel. Such bound states are formed by an atom and a localized photonic excitation and represent the continuum analog of the familiar dressed states in single-mode cavity QED. Here we present a detailed analysis of the linear and nonlinear spectral features associated with single- and multiphoton dressed states and show how the formation of bound states affects the waveguide-mediated dipole-dipole interactions between separated atoms. Our results provide both a qualitative and quantitative description of the essential strong-coupling processes in waveguide QED systems, which are currently being developed in the optical and microwave regimes.

An archetype hydrogen atmosphere problem

NASA Technical Reports Server (NTRS)

Athay, R. G.; Mihalas, D.; Shine, R. A.

1975-01-01

Populations for the first three bound states and the continuum of hydrogen are determined for an isothermal hydrostatic atmosphere at 20,000 K. The atmosphere is treated as optically thin in the Balmer and Paschen continua and illuminated by continuum radiation at these wavelengths with prescribed radiation temperatures. The atmosphere is optically thick in the 2-1, 3-1, 3-2 and c-1 transitions. Three stages of approximation are treated: (1) radiative detailed balance in the 2-1, 3-1 and 3-2 transitions, (2) radiative detailed balance in the 3-1 and 3-2 transitions, and (3) all transitions out of detailed balance. The solution of this problem is nontrivial and presents sufficient difficulty to have caused the failure of at least one rather standard technique. The problem is thus a good archetype against which new methods or new implementations of old methods may be tested.

The path integral on the Poincaré upper half-plane with a magnetic field and for the Morse potential

NASA Astrophysics Data System (ADS)

Grosche, Christian

1988-10-01

Rigorous path integral treatments on the Poincaré upper half-plane with a magnetic field and for the Morse potential are presented. The calculation starts with the path integral on the Poincaré upper half-plane with a magnetic field. By a Fourier expansion and a non-linear transformation this problem is reformulated in terms of the path integral for the Morse potential. This latter problem can be reduced by an appropriate space-time transformation to the path integral for the harmonic oscillator with generalised angular momentum, a technique which has been developed in recent years. The well-known solution for the last problem enables one to give explicit expressions for the Feynman kernels for the Morse potential and for the Poincaré upper half-plane with magnetic field, respectively. The wavefunctions and the energy spectrum for the bound and scattering states are given, respectively.

W-Z-top-quark bags

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

Crichigno, Marcos P.; Shuryak, Edward; Flambaum, Victor V.

2010-10-01

We discuss a new family of multiquanta-bound states in the standard model which exist due to the mutual Higgs-based attraction of the heaviest members of the standard model, namely, gauge quanta W, Z, and (anti)top quarks, t, t. We use a self-consistent mean-field approximation, up to a rather large particle number N. In this paper we do not focus on weakly bound, nonrelativistic bound states, but rather on 'bags' in which the Higgs vacuum expectation value is significantly modified or depleted. The minimal number N above which such states appear strongly depends on the ratio of the Higgs mass tomore » the masses of W, Z, t, t: For a light Higgs mass, m{sub H{approx}}50 GeV, bound states start from N{approx}O(10), but for a ''realistic'' Higgs mass, m{sub H{approx}}100 GeV, one finds metastable/bound W, Z bags only for N{approx}O(1000). We also found that in the latter case pure top bags disappear for all N, although top quarks can still be well bound to the W bags. Anticipating the cosmological applications (discussed in the following Article [Phys. Rev. D 82, 073019]) of these bags as 'doorway states' for baryosynthesis, we also consider here the existence of such metastable bags at finite temperatures, when standard-model parameters such as Higgs, gauge, and top masses are significantly modified.« less

The bound states of ultracold KRb molecules

NASA Astrophysics Data System (ADS)

Julienne, Paul; Hanna, Thomas

2009-03-01

Recently ultracold vibrational ground state ^40K^87Rb polar molecules have been made using magnetoassociation of two cold atoms to a weakly bound Feshbach molecule, followed by a two-color optical STIRAP process to transfer molecules to the molecular ground state [1]. We have used accurate potential energy curves for the singlet and triplet states of the KRb molecule [2] with coupled channels calculations to calculate all of the bound states of the ^40K^87Rb molecule as a function of magnetic field from the cold atom collision threshold to the v=0 ground state. We have also developed approximate models for understanding the changing properties of the molecular bound states as binding energy increases. Some overall conclusions from these calculations will be presented. [1] K.-K. Ni, S. Ospelkaus, M. H. G. de Miranda, A. Peer, B. Neyenhuis, J. J. Zirbel, S. Kotochigova, P. S. Julienne, D. S. Jin, and J. Ye, Science, 2008, 322, 231--235. [2] A. Pashov, O. Docenko, M. Tamanis, R. Ferber, H. Kn"ockel, and E. Tiemann, Phys. Rev. A, 2007, 76, 022511.

Resolving the Spatial Structures of Bound Hole States in Black Phosphorus.

PubMed

Qiu, Zhizhan; Fang, Hanyan; Carvalho, Alexandra; Rodin, A S; Liu, Yanpeng; Tan, Sherman J R; Telychko, Mykola; Lv, Pin; Su, Jie; Wang, Yewu; Castro Neto, A H; Lu, Jiong

2017-11-08

Understanding the local electronic properties of individual defects and dopants in black phosphorus (BP) is of great importance for both fundamental research and technological applications. Here, we employ low-temperature scanning tunnelling microscope (LT-STM) to probe the local electronic structures of single acceptors in BP. We demonstrate that the charge state of individual acceptors can be reversibly switched by controlling the tip-induced band bending. In addition, acceptor-related resonance features in the tunnelling spectra can be attributed to the formation of Rydberg-like bound hole states. The spatial mapping of the quantum bound states shows two distinct shapes evolving from an extended ellipse shape for the 1s ground state to a dumbbell shape for the 2p x excited state. The wave functions of bound hole states can be well-described using the hydrogen-like model with anisotropic effective mass, corroborated by our theoretical calculations. Our findings not only provide new insight into the many-body interactions around single dopants in this anisotropic two-dimensional material but also pave the way to the design of novel quantum devices.

Optical transitions in two-dimensional topological insulators with point defects

NASA Astrophysics Data System (ADS)

Sablikov, Vladimir A.; Sukhanov, Aleksei A.

2016-12-01

Nontrivial properties of electronic states in topological insulators are inherent not only to the surface and boundary states, but to bound states localized at structure defects as well. We clarify how the unusual properties of the defect-induced bound states are manifested in optical absorption spectra in two-dimensional topological insulators. The calculations are carried out for defects with short-range potential. We find that the defects give rise to the appearance of specific features in the absorption spectrum, which are an inherent property of topological insulators. They have the form of two or three absorption peaks that are due to intracenter transitions between electron-like and hole-like bound states.

Non-Abelian fermion parity interferometry of Majorana bound states in a Fermi sea

NASA Astrophysics Data System (ADS)

Dahan, Daniel; Tanhayi Ahari, Mostafa; Ortiz, Gerardo; Seradjeh, Babak; Grosfeld, Eytan

We study the quantum dynamics of Majorana and regular fermion bound states coupled to a one-dimensional lead. The dynamics following the quench in the coupling to the lead exhibits a series of dynamical revivals as the bound state propagates in the lead and reflects from the boundaries. We show that the nature of revivals for a single Majorana bound state depends uniquely on the presence of a resonant level in the lead. When two spatially separated Majorana modes are coupled to the lead, the revivals depend only on the phase difference between their host superconductors. Remarkably, the quench in this case effectively performs a fermion-parity interferometry between Majorana bound states, revealing their unique non-Abelian braiding. Using both analytical and numerical techniques, we find the pattern of fermion parity transfers following the quench, study its evolution in the presence of disorder and interactions, and thus, ascertain the fate of Majorana in a rough Fermi sea. Work supported in part by BSF Grant No. 2014345, ISF Grant Nos. 401/12 and 1626/16, EU Seventh Framework Programme (FP7/2007-2013) Grant No. 303742, NSF CAREER Grant DMR-1350663 and the College of Arts and Sciences at Indiana University.

The hyperbolic step potential: Anti-bound states, SUSY partners and Wigner time delays

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

Gadella, M.; Kuru, Ş.; Negro, J., E-mail: jnegro@fta.uva.es

We study the scattering produced by a one dimensional hyperbolic step potential, which is exactly solvable and shows an unusual interest because of its asymmetric character. The analytic continuation of the scattering matrix in the momentum representation has a branch cut and an infinite number of simple poles on the negative imaginary axis which are related with the so called anti-bound states. This model does not show resonances. Using the wave functions of the anti-bound states, we obtain supersymmetric (SUSY) partners which are the series of Rosen–Morse II potentials. We have computed the Wigner reflection and transmission time delays formore » the hyperbolic step and such SUSY partners. Our results show that the more bound states a partner Hamiltonian has the smaller is the time delay. We also have evaluated time delays for the hyperbolic step potential in the classical case and have obtained striking similitudes with the quantum case. - Highlights: • The scattering matrix of hyperbolic step potential is studied. • The scattering matrix has a branch cut and an infinite number of poles. • The poles are associated to anti-bound states. • Susy partners using antibound states are computed. • Wigner time delays for the hyperbolic step and partner potentials are compared.« less

Near optimal pentamodes as a tool for guiding stress while minimizing compliance in 3d-printed materials: A complete solution to the weak G-closure problem for 3d-printed materials

NASA Astrophysics Data System (ADS)

Milton, Graeme W.; Camar-Eddine, Mohamed

2018-05-01

For a composite containing one isotropic elastic material, with positive Lame moduli, and void, with the elastic material occupying a prescribed volume fraction f, and with the composite being subject to an average stress, σ0 , Gibiansky, Cherkaev, and Allaire provided a sharp lower bound Wf(σ0) on the minimum compliance energy σ0 :ɛ0 , in which ɛ0 is the average strain. Here we show these bounds also provide sharp bounds on the possible (σ0 ,ɛ0) -pairs that can coexist in such composites, and thus solve the weak G-closure problem for 3d-printed materials. The materials we use to achieve the extremal (σ0 ,ɛ0) -pairs are denoted as near optimal pentamodes. We also consider two-phase composites containing this isotropic elasticity material and a rigid phase with the elastic material occupying a prescribed volume fraction f, and with the composite being subject to an average strain, ɛ0. For such composites, Allaire and Kohn provided a sharp lower bound W˜f(ɛ0) on the minimum elastic energy σ0 :ɛ0 . We show that these bounds also provide sharp bounds on the possible (σ0 ,ɛ0) -pairs that can coexist in such composites of the elastic and rigid phases, and thus solve the weak G-closure problem in this case too. The materials we use to achieve these extremal (σ0 ,ɛ0) -pairs are denoted as near optimal unimodes.

Electron accommodation dynamics in the DNA base thymine

NASA Astrophysics Data System (ADS)

King, Sarah B.; Stephansen, Anne B.; Yokoi, Yuki; Yandell, Margaret A.; Kunin, Alice; Takayanagi, Toshiyuki; Neumark, Daniel M.

2015-07-01

The dynamics of electron attachment to the DNA base thymine are investigated using femtosecond time-resolved photoelectron imaging of the gas phase iodide-thymine (I-T) complex. An ultraviolet pump pulse ejects an electron from the iodide and prepares an iodine-thymine temporary negative ion that is photodetached with a near-IR probe pulse. The resulting photoelectrons are analyzed with velocity-map imaging. At excitation energies ranging from -120 meV to +90 meV with respect to the vertical detachment energy (VDE) of 4.05 eV for I-T, both the dipole-bound and valence-bound negative ions of thymine are observed. A slightly longer rise time for the valence-bound state than the dipole-bound state suggests that some of the dipole-bound anions convert to valence-bound species. No evidence is seen for a dipole-bound anion of thymine at higher excitation energies, in the range of 0.6 eV above the I-T VDE, which suggests that if the dipole-bound anion acts as a "doorway" to the valence-bound anion, it only does so at excitation energies near the VDE of the complex.

Electron accommodation dynamics in the DNA base thymine.

PubMed

King, Sarah B; Stephansen, Anne B; Yokoi, Yuki; Yandell, Margaret A; Kunin, Alice; Takayanagi, Toshiyuki; Neumark, Daniel M

2015-07-14

The dynamics of electron attachment to the DNA base thymine are investigated using femtosecond time-resolved photoelectron imaging of the gas phase iodide-thymine (I(-)T) complex. An ultraviolet pump pulse ejects an electron from the iodide and prepares an iodine-thymine temporary negative ion that is photodetached with a near-IR probe pulse. The resulting photoelectrons are analyzed with velocity-map imaging. At excitation energies ranging from -120 meV to +90 meV with respect to the vertical detachment energy (VDE) of 4.05 eV for I(-)T, both the dipole-bound and valence-bound negative ions of thymine are observed. A slightly longer rise time for the valence-bound state than the dipole-bound state suggests that some of the dipole-bound anions convert to valence-bound species. No evidence is seen for a dipole-bound anion of thymine at higher excitation energies, in the range of 0.6 eV above the I(-)T VDE, which suggests that if the dipole-bound anion acts as a "doorway" to the valence-bound anion, it only does so at excitation energies near the VDE of the complex.

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.

33 CFR 151.2040 - What are the mandatory ballast water management requirements for vessels equipped with ballast...

Code of Federal Regulations, 2010 CFR

2010-07-01

... United States and are bound for ports or places in the United States? 151.2040 Section 151.2040... Water Management for Control of Nonindigenous Species in Waters of the United States § 151.2040 What are... operate in the waters of the United States and are bound for ports or places in the United States? (a) A...

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.

Distributed multi-sensor particle filter for bearings-only tracking

NASA Astrophysics Data System (ADS)

Zhang, Jungen; Ji, Hongbing

2012-02-01

In this article, the classical bearings-only tracking (BOT) problem for a single target is addressed, which belongs to the general class of non-linear filtering problems. Due to the fact that the radial distance observability of the target is poor, the algorithm-based sequential Monte-Carlo (particle filtering, PF) methods generally show instability and filter divergence. A new stable distributed multi-sensor PF method is proposed for BOT. The sensors process their measurements at their sites using a hierarchical PF approach, which transforms the BOT problem from Cartesian coordinate to the logarithmic polar coordinate and separates the observable components from the unobservable components of the target. In the fusion centre, the target state can be estimated by utilising the multi-sensor optimal information fusion rule. Furthermore, the computation of a theoretical Cramer-Rao lower bound is given for the multi-sensor BOT problem. Simulation results illustrate that the proposed tracking method can provide better performances than the traditional PF method.

FSMRank: feature selection algorithm for learning to rank.

PubMed

Lai, Han-Jiang; Pan, Yan; Tang, Yong; Yu, Rong

2013-06-01

In recent years, there has been growing interest in learning to rank. The introduction of feature selection into different learning problems has been proven effective. These facts motivate us to investigate the problem of feature selection for learning to rank. We propose a joint convex optimization formulation which minimizes ranking errors while simultaneously conducting feature selection. This optimization formulation provides a flexible framework in which we can easily incorporate various importance measures and similarity measures of the features. To solve this optimization problem, we use the Nesterov's approach to derive an accelerated gradient algorithm with a fast convergence rate O(1/T(2)). We further develop a generalization bound for the proposed optimization problem using the Rademacher complexities. Extensive experimental evaluations are conducted on the public LETOR benchmark datasets. The results demonstrate that the proposed method shows: 1) significant ranking performance gain compared to several feature selection baselines for ranking, and 2) very competitive performance compared to several state-of-the-art learning-to-rank algorithms.

Quantum motion of a point particle in the presence of the Aharonov–Bohm potential in curved space

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

Silva, Edilberto O., E-mail: edilbertoo@gmail.com; Ulhoa, Sérgio C., E-mail: sc.ulhoa@gmail.com; Andrade, Fabiano M., E-mail: f.andrade@ucl.ac.uk

The nonrelativistic quantum dynamics of a spinless charged particle in the presence of the Aharonov–Bohm potential in curved space is considered. We chose the surface as being a cone defined by a line element in polar coordinates. The geometry of this line element establishes that the motion of the particle can occur on the surface of a cone or an anti-cone. As a consequence of the nontrivial topology of the cone and also because of two-dimensional confinement, the geometric potential should be taken into account. At first, we establish the conditions for the particle describing a circular path in suchmore » a context. Because of the presence of the geometric potential, which contains a singular term, we use the self-adjoint extension method in order to describe the dynamics in all space including the singularity. Expressions are obtained for the bound state energies and wave functions. -- Highlights: •Motion of particle under the influence of magnetic field in curved space. •Bound state for Aharonov–Bohm problem. •Particle describing a circular path. •Determination of the self-adjoint extension parameter.« less

Quantum defect theory for the orbital Feshbach resonance

NASA Astrophysics Data System (ADS)

Cheng, Yanting; Zhang, Ren; Zhang, Peng

2017-01-01

In the ultracold gases of alkali-earth-metal-like atoms, a new type of Feshbach resonance, i.e., the orbital Feshbach resonance (OFR), has been proposed and experimentally observed in ultracold 173Yb atoms [R. Zhang et al., Phys. Rev. Lett. 115, 135301 (2015), 10.1103/PhysRevLett.115.135301]. When the OFR of the 173Yb atoms occurs, the energy gap between the open and closed channels is smaller by two orders of magnitude than the van der Waals energy. As a result, quantitative accurate results for the low-energy two-body problems can be obtained via multichannel quantum defect theory (MQDT), which is based on the exact solution of the Schrödinger equation with the van der Waals potential. In this paper we use MQDT to calculate the two-atom scattering length, effective range, and binding energy of two-body bound states for the systems with OFR. With these results we further study the clock-transition spectrum for the two-body bound states, which can be used to experimentally measure the binding energy. Our results are helpful for the quantitative theoretical and experimental research for the ultracold gases of alkali-earth-metal-like atoms with OFR.

Energy Efficient Data Transmission for Sensors with Wireless Charging

PubMed Central

Luo, Junzhou; Wu, Weiwei; Gao, Hong

2018-01-01

This paper studies the problem of maximizing the energy utilization for data transmission in sensors with periodical wireless charging process while taking into account the thermal effect. Two classes of problems are analyzed: one is the case that wireless charging can process for only a limited period of time, and the other is the case that wireless charging can process for a long enough time. Algorithms are proposed to solve the problems and analysis of these algorithms are also provided. For the first problem, three subproblems are studied, and, for the general problem, we give an algorithm that can derive a performance bound of (1−12m)(OPT−E) compared to an optimal solution. In addition, for the second problem, we provide an algorithm with 2m2m−1OPT+1 performance bound for the general problem. Simulations confirm the analysis of the algorithms. PMID:29419770

Energy Efficient Data Transmission for Sensors with Wireless Charging.

PubMed

Fang, Xiaolin; Luo, Junzhou; Wu, Weiwei; Gao, Hong

2018-02-08

This paper studies the problem of maximizing the energy utilization for data transmission in sensors with periodical wireless charging process while taking into account the thermal effect. Two classes of problems are analyzed: one is the case that wireless charging can process for only a limited period of time, and the other is the case that wireless charging can process for a long enough time. Algorithms are proposed to solve the problems and analysis of these algorithms are also provided. For the first problem, three subproblems are studied, and, for the general problem, we give an algorithm that can derive a performance bound of ( 1 - 1 2 m ) ( O P T - E ) compared to an optimal solution. In addition, for the second problem, we provide an algorithm with 2 m 2 m - 1 O P T + 1 performance bound for the general problem. Simulations confirm the analysis of the algorithms.

State estimation for networked control systems using fixed data rates

NASA Astrophysics Data System (ADS)

Liu, Qing-Quan; Jin, Fang

2017-07-01

This paper investigates state estimation for linear time-invariant systems where sensors and controllers are geographically separated and connected via a bandwidth-limited and errorless communication channel with the fixed data rate. All plant states are quantised, coded and converted together into a codeword in our quantisation and coding scheme. We present necessary and sufficient conditions on the fixed data rate for observability of such systems, and further develop the data-rate theorem. It is shown in our results that there exists a quantisation and coding scheme to ensure observability of the system if the fixed data rate is larger than the lower bound given, which is less conservative than the one in the literature. Furthermore, we also examine the role that the disturbances have on the state estimation problem in the case with data-rate limitations. Illustrative examples are given to demonstrate the effectiveness of the proposed method.

Experimental quantum key distribution with source flaws

NASA Astrophysics Data System (ADS)

Xu, Feihu; Wei, Kejin; Sajeed, Shihan; Kaiser, Sarah; Sun, Shihai; Tang, Zhiyuan; Qian, Li; Makarov, Vadim; Lo, Hoi-Kwong

2015-09-01

Decoy-state quantum key distribution (QKD) is a standard technique in current quantum cryptographic implementations. Unfortunately, existing experiments have two important drawbacks: the state preparation is assumed to be perfect without errors and the employed security proofs do not fully consider the finite-key effects for general attacks. These two drawbacks mean that existing experiments are not guaranteed to be proven to be secure in practice. Here, we perform an experiment that shows secure QKD with imperfect state preparations over long distances and achieves rigorous finite-key security bounds for decoy-state QKD against coherent attacks in the universally composable framework. We quantify the source flaws experimentally and demonstrate a QKD implementation that is tolerant to channel loss despite the source flaws. Our implementation considers more real-world problems than most previous experiments, and our theory can be applied to general discrete-variable QKD systems. These features constitute a step towards secure QKD with imperfect devices.

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

NASA Technical Reports Server (NTRS)

Nash, Stephen G.; Polyak, R.; Sofer, Ariela

1994-01-01

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

A Genetic Algorithm for Flow Shop Scheduling with Assembly Operations to Minimize Makespan

NASA Astrophysics Data System (ADS)

Bhongade, A. S.; Khodke, P. M.

2014-04-01

Manufacturing systems, in which, several parts are processed through machining workstations and later assembled to form final products, is common. Though scheduling of such problems are solved using heuristics, available solution approaches can provide solution for only moderate sized problems due to large computation time required. In this work, scheduling approach is developed for such flow-shop manufacturing system having machining workstations followed by assembly workstations. The initial schedule is generated using Disjunctive method and genetic algorithm (GA) is applied further for generating schedule for large sized problems. GA is found to give near optimal solution based on the deviation of makespan from lower bound. The lower bound of makespan of such problem is estimated and percent deviation of makespan from lower bounds is used as a performance measure to evaluate the schedules. Computational experiments are conducted on problems developed using fractional factorial orthogonal array, varying the number of parts per product, number of products, and number of workstations (ranging upto 1,520 number of operations). A statistical analysis indicated the significance of all the three factors considered. It is concluded that GA method can obtain optimal makespan.

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

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.

About Block Dynamic Model of Earthquake Source.

NASA Astrophysics Data System (ADS)

Gusev, G. A.; Gufeld, I. L.

One may state the absence of a progress in the earthquake prediction papers. The short-term prediction (diurnal period, localisation being also predicted) has practical meaning. Failure is due to the absence of the adequate notions about geological medium, particularly, its block structure and especially in the faults. Geological and geophysical monitoring gives the basis for the notion about geological medium as open block dissipative system with limit energy saturation. The variations of the volume stressed state close to critical states are associated with the interaction of the inhomogeneous ascending stream of light gases (helium and hydrogen) with solid phase, which is more expressed in the faults. In the background state small blocks of the fault medium produce the sliding of great blocks in the faults. But for the considerable variations of ascending gas streams the formation of bound chains of small blocks is possible, so that bound state of great blocks may result (earthquake source). Recently using these notions we proposed a dynamical earthquake source model, based on the generalized chain of non-linear bound oscillators of Fermi-Pasta-Ulam type (FPU). The generalization concerns its in homogeneity and different external actions, imitating physical processes in the real source. Earlier weak inhomogeneous approximation without dissipation was considered. Last has permitted to study the FPU return (return to initial state). Probabilistic properties in quasi periodic movement were found. The chain decay problem due to non-linearity and external perturbations was posed. The thresholds and dependence of life- time of the chain are studied. The great fluctuations of life-times are discovered. In the present paper the rigorous consideration of the inhomogeneous chain including the dissipation is considered. For the strong dissipation case, when the oscillation movements are suppressed, specific effects are discovered. For noise action and constantly arising deformation the dependence of life-time on noise amplitude is investigated. Also for the initial shock we have chosen the amplitudes, when it determined the life-time, as principal cause. For this case it appeared, that life-time had non-monotonous dependence on the noise amplitude ("temperature"). There was the domain of the "temperatures", where the life-time reached a maximum. The comparison of different dissipation intensities was performed.

Solving the relativistic inverse stellar problem through gravitational waves observation of binary neutron stars

NASA Astrophysics Data System (ADS)

Abdelsalhin, Tiziano; Maselli, Andrea; Ferrari, Valeria

2018-04-01

The LIGO/Virgo Collaboration has recently announced the direct detection of gravitational waves emitted in the coalescence of a neutron star binary. This discovery allows, for the first time, to set new constraints on the behavior of matter at supranuclear density, complementary with those coming from astrophysical observations in the electromagnetic band. In this paper we demonstrate the feasibility of using gravitational signals to solve the relativistic inverse stellar problem, i.e., to reconstruct the parameters of the equation of state (EoS) from measurements of the stellar mass and tidal Love number. We perform Bayesian inference of mock data, based on different models of the star internal composition, modeled through piecewise polytropes. Our analysis shows that the detection of a small number of sources by a network of advanced interferometers would allow to put accurate bounds on the EoS parameters, and to perform a model selection among the realistic equations of state proposed in the literature.

Exact-Output Tracking Theory for Systems with Parameter Jumps

NASA Technical Reports Server (NTRS)

Devasia, Santosh; Paden, Brad; Rossi, Carlo

1996-01-01

In this paper we consider the exact output tracking problem for systems with parameter jumps. Necessary and sufficient conditions are derived for the elimination of switching-introduced output transient. Previous works have studied this problem by developing a regulator that maintains exact tracking through parameter jumps (switches). Such techniques are, however, only applicable to minimum-phase systems. In contrast, our approach is applicable to nonminimum-phase systems and obtains bounded but possibly non-causal solutions. If the reference trajectories are generated by an exo-system, then we develop an exact-tracking controller in a feedback form. As in standard regulator theory, we obtain a linear map from the states of the exo-system to the desired system state which is defined via a matrix differential equation. The constant solution of this differential equation provides asymptotic tracking, and coincides with the feedback law used in standard regulator theory. The obtained results are applied to a simple flexible manipulator with jumps in the pay-load mass.

Exact-Output Tracking Theory for Systems with Parameter Jumps

NASA Technical Reports Server (NTRS)

Devasia, Santosh; Paden, Brad; Rossi, Carlo

1997-01-01

We consider the exact output tracking problem for systems with parameter jumps. Necessary and sufficient conditions are derived for the elimination of switching-introduced output transient. Previous works have studied this problem by developing a regulator that maintains exact tracking through parameter jumps (switches). Such techniques are, however, only applicable to minimum-phase systems. In contrast, our approach is applicable to non-minimum-phase systems and it obtains bounded but possibly non-causal solutions. If the reference trajectories are generated by an exosystem, then we develop an exact-tracking controller in a feed-back form. As in standard regulator theory, we obtain a linear map from the states of the exosystem to the desired system state which is defined via a matrix differential equation. The constant solution of this differential equation provides asymptotic tracking, and coincides with the feedback law used in standard regulator theory. The obtained results are applied to a simple flexible manipulator with jumps in the pay-load mass.

Parallelized reliability estimation of reconfigurable computer networks

NASA Technical Reports Server (NTRS)

Nicol, David M.; Das, Subhendu; Palumbo, Dan

1990-01-01

A parallelized system, ASSURE, for computing the reliability of embedded avionics flight control systems which are able to reconfigure themselves in the event of failure is described. ASSURE accepts a grammar that describes a reliability semi-Markov state-space. From this it creates a parallel program that simultaneously generates and analyzes the state-space, placing upper and lower bounds on the probability of system failure. ASSURE is implemented on a 32-node Intel iPSC/860, and has achieved high processor efficiencies on real problems. Through a combination of improved algorithms, exploitation of parallelism, and use of an advanced microprocessor architecture, ASSURE has reduced the execution time on substantial problems by a factor of one thousand over previous workstation implementations. Furthermore, ASSURE's parallel execution rate on the iPSC/860 is an order of magnitude faster than its serial execution rate on a Cray-2 supercomputer. While dynamic load balancing is necessary for ASSURE's good performance, it is needed only infrequently; the particular method of load balancing used does not substantially affect performance.

Forbidden regimes in the distribution of bipartite quantum correlations due to multiparty entanglement

NASA Astrophysics Data System (ADS)

Kumar, Asutosh; Dhar, Himadri Shekhar; Prabhu, R.; Sen(De), Aditi; Sen, Ujjwal

2017-05-01

Monogamy is a nonclassical property that limits the distribution of quantum correlation among subparts of a multiparty system. We show that monogamy scores for different quantum correlation measures are bounded above by functions of genuine multipartite entanglement for a large majority of pure multiqubit states. The bound is universal for all three-qubit pure states. We derive necessary conditions to characterize the states that violate the bound, which can also be observed by numerical simulation for a small set of states, generated Haar uniformly. The results indicate that genuine multipartite entanglement restricts the distribution of bipartite quantum correlations in a multiparty system.

A methodology for airplane parameter estimation and confidence interval determination in nonlinear estimation problems. Ph.D. Thesis - George Washington Univ., Apr. 1985

NASA Technical Reports Server (NTRS)

Murphy, P. C.

1986-01-01

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. With the fitted surface, sensitivity information can be updated at each iteration with less computational effort than that required by either a finite-difference method or integration of the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, and thus provides flexibility to use model equations in any convenient format. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. The degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels and to predict the degree of agreement between CR bounds and search estimates.

Direct and inverse theorems on approximation by root functions of a regular boundary-value problem

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

Radzievskii, G V

2006-08-31

One considers the spectral problem x{sup (n)}+ Fx={lambda}x with boundary conditions U{sub j}(x)=0, j=1,...,n, for functions x on [0,1]. It is assumed that F is a linear bounded operator from the Hoelder space C{sup {gamma}}, {gamma} element of [0,n-1), into L{sub 1} and the U{sub j} are bounded linear functionals on C{sup k{sub j}} with k{sub j} element of {l_brace}0,...,n- 1{r_brace}. Let P{sub {zeta}} be the linear span of the root functions of the problem x{sup (n)}+ Fx={lambda}x, U{sub j}(x)=0, j=1,...,n, corresponding to the eigenvalues {lambda}{sub k} with |{lambda}{sub k}|<{zeta}{sup n}, and let E{sub {zeta}}(f){sub W{sub p}{sup l}}:=inf{l_brace}||f-g||{sub W{sub p}{supmore » l}}:g element of P{sub {zeta}}{r_brace}. An estimate of E{sub {zeta}}(f){sub W{sub p}{sup l}} is obtained in terms of the K-functional K({zeta}{sup -m},f;W{sub p}{sup l},W{sub p,U}{sup l+m}):= inf{l_brace}||f-x||{sub W{sub p}{sup l}}+{zeta}{sup -m}||x||{sub W{sub p}{sup l}{sup +}{sup m}}:x element of W{sub p}{sup l+m}, U{sub j}(x)=0 for k{sub j}

Dynamic State Estimation of Terrestrial and Solar Plasmas

NASA Astrophysics Data System (ADS)

Kamalabadi, Farzad

A pervasive problem in virtually all branches of space science is the estimation of multi-dimensional state parameters of a dynamical system from a collection of indirect, often incomplete, and imprecise measurements. Subsequent scientific inference is predicated on rigorous analysis, interpretation, and understanding of physical observations and on the reliability of the associated quantitative statistical bounds and performance characteristics of the algorithms used. In this work, we focus on these dynamic state estimation problems and illustrate their importance in the context of two timely activities in space remote sensing. First, we discuss the estimation of multi-dimensional ionospheric state parameters from UV spectral imaging measurements anticipated to be acquired the recently selected NASA Heliophysics mission, Ionospheric Connection Explorer (ICON). Next, we illustrate that similar state-space formulations provide the means for the estimation of 3D, time-dependent densities and temperatures in the solar corona from a series of white-light and EUV measurements. We demonstrate that, while a general framework for the stochastic formulation of the state estimation problem is suited for systematic inference of the parameters of a hidden Markov process, several challenges must be addressed in the assimilation of an increasing volume and diversity of space observations. These challenges are: (1) the computational tractability when faced with voluminous and multimodal data, (2) the inherent limitations of the underlying models which assume, often incorrectly, linear dynamics and Gaussian noise, and (3) the unavailability or inaccuracy of transition probabilities and noise statistics. We argue that pursuing answers to these questions necessitates cross-disciplinary research that enables progress toward systematically reconciling observational and theoretical understanding of the space environment.

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

Scenarios of physics beyond the standard model

NASA Astrophysics Data System (ADS)

Fok, Ricky

This dissertation discusses three topics on scenarios beyond the Standard Model. Topic one is the effects from a fourth generation of quarks and leptons on electroweak baryogenesis in the early universe. The Standard Model is incapable of electroweak baryogenesis due to an insufficiently strong enough electroweak phase transition (EWPT) as well as insufficient CP violation. We show that the presence of heavy fourth generation fermions solves the first problem but requires additional bosons to be included to stabilize the electroweak vacuum. Introducing supersymmetric partners of the heavy fermions, we find that the EWPT can be made strong enough and new sources of CP violation are present. Topic two relates to the lepton avor problem in supersymmetry. In the Minimal Supersymmetric Standard Model (MSSM), the off-diagonal elements in the slepton mass matrix must be suppressed at the 10-3 level to avoid experimental bounds from lepton avor changing processes. This dissertation shows that an enlarged R-parity can alleviate the lepton avor problem. An analysis of all sensitive parameters was performed in the mass range below 1 TeV, and we find that slepton maximal mixing is possible without violating bounds from the lepton avor changing processes: mu → egamma; mu → e conversion, and mu → 3e. Topic three is the collider phenomenology of quirky dark matter. In this model, quirks are particles that are gauged under the electroweak group, as well as a dark" color SU(2) group. The hadronization scale of this color group is well below the quirk masses. As a result, the dark color strings never break. Quirk and anti-quirk pairs can be produced at the LHC. Once produced, they immediately form a bound state of high angular momentum. The quirk pair rapidly shed angular momentum by emitting soft radiation before they annihilate into observable signals. This dissertation presents the decay branching ratios of quirkonia where quirks obtain their masses through electroweak symmetry breaking. This dissertation includes previously published and unpublished co-authored material.

Finite-Momentum Dimer Bound State in Spin-Orbit Coupled Fermi Gas

NASA Astrophysics Data System (ADS)

Dong, Lin; Jiang, Lei; Hu, Hui; Pu, Han

2013-03-01

We investigate the two-body properties of a spin-1/2 Fermi gas subject to a spin-orbit coupling induced by laser fields. When attractive s-wave interaction between unlike spins is present, the system may form a dimer bound state. Surprisingly, under proper conditions, the bound state obtains finite center-of-mass momentum, whereas under the same condition but in the absence of the two-body interaction, the system has zero total momentum. This unusual result can be regarded as a consequence of the broken Galilean invariance by the spin-orbit coupling. Such a finite-momentum bound state will have profound effects on the many-body properties of the system. HP is supported by the NSF, the Welch Foundation (Grant No. C-1669), and DARPA. HH is supported by the ARC Discovery Projects (Grant No. DP0984522) and the National Basic Research Program of China (NFRP-China, Grant No. 2011CB921502).

Index theorem for the flat Andreev bound states at a dirty surface of a nodal superconductor

NASA Astrophysics Data System (ADS)

Ikegaya, Satoshi; Asano, Yasuhiro

2018-03-01

We discuss the stability of at-band Andreev bound states appearing at a surface of a nodal unconventional superconductor. In the clean limit, the existence of the surface bound states is topologically characterized by a momentum-dependent topological invariant: one-dimensional winding number de ned in the restricted Brillouin zone. Thus, such topological invariant is ill-defined in the presence of potential disorder which is inevitable in experiments. By paying attention to chiral symmetry of the Hamiltonian, we provide an alternative topological index N ZES that predicts the number of Andreev bound states at a dirty surface of an unconventional superconductor. Moreover, we demonstrate that the zero-bias differential conductance in a normal metal/unconventional superconductor junction is quantized at (4e 2 /h)|N ZES | in the limit of strong impurity scattering in the normal metal.

Binding of the B D D ¯ and B D D systems

NASA Astrophysics Data System (ADS)

Dias, J. M.; Debastiani, V. R.; Roca, L.; Sakai, S.; Oset, E.

2017-11-01

We study theoretically the B D D ¯ and B D D systems to see if they allow for possible bound or resonant states. The three-body interaction is evaluated implementing the fixed center approximation to the Faddeev equations which considers the interaction of a D or D ¯ particle with the components of a B D cluster, previously proved to form a bound state. We find an I (JP)=1 /2 (0-) bound state for the B D D ¯ system at an energy around 8925-8985 MeV within uncertainties, which would correspond to a bottom hidden-charm meson. In contrast, for the B D D system, which would be bottom double-charm and hence manifestly exotic, we have found hints of a bound state in the energy region 8935-8985 MeV, but the results are not stable under the uncertainties of the model, and we cannot assure, nor rule out, the possibility of a B D D three-body state.

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

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

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

DOE PAGES

Gade, Dinakar; Hackebeil, Gabriel; Ryan, Sarah M.; ...

2016-04-02

We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.

Trapping of quantum particles and light beams by switchable potential wells

NASA Astrophysics Data System (ADS)

Sonkin, Eduard; Malomed, Boris A.; Granot, Er'El; Marchewka, Avi

2010-09-01

We consider basic dynamical effects in settings based on a pair of local potential traps that may be effectively switched on and off, or suddenly displaced, by means of appropriate control mechanisms, such as scanning tunneling microscopy or photo-switchable quantum dots. The same models, based on the linear Schrödinger equation with time-dependent trapping potentials, apply to the description of optical planar systems designed for the switching of trapped light beams. The analysis is carried out in the analytical form, using exact solutions of the Schrödinger equation. The first dynamical problem considered in this work is the retention of a particle released from a trap which was suddenly turned off, while another local trap was switched on at a distance—immediately or with a delay. In this case, we demonstrate that the maximum of the retention rate is achieved at a specific finite value of the strength of the new trap, and at a finite value of the temporal delay, depending on the distance between the two traps. Another problem is retrapping of the bound particle when the addition of the second trap transforms the single-well setting into a double-well potential (DWP). In that case, we find probabilities for the retrapping into the ground or first excited state of the DWP. We also analyze effects entailed by the application of a kick to a bound particle, the most interesting one being a kick-induced transition between the DWP’s ground and excited states. In the latter case, the largest transition probability is achieved at a particular strength of the kick.

Model Based Optimal Control, Estimation, and Validation of Lithium-Ion Batteries

NASA Astrophysics Data System (ADS)

Perez, Hector Eduardo

This dissertation focuses on developing and experimentally validating model based control techniques to enhance the operation of lithium ion batteries, safely. An overview of the contributions to address the challenges that arise are provided below. Chapter 1: This chapter provides an introduction to battery fundamentals, models, and control and estimation techniques. Additionally, it provides motivation for the contributions of this dissertation. Chapter 2: This chapter examines reference governor (RG) methods for satisfying state constraints in Li-ion batteries. Mathematically, these constraints are formulated from a first principles electrochemical model. Consequently, the constraints explicitly model specific degradation mechanisms, such as lithium plating, lithium depletion, and overheating. This contrasts with the present paradigm of limiting measured voltage, current, and/or temperature. The critical challenges, however, are that (i) the electrochemical states evolve according to a system of nonlinear partial differential equations, and (ii) the states are not physically measurable. Assuming available state and parameter estimates, this chapter develops RGs for electrochemical battery models. The results demonstrate how electrochemical model state information can be utilized to ensure safe operation, while simultaneously enhancing energy capacity, power, and charge speeds in Li-ion batteries. Chapter 3: Complex multi-partial differential equation (PDE) electrochemical battery models are characterized by parameters that are often difficult to measure or identify. This parametric uncertainty influences the state estimates of electrochemical model-based observers for applications such as state-of-charge (SOC) estimation. This chapter develops two sensitivity-based interval observers that map bounded parameter uncertainty to state estimation intervals, within the context of electrochemical PDE models and SOC estimation. Theoretically, this chapter extends the notion of interval observers to PDE models using a sensitivity-based approach. Practically, this chapter quantifies the sensitivity of battery state estimates to parameter variations, enabling robust battery management schemes. The effectiveness of the proposed sensitivity-based interval observers is verified via a numerical study for the range of uncertain parameters. Chapter 4: This chapter seeks to derive insight on battery charging control using electrochemistry models. Directly using full order complex multi-partial differential equation (PDE) electrochemical battery models is difficult and sometimes impossible to implement. This chapter develops an approach for obtaining optimal charge control schemes, while ensuring safety through constraint satisfaction. An optimal charge control problem is mathematically formulated via a coupled reduced order electrochemical-thermal model which conserves key electrochemical and thermal state information. The Legendre-Gauss-Radau (LGR) pseudo-spectral method with adaptive multi-mesh-interval collocation is employed to solve the resulting nonlinear multi-state optimal control problem. Minimum time charge protocols are analyzed in detail subject to solid and electrolyte phase concentration constraints, as well as temperature constraints. The optimization scheme is examined using different input current bounds, and an insight on battery design for fast charging is provided. Experimental results are provided to compare the tradeoffs between an electrochemical-thermal model based optimal charge protocol and a traditional charge protocol. Chapter 5: Fast and safe charging protocols are crucial for enhancing the practicality of batteries, especially for mobile applications such as smartphones and electric vehicles. This chapter proposes an innovative approach to devising optimally health-conscious fast-safe charge protocols. A multi-objective optimal control problem is mathematically formulated via a coupled electro-thermal-aging battery model, where electrical and aging sub-models depend upon the core temperature captured by a two-state thermal sub-model. The Legendre-Gauss-Radau (LGR) pseudo-spectral method with adaptive multi-mesh-interval collocation is employed to solve the resulting highly nonlinear six-state optimal control problem. Charge time and health degradation are therefore optimally traded off, subject to both electrical and thermal constraints. Minimum-time, minimum-aging, and balanced charge scenarios are examined in detail. Sensitivities to the upper voltage bound, ambient temperature, and cooling convection resistance are investigated as well. Experimental results are provided to compare the tradeoffs between a balanced and traditional charge protocol. Chapter 6: This chapter provides concluding remarks on the findings of this dissertation and a discussion of future work.

Localization behavior at bound Bi complex states in GaA s 1 - x B i x

DOE PAGES

Alberi, K.; Christian, T. M.; Fluegel, B.; ...

2017-07-01

While bismuth-related states are known to localize carriers in GaAs 1-xBi x alloys, the localization behavior of distinct Bi pair, triplet and cluster states bound above the valence band is less well understood. We probe localization at three different Bi complex states in dilute GaAs 1-xBi x alloys using magneto-photoluminescence and time-resolved photoluminescence spectroscopy. The mass of electrons Coulomb-bound to holes trapped at Bi pair states is found to increase relative to the average electron mass in the alloy. This increase is attributed to enhanced local compressive strain in the immediate vicinity of the pairs. The dependence of energy transfermore » between these states on composition is also explored.« less

Observer-Based Adaptive NN Control for a Class of Uncertain Nonlinear Systems With Nonsymmetric Input Saturation.

PubMed

Yong-Feng Gao; Xi-Ming Sun; Changyun Wen; Wei Wang

2017-07-01

This paper is concerned with the problem of adaptive tracking control for a class of uncertain nonlinear systems with nonsymmetric input saturation and immeasurable states. The radial basis function of neural network (NN) is employed to approximate unknown functions, and an NN state observer is designed to estimate the immeasurable states. To analyze the effect of input saturation, an auxiliary system is employed. By the aid of adaptive backstepping technique, an adaptive tracking control approach is developed. Under the proposed adaptive tracking controller, the boundedness of all the signals in the closed-loop system is achieved. Moreover, distinct from most of the existing references, the tracking error can be bounded by an explicit function of design parameters and saturation input error. Finally, an example is given to show the effectiveness of the proposed method.

Harmonic oscillator representation in the theory of scattering and nuclear reactions

NASA Technical Reports Server (NTRS)

Smirnov, Yuri F.; Shirokov, A. M.; Lurie, Yuri, A.; Zaitsev, S. A.

1995-01-01

The following questions, concerning the application of the harmonic oscillator representation (HOR) in the theory of scattering and reactions, are discussed: the formulation of the scattering theory in HOR; exact solutions of the free motion Schroedinger equation in HOR; separable expansion of the short range potentials and the calculation of the phase shifts; 'isolated states' as generalization of the Wigner-von Neumann bound states embedded in continuum; a nuclear coupled channel problem in HOR; and the description of true three body scattering in HOR. As an illustration the soft dipole mode in the (11)Li nucleus is considered in a frame of the (9)Li+n+n cluster model taking into account of three body continuum effects.

Graph Embedding Techniques for Bounding Condition Numbers of Incomplete Factor Preconditioning

NASA Technical Reports Server (NTRS)

Guattery, Stephen

1997-01-01

We extend graph embedding techniques for bounding the spectral condition number of preconditioned systems involving symmetric, irreducibly diagonally dominant M-matrices to systems where the preconditioner is not diagonally dominant. In particular, this allows us to bound the spectral condition number when the preconditioner is based on an incomplete factorization. We provide a review of previous techniques, describe our extension, and give examples both of a bound for a model problem, and of ways in which our techniques give intuitive way of looking at incomplete factor preconditioners.

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

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.

Resource Constrained Planning of Multiple Projects with Separable Activities

NASA Astrophysics Data System (ADS)

Fujii, Susumu; Morita, Hiroshi; Kanawa, Takuya

In this study we consider a resource constrained planning problem of multiple projects with separable activities. This problem provides a plan to process the activities considering a resource availability with time window. We propose a solution algorithm based on the branch and bound method to obtain the optimal solution minimizing the completion time of all projects. We develop three methods for improvement of computational efficiency, that is, to obtain initial solution with minimum slack time rule, to estimate lower bound considering both time and resource constraints and to introduce an equivalence relation for bounding operation. The effectiveness of the proposed methods is demonstrated by numerical examples. Especially as the number of planning projects increases, the average computational time and the number of searched nodes are reduced.

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.

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

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

NASA Technical Reports Server (NTRS)

Smith, Stephen F.; Pathak, Dhiraj K.

1991-01-01

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

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

A Class of Prediction-Correction Methods for Time-Varying Convex Optimization

NASA Astrophysics Data System (ADS)

Simonetto, Andrea; Mokhtari, Aryan; Koppel, Alec; Leus, Geert; Ribeiro, Alejandro

2016-09-01

This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or multiple gradient steps or Newton steps, which respectively correspond to the gradient trajectory tracking (GTT) or Newton trajectory tracking (NTT) algorithms. Under suitable conditions, we establish that the asymptotic error incurred by both proposed methods behaves as $O(h^2)$, and in some cases as $O(h^4)$, which outperforms the state-of-the-art error bound of $O(h)$ for correction-only methods in the gradient-correction step. Moreover, when the characteristics of the objective function variation are not available, we propose approximate gradient and Newton tracking algorithms (AGT and ANT, respectively) that still attain these asymptotical error bounds. Numerical simulations demonstrate the practical utility of the proposed methods and that they improve upon existing techniques by several orders of magnitude.

Magnetic states at short distances

NASA Astrophysics Data System (ADS)

Crater, Horace W.; Wong, Cheuk-Yin

2012-06-01

The magnetic interactions between a fermion and an antifermion of opposite electric or color charges in the S0-+1 and P0++3 states with J=0 are very attractive and singular near the origin and may allow the formation of new bound and resonance states at short distances. In the two-body Dirac equations formulated in constraint dynamics, the short-distance attraction for these states for point particles leads to a quasipotential that behaves near the origin as -α2/r2, where α is the coupling constant. Representing this quasipotential at short distances as λ(λ+1)/r2 with λ=(-1+1-4α2)/2, both S0-+1 and P0++3 states admit two types of eigenstates with drastically different behaviors for the radial wave function u=rψ. One type of states, with u growing as rλ+1 at small r, will be called usual states. The other type of states with u growing as r-λ will be called peculiar states. Both of the usual and peculiar eigenstates have admissible behaviors at short distances. Remarkably, the solutions for both sets of S01 states can be written out analytically. The usual bound S01 states possess attributes the same as those one usually encounters in QED and QCD, with bound QED state energies explicitly agreeing with the standard perturbative results through order α4. In contrast, the peculiar bound S01 states, yet to be observed, not only have different behaviors at the origin, but also distinctly different bound state properties (and scattering phase shifts). For the peculiar S01 ground state of fermion-antifermion pair with fermion rest mass m, the root-mean-square radius is approximately 1/m, binding energy is approximately (2-2)m, and rest mass approximately 2m. On the other hand, the (n+1)S01 peculiar state with principal quantum number (n+1) is nearly degenerate in energy and approximately equal in size with the nS01 usual states. For the P03 states, the usual solutions lead to the standard bound state energies and no resonance, but resonances have been found for the peculiar states whose energies depend on the description of the internal structure of the charges, the mass of the constituent, and the coupling constant. The existence of both usual and peculiar eigenstates in the same system leads to the non-self-adjoint property of the mass operator and two nonorthogonal complete sets. As both sets of states are physically admissible, the mass operator can be made self-adjoint with a single complete set of admissible states by introducing a new peculiarity quantum number and an enlarged Hilbert space that contains both the usual and peculiar states in different peculiarity sectors. Whether or not these newly-uncovered quantum-mechanically acceptable peculiar S01 bound states and P03 resonances for point fermion-antifermion systems correspond to physical states remains to be further investigated.

Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs

PubMed Central

Novo, Leonardo; Chakraborty, Shantanav; Mohseni, Masoud; Neven, Hartmut; Omar, Yasser

2015-01-01

Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that confine the dynamics to a smaller subspace of the full Hilbert space. In this work, we use invariant subspace methods, that can be computed systematically using the Lanczos algorithm, to obtain the reduced set of states that encompass the dynamics of the problem at hand without the specific knowledge of underlying symmetries. First, we apply this method to obtain new instances of graphs where the spatial quantum search algorithm is optimal: complete graphs with broken links and complete bipartite graphs, in particular, the star graph. These examples show that regularity and high-connectivity are not needed to achieve optimal spatial search. We also show that this method considerably simplifies the calculation of quantum transport efficiencies. Furthermore, we observe improved efficiencies by removing a few links from highly symmetric graphs. Finally, we show that this reduction method also allows us to obtain an upper bound for the fidelity of a single qubit transfer on an XY spin network. PMID:26330082

Heuristic approach to Satellite Range Scheduling with Bounds using Lagrangian Relaxation.

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

Brown, Nathanael J. K.; Arguello, Bryan; Nozick, Linda Karen

This paper focuses on scheduling antennas to track satellites using a heuristic method. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The performance of the algorithm is established using several illustrative problems.

Bound state potential energy surface construction: ab initio zero-point energies and vibrationally averaged rotational constants.

PubMed

Bettens, Ryan P A

2003-01-15

Collins' method of interpolating a potential energy surface (PES) from quantum chemical calculations for reactive systems (Jordan, M. J. T.; Thompson, K. C.; Collins, M. A. J. Chem. Phys. 1995, 102, 5647. Thompson, K. C.; Jordan, M. J. T.; Collins, M. A. J. Chem. Phys. 1998, 108, 8302. Bettens, R. P. A.; Collins, M. A. J. Chem. Phys. 1999, 111, 816) has been applied to a bound state problem. The interpolation method has been combined for the first time with quantum diffusion Monte Carlo calculations to obtain an accurate ground state zero-point energy, the vibrationally average rotational constants, and the vibrationally averaged internal coordinates. In particular, the system studied was fluoromethane using a composite method approximating the QCISD(T)/6-311++G(2df,2p) level of theory. The approach adopted in this work (a) is fully automated, (b) is fully ab initio, (c) includes all nine nuclear degrees of freedom, (d) requires no assumption of the functional form of the PES, (e) possesses the full symmetry of the system, (f) does not involve fitting any parameters of any kind, and (g) is generally applicable to any system amenable to quantum chemical calculations and Collins' interpolation method. The calculated zero-point energy agrees to within 0.2% of its current best estimate. A0 and B0 are within 0.9 and 0.3%, respectively, of experiment.

Fluoride-Mediated Capture of a Noncovalent Bound State of a Reversible Covalent Enzyme Inhibitor: X-ray Crystallographic Analysis of an Exceptionally Potent [alpha]-Ketoheterocycle Inhibitor of Fatty Acid Amide Hydrolase

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

Mileni, Mauro; Garfunkle, Joie; Ezzili, Cyrine

2011-11-02

Two cocrystal X-ray structures of the exceptionally potent {alpha}-ketoheterocycle inhibitor 1 (K{sub i} = 290 pM) bound to a humanized variant of rat fatty acid amide hydrolase (FAAH) are disclosed, representing noncovalently and covalently bound states of the same inhibitor with the enzyme. Key to securing the structure of the noncovalently bound state of the inhibitor was the inclusion of fluoride ion in the crystallization conditions that is proposed to bind the oxyanion hole precluding inhibitor covalent adduct formation with stabilization of the tetrahedral hemiketal. This permitted the opportunity to detect important noncovalent interactions stabilizing the binding of the inhibitormore » within the FAAH active site independent of the covalent reaction. Remarkably, noncovalently bound 1 in the presence of fluoride appears to capture the active site in the same 'in action' state with the three catalytic residues Ser241-Ser217-Lys142 occupying essentially identical positions observed in the covalently bound structure of 1, suggesting that this technique of introducing fluoride may have important applications in structural studies beyond inhibiting substrate or inhibitor oxyanion hole binding. Key insights to emerge from the studies include the observations that noncovalently bound 1 binds in its ketone (not gem diol) form, that the terminal phenyl group in the acyl side chain of the inhibitor serves as the key anchoring interaction overriding the intricate polar interactions in the cytosolic port, and that the role of the central activating heterocycle is dominated by its intrinsic electron-withdrawing properties. These two structures are also briefly compared with five X-ray structures of {alpha}-ketoheterocycle-based inhibitors bound to FAAH recently disclosed.« less

Quantum speed limit for arbitrary initial states

PubMed Central

Zhang, Ying-Jie; Han, Wei; Xia, Yun-Jie; Cao, Jun-Peng; Fan, Heng

2014-01-01

The minimal time a system needs to evolve from an initial state to its one orthogonal state is defined as the quantum speed limit time, which can be used to characterize the maximal speed of evolution of a quantum system. This is a fundamental question of quantum physics. We investigate the generic bound on the minimal evolution time of the open dynamical quantum system. This quantum speed limit time is applicable to both mixed and pure initial states. We then apply this result to the damped Jaynes-Cummings model and the Ohimc-like dephasing model starting from a general time-evolution state. The bound of this time-dependent state at any point in time can be found. For the damped Jaynes-Cummings model, when the system starts from the excited state, the corresponding bound first decreases and then increases in the Markovian dynamics. While in the non-Markovian regime, the speed limit time shows an interesting periodic oscillatory behavior. For the case of Ohimc-like dephasing model, this bound would be gradually trapped to a fixed value. In addition, the roles of the relativistic effects on the speed limit time for the observer in non-inertial frames are discussed. PMID:24809395

A new problem in mathematical physics associated with the problem of coherent phase transformation

NASA Astrophysics Data System (ADS)

Grinfeld, M. A.

1985-06-01

The description of heterogeneous coherent phase equilibria in an elastic single component system is shown to lead, in the approximation of small intrinsic deformation, to a new problem in mathematical physics with an unknown bound. The low order terms of the resulting system of equilibrium equations coincide with the equations of the classical linear theory of elasticity (generally speaking, anisotropic); however, the problem remains strongly nonlinear overall, inasmuch as it contains an unknown bound and a boundary condition on it which is quadratic with respect to translation. The formulas obtained are used to find certain explicit solutions to the boundary problems. As an example, the problem of heterogeneous equilibria in an infinite rectangular isotropic beam with free faces and constant loading on the surfaces x squared = const can be examined. A modeling problem for the asymptote of small intrinsic deformation during coherent phase transformation is presented as a scalar analog of the vector problem considered initially.

Pairing from strong repulsion in triangular lattice Hubbard model

NASA Astrophysics Data System (ADS)

Zhang, Shang-Shun; Zhu, Wei; Batista, Cristian D.

2018-04-01

We propose a pairing mechanism between holes in the dilute limit of doped frustrated Mott insulators. Hole pairing arises from a hole-hole-magnon three-body bound state. This pairing mechanism has its roots on single-hole kinetic energy frustration, which favors antiferromagnetic (AFM) correlations around the hole. We demonstrate that the AFM polaron (hole-magnon bound state) produced by a single hole propagating on a field-induced polarized background is strong enough to bind a second hole. The effective interaction between these three-body bound states is repulsive, implying that this pairing mechanism is relevant for superconductivity.

Structure and dynamics of proflavine association around DNA.

PubMed

Sasikala, Wilbee D; Mukherjee, Arnab

2016-04-21

Proflavine is a small molecule that intercalates into DNA and, thereby, acts as an anticancer agent. Intercalation of proflavine is shown to be a two-step process in which the first step is believed to be the formation of a pre-intercalative outside bound state. Experimental studies so far have been unable to capture the nature of the outside bound state. However, the sub-millisecond timescale observed in fluorescence kinetic experiments is often attributed to the binding of proflavine outside of DNA. Here, we have performed molecular dynamics simulations with multiple proflavine molecules to study the structure and dynamics of the formation of the outside bound state of DNA at different ion concentrations. We observed that the timescale of the outside bound state formation is, at least, five orders of magnitude faster (in nanoseconds) than the experimentally reported timescale (sub-milliseconds) attributed to binding outside DNA. Moreover, we also observed the stacked arrangement of proflavine all around DNA, which is different from the experimentally predicted stacking arrangement perpendicular to the helical axis of DNA in the close vicinity of the phosphate groups. This study, therefore, provides insight into the molecular structure and dynamics of the pre-intercalative outside bound state and will help in understanding the overall intercalation mechanism.

Topological bound states of a quantum walk with cold atoms

NASA Astrophysics Data System (ADS)

Mugel, Samuel; Celi, Alessio; Massignan, Pietro; Asbóth, János K.; Lewenstein, Maciej; Lobo, Carlos

2016-08-01

We suggest a method for engineering a quantum walk, with cold atoms as walkers, which presents topologically nontrivial properties. We derive the phase diagram, and show that we are able to produce a boundary between topologically distinct phases using the finite beam width of the applied lasers. A topologically protected bound state can then be observed, which is pinned to the interface and is robust to perturbations. We show that it is possible to identify this bound state by averaging over spin sensitive measures of the atom's position, based on the spin distribution that these states display. Interestingly, there exists a parameter regime in which our system maps on to the Creutz ladder.

Nearly Supersymmetric Dark Atoms

DOE PAGES

Behbahani, Siavosh R.; Jankowiak, Martin; Rube, Tomas; ...

2011-01-01

Theories of dark matter that support bound states are an intriguing possibility for the identity of the missing mass of the Universe. This article proposes a class of models of supersymmetric composite dark matter where the interactions with the Standard Model communicate supersymmetry breaking to the dark sector. In these models, supersymmetry breaking can be treated as a perturbation on the spectrum of bound states. Using a general formalism, the spectrum with leading supersymmetry effects is computed without specifying the details of the binding dynamics. The interactions of the composite states with the Standard Model are computed, and several benchmarkmore » models are described. General features of nonrelativistic supersymmetric bound states are emphasized.« less

Short paths in expander graphs

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

Kleinberg, J.; Rubinfeld, R.

Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the interconnection networks on which they run. We develop new routing algorithms and structural results for bounded-degree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work asserting that expanders are rich in short, disjoint paths. In particular, our work has consequences for the disjoint paths problem, multicommodify flow, and graph minor containment. We show: (i) A greedy algorithm for approximating the maximum disjoint paths problem achieves a polylogarithmic approximation ratiomore » in bounded-degree expanders. Although our algorithm is both deterministic and on-line, its performance guarantee is an improvement over previous bounds in expanders. (ii) For a multicommodily flow problem with arbitrary demands on a bounded-degree expander, there is a (1 + {epsilon})-optimal solution using only flow paths of polylogarithmic length. It follows that the multicommodity flow algorithm of Awerbuch and Leighton runs in nearly linear time per commodity in expanders. Our analysis is based on establishing the following: given edge weights on an expander G, one can increase some of the weights very slightly so the resulting shortest-path metric is smooth - the min-weight path between any pair of nodes uses a polylogarithmic number of edges. (iii) Every bounded-degree expander on n nodes contains every graph with O(n/log{sup O(1)} n) nodes and edges as a minor.« less

Bounds on negativity for the success of quantum teleportation of qutrit-qubit system

NASA Astrophysics Data System (ADS)

K G, Paulson; Satyanarayana, S. V. M.

In the original protocol Bennet et.al., used maximally entangled pure states as quantum channel to teleport unknown states between distant observers with maximum fidelity. Noisy quantum channel can be used for imperfect teleportation. Both degree of entanglement and mixedness decide the success of teleportation in the case of mixed entangled quantum channel. . In one of our previous works, we discussed the existence of lower bound below which ,state is useless for quantum teleportation in the measure of entanglement for a fixed value of fidelity, and this lower bound decreases as rank increases for two-qubit system. We use negativity as the measure of entanglement. . In this work, we consider a qutrit-qubit system as quantum channel for teleportation, and study how the negativity and rank affect the teleportation fidelity for a class of states. We construct a new class of mixed entangled qutrit-qubit states as quantum channel, which is a convex sum of orthonormal maximally entangled and separable pure states. The classical limit of fidelity below which state is useless for quantum teleportation is fixed as 2/3. We numerically generate 30000 states and estimate the value of negativity below which each rank mixed state is useless for quantum teleportation. We also construct rank dependant boundary states by choosing appropriate eigen values, which act as upper bound for respective rank states.

Semistable extremal ground states for nonlinear evolution equations in unbounded domains

NASA Astrophysics Data System (ADS)

Rodríguez-Bernal, Aníbal; Vidal-López, Alejandro

2008-02-01

In this paper we show that dissipative reaction-diffusion equations in unbounded domains posses extremal semistable ground states equilibria, which bound asymptotically the global dynamics. Uniqueness of such positive ground state and their approximation by extremal equilibria in bounded domains is also studied. The results are then applied to the important case of logistic equations.

Contemporary continuum QCD approaches to excited hadrons

NASA Astrophysics Data System (ADS)

El-Bennich, Bruno; Rojas, Eduardo

2016-03-01

Amongst the bound states produced by the strong interaction, radially excited meson and nucleon states offer an important phenomenological window into the long-range behavior of the coupling constant in Quantum Chromodynamics. We here report on some technical details related to the computation of the bound state's eigenvalue spectrum in the framework of Bethe-Salpeter and Faddeev equations.

Obtaining a W state from a Greenberger-Horne-Zeilinger state via stochastic local operations and classical communication with a rate approaching unity.

PubMed

Yu, Nengkun; Guo, Cheng; Duan, Runyao

2014-04-25

We introduce a notion of the entanglement transformation rate to characterize the asymptotic comparability of two multipartite pure entangled states under stochastic local operations and classical communication (SLOCC). For two well known SLOCC inequivalent three-qubit states |GHZ⟩=(1/2)(|000⟩+|111⟩) and |W⟩=(1/3)(|100⟩+|010⟩+|001⟩), we show that the entanglement transformation rate from |GHZ⟩ to |W⟩ is exactly 1. That means that we can obtain one copy of the W state from one copy of the Greenberg-Horne-Zeilinger (GHZ) state by SLOCC, asymptotically. We then apply similar techniques to obtain a lower bound on the entanglement transformation rates from an N-partite GHZ state to a class of Dicke states, and prove the tightness of this bound for some special cases which naturally generalize the |W⟩ state. A new lower bound on the tensor rank of the matrix permanent is also obtained by evaluating the tensor rank of Dicke states.

On the computation of molecular surface correlations for protein docking using fourier techniques.

PubMed

Sakk, Eric

2007-08-01

The computation of surface correlations using a variety of molecular models has been applied to the unbound protein docking problem. Because of the computational complexity involved in examining all possible molecular orientations, the fast Fourier transform (FFT) (a fast numerical implementation of the discrete Fourier transform (DFT)) is generally applied to minimize the number of calculations. This approach is rooted in the convolution theorem which allows one to inverse transform the product of two DFTs in order to perform the correlation calculation. However, such a DFT calculation results in a cyclic or "circular" correlation which, in general, does not lead to the same result as the linear correlation desired for the docking problem. In this work, we provide computational bounds for constructing molecular models used in the molecular surface correlation problem. The derived bounds are then shown to be consistent with various intuitive guidelines previously reported in the protein docking literature. Finally, these bounds are applied to different molecular models in order to investigate their effect on the correlation calculation.

Budgeted Interactive Learning

DTIC Science & Technology

2017-06-15

the methodology of reducing the online-algorithm-selecting problem as a contextual bandit problem, which is yet another interactive learning...KH2016a] Kuan-Hao Huang and Hsuan-Tien Lin. Linear upper confidence bound algorithm for contextual bandit problem with piled rewards. In Proceedings

The Kinesin-5 Chemomechanical Cycle Is Dominated by a Two-heads-bound State*♦

PubMed Central

Mickolajczyk, Keith J.

2016-01-01

Single-molecule microscopy and stopped-flow kinetics assays were carried out to understand the microtubule polymerase activity of kinesin-5 (Eg5). Four lines of evidence argue that the motor primarily resides in a two-heads-bound (2HB) state. First, upon microtubule binding, dimeric Eg5 releases both bound ADPs. Second, microtubule dissociation in saturating ADP is 20-fold slower for the dimer than for the monomer. Third, ATP-triggered mant-ADP release is 5-fold faster than the stepping rate. Fourth, ATP binding is relatively fast when the motor is locked in a 2HB state. Shortening the neck-linker does not facilitate rear-head detachment, suggesting a minimal role for rear-head-gating. This 2HB state may enable Eg5 to stabilize incoming tubulin at the growing microtubule plus-end. The finding that slowly hydrolyzable ATP analogs trigger slower nucleotide release than ATP suggests that ATP hydrolysis in the bound head precedes stepping by the tethered head, leading to a mechanochemical cycle in which processivity is determined by the race between unbinding of the bound head and attachment of the tethered head. PMID:27402829

Volume dependence of N-body bound states

NASA Astrophysics Data System (ADS)

König, Sebastian; Lee, Dean

2018-04-01

We derive the finite-volume correction to the binding energy of an N-particle quantum bound state in a cubic periodic volume. Our results are applicable to bound states with arbitrary composition and total angular momentum, and in any number of spatial dimensions. The only assumptions are that the interactions have finite range. The finite-volume correction is a sum of contributions from all possible breakup channels. In the case where the separation is into two bound clusters, our result gives the leading volume dependence up to exponentially small corrections. If the separation is into three or more clusters, there is a power-law factor that is beyond the scope of this work, however our result again determines the leading exponential dependence. We also present two independent methods that use finite-volume data to determine asymptotic normalization coefficients. The coefficients are useful to determine low-energy capture reactions into weakly bound states relevant for nuclear astrophysics. Using the techniques introduced here, one can even extract the infinite-volume energy limit using data from a single-volume calculation. The derived relations are tested using several exactly solvable systems and numerical examples. We anticipate immediate applications to lattice calculations of hadronic, nuclear, and cold atomic systems.

Lower bounds on the violation of the monogamy inequality for quantum correlation measures

NASA Astrophysics Data System (ADS)

Kumar, Asutosh; Dhar, Himadri Shekhar

2016-06-01

In multiparty quantum systems, the monogamy inequality proposes an upper bound on the distribution of bipartite quantum correlation between a single party and each of the remaining parties in the system, in terms of the amount of quantum correlation shared by that party with the rest of the system taken as a whole. However, it is well known that not all quantum correlation measures universally satisfy the monogamy inequality. In this work, we aim at determining the nontrivial value by which the monogamy inequality can be violated by a quantum correlation measure. Using an information-theoretic complementarity relation between the normalized purity and quantum correlation in any given multiparty state, we obtain a nontrivial lower bound on the negative monogamy score for the quantum correlation measure. In particular, for the three-qubit states the lower bound is equal to the negative von Neumann entropy of the single qubit reduced density matrix. We analytically examine the tightness of the derived lower bound for certain n -qubit quantum states. Further, we report numerical results of the same for monogamy violating correlation measures using Haar uniformly generated three-qubit states.

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

Implementing and Bounding a Cascade Heuristic for Large-Scale Optimization

DTIC Science & Technology

2017-06-01

solving the monolith, we develop a method for producing lower bounds to the optimal objective function value. To do this, we solve a new integer...as developing and analyzing methods for producing lower bounds to the optimal objective function value of the seminal problem monolith, which this...length of the window decreases, the end effects of the model typically increase (Zerr, 2016). There are four primary methods for correcting end

Distributed ESO based cooperative tracking control for high-order nonlinear multiagent systems with lumped disturbance and application in multi flight simulators systems.

PubMed

Cong, Zhang

2018-03-01

Based on extended state observer, a novel and practical design method is developed to solve the distributed cooperative tracking problem of higher-order nonlinear multiagent systems with lumped disturbance in a fixed communication topology directed graph. The proposed method is designed to guarantee all the follower nodes ultimately and uniformly converge to the leader node with bounded residual errors. The leader node, modeled as a higher-order non-autonomous nonlinear system, acts as a command generator giving commands only to a small portion of the networked follower nodes. Extended state observer is used to estimate the local states and lumped disturbance of each follower node. Moreover, each distributed controller can work independently only requiring the relative states and/or the estimated relative states information between itself and its neighbors. Finally an engineering application of multi flight simulators systems is demonstrated to test and verify the effectiveness of the proposed algorithm. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Cost analysis of measles in refugees arriving at Los Angeles International Airport from Malaysia

PubMed Central

Coleman, Margaret S.; Burke, Heather M.; Welstead, Bethany L.; Mitchell, Tarissa; Taylor, Eboni M.; Shapovalov, Dmitry; Maskery, Brian A.; Joo, Heesoo; Weinberg, Michelle

2017-01-01

ABSTRACT Background On August 24, 2011, 31 US-bound refugees from Kuala Lumpur, Malaysia (KL) arrived in Los Angeles. One of them was diagnosed with measles post-arrival. He exposed others during a flight, and persons in the community while disembarking and seeking medical care. As a result, 9 cases of measles were identified. Methods We estimated costs of response to this outbreak and conducted a comparative cost analysis examining what might have happened had all US-bound refugees been vaccinated before leaving Malaysia. Results State-by-state costs differed and variously included vaccination, hospitalization, medical visits, and contact tracing with costs ranging from $621 to $35,115. The total of domestic and IOM Malaysia reported costs for US-bound refugees were $137,505 [range: $134,531 - $142,777 from a sensitivity analysis]. Had all US-bound refugees been vaccinated while in Malaysia, it would have cost approximately $19,646 and could have prevented 8 measles cases. Conclusion A vaccination program for US-bound refugees, supporting a complete vaccination for US-bound refugees, could improve refugees' health, reduce importations of vaccine-preventable diseases in the United States, and avert measles response activities and costs. PMID:28068211

Cost analysis of measles in refugees arriving at Los Angeles International Airport from Malaysia.

PubMed

Coleman, Margaret S; Burke, Heather M; Welstead, Bethany L; Mitchell, Tarissa; Taylor, Eboni M; Shapovalov, Dmitry; Maskery, Brian A; Joo, Heesoo; Weinberg, Michelle

2017-05-04

Background On August 24, 2011, 31 US-bound refugees from Kuala Lumpur, Malaysia (KL) arrived in Los Angeles. One of them was diagnosed with measles post-arrival. He exposed others during a flight, and persons in the community while disembarking and seeking medical care. As a result, 9 cases of measles were identified. Methods We estimated costs of response to this outbreak and conducted a comparative cost analysis examining what might have happened had all US-bound refugees been vaccinated before leaving Malaysia. Results State-by-state costs differed and variously included vaccination, hospitalization, medical visits, and contact tracing with costs ranging from $621 to $35,115. The total of domestic and IOM Malaysia reported costs for US-bound refugees were $137,505 [range: $134,531 - $142,777 from a sensitivity analysis]. Had all US-bound refugees been vaccinated while in Malaysia, it would have cost approximately $19,646 and could have prevented 8 measles cases. Conclusion A vaccination program for US-bound refugees, supporting a complete vaccination for US-bound refugees, could improve refugees' health, reduce importations of vaccine-preventable diseases in the United States, and avert measles response activities and costs.

A hybrid heuristic for the multiple choice multidimensional knapsack problem

NASA Astrophysics Data System (ADS)

Mansi, Raïd; Alves, Cláudio; Valério de Carvalho, J. M.; Hanafi, Saïd

2013-08-01

In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class has to be chosen. Both problems are NP-hard. However, the multiple choice multidimensional knapsack problem appears to be more difficult to solve in part because of its choice constraints. Many real applications lead to very large scale multiple choice multidimensional knapsack problems that can hardly be addressed using exact algorithms. A new hybrid heuristic is proposed that embeds several new procedures for this problem. The approach is based on the resolution of linear programming relaxations of the problem and reduced problems that are obtained by fixing some variables of the problem. The solutions of these problems are used to update the global lower and upper bounds for the optimal solution value. A new strategy for defining the reduced problems is explored, together with a new family of cuts and a reformulation procedure that is used at each iteration to improve the performance of the heuristic. An extensive set of computational experiments is reported for benchmark instances from the literature and for a large set of hard instances generated randomly. The results show that the approach outperforms other state-of-the-art methods described so far, providing the best known solution for a significant number of benchmark instances.

Fingerprints selection for topological localization

NASA Astrophysics Data System (ADS)

Popov, Vladimir

2017-07-01

Problems of visual navigation are extensively studied in contemporary robotics. In particular, we can mention different problems of visual landmarks selection, the problem of selection of a minimal set of visual landmarks, selection of partially distinguishable guards, the problem of placement of visual landmarks. In this paper, we consider one-dimensional color panoramas. Such panoramas can be used for creating fingerprints. Fingerprints give us unique identifiers for visually distinct locations by recovering statistically significant features. Fingerprints can be used as visual landmarks for the solution of various problems of mobile robot navigation. In this paper, we consider a method for automatic generation of fingerprints. In particular, we consider the bounded Post correspondence problem and applications of the problem to consensus fingerprints and topological localization. We propose an efficient approach to solve the bounded Post correspondence problem. In particular, we use an explicit reduction from the decision version of the problem to the satisfiability problem. We present the results of computational experiments for different satisfiability algorithms. In robotic experiments, we consider the average accuracy of reaching of the target point for different lengths of routes and types of fingerprints.

A capacitated vehicle routing problem with order available time in e-commerce industry

NASA Astrophysics Data System (ADS)

Liu, Ling; Li, Kunpeng; Liu, Zhixue

2017-03-01

In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.

Nucleotide Dependent Switching in Rho GTPase: Conformational Heterogeneity and Competing Molecular Interactions

PubMed Central

Kumawat, Amit; Chakrabarty, Suman; Kulkarni, Kiran

2017-01-01

Ras superfamily of GTPases regulate myriad cellular processes through a conserved nucleotide (GTP/GDP) dependent switching mechanism. Unlike Ras family of GTPases, for the Rho GTPases, there is no clear evidence for the existence of “sub-states” such as state 1 & state 2 in the GTP bound form. To explore the nucleotide dependent conformational space of the Switch I loop and also to look for existence of state 1 like conformations in Rho GTPases, atomistic molecular dynamics and metadynamics simulations on RhoA were performed. These studies demonstrate that both the nucleotide-free state and the GDP bound “OFF” state have very similar conformations, whereas the GTP bound “ON” state has unique conformations with signatures of two intermediate states. The conformational free energy landscape for these systems suggests the presence of multiple intermediate states. Interestingly, the energetic penalty of exposing the non-polar residues in the GTP bound form is counter balanced by the favourable hydrogen bonded interactions between the γ-phosphate group of GTP with the highly conserved Tyr34 and Thr37 residues. These competing molecular interactions lead to a tuneable energy landscape of the Switch I conformation, which can undergo significant changes based on the local environment including changes upon binding to effectors. PMID:28374773

Nucleotide Dependent Switching in Rho GTPase: Conformational Heterogeneity and Competing Molecular Interactions

NASA Astrophysics Data System (ADS)

Kumawat, Amit; Chakrabarty, Suman; Kulkarni, Kiran

2017-04-01

Ras superfamily of GTPases regulate myriad cellular processes through a conserved nucleotide (GTP/GDP) dependent switching mechanism. Unlike Ras family of GTPases, for the Rho GTPases, there is no clear evidence for the existence of “sub-states” such as state 1 & state 2 in the GTP bound form. To explore the nucleotide dependent conformational space of the Switch I loop and also to look for existence of state 1 like conformations in Rho GTPases, atomistic molecular dynamics and metadynamics simulations on RhoA were performed. These studies demonstrate that both the nucleotide-free state and the GDP bound “OFF” state have very similar conformations, whereas the GTP bound “ON” state has unique conformations with signatures of two intermediate states. The conformational free energy landscape for these systems suggests the presence of multiple intermediate states. Interestingly, the energetic penalty of exposing the non-polar residues in the GTP bound form is counter balanced by the favourable hydrogen bonded interactions between the γ-phosphate group of GTP with the highly conserved Tyr34 and Thr37 residues. These competing molecular interactions lead to a tuneable energy landscape of the Switch I conformation, which can undergo significant changes based on the local environment including changes upon binding to effectors.

Universal bounds on the time evolution of entanglement entropy.

PubMed

Avery, Steven G; Paulos, Miguel F

2014-12-05

Using relative entropy, we derive bounds on the time rate of change of geometric entanglement entropy for any relativistic quantum field theory in any dimension. The bounds apply to both mixed and pure states, and may be extended to curved space. We illustrate the bounds in a few examples and comment on potential applications and future extensions.

Stability of Nonlinear Systems with Unknown Time-varying Feedback Delay

NASA Astrophysics Data System (ADS)

Chunodkar, Apurva A.; Akella, Maruthi R.

2013-12-01

This paper considers the problem of stabilizing a class of nonlinear systems with unknown bounded delayed feedback wherein the time-varying delay is 1) piecewise constant 2) continuous with a bounded rate. We also consider application of these results to the stabilization of rigid-body attitude dynamics. In the first case, the time-delay in feedback is modeled specifically as a switch among an arbitrarily large set of unknown constant values with a known strict upper bound. The feedback is a linear function of the delayed states. In the case of linear systems with switched delay feedback, a new sufficiency condition for average dwell time result is presented using a complete type Lyapunov-Krasovskii (L-K) functional approach. Further, the corresponding switched system with nonlinear perturbations is proven to be exponentially stable inside a well characterized region of attraction for an appropriately chosen average dwell time. In the second case, the concept of the complete type L-K functional is extended to a class of nonlinear time-delay systems with unknown time-varying time-delay. This extension ensures stability robustness to time-delay in the control design for all values of time-delay less than the known upper bound. Model-transformation is used in order to partition the nonlinear system into a nominal linear part that is exponentially stable with a bounded perturbation. We obtain sufficient conditions which ensure exponential stability inside a region of attraction estimate. A constructive method to evaluate the sufficient conditions is presented together with comparison with the corresponding constant and piecewise constant delay. Numerical simulations are performed to illustrate the theoretical results of this paper.

Capture and decay of electroweak WIMPonium

NASA Astrophysics Data System (ADS)

Asadi, Pouya; Baumgart, Matthew; Fitzpatrick, Patrick J.; Krupczak, Emmett; Slatyer, Tracy R.

2017-02-01

The spectrum of Weakly-Interacting-Massive-Particle (WIMP) dark matter generically possesses bound states when the WIMP mass becomes sufficiently large relative to the mass of the electroweak gauge bosons. The presence of these bound states enhances the annihilation rate via resonances in the Sommerfeld enhancement, but they can also be produced directly with the emission of a low-energy photon. In this work we compute the rate for SU(2) triplet dark matter (the wino) to bind into WIMPonium—which is possible via single-photon emission for wino masses above 5 TeV for relative velocity v < O(10-2) —and study the subsequent decays of these bound states. We present results with applications beyond the wino case, e.g. for dark matter inhabiting a nonabelian dark sector; these include analytic capture and transition rates for general dark sectors in the limit of vanishing force carrier mass, efficient numerical routines for calculating positive and negative-energy eigenstates of a Hamiltonian containing interactions with both massive and massless force carriers, and a study of the scaling of bound state formation in the short-range Hulth&apos{e}n potential. In the specific case of the wino, we find that the rate for bound state formation is suppressed relative to direct annihilation, and so provides only a small correction to the overall annihilation rate. The soft photons radiated by the capture process and by bound state transitions could permit measurement of the dark matter's quantum numbers; for wino-like dark matter, such photons are rare, but might be observable by a future ground-based gamma-ray telescope combining large effective area and a low energy threshold.

Why there is something rather than nothing: cosmological constant from summing over everything in lorentzian quantum gravity.

PubMed

Barvinsky, A O

2007-08-17

The density matrix of the Universe for the microcanonical ensemble in quantum cosmology describes an equipartition in the physical phase space of the theory (sum over everything), but in terms of the observable spacetime geometry this ensemble is peaked about the set of recently obtained cosmological instantons limited to a bounded range of the cosmological constant. This suggests the mechanism of constraining the landscape of string vacua and a possible solution to the dark energy problem in the form of the quasiequilibrium decay of the microcanonical state of the Universe.

New Zealand environmental standards and energy policies

NASA Astrophysics Data System (ADS)

vant, William N.; McGlinchy, Brian J.

1983-11-01

This paper describes the primary energy resources of New Zealand and their relative importance. It describes the principal legislation that provides environmental protection and public participation with which State and private agencies are bound to comply. The paper then discusses air pollution in further detail and cites three examples where there is cause for concern. By international standards, air pollution is not a serious problem in New Zealand and so the economic consequences have received little attention Two simple examples are cited. A map showing the main centers and the location of facilities referred to in the text is included

Video Denoising via Dynamic Video Layering

NASA Astrophysics Data System (ADS)

Guo, Han; Vaswani, Namrata

2018-07-01

Video denoising refers to the problem of removing "noise" from a video sequence. Here the term "noise" is used in a broad sense to refer to any corruption or outlier or interference that is not the quantity of interest. In this work, we develop a novel approach to video denoising that is based on the idea that many noisy or corrupted videos can be split into three parts - the "low-rank layer", the "sparse layer", and a small residual (which is small and bounded). We show, using extensive experiments, that our denoising approach outperforms the state-of-the-art denoising algorithms.

SHARP ENTRYWISE PERTURBATION BOUNDS FOR MARKOV CHAINS.

PubMed

Thiede, Erik; VAN Koten, Brian; Weare, Jonathan

For many Markov chains of practical interest, the invariant distribution is extremely sensitive to perturbations of some entries of the transition matrix, but insensitive to others; we give an example of such a chain, motivated by a problem in computational statistical physics. We have derived perturbation bounds on the relative error of the invariant distribution that reveal these variations in sensitivity. Our bounds are sharp, we do not impose any structural assumptions on the transition matrix or on the perturbation, and computing the bounds has the same complexity as computing the invariant distribution or computing other bounds in the literature. Moreover, our bounds have a simple interpretation in terms of hitting times, which can be used to draw intuitive but rigorous conclusions about the sensitivity of a chain to various types of perturbations.

Object detection via eye tracking and fringe restraint

NASA Astrophysics Data System (ADS)

Pan, Fei; Zhang, Hanming; Zeng, Ying; Tong, Li; Yan, Bin

2017-07-01

Object detection is a computer vision problem which caught a large amount of attention. But the candidate boundingboxes extracted from only image features may end up with false-detection due to the semantic gap between the top-down and the bottom up information. In this paper, we propose a novel method for generating object bounding-boxes proposals using the combination of eye fixation point, saliency detection and edges. The new method obtains a fixation orientated Gaussian map, optimizes the map through single-layer cellular automata, and derives bounding-boxes from the optimized map on three levels. Then we score the boxes by combining all the information above, and choose the box with the highest score to be the final box. We perform an evaluation of our method by comparing with previous state-ofthe art approaches on the challenging POET datasets, the images of which are chosen from PASCAL VOC 2012. Our method outperforms them on small scale objects while comparable to them in general.

Bound states of dipolar bosons in one-dimensional systems

NASA Astrophysics Data System (ADS)

Volosniev, A. G.; Armstrong, J. R.; Fedorov, D. V.; Jensen, A. S.; Valiente, M.; Zinner, N. T.

2013-04-01

We consider one-dimensional tubes containing bosonic polar molecules. The long-range dipole-dipole interactions act both within a single tube and between different tubes. We consider arbitrary values of the externally aligned dipole moments with respect to the symmetry axis of the tubes. The few-body structures in this geometry are determined as a function of polarization angles and dipole strength by using both essentially exact stochastic variational methods and the harmonic approximation. The main focus is on the three-, four- and five-body problems in two or more tubes. Our results indicate that in the weakly coupled limit the intertube interaction is similar to a zero-range term with a suitable rescaled strength. This allows us to address the corresponding many-body physics of the system by constructing a model where bound chains with one molecule in each tube are the effective degrees of freedom. This model can be mapped onto one-dimensional Hamiltonians for which exact solutions are known.

Stochastic Spectral Descent for Discrete Graphical Models

DOE PAGES

Carlson, David; Hsieh, Ya-Ping; Collins, Edo; ...

2015-12-14

Interest in deep probabilistic graphical models has in-creased in recent years, due to their state-of-the-art performance on many machine learning applications. Such models are typically trained with the stochastic gradient method, which can take a significant number of iterations to converge. Since the computational cost of gradient estimation is prohibitive even for modestly sized models, training becomes slow and practically usable models are kept small. In this paper we propose a new, largely tuning-free algorithm to address this problem. Our approach derives novel majorization bounds based on the Schatten- norm. Intriguingly, the minimizers of these bounds can be interpreted asmore » gradient methods in a non-Euclidean space. We thus propose using a stochastic gradient method in non-Euclidean space. We both provide simple conditions under which our algorithm is guaranteed to converge, and demonstrate empirically that our algorithm leads to dramatically faster training and improved predictive ability compared to stochastic gradient descent for both directed and undirected graphical models.« less

Coherent control of the formation of cold heteronuclear molecules by photoassociation

NASA Astrophysics Data System (ADS)

de Lima, Emanuel F.

2017-01-01

We consider the formation of cold diatomic molecules in the electronic ground state by photoassociation of atoms of dissimilar species. A combination of two transition pathways from the free colliding pair of atoms to a bound vibrational level of the electronic molecular ground state is envisioned. The first pathway consists of a pump-dump scheme with two time-delayed laser pulses in the near-infrared frequency domain. The pump pulse drives the transition to a bound vibrational level of an excited electronic state, while the dump pulse transfers the population to a bound vibrational level of the electronic ground state. The second pathway takes advantage of the existing permanent dipole moment and employs a single pulse in the far-infrared domain to drive the transition from the unbound atoms directly to a bound vibrational level in the electronic ground state. We show that this scheme offers the possibility to coherently control the photoassociation yield by manipulating the relative phase and timing of the pulses. The photoassociation mechanism is illustrated for the formation of cold LiCs molecules.

Channel branching ratios in CH2CN- photodetachment: Rotational structure and vibrational energy redistribution in autodetachment

NASA Astrophysics Data System (ADS)

Lyle, Justin; Wedig, Olivia; Gulania, Sahil; Krylov, Anna I.; Mabbs, Richard

2017-12-01

We report photoelectron spectra of CH2CN-, recorded at photon energies between 13 460 and 15 384 cm-1, which show rapid intensity variations in particular detachment channels. The branching ratios for various spectral features reveal rotational structure associated with autodetachment from an intermediate anion state. Calculations using equation-of-motion coupled-cluster method with single and double excitations reveal the presence of two dipole-bound excited anion states (a singlet and a triplet). The computed oscillator strength for the transition to the singlet dipole-bound state provides an estimate of the autodetachment channel contribution to the total photoelectron yield. Analysis of the different spectral features allows identification of the dipole-bound and neutral vibrational levels involved in the autodetachment processes. For the most part, the autodetachment channels are consistent with the vibrational propensity rule and normal mode expectation. However, examination of the rotational structure shows that autodetachment from the ν3 (v = 1 and v = 2) levels of the dipole-bound state displays behavior counter to the normal mode expectation with the final state vibrational level belonging to a different mode.

Scalable problems and memory bounded speedup

NASA Technical Reports Server (NTRS)

Sun, Xian-He; Ni, Lionel M.

1992-01-01

In this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. The latter two consider the relationship between speedup and problem scalability. Two sets of speedup formulations are derived for these three models. One set considers uneven workload allocation and communication overhead and gives more accurate estimation. Another set considers a simplified case and provides a clear picture on the impact of the sequential portion of an application on the possible performance gain from parallel processing. The simplified fixed-size speedup is Amdahl's law. The simplified fixed-time speedup is Gustafson's scaled speedup. The simplified memory-bounded speedup contains both Amdahl's law and Gustafson's scaled speedup as special cases. This study leads to a better understanding of parallel processing.

Robustness in linear quadratic feedback design with application to an aircraft control problem

NASA Technical Reports Server (NTRS)

Patel, R. V.; Sridhar, B.; Toda, M.

1977-01-01

Some new results concerning robustness and asymptotic properties of error bounds of a linear quadratic feedback design are applied to an aircraft control problem. An autopilot for the flare control of the Augmentor Wing Jet STOL Research Aircraft (AWJSRA) is designed based on Linear Quadratic (LQ) theory and the results developed in this paper. The variation of the error bounds to changes in the weighting matrices in the LQ design is studied by computer simulations, and appropriate weighting matrices are chosen to obtain a reasonable error bound for variations in the system matrix and at the same time meet the practical constraints for the flare maneuver of the AWJSRA. Results from the computer simulation of a satisfactory autopilot design for the flare control of the AWJSRA are presented.

Precision is essential for efficient catalysis in an evolved Kemp eliminase.

PubMed

Blomberg, Rebecca; Kries, Hajo; Pinkas, Daniel M; Mittl, Peer R E; Grütter, Markus G; Privett, Heidi K; Mayo, Stephen L; Hilvert, Donald

2013-11-21

Linus Pauling established the conceptual framework for understanding and mimicking enzymes more than six decades ago. The notion that enzymes selectively stabilize the rate-limiting transition state of the catalysed reaction relative to the bound ground state reduces the problem of design to one of molecular recognition. Nevertheless, past attempts to capitalize on this idea, for example by using transition state analogues to elicit antibodies with catalytic activities, have generally failed to deliver true enzymatic rates. The advent of computational design approaches, combined with directed evolution, has provided an opportunity to revisit this problem. Starting from a computationally designed catalyst for the Kemp elimination--a well-studied model system for proton transfer from carbon--we show that an artificial enzyme can be evolved that accelerates an elementary chemical reaction 6 × 10(8)-fold, approaching the exceptional efficiency of highly optimized natural enzymes such as triosephosphate isomerase. A 1.09 Å resolution crystal structure of the evolved enzyme indicates that familiar catalytic strategies such as shape complementarity and precisely placed catalytic groups can be successfully harnessed to afford such high rate accelerations, making us optimistic about the prospects of designing more sophisticated catalysts.

Large enhancement of second harmonic generation from transition-metal dichalcogenide monolayer on grating near bound states in the continuum.

PubMed

Wang, Tiecheng; Zhang, Shihao

2018-01-08

Second harmonic generation from the two-layer structure where a transition-metal dichalcogenide monolayer is put on a one-dimensional grating has been studied. This grating supports bound states in the continuum which have no leakage lying within the continuum of radiation modes, we can enhance the second harmonic generation from the transition-metal dichalcogenide monolayer by more than four orders of magnitude based on the critical field enhancement near the bound states in the continuum. In order to complete this calculation, the scattering matrix theory has been extended to include the nonlinear effect and the scattering matrix of a two-dimensional material including nonlinear terms; furthermore, two methods to observe the bound states in the continuum are considered, where one is tuning the thickness of the grating and the other is changing the incident angle of the electromagnetic wave. We have also discussed various modulation of the second harmonic generation enhancement by adjusting the azimuthal angle of the transition-metal dichalcogenide monolayer.

Valence tautomerism in synthetic models of cytochrome P450

PubMed Central

Das, Pradip Kumar; Samanta, Subhra; McQuarters, Ashley B.; Lehnert, Nicolai

2016-01-01

CytP450s have a cysteine-bound heme cofactor that, in its as-isolated resting (oxidized) form, can be conclusively described as a ferric thiolate species. Unlike the native enzyme, most synthetic thiolate-bound ferric porphyrins are unstable in air unless the axial thiolate ligand is sterically protected. Spectroscopic investigations on a series of synthetic mimics of cytP450 indicate that a thiolate-bound ferric porphyrin coexists in organic solutions at room temperature (RT) with a thiyl-radical bound ferrous porphyrin, i.e., its valence tautomer. The ferric thiolate state is favored by greater enthalpy and is air stable. The ferrous thiyl state is favored by entropy, populates at RT, and degrades in air. These ground states can be reversibly interchanged at RT by the addition or removal of water to the apolar medium. It is concluded that hydrogen bonding and local electrostatics protect the resting oxidized cytP450 active site from degradation in air by stabilizing the ferric thiolate ground state in contrast to its synthetic analogs. PMID:27302948

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.

Generalized Friedland's theorem for C0-semigroups

NASA Astrophysics Data System (ADS)

Cichon, Dariusz; Jung, Il Bong; Stochel, Jan

2008-07-01

Friedland's characterization of bounded normal operators is shown to hold for infinitesimal generators of C0-semigroups. New criteria for normality of bounded operators are furnished in terms of Hamburger moment problem. All this is achieved with the help of the celebrated Ando's theorem on paranormal operators.

Upward Bound: In the Beginning.

ERIC Educational Resources Information Center

Groutt, John; Hill, Calvin

2001-01-01

Describes the early history of the Upward Bound program, including the role of President Johnson's vision, the Task Force on Poverty, the Office of Economic Opportunity, and Community Action Programs; influences on the development of the program; establishment of the program's administrative structure; pilot programs; and early problems leading to…

Sensational Studies in Marine Science.

ERIC Educational Resources Information Center

Keller, E. C., Jr.; Schroyer, Fred C.

1981-01-01

Presents a description of a five-week summer course in marine biology and oceanography offered to college-bound, secondary students with varied physical handicaps. Summarizes insights gained after four summer sessions related to communication problems, physical arrangements for the wheelchair-bound, and handicap-proof maps; evaluates the course's…

L1-norm kernel discriminant analysis via Bayes error bound optimization for robust feature extraction.

PubMed

Zheng, Wenming; Lin, Zhouchen; Wang, Haixian

2014-04-01

A novel discriminant analysis criterion is derived in this paper under the theoretical framework of Bayes optimality. In contrast to the conventional Fisher's discriminant criterion, the major novelty of the proposed one is the use of L1 norm rather than L2 norm, which makes it less sensitive to the outliers. With the L1-norm discriminant criterion, we propose a new linear discriminant analysis (L1-LDA) method for linear feature extraction problem. To solve the L1-LDA optimization problem, we propose an efficient iterative algorithm, in which a novel surrogate convex function is introduced such that the optimization problem in each iteration is to simply solve a convex programming problem and a close-form solution is guaranteed to this problem. Moreover, we also generalize the L1-LDA method to deal with the nonlinear robust feature extraction problems via the use of kernel trick, and hereafter proposed the L1-norm kernel discriminant analysis (L1-KDA) method. Extensive experiments on simulated and real data sets are conducted to evaluate the effectiveness of the proposed method in comparing with the state-of-the-art methods.

Thread Graphs, Linear Rank-Width and Their Algorithmic Applications

NASA Astrophysics Data System (ADS)

Ganian, Robert

The introduction of tree-width by Robertson and Seymour [7] was a breakthrough in the design of graph algorithms. A lot of research since then has focused on obtaining a width measure which would be more general and still allowed efficient algorithms for a wide range of NP-hard problems on graphs of bounded width. To this end, Oum and Seymour have proposed rank-width, which allows the solution of many such hard problems on a less restricted graph classes (see e.g. [3,4]). But what about problems which are NP-hard even on graphs of bounded tree-width or even on trees? The parameter used most often for these exceptionally hard problems is path-width, however it is extremely restrictive - for example the graphs of path-width 1 are exactly paths.

Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

PubMed

Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly

2014-01-01

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

PubMed Central

2014-01-01

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures. PMID:25610911

Effect of nonmagnetic impurities on s+/- superconductivity in the presence of incipient bands

NASA Astrophysics Data System (ADS)

Chen, Xiao; Mishra, Vivek; Maiti, Saurabh; Hirschfeld, Peter

Several Fe chalcogenide superconductors without hole pockets at the Fermi level display high temperature superconductivity, in apparent contradiction to naive spin fluctuation pairing arguments. Recently, scanning tunneling microscopy measurements have measured the influence of impurities on some of these materials, and claimed that non-magnetic impurities do not create in-gap states, leading to the conclusion that the gap must be s+ +, i.e. conventional s wave with no gap sign change. Here we present various ways sign-changing gaps can be consistent with the absence of such bound states. In particular, we calculate the bound states for an s+/- system with a hole pocket below the Fermi level, and show that the nonmagnetic impurity bound state energy generically tracks the gap edge in the system, thereby rendering it unobservable. A failure to observe a bound state in the case of a nonmagnetic impurity can therefore not be used as an argument to exclude sign-changing pairing states. XC, SM and PJH were supported by NSF-DMR-1407502. VM was supported by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory, managed by UT-Battelle, LLC, for the U. S. Department of Energy.

Short Range Photoassociation of Rb2 by a high power fiber laser

NASA Astrophysics Data System (ADS)

Passagem, Henry; Rodriguez, Ricardo; Ventura, Paulo; Bouloufa, Nadia; Dulieu, Olivier; Marcassa, Luis

2016-05-01

Photoassociation has been studied using cold trapped atomic samples for the last 20 years. Due to poor Franck-Condon overlap, a free-to-bound transition followed by spontaneous decay results in a small production of electronic ground state molecules. If the photoassociation is done at short range, deeply bound ground state molecules can be formed. Optical pumping schemes can be used to populate a single state. In our experiment, we have performed trap loss spectroscopy on trapped 85 Rb atoms in a MOT using a high power fiber laser. Our single mode fiber laser (linewidth < 1 MHz) produces about 50 W, which can be tuned in the 1060-1070 nm range. Two vibrational bound states of the 0u+ potential were observed (ν = 137 and 138). The frequency positions as well as the rotational constants of these states are in good agreement with theoretical predictions. We have also measured the lifetime of a crossed optical dipole trap using such fiber laser. The lifetime on resonance is shorter than off resonance as expected. A simple theoretical model indicates that the molecules decay to deeply bound vibrational levels in the ground state. This work was supported by Fapesp and INCT-IQ.

Andreev bound states in a semiconducting nanowire Josephson junction, Part II: Quantum jumps and Fermion parity switching

NASA Astrophysics Data System (ADS)

Hays, M.; de Lange, G.; Serniak, K.; van Woerkom, D. J.; Väyrynen, J. I.; van Heck, B.; Vool, U.; Krogstrup, P.; Nygård, J.; Frunzio, L.; Geresdi, A.; Glazman, L. I.; Devoret, M. H.

Proximitized semiconducting nanowires subject to magnetic field should display topological superconductivity and support Majorana zero modes which have non-Abelian braiding statistics. The conventional Andreev levels formed in such wires in the absence of field are a precursor to these exotic zero modes. The fermion-parity switching time of Andreev levels sets a lower bound on the bandwidth required for experiments aimed at harnessing non-Abelian braiding statistics. We demonstrate the observation of quantum jumps between even and odd-parity states of an individual Andreev bound state in a non-topological junction, providing a direct measurement of the state populations and the parity lifetime. Work supported by: ARO, ONR, AFOSR, EU Marie Curie and YINQE.

Estimating the Inertia Matrix of a Spacecraft

NASA Technical Reports Server (NTRS)

Acikmese, Behcet; Keim, Jason; Shields, Joel

2007-01-01

A paper presents a method of utilizing some flight data, aboard a spacecraft that includes reaction wheels for attitude control, to estimate the inertia matrix of the spacecraft. The required data are digitized samples of (1) the spacecraft attitude in an inertial reference frame as measured, for example, by use of a star tracker and (2) speeds of rotation of the reaction wheels, the moments of inertia of which are deemed to be known. Starting from the classical equations for conservation of angular momentum of a rigid body, the inertia-matrix-estimation problem is formulated as a constrained least-squares minimization problem with explicit bounds on the inertia matrix incorporated as linear matrix inequalities. The explicit bounds reflect physical bounds on the inertia matrix and reduce the volume of data that must be processed to obtain a solution. The resulting minimization problem is a semidefinite optimization problem that can be solved efficiently, with guaranteed convergence to the global optimum, by use of readily available algorithms. In a test case involving a model attitude platform rotating on an air bearing, it is shown that, relative to a prior method, the present method produces better estimates from few data.

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.

Invariant criteria for bound states, degree of ionization, and plasma phase transition

NASA Technical Reports Server (NTRS)

Girardeau, M. D.

1990-01-01

Basis invariant characterizations of bound states and bound fraction of a partially ionized hydrogen plasma are given in terms of properties of the spectrum of eigenvalues and eigenfunctions of the equilibrium quantum statistical one-proton-one-electron reduced density matrix. It is suggested that these can be used to place theories of a proposed plasma-ionization phase transition on a firm foundation. This general approach may be relevant to cosmological questions such as the quark deconfinement-confinement transition.

New method for taking into account finite nuclear mass in the determination of the absence of bound states: Application to e/sup +/H

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

Armour, E.A.G.

1982-06-07

It has been known since the work of Aronson, Kleinman and Spruch, and Armour that, if the proton is considered to be infinitely massive, no bound state of a system made up of a positron and a hydrogen atom can exist. In this Letter a new method is introduced for taking into account finite nuclear mass. With use of this method it is shown that the inclusion of the finite mass of the proton does not result in the appearance of a bound state. This is the first time that this result has been established.

On the Directional Dependence and Null Space Freedom in Uncertainty Bound Identification

NASA Technical Reports Server (NTRS)

Lim, K. B.; Giesy, D. P.

1997-01-01

In previous work, the determination of uncertainty models via minimum norm model validation is based on a single set of input and output measurement data. Since uncertainty bounds at each frequency is directionally dependent for multivariable systems, this will lead to optimistic uncertainty levels. In addition, the design freedom in the uncertainty model has not been utilized to further reduce uncertainty levels. The above issues are addressed by formulating a min- max problem. An analytical solution to the min-max problem is given to within a generalized eigenvalue problem, thus avoiding a direct numerical approach. This result will lead to less conservative and more realistic uncertainty models for use in robust control.

An approach to optimal semi-active control of vibration energy harvesting based on MEMS

NASA Astrophysics Data System (ADS)

Rojas, Rafael A.; Carcaterra, Antonio

2018-07-01

In this paper the energy harvesting problem involving typical MEMS technology is reduced to an optimal control problem, where the objective function is the absorption of the maximum amount of energy in a given time interval from a vibrating environment. The interest here is to identify a physical upper bound for this energy storage. The mathematical tool is a new optimal control called Krotov's method, that has not yet been applied to engineering problems, except in quantum dynamics. This approach leads to identify new maximum bounds to the energy harvesting performance. Novel MEMS-based device control configurations for vibration energy harvesting are proposed with particular emphasis to piezoelectric, electromagnetic and capacitive circuits.

A centre-free approach for resource allocation with lower bounds

NASA Astrophysics Data System (ADS)

Obando, Germán; Quijano, Nicanor; Rakoto-Ravalontsalama, Naly

2017-09-01

Since complexity and scale of systems are continuously increasing, there is a growing interest in developing distributed algorithms that are capable to address information constraints, specially for solving optimisation and decision-making problems. In this paper, we propose a novel method to solve distributed resource allocation problems that include lower bound constraints. The optimisation process is carried out by a set of agents that use a communication network to coordinate their decisions. Convergence and optimality of the method are guaranteed under some mild assumptions related to the convexity of the problem and the connectivity of the underlying graph. Finally, we compare our approach with other techniques reported in the literature, and we present some engineering applications.

Center for Quantum Algorithms and Complexity

DTIC Science & Technology

2014-05-12

precisely, it asserts that for any subset L of particles, the entanglement entropy between L and L̄ is bounded by the surface area of L (the area is...ground states of gapped local Hamiltonians. Roughly, it says that the entanglement in such states is very local, and the entanglement entropy scales...the theorem states that the entanglement entropy is bounded by exp(X), where X = log(d/?). Hastingss result implies that ground states of gapped 1D

Schmidt-number witnesses and bound entanglement

NASA Astrophysics Data System (ADS)

Sanpera, Anna; Bruß, Dagmar; Lewenstein, Maciej

2001-05-01

The Schmidt number of a mixed state characterizes the minimum Schmidt rank of the pure states needed to construct it. We investigate the Schmidt number of an arbitrary mixed state by studying Schmidt-number witnesses that detect it. We present a canonical form of such witnesses and provide constructive methods for their optimization. Finally, we present strong evidence that all bound entangled states with positive partial transpose in C3⊗C3 have Schmidt number 2.

Observed-Based Adaptive Fuzzy Tracking Control for Switched Nonlinear Systems With Dead-Zone.

PubMed

Tong, Shaocheng; Sui, Shuai; Li, Yongming

2015-12-01

In this paper, the problem of adaptive fuzzy output-feedback control is investigated for a class of uncertain switched nonlinear systems in strict-feedback form. The considered switched systems contain unknown nonlinearities, dead-zone, and immeasurable states. Fuzzy logic systems are utilized to approximate the unknown nonlinear functions, a switched fuzzy state observer is designed and thus the immeasurable states are obtained by it. By applying the adaptive backstepping design principle and the average dwell time method, an adaptive fuzzy output-feedback tracking control approach is developed. It is proved that the proposed control approach can guarantee that all the variables in the closed-loop system are bounded under a class of switching signals with average dwell time, and also that the system output can track a given reference signal as closely as possible. The simulation results are given to check the effectiveness of the proposed approach.

Neuro-adaptive backstepping control of SISO non-affine systems with unknown gain sign.

PubMed

Ramezani, Zahra; Arefi, Mohammad Mehdi; Zargarzadeh, Hassan; Jahed-Motlagh, Mohammad Reza

2016-11-01

This paper presents two neuro-adaptive controllers for a class of uncertain single-input, single-output (SISO) nonlinear non-affine systems with unknown gain sign. The first approach is state feedback controller, so that a neuro-adaptive state-feedback controller is constructed based on the backstepping technique. The second approach is an observer-based controller and K-filters are designed to estimate the system states. The proposed method relaxes a priori knowledge of control gain sign and therefore by utilizing the Nussbaum-type functions this problem is addressed. In these methods, neural networks are employed to approximate the unknown nonlinear functions. The proposed adaptive control schemes guarantee that all the closed-loop signals are semi-globally uniformly ultimately bounded (SGUUB). Finally, the theoretical results are numerically verified through simulation examples. Simulation results show the effectiveness of the proposed methods. Copyright © 2016 ISA. All rights reserved.

The Consensus Problem in Unreliable Distributed Systems (A Brief Survey).

DTIC Science & Technology

1983-06-01

they might also reach conflicting conclusions about the outcome of the election and hence fail to reach agreement. Davies and Wakerly [21 realized this...15], and part (b) was shown by Dolev and Reischuk [10]. For practical applications , these bounds are not very encouraging, especially the t+I bound on...solutions is f2(n + t2)). Theorem 7, part (b) shows this bound "best possible" for authenticated algorithms. 6. Applications of Agreement Protocols The

An interior-point method-based solver for simulation of aircraft parts riveting

NASA Astrophysics Data System (ADS)

Stefanova, Maria; Yakunin, Sergey; Petukhova, Margarita; Lupuleac, Sergey; Kokkolaras, Michael

2018-05-01

The particularities of the aircraft parts riveting process simulation necessitate the solution of a large amount of contact problems. A primal-dual interior-point method-based solver is proposed for solving such problems efficiently. The proposed method features a worst case polynomial complexity bound ? on the number of iterations, where n is the dimension of the problem and ε is a threshold related to desired accuracy. In practice, the convergence is often faster than this worst case bound, which makes the method applicable to large-scale problems. The computational challenge is solving the system of linear equations because the associated matrix is ill conditioned. To that end, the authors introduce a preconditioner and a strategy for determining effective initial guesses based on the physics of the problem. Numerical results are compared with ones obtained using the Goldfarb-Idnani algorithm. The results demonstrate the efficiency of the proposed method.

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

PubMed

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

2018-06-01

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