Experimental plug and play quantum coin flipping.

PubMed

Pappa, Anna; Jouguet, Paul; Lawson, Thomas; Chailloux, André; Legré, Matthieu; Trinkler, Patrick; Kerenidis, Iordanis; Diamanti, Eleni

2014-04-24

Performing complex cryptographic tasks will be an essential element in future quantum communication networks. These tasks are based on a handful of fundamental primitives, such as coin flipping, where two distrustful parties wish to agree on a randomly generated bit. Although it is known that quantum versions of these primitives can offer information-theoretic security advantages with respect to classical protocols, a demonstration of such an advantage in a practical communication scenario has remained elusive. Here we experimentally implement a quantum coin flipping protocol that performs strictly better than classically possible over a distance suitable for communication over metropolitan area optical networks. The implementation is based on a practical plug and play system, developed by significantly enhancing a commercial quantum key distribution device. Moreover, we provide combined quantum coin flipping protocols that are almost perfectly secure against bounded adversaries. Our results offer a useful toolbox for future secure quantum communications.

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

PubMed

Rajan, K; Deo, N

1999-09-01

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

Long-distance continuous-variable quantum key distribution using non-Gaussian state-discrimination detection

NASA Astrophysics Data System (ADS)

Liao, Qin; Guo, Ying; Huang, Duan; Huang, Peng; Zeng, Guihua

2018-02-01

We propose a long-distance continuous-variable quantum key distribution (CVQKD) with a four-state protocol using non-Gaussian state-discrimination detection. A photon subtraction operation, which is deployed at the transmitter, is used for splitting the signal required for generating the non-Gaussian operation to lengthen the maximum transmission distance of the CVQKD. Whereby an improved state-discrimination detector, which can be deemed as an optimized quantum measurement that allows the discrimination of nonorthogonal coherent states beating the standard quantum limit, is applied at the receiver to codetermine the measurement result with the conventional coherent detector. By tactfully exploiting the multiplexing technique, the resulting signals can be simultaneously transmitted through an untrusted quantum channel, and subsequently sent to the state-discrimination detector and coherent detector, respectively. Security analysis shows that the proposed scheme can lengthen the maximum transmission distance up to hundreds of kilometers. Furthermore, by taking the finite-size effect and composable security into account we obtain the tightest bound of the secure distance, which is more practical than that obtained in the asymptotic limit.

Coherence in quantum estimation

NASA Astrophysics Data System (ADS)

Giorda, Paolo; Allegra, Michele

2018-01-01

The geometry of quantum states provides a unifying framework for estimation processes based on quantum probes, and it establishes the ultimate bounds of the achievable precision. We show a relation between the statistical distance between infinitesimally close quantum states and the second order variation of the coherence of the optimal measurement basis with respect to the state of the probe. In quantum phase estimation protocols, this leads to propose coherence as the relevant resource that one has to engineer and control to optimize the estimation precision. Furthermore, the main object of the theory i.e. the symmetric logarithmic derivative, in many cases allows one to identify a proper factorization of the whole Hilbert space in two subsystems. The factorization allows one to discuss the role of coherence versus correlations in estimation protocols; to show how certain estimation processes can be completely or effectively described within a single-qubit subsystem; and to derive lower bounds for the scaling of the estimation precision with the number of probes used. We illustrate how the framework works for both noiseless and noisy estimation procedures, in particular those based on multi-qubit GHZ-states. Finally we succinctly analyze estimation protocols based on zero-temperature critical behavior. We identify the coherence that is at the heart of their efficiency, and we show how it exhibits the non-analyticities and scaling behavior proper of a large class of quantum phase transitions.

Strong and uniform convergence in the teleportation simulation of bosonic Gaussian channels

NASA Astrophysics Data System (ADS)

Wilde, Mark M.

2018-06-01

In the literature on the continuous-variable bosonic teleportation protocol due to Braunstein and Kimble [Phys. Rev. Lett. 80, 869 (1998), 10.1103/PhysRevLett.80.869], it is often loosely stated that this protocol converges to a perfect teleportation of an input state in the limit of ideal squeezing and ideal detection, but the exact form of this convergence is typically not clarified. In this paper, I explicitly clarify that the convergence is in the strong sense, and not the uniform sense, and furthermore that the convergence occurs for any input state to the protocol, including the infinite-energy Basel states defined and discussed here. I also prove, in contrast to the above result, that the teleportation simulations of pure-loss, thermal, pure-amplifier, amplifier, and additive-noise channels converge both strongly and uniformly to the original channels, in the limit of ideal squeezing and detection for the simulations. For these channels, I give explicit uniform bounds on the accuracy of their teleportation simulations. I then extend these uniform convergence results to particular multimode bosonic Gaussian channels. These convergence statements have important implications for mathematical proofs that make use of the teleportation simulation of bosonic Gaussian channels, some of which have to do with bounding their nonasymptotic secret-key-agreement capacities. As a by-product of the discussion given here, I confirm the correctness of the proof of such bounds from my joint work with Berta and Tomamichel from [Wilde, Tomamichel, and Berta, IEEE Trans. Inf. Theory 63, 1792 (2017), 10.1109/TIT.2017.2648825]. Furthermore, I show that it is not necessary to invoke the energy-constrained diamond distance in order to confirm the correctness of this proof.

Incompleteness and limit of security theory of quantum key distribution

NASA Astrophysics Data System (ADS)

Hirota, Osamu; Murakami, Dan; Kato, Kentaro; Futami, Fumio

2012-10-01

It is claimed in the many papers that a trace distance: d guarantees the universal composition security in quantum key distribution (QKD) like BB84 protocol. In this introduction paper, at first, it is explicitly explained what is the main misconception in the claim of the unconditional security for QKD theory. In general terms, the cause of the misunderstanding on the security claim is the Lemma in the paper of Renner. It suggests that the generation of the perfect random key is assured by the probability (1-d), and its failure probability is d. Thus, it concludes that the generated key provides the perfect random key sequence when the protocol is success. So the QKD provides perfect secrecy to the one time pad. This is the reason for the composition claim. However, the quantity of the trace distance (or variational distance) is not the probability for such an event. If d is not small enough, always the generated key sequence is not uniform. Now one needs the reconstruction of the evaluation of the trace distance if one wants to use it. One should first go back to the indistinguishability theory in the computational complexity based, and to clarify the meaning of the value of the variational distance. In addition, the same analysis for the information theoretic case is necessary. The recent serial papers by H.P.Yuen have given the answer on such questions. In this paper, we show more concise description of Yuen's theory, and clarify that the upper bound theories for the trace distance by Tomamichel et al and Hayashi et al are constructed by the wrong reasoning of Renner and it is unsuitable as the security analysis. Finally, we introduce a new macroscopic quantum communication to replace Q-bit QKD.

Finite-key security analysis of quantum key distribution with imperfect light sources

DOE PAGES

Mizutani, Akihiro; Curty, Marcos; Lim, Charles Ci Wen; ...

2015-09-09

In recent years, the gap between theory and practice in quantum key distribution (QKD) has been significantly narrowed, particularly for QKD systems with arbitrarily flawed optical receivers. The status for QKD systems with imperfect light sources is however less satisfactory, in the sense that the resulting secure key rates are often overly dependent on the quality of state preparation. This is especially the case when the channel loss is high. Very recently, to overcome this limitation, Tamaki et al proposed a QKD protocol based on the so-called 'rejected data analysis', and showed that its security in the limit of infinitelymore » long keys is almost independent of any encoding flaw in the qubit space, being this protocol compatible with the decoy state method. Here, as a step towards practical QKD, we show that a similar conclusion is reached in the finite-key regime, even when the intensity of the light source is unstable. More concretely, we derive security bounds for a wide class of realistic light sources and show that the bounds are also efficient in the presence of high channel loss. Our results strongly suggest the feasibility of long distance provably secure communication with imperfect light sources.« less

Nuclear Overhauser effect studies on the conformation of magnesium adenosine 5'-triphosphate bound to rabbit muscle creatine kinase

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

Rosevear, P.R.; Powers, V.M.; Dowhan, D.

1987-08-25

Nuclear Overhauser effects were used to determine interproton distances on MgATP bound to rabbit muscle creatine kinase. The internuclear distances were used in a distance geometry program that objectively determines both the conformation of the bound MgATP and its uniqueness. Two classes of structures were found that satisfied the measured interproton distances. Both classes had the same anti glycosidic torsional angle (X = 78 +/- 10/sup 0/) but differed in their ribose ring puckers (O1'-endo or C4'-exo). The uniqueness of the glycosidic torsional angle is consistent with the preference of creatine kinase for adenine nucleotides. One of these conformations ofmore » MgATP bound to creatine kinase is indistinguishable from the conformation found for Co(NH/sub 3/)/sub 4/ ATP bound to the catalytic subunit of protein kinase, which also has a high specificity for adenine nucleotides. Distance geometry calculations also suggest that upper limit distances, when low enough (less than or equal to 3.4 A), can be used instead of measured distances to define, within experimental error, the glycosidic torsional angle of bound nucleotides. However, this approach does not permit an evaluation of the ribose ring pucker.« less

Cryptography in the Bounded-Quantum-Storage Model

NASA Astrophysics Data System (ADS)

Schaffner, Christian

2007-09-01

This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is required for honest players, whereas the protocols can only be broken by an adversary controlling a large amount of quantum memory. The protocols are efficient, non-interactive and can be implemented with today's technology. On the theoretical side, new entropic uncertainty relations involving min-entropy are established and used to prove the security of protocols according to new strong security definitions. For instance, in the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers, the uncertainty relation allows to prove the security of QKD protocols while tolerating considerably higher error rates compared to the standard model with unbounded adversaries.

Protocol for Communication Networking for Formation Flying

NASA Technical Reports Server (NTRS)

Jennings, Esther; Okino, Clayton; Gao, Jay; Clare, Loren

2009-01-01

An application-layer protocol and a network architecture have been proposed for data communications among multiple autonomous spacecraft that are required to fly in a precise formation in order to perform scientific observations. The protocol could also be applied to other autonomous vehicles operating in formation, including robotic aircraft, robotic land vehicles, and robotic underwater vehicles. A group of spacecraft or other vehicles to which the protocol applies could be characterized as a precision-formation- flying (PFF) network, and each vehicle could be characterized as a node in the PFF network. In order to support precise formation flying, it would be necessary to establish a corresponding communication network, through which the vehicles could exchange position and orientation data and formation-control commands. The communication network must enable communication during early phases of a mission, when little positional knowledge is available. Particularly during early mission phases, the distances among vehicles may be so large that communication could be achieved only by relaying across multiple links. The large distances and need for omnidirectional coverage would limit communication links to operation at low bandwidth during these mission phases. Once the vehicles were in formation and distances were shorter, the communication network would be required to provide high-bandwidth, low-jitter service to support tight formation-control loops. The proposed protocol and architecture, intended to satisfy the aforementioned and other requirements, are based on a standard layered-reference-model concept. The proposed application protocol would be used in conjunction with conventional network, data-link, and physical-layer protocols. The proposed protocol includes the ubiquitous Institute of Electrical and Electronics Engineers (IEEE) 802.11 medium access control (MAC) protocol to be used in the datalink layer. In addition to its widespread and proven use in diverse local-area networks, this protocol offers both (1) a random- access mode needed for the early PFF deployment phase and (2) a time-bounded-services mode needed during PFF-maintenance operations. Switching between these two modes could be controlled by upper-layer entities using standard link-management mechanisms. Because the early deployment phase of a PFF mission can be expected to involve multihop relaying to achieve network connectivity (see figure), the proposed protocol includes the open shortest path first (OSPF) network protocol that is commonly used in the Internet. Each spacecraft in a PFF network would be in one of seven distinct states as the mission evolved from initial deployment, through coarse formation, and into precise formation. Reconfiguration of the formation to perform different scientific observations would also cause state changes among the network nodes. The application protocol provides for recognition and tracking of the seven states for each node and for protocol changes under specified conditions to adapt the network and satisfy communication requirements associated with the current PFF mission phase. Except during early deployment, when peer-to-peer random access discovery methods would be used, the application protocol provides for operation in a centralized manner.

Sensors closeness test based on an improved [0, 1] bounded Mahalanobis distance Δ{sup 2}

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

Masnan, Maz Jamilah, E-mail: mazjamilah@unimap.edu.my; Mahat, Nor Idayu, E-mail: noridayu@uum.edu.my; Shakaff, Ali Yeon Md, E-mail: aliyeon@unimap.edu.my

2015-12-11

Mahalanobis distance Δ{sup 2} values are commonly in the range of 0 to +∞ where higher values represent greater distance between class means or points. The increase in Mahalanobis distance is unbounded as the distance multiply. To certain extend, the unbounded distance values pose difficulties in the evaluation and decision for instance in the sensors closeness test. This paper proposes an approach to [0, 1] bounded Mahalanobis distance Δ{sup 2} that enable researcher to easily perform sensors closeness test. The experimental data of four different types of rice based on three different electronic nose sensors namely InSniff, PEN3, and Cyranose320more » were analyzed and sensor closeness test seems successfully performed within the [0, 1] bound.« less

Fundamental rate-loss trade-off for the quantum internet

NASA Astrophysics Data System (ADS)

Azuma, Koji; Mizutani, Akihiro; Lo, Hoi-Kwong

2016-11-01

The quantum internet holds promise for achieving quantum communication--such as quantum teleportation and quantum key distribution (QKD)--freely between any clients all over the globe, as well as for the simulation of the evolution of quantum many-body systems. The most primitive function of the quantum internet is to provide quantum entanglement or a secret key to two points efficiently, by using intermediate nodes connected by optical channels with each other. Here we derive a fundamental rate-loss trade-off for a quantum internet protocol, by generalizing the Takeoka-Guha-Wilde bound to be applicable to any network topology. This trade-off has essentially no scaling gap with the quantum communication efficiencies of protocols known to be indispensable to long-distance quantum communication, such as intercity QKD and quantum repeaters. Our result--putting a practical but general limitation on the quantum internet--enables us to grasp the potential of the future quantum internet.

Fundamental rate-loss trade-off for the quantum internet

PubMed Central

Azuma, Koji; Mizutani, Akihiro; Lo, Hoi-Kwong

2016-01-01

The quantum internet holds promise for achieving quantum communication—such as quantum teleportation and quantum key distribution (QKD)—freely between any clients all over the globe, as well as for the simulation of the evolution of quantum many-body systems. The most primitive function of the quantum internet is to provide quantum entanglement or a secret key to two points efficiently, by using intermediate nodes connected by optical channels with each other. Here we derive a fundamental rate-loss trade-off for a quantum internet protocol, by generalizing the Takeoka–Guha–Wilde bound to be applicable to any network topology. This trade-off has essentially no scaling gap with the quantum communication efficiencies of protocols known to be indispensable to long-distance quantum communication, such as intercity QKD and quantum repeaters. Our result—putting a practical but general limitation on the quantum internet—enables us to grasp the potential of the future quantum internet. PMID:27886172

Fundamental rate-loss trade-off for the quantum internet.

PubMed

Azuma, Koji; Mizutani, Akihiro; Lo, Hoi-Kwong

2016-11-25

The quantum internet holds promise for achieving quantum communication-such as quantum teleportation and quantum key distribution (QKD)-freely between any clients all over the globe, as well as for the simulation of the evolution of quantum many-body systems. The most primitive function of the quantum internet is to provide quantum entanglement or a secret key to two points efficiently, by using intermediate nodes connected by optical channels with each other. Here we derive a fundamental rate-loss trade-off for a quantum internet protocol, by generalizing the Takeoka-Guha-Wilde bound to be applicable to any network topology. This trade-off has essentially no scaling gap with the quantum communication efficiencies of protocols known to be indispensable to long-distance quantum communication, such as intercity QKD and quantum repeaters. Our result-putting a practical but general limitation on the quantum internet-enables us to grasp the potential of the future quantum internet.

Achieving unequal error protection with convolutional codes

NASA Technical Reports Server (NTRS)

Mills, D. G.; Costello, D. J., Jr.; Palazzo, R., Jr.

1994-01-01

This paper examines the unequal error protection capabilities of convolutional codes. Both time-invariant and periodically time-varying convolutional encoders are examined. The effective free distance vector is defined and is shown to be useful in determining the unequal error protection (UEP) capabilities of convolutional codes. A modified transfer function is used to determine an upper bound on the bit error probabilities for individual input bit positions in a convolutional encoder. The bound is heavily dependent on the individual effective free distance of the input bit position. A bound relating two individual effective free distances is presented. The bound is a useful tool in determining the maximum possible disparity in individual effective free distances of encoders of specified rate and memory distribution. The unequal error protection capabilities of convolutional encoders of several rates and memory distributions are determined and discussed.

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

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

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

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

The Impact of World Knowledge on the Processing of Mandarin Possessive Reflexive "Zijide"

ERIC Educational Resources Information Center

Li, Rui; Zhang, Zhiyi; Ni, Chuanbin

2017-01-01

It has long been considered that the Mandarin possessive reflexive "zijide" can be either locally bound or long distance bound, leading to ambiguity where it fails to exclusively refer back to either long distance binding NP or the local NP. In addition to syntactic factors such as the local versus long distance division, the present…

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.

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.

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.

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.

The shock formation distance in a bounded sound beam of finite amplitude.

PubMed

Tao, Chao; Ma, Jian; Zhu, Zhemin; Du, Gonghuan; Ping, Zihong

2003-07-01

This paper investigates the shock formation distance in a bounded sound beam of finite amplitude by solving the Khokhlov-Zabolotskaya-Kuznetsov (KZK) equation using frequency-domain numerical method. Simulation results reveal that, besides the nonlinearity and absorption, the diffraction is another important factor that affects the shock formation of a bounded sound beam. More detailed discussions of the shock formation in a bounded sound beam, such as the waveform of sound pressure and the spatial distribution of shock formation, are also presented and compared for different parameters.

Performance bounds on parallel self-initiating discrete-event

NASA Technical Reports Server (NTRS)

Nicol, David M.

1990-01-01

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

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

A Movement Account of Long-Distance Reflexives

ERIC Educational Resources Information Center

McKeown, Rebecca Katherine

2013-01-01

This thesis examines reflexive pronouns, such as Icelandic "sig" (Cf. Thrainsson 2007), which may be bound from outside of an infinitive clause (which I call MD "medium distance" binding) in addition to being bound locally. I propose that such reflexives are linked to their antecedents via sisterhood followed by movement: the…

Model Checking A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2012-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV) for a subset of digraphs. Modeling challenges of the protocol and the system are addressed. The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period.

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.

Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way postprocessing.

PubMed

Scarani, Valerio; Renner, Renato

2008-05-23

We derive a bound for the security of quantum key distribution with finite resources under one-way postprocessing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols such as Bennett-Brassard 1984 and six-states protocol. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N approximately 10(5) signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained using the exponential de Finetti theorem, but the additional overhead leads to very pessimistic estimates.

Efficient Measurement of Quantum Gate Error by Interleaved Randomized Benchmarking

NASA Astrophysics Data System (ADS)

Magesan, Easwar; Gambetta, Jay M.; Johnson, B. R.; Ryan, Colm A.; Chow, Jerry M.; Merkel, Seth T.; da Silva, Marcus P.; Keefe, George A.; Rothwell, Mary B.; Ohki, Thomas A.; Ketchen, Mark B.; Steffen, M.

2012-08-01

We describe a scalable experimental protocol for estimating the average error of individual quantum computational gates. This protocol consists of interleaving random Clifford gates between the gate of interest and provides an estimate as well as theoretical bounds for the average error of the gate under test, so long as the average noise variation over all Clifford gates is small. This technique takes into account both state preparation and measurement errors and is scalable in the number of qubits. We apply this protocol to a superconducting qubit system and find a bounded average error of 0.003 [0,0.016] for the single-qubit gates Xπ/2 and Yπ/2. These bounded values provide better estimates of the average error than those extracted via quantum process tomography.

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

PubMed

Wang, Xiang-Bin

2005-06-17

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

Editing wild points in isolation - Fast agreement for reliable systems (Preliminary version)

NASA Technical Reports Server (NTRS)

Kearns, Phil; Evans, Carol

1989-01-01

Consideration is given to the intuitively appealing notion of discarding sensor values which are strongly suspected of being erroneous in a modified approximate agreement protocol. Approximate agreement with editing imposes a time bound upon the convergence of the protocol - no such bound was possible for the original approximate agreement protocol. This new approach is potentially useful in the construction of asynchronous fault tolerant systems. The main result is that a wild-point replacement technique called t-worst editing can be shown to guarantee convergence of the approximate agreement protocol to a valid agreement value. Results are presented for a four-processor synchronous system in which a single processor may be faulty.

Project Hermes 'Use of Smartphones for Receiving Telemetry and Commanding a Satellite'

NASA Technical Reports Server (NTRS)

Maharaja, Rishabh (Principal Investigator)

2016-01-01

TCPIP protocols can be applied for satellite command, control, and data transfer. Project Hermes was an experiment set-up to test the use of the TCPIP protocol for communicating with a space bound payload. The idea was successfully demonstrated on high altitude balloon flights and on a sub-orbital sounding rocket launched from NASAs Wallops Flight Facility. TCPIP protocols can be applied for satellite command, control, and data transfer. Project Hermes was an experiment set-up to test the use of the TCPIP protocol for communicating with a space bound payload. The idea was successfully demonstrated on high altitude balloon flights and on a sub-orbital sounding rocket launched from NASAs Wallops Flight Facility.

IMHRP: Improved Multi-Hop Routing Protocol for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Huang, Jianhua; Ruan, Danwei; Hong, Yadong; Zhao, Ziming; Zheng, Hong

2017-10-01

Wireless sensor network (WSN) is a self-organizing system formed by a large number of low-cost sensor nodes through wireless communication. Sensor nodes collect environmental information and transmit it to the base station (BS). Sensor nodes usually have very limited battery energy. The batteries cannot be charged or replaced. Therefore, it is necessary to design an energy efficient routing protocol to maximize the network lifetime. This paper presents an improved multi-hop routing protocol (IMHRP) for homogeneous networks. In the IMHRP protocol, based on the distances to the BS, the CH nodes are divided into internal CH nodes and external CH nodes. The set-up phase of the protocol is based on the LEACH protocol and the minimum distance between CH nodes are limited to a special constant distance, so a more uniform distribution of CH nodes is achieved. In the steady-state phase, the routes of different CH nodes are created on the basis of the distances between the CH nodes. The energy efficiency of communication can be maximized. The simulation results show that the proposed algorithm can more effectively reduce the energy consumption of each round and prolong the network lifetime compared with LEACH protocol and MHT protocol.

Turning Around along the Cosmic Web

NASA Astrophysics Data System (ADS)

Lee, Jounghun; Yepes, Gustavo

2016-12-01

A bound violation designates a case in which the turnaround radius of a bound object exceeds the upper limit imposed by the spherical collapse model based on the standard ΛCDM paradigm. Given that the turnaround radius of a bound object is a stochastic quantity and that the spherical model overly simplifies the true gravitational collapse, which actually proceeds anisotropically along the cosmic web, the rarity of the occurrence of a bound violation may depend on the web environment. Assuming a Planck cosmology, we numerically construct the bound-zone peculiar velocity profiles along the cosmic web (filaments and sheets) around the isolated groups with virial mass {M}{{v}}≥slant 3× {10}13 {h}-1 {M}⊙ identified in the Small MultiDark Planck simulations and determine the radial distances at which their peculiar velocities equal the Hubble expansion speed as the turnaround radii of the groups. It is found that although the average turnaround radii of the isolated groups are well below the spherical bound limit on all mass scales, the bound violations are not forbidden for individual groups, and the cosmic web has an effect of reducing the rarity of the occurrence of a bound violation. Explaining that the spherical bound limit on the turnaround radius in fact represents the threshold distance up to which the intervention of the external gravitational field in the bound-zone peculiar velocity profiles around the nonisolated groups stays negligible, we discuss the possibility of using the threshold distance scale to constrain locally the equation of state of dark energy.

Calculating Reuse Distance from Source Code

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

Narayanan, Sri Hari Krishna; Hovland, Paul

The efficient use of a system is of paramount importance in high-performance computing. Applications need to be engineered for future systems even before the architecture of such a system is clearly known. Static performance analysis that generates performance bounds is one way to approach the task of understanding application behavior. Performance bounds provide an upper limit on the performance of an application on a given architecture. Predicting cache hierarchy behavior and accesses to main memory is a requirement for accurate performance bounds. This work presents our static reuse distance algorithm to generate reuse distance histograms. We then use these histogramsmore » to predict cache miss rates. Experimental results for kernels studied show that the approach is accurate.« less

Proof-of-principle experiment of reference-frame-independent quantum key distribution with phase coding

PubMed Central

Liang, Wen-Ye; Wang, Shuang; Li, Hong-Wei; Yin, Zhen-Qiang; Chen, Wei; Yao, Yao; Huang, Jing-Zheng; Guo, Guang-Can; Han, Zheng-Fu

2014-01-01

We have demonstrated a proof-of-principle experiment of reference-frame-independent phase coding quantum key distribution (RFI-QKD) over an 80-km optical fiber. After considering the finite-key bound, we still achieve a distance of 50 km. In this scenario, the phases of the basis states are related by a slowly time-varying transformation. Furthermore, we developed and realized a new decoy state method for RFI-QKD systems with weak coherent sources to counteract the photon-number-splitting attack. With the help of a reference-frame-independent protocol and a Michelson interferometer with Faraday rotator mirrors, our system is rendered immune to the slow phase changes of the interferometer and the polarization disturbances of the channel, making the procedure very robust. PMID:24402550

Communication complexity and information complexity

NASA Astrophysics Data System (ADS)

Pankratov, Denis

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

Irreducible normalizer operators and thresholds for degenerate quantum codes with sublinear distances

NASA Astrophysics Data System (ADS)

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

2015-03-01

We construct a lower (existence) bound for the threshold of scalable quantum computation which is applicable to all stabilizer codes, including degenerate quantum codes with sublinear distance scaling. The threshold is based on enumerating irreducible operators in the normalizer of the code, i.e., those that cannot be decomposed into a product of two such operators with non-overlapping support. For quantum LDPC codes with logarithmic or power-law distances, we get threshold values which are parametrically better than the existing analytical bound based on percolation. The new bound also gives a finite threshold when applied to other families of degenerate quantum codes, e.g., the concatenated codes. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.

A distance limited method for sampling downed coarse woody debris

Treesearch

Jeffrey H. Gove; Mark J. Ducey; Harry T. Valentine; Michael S. Williams

2012-01-01

A new sampling method for down coarse woody debris is proposed based on limiting the perpendicular distance from individual pieces to a randomly chosen sample point. Two approaches are presented that allow different protocols to be used to determine field measurements; estimators for each protocol are also developed. Both protocols are compared via simulation against...

Quantifying non-Gaussianity for quantum information

NASA Astrophysics Data System (ADS)

Genoni, Marco G.; Paris, Matteo G. A.

2010-11-01

We address the quantification of non-Gaussianity (nG) of states and operations in continuous-variable systems and its use in quantum information. We start by illustrating in detail the properties and the relationships of two recently proposed measures of nG based on the Hilbert-Schmidt distance and the quantum relative entropy (QRE) between the state under examination and a reference Gaussian state. We then evaluate the non-Gaussianities of several families of non-Gaussian quantum states and show that the two measures have the same basic properties and also share the same qualitative behavior in most of the examples taken into account. However, we also show that they introduce a different relation of order; that is, they are not strictly monotone to each other. We exploit the nG measures for states in order to introduce a measure of nG for quantum operations, to assess Gaussification and de-Gaussification protocols, and to investigate in detail the role played by nG in entanglement-distillation protocols. Besides, we exploit the QRE-based nG measure to provide different insight on the extremality of Gaussian states for some entropic quantities such as conditional entropy, mutual information, and the Holevo bound. We also deal with parameter estimation and present a theorem connecting the QRE nG to the quantum Fisher information. Finally, since evaluation of the QRE nG measure requires the knowledge of the full density matrix, we derive some experimentally friendly lower bounds to nG for some classes of states and by considering the possibility of performing on the states only certain efficient or inefficient measurements.

A novel quantum solution to secure two-party distance computation

NASA Astrophysics Data System (ADS)

Peng, Zhen-wan; Shi, Run-hua; Wang, Pan-hong; Zhang, Shun

2018-06-01

Secure Two-Party Distance Computation is an important primitive of Secure Multiparty Computational Geometry that it involves two parties, where each party has a private point, and the two parties want to jointly compute the distance between their points without revealing anything about their respective private information. Secure Two-Party Distance Computation has very important and potential applications in settings of high secure requirements, such as privacy-preserving Determination of Spatial Location-Relation, Determination of Polygons Similarity, and so on. In this paper, we present a quantum protocol for Secure Two-Party Distance Computation by using QKD-based Quantum Private Query. The security of the protocol is based on the physical principles of quantum mechanics, instead of difficulty assumptions, and therefore, it can ensure higher security than the classical related protocols.

Excessive distribution of quantum entanglement

NASA Astrophysics Data System (ADS)

Zuppardo, Margherita; Krisnanda, Tanjung; Paterek, Tomasz; Bandyopadhyay, Somshubhro; Banerjee, Anindita; Deb, Prasenjit; Halder, Saronath; Modi, Kavan; Paternostro, Mauro

2016-01-01

We classify entanglement distribution protocols based on whether or not entanglement gain is observed with respect to communicated and initial entanglement. We call a protocol nonexcessive if the gain of entanglement is bounded by the communicated entanglement and excessive if it violates this bound. We present examples of excessive protocols that achieve significant gain, independently of the presence of the initial and (or) communicated entanglement. We show that, for certain entanglement measures, excessive entanglement distribution is possible even with pure states, which sheds light on the possibility of formulating a unifying approach to quantifiers of quantum correlations. We point out a "catalytic" effect, where a protocol is turned into an excessive one by sending an intermediate particle (which does not change the initial entanglement) in advance of the designated carrier. Finally, we analyze the protocols in noisy scenarios and show that, under suitable conditions, excessive distribution may be the only way to achieve entanglement gain.

Achieving the Holevo bound via a bisection decoding protocol

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

Rosati, Matteo; Giovannetti, Vittorio

2016-06-15

We present a new decoding protocol to realize transmission of classical information through a quantum channel at asymptotically maximum capacity, achieving the Holevo bound and thus the optimal communication rate. At variance with previous proposals, our scheme recovers the message bit by bit, making use of a series of “yes-no” measurements, organized in bisection fashion, thus determining which codeword was sent in log{sub 2} N steps, N being the number of codewords.

Security of a semi-quantum protocol where reflections contribute to the secret key

NASA Astrophysics Data System (ADS)

Krawec, Walter O.

2016-05-01

In this paper, we provide a proof of unconditional security for a semi-quantum key distribution protocol introduced in a previous work. This particular protocol demonstrated the possibility of using X basis states to contribute to the raw key of the two users (as opposed to using only direct measurement results) even though a semi-quantum participant cannot directly manipulate such states. In this work, we provide a complete proof of security by deriving a lower bound of the protocol's key rate in the asymptotic scenario. Using this bound, we are able to find an error threshold value such that for all error rates less than this threshold, it is guaranteed that A and B may distill a secure secret key; for error rates larger than this threshold, A and B should abort. We demonstrate that this error threshold compares favorably to several fully quantum protocols. We also comment on some interesting observations about the behavior of this protocol under certain noise scenarios.

On the Miller-Tucker-Zemlin Based Formulations for the Distance Constrained Vehicle Routing Problems

NASA Astrophysics Data System (ADS)

Kara, Imdat

2010-11-01

Vehicle Routing Problem (VRP), is an extension of the well known Traveling Salesman Problem (TSP) and has many practical applications in the fields of distribution and logistics. When the VRP consists of distance based constraints it is called Distance Constrained Vehicle Routing Problem (DVRP). However, the literature addressing on the DVRP is scarce. In this paper, existing two-indexed integer programming formulations, having Miller-Tucker-Zemlin based subtour elimination constraints, are reviewed. Existing formulations are simplified and obtained formulation is presented as formulation F1. It is shown that, the distance bounding constraints of the formulation F1, may not generate the distance traveled up to the related node. To do this, we redefine the auxiliary variables of the formulation and propose second formulation F2 with new and easy to use distance bounding constraints. Adaptation of the second formulation to the cases where new restrictions such as minimal distance traveled by each vehicle or other objectives such as minimizing the longest distance traveled is discussed.

Distance geometry protocol to generate conformations of natural products to structurally interpret ion mobility-mass spectrometry collision cross sections.

PubMed

Stow, Sarah M; Goodwin, Cody R; Kliman, Michal; Bachmann, Brian O; McLean, John A; Lybrand, Terry P

2014-12-04

Ion mobility-mass spectrometry (IM-MS) allows the separation of ionized molecules based on their charge-to-surface area (IM) and mass-to-charge ratio (MS), respectively. The IM drift time data that is obtained is used to calculate the ion-neutral collision cross section (CCS) of the ionized molecule with the neutral drift gas, which is directly related to the ion conformation and hence molecular size and shape. Studying the conformational landscape of these ionized molecules computationally provides interpretation to delineate the potential structures that these CCS values could represent, or conversely, structural motifs not consistent with the IM data. A challenge in the IM-MS community is the ability to rapidly compute conformations to interpret natural product data, a class of molecules exhibiting a broad range of biological activity. The diversity of biological activity is, in part, related to the unique structural characteristics often observed for natural products. Contemporary approaches to structurally interpret IM-MS data for peptides and proteins typically utilize molecular dynamics (MD) simulations to sample conformational space. However, MD calculations are computationally expensive, they require a force field that accurately describes the molecule of interest, and there is no simple metric that indicates when sufficient conformational sampling has been achieved. Distance geometry is a computationally inexpensive approach that creates conformations based on sampling different pairwise distances between the atoms within the molecule and therefore does not require a force field. Progressively larger distance bounds can be used in distance geometry calculations, providing in principle a strategy to assess when all plausible conformations have been sampled. Our results suggest that distance geometry is a computationally efficient and potentially superior strategy for conformational analysis of natural products to interpret gas-phase CCS data.

Distance Geometry Protocol to Generate Conformations of Natural Products to Structurally Interpret Ion Mobility-Mass Spectrometry Collision Cross Sections

PubMed Central

2015-01-01

Ion mobility-mass spectrometry (IM-MS) allows the separation of ionized molecules based on their charge-to-surface area (IM) and mass-to-charge ratio (MS), respectively. The IM drift time data that is obtained is used to calculate the ion-neutral collision cross section (CCS) of the ionized molecule with the neutral drift gas, which is directly related to the ion conformation and hence molecular size and shape. Studying the conformational landscape of these ionized molecules computationally provides interpretation to delineate the potential structures that these CCS values could represent, or conversely, structural motifs not consistent with the IM data. A challenge in the IM-MS community is the ability to rapidly compute conformations to interpret natural product data, a class of molecules exhibiting a broad range of biological activity. The diversity of biological activity is, in part, related to the unique structural characteristics often observed for natural products. Contemporary approaches to structurally interpret IM-MS data for peptides and proteins typically utilize molecular dynamics (MD) simulations to sample conformational space. However, MD calculations are computationally expensive, they require a force field that accurately describes the molecule of interest, and there is no simple metric that indicates when sufficient conformational sampling has been achieved. Distance geometry is a computationally inexpensive approach that creates conformations based on sampling different pairwise distances between the atoms within the molecule and therefore does not require a force field. Progressively larger distance bounds can be used in distance geometry calculations, providing in principle a strategy to assess when all plausible conformations have been sampled. Our results suggest that distance geometry is a computationally efficient and potentially superior strategy for conformational analysis of natural products to interpret gas-phase CCS data. PMID:25360896

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

NASA Technical Reports Server (NTRS)

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

1977-01-01

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

Continuous variable quantum key distribution: finite-key analysis of composable security against coherent attacks.

PubMed

Furrer, F; Franz, T; Berta, M; Leverrier, A; Scholz, V B; Tomamichel, M; Werner, R F

2012-09-07

We provide a security analysis for continuous variable quantum key distribution protocols based on the transmission of two-mode squeezed vacuum states measured via homodyne detection. We employ a version of the entropic uncertainty relation for smooth entropies to give a lower bound on the number of secret bits which can be extracted from a finite number of runs of the protocol. This bound is valid under general coherent attacks, and gives rise to keys which are composably secure. For comparison, we also give a lower bound valid under the assumption of collective attacks. For both scenarios, we find positive key rates using experimental parameters reachable today.

Quantifying the nonlocality of Greenberger-Horne-Zeilinger quantum correlations by a bounded communication simulation protocol.

PubMed

Branciard, Cyril; Gisin, Nicolas

2011-07-08

The simulation of quantum correlations with finite nonlocal resources, such as classical communication, gives a natural way to quantify their nonlocality. While multipartite nonlocal correlations appear to be useful resources, very little is known on how to simulate multipartite quantum correlations. We present a protocol that reproduces tripartite Greenberger-Horne-Zeilinger correlations with bounded communication: 3 bits in total turn out to be sufficient to simulate all equatorial Von Neumann measurements on the tripartite Greenberger-Horne-Zeilinger state.

Optimal approach to quantum communication using dynamic programming.

PubMed

Jiang, Liang; Taylor, Jacob M; Khaneja, Navin; Lukin, Mikhail D

2007-10-30

Reliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished by noisy channels (such as optical fibers) that generally result in exponential attenuation of quantum signals at large distances. A special class of quantum error correction protocols, quantum repeater protocols, can be used to overcome such losses. In this work, we introduce a method for systematically optimizing existing protocols and developing more efficient protocols. Our approach makes use of a dynamic programming-based searching algorithm, the complexity of which scales only polynomially with the communication distance, letting us efficiently determine near-optimal solutions. We find significant improvements in both the speed and the final-state fidelity for preparing long-distance entangled states.

Distance-Based and Low Energy Adaptive Clustering Protocol for Wireless Sensor Networks

PubMed Central

Gani, Abdullah; Anisi, Mohammad Hossein; Ab Hamid, Siti Hafizah; Akhunzada, Adnan; Khan, Muhammad Khurram

2016-01-01

A wireless sensor network (WSN) comprises small sensor nodes with limited energy capabilities. The power constraints of WSNs necessitate efficient energy utilization to extend the overall network lifetime of these networks. We propose a distance-based and low-energy adaptive clustering (DISCPLN) protocol to streamline the green issue of efficient energy utilization in WSNs. We also enhance our proposed protocol into the multi-hop-DISCPLN protocol to increase the lifetime of the network in terms of high throughput with minimum delay time and packet loss. We also propose the mobile-DISCPLN protocol to maintain the stability of the network. The modelling and comparison of these protocols with their corresponding benchmarks exhibit promising results. PMID:27658194

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

NASA Astrophysics Data System (ADS)

Sakurai, Yuko; Yokoo, Makoto

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

Quantum error correction of continuous-variable states against Gaussian noise

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

Ralph, T. C.

2011-08-15

We describe a continuous-variable error correction protocol that can correct the Gaussian noise induced by linear loss on Gaussian states. The protocol can be implemented using linear optics and photon counting. We explore the theoretical bounds of the protocol as well as the expected performance given current knowledge and technology.

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

PubMed

Pei, Lidan; Pan, Xiangfeng

2018-01-01

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

Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation.

PubMed

Leverrier, Anthony; Grangier, Philippe

2009-05-08

We present a continuous-variable quantum key distribution protocol combining a discrete modulation and reverse reconciliation. This protocol is proven unconditionally secure and allows the distribution of secret keys over long distances, thanks to a reverse reconciliation scheme efficient at very low signal-to-noise ratio.

Distributed Synchronization Control of Multiagent Systems With Unknown Nonlinearities.

PubMed

Su, Shize; Lin, Zongli; Garcia, Alfredo

2016-01-01

This paper revisits the distributed adaptive control problem for synchronization of multiagent systems where the dynamics of the agents are nonlinear, nonidentical, unknown, and subject to external disturbances. Two communication topologies, represented, respectively, by a fixed strongly-connected directed graph and by a switching connected undirected graph, are considered. Under both of these communication topologies, we use distributed neural networks to approximate the uncertain dynamics. Decentralized adaptive control protocols are then constructed to solve the cooperative tracker problem, the problem of synchronization of all follower agents to a leader agent. In particular, we show that, under the proposed decentralized control protocols, the synchronization errors are ultimately bounded, and their ultimate bounds can be reduced arbitrarily by choosing the control parameter appropriately. Simulation study verifies the effectiveness of our proposed protocols.

Optimal and secure measurement protocols for quantum sensor networks

NASA Astrophysics Data System (ADS)

Eldredge, Zachary; Foss-Feig, Michael; Gross, Jonathan A.; Rolston, S. L.; Gorshkov, Alexey V.

2018-04-01

Studies of quantum metrology have shown that the use of many-body entangled states can lead to an enhancement in sensitivity when compared with unentangled states. In this paper, we quantify the metrological advantage of entanglement in a setting where the measured quantity is a linear function of parameters individually coupled to each qubit. We first generalize the Heisenberg limit to the measurement of nonlocal observables in a quantum network, deriving a bound based on the multiparameter quantum Fisher information. We then propose measurement protocols that can make use of Greenberger-Horne-Zeilinger (GHZ) states or spin-squeezed states and show that in the case of GHZ states the protocol is optimal, i.e., it saturates our bound. We also identify nanoscale magnetic resonance imaging as a promising setting for this technology.

Age differences in change-of-direction performance and its subelements in female football players.

PubMed

Hirose, Norikazu; Nakahori, Chikako

2015-05-01

To describe cross-sectional age differences in change-of-direction performance (CODp) in female football players and investigate the relationship between CODp and linear-sprint speed, muscle power, and body size. A sample of 135 well-trained female football players was divided into 8 age groups. Anthropometry (height, body mass, and lean body mass) and athletic performance (10-m sprint speed, 10-m×5-CODp, and 5-step bounding distance) were compared to determine interage differences using ANOVA. Then, the participants were divided into 3 age groups: 12- to 14-y-olds, 15- to 17-y-olds, and ≥18 y-olds. Simple- and multiple-regression analyses were conducted to determine the correlation between CODp and the other measurement variables in each age group. Age-related differences were found for CODp (F=10.41, P<.01), sprint speed (F=3.27, P<.01), and bounding distance (F=4.20, P<.01). Post hoc analysis revealed that the CODp of 17-y-old players was faster than that of 16-y-old players (P<.01), with no interage differences in sprint speed and bounding distance. Sprint speed and bounding distance were weakly correlated with CODp in 15- to ≥18-y-old players, but only sprint speed was correlated with CODp in 12- to 14-y-old players. CODp improves from 16 to 17 y of age in female players. Linear-sprint speed, muscle power, and body size were weakly correlated with the age differences in CODp.

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.

Institutional Politics: The Rhetoric of the Upward Bound (Interacting Successfully in Corporate Culture).

ERIC Educational Resources Information Center

Southard, Sherry G.

Protocol involves the behavior and procedures that are proper in any discourse community, including both what is spoken or written as well as what is not spoken or written. Students need to understand what proper protocol in corporate culture involves, how it is determined by formal and informal structures, and why such protocol is important. They…

Contraction coefficients for noisy quantum channels

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

Hiai, Fumio, E-mail: hiai.fumio@gmail.com; Ruskai, Mary Beth, E-mail: ruskai@member.ams.org

Generalized relative entropy, monotone Riemannian metrics, geodesic distance, and trace distance are all known to decrease under the action of quantum channels. We give some new bounds on, and relationships between, the maximal contraction for these quantities.

Aggregating quantum repeaters for the quantum internet

NASA Astrophysics Data System (ADS)

Azuma, Koji; Kato, Go

2017-09-01

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

Backscattering measurement of 6He on 209Bi: Critical interaction distance

NASA Astrophysics Data System (ADS)

Guimarães, V.; Kolata, J. J.; Aguilera, E. F.; Howard, A.; Roberts, A.; Becchetti, F. D.; Torres-Isea, R. O.; Riggins, A.; Febrarro, M.; Scarduelli, V.; de Faria, P. N.; Monteiro, D. S.; Huiza, J. F. P.; Arazi, A.; Hinnefeld, J.; Moro, A. M.; Rossi, E. S.; Morcelle, V.; Barioni, A.

2016-06-01

An elastic backscattering experiment has been performed at energies below the Coulomb barrier to investigate static and dynamic effects in the interaction of 6He with 209Bi. The measured cross sections are presented in terms of the d σ /d σR u t h ratio, as a function of the distance of closest approach on a Rutherford trajectory. The data are compared with a three-body CDCC calculation and good agreement is observed. In addition, the critical distance of interaction was extracted. A larger value was obtained for the exotic 6He nucleus as compared with the weakly bound 6Li and 9Be nuclei and the tightly bound 4He12C, and 16O nuclei.

A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This paper presents a self-stabilizing distributed clock synchronization protocol in the absence of faults in the system. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. We present an outline of a deductive proof of the correctness of the protocol. A bounded model of the protocol was mechanically verified for a variety of topologies. Results of the mechanical proof of the correctness of the protocol are provided. The model checking results have verified the correctness of the protocol as they apply to the networks with unidirectional and bidirectional links. In addition, the results confirm the claims of determinism and linear convergence. As a result, we conjecture that the protocol solves the general case of this problem. We also present several variations of the protocol and discuss that this synchronization protocol is indeed an emergent system.

Deterministic and unambiguous dense coding

NASA Astrophysics Data System (ADS)

Wu, Shengjun; Cohen, Scott M.; Sun, Yuqing; Griffiths, Robert B.

2006-04-01

Optimal dense coding using a partially-entangled pure state of Schmidt rank Dmacr and a noiseless quantum channel of dimension D is studied both in the deterministic case where at most Ld messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability τx ) Bob knows for sure that Alice sent message x , and when it fails (probability 1-τx ) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For Dmacr ⩽D a bound is obtained for Ld in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes [Phys. Rev. A71, 012311 (2005)]. For Dmacr >D it is shown that Ld is strictly less than D2 unless Dmacr is an integer multiple of D , in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for Dmacr ⩽D , assuming τx>0 for a set of Dmacr D messages, and a bound is obtained for the average ⟨1/τ⟩ . A bound on the average ⟨τ⟩ requires an additional assumption of encoding by isometries (unitaries when Dmacr =D ) that are orthogonal for different messages. Both bounds are saturated when τx is a constant independent of x , by a protocol based on one-shot entanglement concentration. For Dmacr >D it is shown that (at least) D2 messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.

Counterfactual Quantum Deterministic Key Distribution

NASA Astrophysics Data System (ADS)

Zhang, Sheng; Wang, Jian; Tang, Chao-Jing

2013-01-01

We propose a new counterfactual quantum cryptography protocol concerning about distributing a deterministic key. By adding a controlled blocking operation module to the original protocol [T.G. Noh, Phys. Rev. Lett. 103 (2009) 230501], the correlation between the polarizations of the two parties, Alice and Bob, is extended, therefore, one can distribute both deterministic keys and random ones using our protocol. We have also given a simple proof of the security of our protocol using the technique we ever applied to the original protocol. Most importantly, our analysis produces a bound tighter than the existing ones.

Loosely-Bound Diatomic Molecules.

ERIC Educational Resources Information Center

Balfour, W. J.

1979-01-01

Discusses concept of covalent bonding as related to homonuclear diatomic molecules. Article draws attention to the existence of bound rare gas and alkaline earth diatomic molecules. Summarizes their molecular parameters and offers spectroscopic data. Strength and variation with distance of interatomic attractive forces is given. (Author/SA)

A novel quantum scheme for secure two-party distance computation

NASA Astrophysics Data System (ADS)

Peng, Zhen-wan; Shi, Run-hua; Zhong, Hong; Cui, Jie; Zhang, Shun

2017-12-01

Secure multiparty computational geometry is an essential field of secure multiparty computation, which computes a computation geometric problem without revealing any private information of each party. Secure two-party distance computation is a primitive of secure multiparty computational geometry, which computes the distance between two points without revealing each point's location information (i.e., coordinate). Secure two-party distance computation has potential applications with high secure requirements in military, business, engineering and so on. In this paper, we present a quantum solution to secure two-party distance computation by subtly using quantum private query. Compared to the classical related protocols, our quantum protocol can ensure higher security and better privacy protection because of the physical principle of quantum mechanics.

Error control techniques for satellite and space communications

NASA Technical Reports Server (NTRS)

Costello, Daniel J., Jr.

1990-01-01

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

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.

Neural Decoding and "Inner" Psychophysics: A Distance-to-Bound Approach for Linking Mind, Brain, and Behavior.

PubMed

Ritchie, J Brendan; Carlson, Thomas A

2016-01-01

A fundamental challenge for cognitive neuroscience is characterizing how the primitives of psychological theory are neurally implemented. Attempts to meet this challenge are a manifestation of what Fechner called "inner" psychophysics: the theory of the precise mapping between mental quantities and the brain. In his own time, inner psychophysics remained an unrealized ambition for Fechner. We suggest that, today, multivariate pattern analysis (MVPA), or neural "decoding," methods provide a promising starting point for developing an inner psychophysics. A cornerstone of these methods are simple linear classifiers applied to neural activity in high-dimensional activation spaces. We describe an approach to inner psychophysics based on the shared architecture of linear classifiers and observers under decision boundary models such as signal detection theory. Under this approach, distance from a decision boundary through activation space, as estimated by linear classifiers, can be used to predict reaction time in accordance with signal detection theory, and distance-to-bound models of reaction time. Our "neural distance-to-bound" approach is potentially quite general, and simple to implement. Furthermore, our recent work on visual object recognition suggests it is empirically viable. We believe the approach constitutes an important step along the path to an inner psychophysics that links mind, brain, and behavior.

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.

A Framework for Bounding Nonlocality of State Discrimination

NASA Astrophysics Data System (ADS)

Childs, Andrew M.; Leung, Debbie; Mančinska, Laura; Ozols, Maris

2013-11-01

We consider the class of protocols that can be implemented by local quantum operations and classical communication (LOCC) between two parties. In particular, we focus on the task of discriminating a known set of quantum states by LOCC. Building on the work in the paper Quantum nonlocality without entanglement (Bennett et al., Phys Rev A 59:1070-1091, 1999), we provide a framework for bounding the amount of nonlocality in a given set of bipartite quantum states in terms of a lower bound on the probability of error in any LOCC discrimination protocol. We apply our framework to an orthonormal product basis known as the domino states and obtain an alternative and simplified proof that quantifies its nonlocality. We generalize this result for similar bases in larger dimensions, as well as the “rotated” domino states, resolving a long-standing open question (Bennett et al., Phys Rev A 59:1070-1091, 1999).

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

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

NASA Astrophysics Data System (ADS)

Kaur, Eneet; Wilde, Mark M.

2017-12-01

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

Efficient quantum repeater with respect to both entanglement-concentration rate and complexity of local operations and classical communication

NASA Astrophysics Data System (ADS)

Su, Zhaofeng; Guan, Ji; Li, Lvzhou

2018-01-01

Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, in practice, it is difficult to distribute quantum entanglement over a long distance, due to the absorption and noise in quantum channels. A solution to this challenge is a quantum repeater, which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place with respect to time efficiency. Motivated by this observation, we consider a basic quantum repeater scheme that focuses on not only the optimal rate of entanglement concentration but also the complexity of local operations and classical communication. First, we consider the case where two different two-qubit pure states are initially distributed in the scenario. We construct a protocol with the optimal entanglement-concentration rate and less consumption of local operations and classical communication. We also find a criterion for the projective measurements to achieve the optimal probability of creating a maximally entangled state between the two ends. Second, we consider the case in which two general pure states are prepared and general measurements are allowed. We get an upper bound on the probability for a successful measurement operation to produce a maximally entangled state without any further local operations.

Fully Integrated Passive UHF RFID Tag for Hash-Based Mutual Authentication Protocol.

PubMed

Mikami, Shugo; Watanabe, Dai; Li, Yang; Sakiyama, Kazuo

2015-01-01

Passive radio-frequency identification (RFID) tag has been used in many applications. While the RFID market is expected to grow, concerns about security and privacy of the RFID tag should be overcome for the future use. To overcome these issues, privacy-preserving authentication protocols based on cryptographic algorithms have been designed. However, to the best of our knowledge, evaluation of the whole tag, which includes an antenna, an analog front end, and a digital processing block, that runs authentication protocols has not been studied. In this paper, we present an implementation and evaluation of a fully integrated passive UHF RFID tag that runs a privacy-preserving mutual authentication protocol based on a hash function. We design a single chip including the analog front end and the digital processing block. We select a lightweight hash function supporting 80-bit security strength and a standard hash function supporting 128-bit security strength. We show that when the lightweight hash function is used, the tag completes the protocol with a reader-tag distance of 10 cm. Similarly, when the standard hash function is used, the tag completes the protocol with the distance of 8.5 cm. We discuss the impact of the peak power consumption of the tag on the distance of the tag due to the hash function.

Numerical simulation of the optimal two-mode attacks for two-way continuous-variable quantum cryptography in reverse reconciliation

NASA Astrophysics Data System (ADS)

Zhang, Yichen; Li, Zhengyu; Zhao, Yijia; Yu, Song; Guo, Hong

2017-02-01

We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against one specific attack model, the expression of secret key rates of the two-way protocol are derived against all accessible attack models. It is found that there is an optimal two-mode attack to minimize the performance of the protocol in terms of both secret key rates and maximal transmission distances. We identify the optimal two-mode attack, give the specific attack model of the optimal two-mode attack and show the performance of the two-way protocol against the optimal two-mode attack. Even under the optimal two-mode attack, the performances of two-way protocol are still better than the corresponding one-way protocol, which shows the advantage of making double use of the quantum channel and the potential of long-distance secure communication using a two-way protocol.

Secret key distillation from shielded two-qubit states

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

Bae, Joonwoo

The quantum states corresponding to a secret key are characterized using the so-called private states, where the key part consisting of a secret key is shielded by the additional systems. Based on the construction, it was shown that a secret key can be distilled from bound entangled states. In this work, I consider the shielded two-qubit states in a key-distillation scenario and derive the conditions under which a secret key can be distilled using the recurrence protocol or the two-way classical distillation, advantage distillation together with one-way postprocessing. From the security conditions, it is shown that a secret key canmore » be distilled from bound entangled states in a much wider range. In addition, I consider the case that in which white noise is added to quantum states and show that the classical distillation protocol still works despite a certain amount of noise although the recurrence protocol does not.« less

Estimating earthquake location and magnitude from seismic intensity data

USGS Publications Warehouse

Bakun, W.H.; Wentworth, C.M.

1997-01-01

Analysis of Modified Mercalli intensity (MMI) observations for a training set of 22 California earthquakes suggests a strategy for bounding the epicentral region and moment magnitude M from MMI observations only. We define an intensity magnitude MI that is calibrated to be equal in the mean to M. MI = mean (Mi), where Mi = (MMIi + 3.29 + 0.0206 * ??i)/1.68 and ??i is the epicentral distance (km) of observation MMIi. The epicentral region is bounded by contours of rms [MI] = rms (MI - Mi) - rms0 (MI - Mi-), where rms is the root mean square, rms0 (MI - Mi) is the minimum rms over a grid of assumed epicenters, and empirical site corrections and a distance weighting function are used. Empirical contour values for bounding the epicenter location and empirical bounds for M estimated from MI appropriate for different levels of confidence and different quantities of intensity observations are tabulated. The epicentral region bounds and MI obtained for an independent test set of western California earthquakes are consistent with the instrumental epicenters and moment magnitudes of these earthquakes. The analysis strategy is particularly appropriate for the evaluation of pre-1900 earthquakes for which the only available data are a sparse set of intensity observations.

SURBAL: computerized metes and bounds surveying

Treesearch

Roger N. Baughman; James H. Patric

1970-01-01

A computer program has been developed at West Virginia University for use in metes and bounds surveying. Stations, slope distances, slope angles, and bearings are primary information needed for this program. Other information needed may include magnetic deviation, acceptable closure error, desired map scale, and title designation. SURBAL prints out latitudes and...

Squeezed-state quantum key distribution with a Rindler observer

NASA Astrophysics Data System (ADS)

Zhou, Jian; Shi, Ronghua; Guo, Ying

2018-03-01

Lengthening the maximum transmission distance of quantum key distribution plays a vital role in quantum information processing. In this paper, we propose a directional squeezed-state protocol with signals detected by a Rindler observer in the relativistic quantum field framework. We derive an analytical solution to the transmission problem of squeezed states from the inertial sender to the accelerated receiver. The variance of the involved signal mode is closer to optimality than that of the coherent-state-based protocol. Simulation results show that the proposed protocol has better performance than the coherent-state counterpart especially in terms of the maximal transmission distance.

A distance of 133-137 parsecs to the Pleiades star cluster.

PubMed

Pan, Xiaopei; Shao, M; Kulkarni, S R

2004-01-22

Nearby 'open' clusters of stars (those that are not gravitationally bound) have played a crucial role in the development of stellar astronomy because, as a consequence of the stars having a common age, they provide excellent natural laboratories to test theoretical stellar models. Clusters also play a fundamental part in determining distance scales. The satellite Hipparcos surprisingly found that an extensively studied open cluster--the Pleiades (also known as the Seven Sisters)--had a distance of D = 118 +/- 4 pc (refs 2, 3), about ten per cent smaller than the accepted value. The discrepancy generated a spirited debate because the implication was that either current stellar models were incorrect by a surprising amount or Hipparcos was giving incorrect distances. Here we report the orbital parameters of the bright double star Atlas in the Pleiades, using long-baseline optical/infrared interferometry. From the data we derive a firm lower bound of D > 127 pc, with the most likely range being 133 < D < 137 pc. Our result reaffirms the fidelity of current stellar models.

A Security Proof of Measurement Device Independent Quantum Key Distribution: From the View of Information Theory

NASA Astrophysics Data System (ADS)

Li, Fang-Yi; Yin, Zhen-Qiang; Li, Hong-Wei; Chen, Wei; Wang, Shuang; Wen, Hao; Zhao, Yi-Bo; Han, Zheng-Fu

2014-07-01

Although some ideal quantum key distribution protocols have been proved to be secure, there have been some demonstrations that practical quantum key distribution implementations were hacked due to some real-life imperfections. Among these attacks, detector side channel attacks may be the most serious. Recently, a measurement device independent quantum key distribution protocol [Phys. Rev. Lett. 108 (2012) 130503] was proposed and all detector side channel attacks are removed in this scheme. Here a new security proof based on quantum information theory is given. The eavesdropper's information of the sifted key bits is bounded. Then with this bound, the final secure key bit rate can be obtained.

Achieving the physical limits of the bounded-storage model

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

Mandayam, Prabha; Wehner, Stephanie; Centre for Quantum Technologies, National University of Singapore, 2 Science Drive 3, 117543 Singapore

2011-02-15

Secure two-party cryptography is possible if the adversary's quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the protocol. This special case is known as the bounded-storage model, and it has long been an open question whether security can still be achieved if the adversary's storage were any larger. Here, we answer this question positively and demonstrate a two-party protocol which is secure as long as the adversary cannot store even a small fraction of the transmitted pulses. We also show that security canmore » be extended to a larger class of noisy quantum memories.« less

Performance Improvement in Geographic Routing for Vehicular Ad Hoc Networks

PubMed Central

Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D. K.; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

2014-01-01

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed. PMID:25429415

Performance improvement in geographic routing for Vehicular Ad Hoc Networks.

PubMed

Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D K; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

2014-11-25

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed.

A Unified Fault-Tolerance Protocol

NASA Technical Reports Server (NTRS)

Miner, Paul; Gedser, Alfons; Pike, Lee; Maddalon, Jeffrey

2004-01-01

Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Wakerly protocol, the unified protocol, and its proof of correctness. We prove that it satisfies validity and agreement properties for communication of exact values. We then introduce bounded communication error into the model. Inexact communication is inherent for clock synchronization protocols. We prove that validity and agreement properties hold for inexact communication, and that exact communication is a special case. As a running example, we illustrate the unified protocol using the SPIDER family of fault-tolerant architectures. In particular we demonstrate that the SPIDER interactive consistency, distributed diagnosis, and clock synchronization protocols are instances of the unified protocol.

Dynamic Studies of Struve Double Stars: STF4 and STF 236AB Appear Gravitationally Bound

NASA Astrophysics Data System (ADS)

Wiley, E. O.; Rica, F. M.

2015-01-01

Dynamics of two Struve double stars, WDS 00099+0827 (STF 4) and WDS 02556+2652 (STF 326 AB) are analyzed using astrometric criteria to determine their natures as gravitationally bound or unbound systems. If gravitationally bound, then observed relative velocity will be within limits according to the orbital energy conservation equation. Full implementation of this criterion was possible because the relative radial velocities as well as proper motions have been estimated. Other physical parameters were taken from literature or estimated using published protocols. Monte Carlo analysis indicates that both pairs have a high probability of being gravitationally bound and thus are long-period binaries.

Accessible Buildings for People with Walking and Reaching Limitations.

ERIC Educational Resources Information Center

Steinfeld, Edward; And Others

Research was reviewed and conducted regarding the accessibility of buildings for physically disabled persons. Data was produced regarding anthropometrics (eye level and reach limits for ambulant, semiambulant, and wheelchair bound persons); wheelchair maneuvers; speed and distance (maximum travel distances for people with limitations of stamina);…

Fully Integrated Passive UHF RFID Tag for Hash-Based Mutual Authentication Protocol

PubMed Central

Mikami, Shugo; Watanabe, Dai; Li, Yang; Sakiyama, Kazuo

2015-01-01

Passive radio-frequency identification (RFID) tag has been used in many applications. While the RFID market is expected to grow, concerns about security and privacy of the RFID tag should be overcome for the future use. To overcome these issues, privacy-preserving authentication protocols based on cryptographic algorithms have been designed. However, to the best of our knowledge, evaluation of the whole tag, which includes an antenna, an analog front end, and a digital processing block, that runs authentication protocols has not been studied. In this paper, we present an implementation and evaluation of a fully integrated passive UHF RFID tag that runs a privacy-preserving mutual authentication protocol based on a hash function. We design a single chip including the analog front end and the digital processing block. We select a lightweight hash function supporting 80-bit security strength and a standard hash function supporting 128-bit security strength. We show that when the lightweight hash function is used, the tag completes the protocol with a reader-tag distance of 10 cm. Similarly, when the standard hash function is used, the tag completes the protocol with the distance of 8.5 cm. We discuss the impact of the peak power consumption of the tag on the distance of the tag due to the hash function. PMID:26491714

Continuous variable quantum key distribution with modulated entangled states.

PubMed

Madsen, Lars S; Usenko, Vladyslav C; Lassen, Mikael; Filip, Radim; Andersen, Ulrik L

2012-01-01

Quantum key distribution enables two remote parties to grow a shared key, which they can use for unconditionally secure communication over a certain distance. The maximal distance depends on the loss and the excess noise of the connecting quantum channel. Several quantum key distribution schemes based on coherent states and continuous variable measurements are resilient to high loss in the channel, but are strongly affected by small amounts of channel excess noise. Here we propose and experimentally address a continuous variable quantum key distribution protocol that uses modulated fragile entangled states of light to greatly enhance the robustness to channel noise. We experimentally demonstrate that the resulting quantum key distribution protocol can tolerate more noise than the benchmark set by the ideal continuous variable coherent state protocol. Our scheme represents a very promising avenue for extending the distance for which secure communication is possible.

Improvement of two-way continuous-variable quantum key distribution with virtual photon subtraction

NASA Astrophysics Data System (ADS)

Zhao, Yijia; Zhang, Yichen; Li, Zhengyu; Yu, Song; Guo, Hong

2017-08-01

We propose a method to improve the performance of two-way continuous-variable quantum key distribution protocol by virtual photon subtraction. The virtual photon subtraction implemented via non-Gaussian post-selection not only enhances the entanglement of two-mode squeezed vacuum state but also has advantages in simplifying physical operation and promoting efficiency. In two-way protocol, virtual photon subtraction could be applied on two sources independently. Numerical simulations show that the optimal performance of renovated two-way protocol is obtained with photon subtraction only used by Alice. The transmission distance and tolerable excess noise are improved by using the virtual photon subtraction with appropriate parameters. Moreover, the tolerable excess noise maintains a high value with the increase in distance so that the robustness of two-way continuous-variable quantum key distribution system is significantly improved, especially at long transmission distance.

Necessary detection efficiencies for secure quantum key distribution and bound randomness

NASA Astrophysics Data System (ADS)

Acín, Antonio; Cavalcanti, Daniel; Passaro, Elsa; Pironio, Stefano; Skrzypczyk, Paul

2016-01-01

In recent years, several hacking attacks have broken the security of quantum cryptography implementations by exploiting the presence of losses and the ability of the eavesdropper to tune detection efficiencies. We present a simple attack of this form that applies to any protocol in which the key is constructed from the results of untrusted measurements performed on particles coming from an insecure source or channel. Because of its generality, the attack applies to a large class of protocols, from standard prepare-and-measure to device-independent schemes. Our attack gives bounds on the critical detection efficiencies necessary for secure quantum key distribution, which show that the implementation of most partly device-independent solutions is, from the point of view of detection efficiency, almost as demanding as fully device-independent ones. We also show how our attack implies the existence of a form of bound randomness, namely nonlocal correlations in which a nonsignalling eavesdropper can find out a posteriori the result of any implemented measurement.

Security of a single-state semi-quantum key distribution protocol

NASA Astrophysics Data System (ADS)

Zhang, Wei; Qiu, Daowen; Mateus, Paulo

2018-06-01

Semi-quantum key distribution protocols are allowed to set up a secure secret key between two users. Compared with their full quantum counterparts, one of the two users is restricted to perform some "classical" or "semi-quantum" operations, which potentially makes them easily realizable by using less quantum resource. However, the semi-quantum key distribution protocols mainly rely on a two-way quantum channel. The eavesdropper has two opportunities to intercept the quantum states transmitted in the quantum communication stage. It may allow the eavesdropper to get more information and make the security analysis more complicated. In the past ten years, many semi-quantum key distribution protocols have been proposed and proved to be robust. However, there are few works concerning their unconditional security. It is doubted that how secure the semi-quantum ones are and how much noise they can tolerate to establish a secure secret key. In this paper, we prove the unconditional security of a single-state semi-quantum key distribution protocol proposed by Zou et al. (Phys Rev A 79:052312, 2009). We present a complete proof from information theory aspect by deriving a lower bound of the protocol's key rate in the asymptotic scenario. Using this bound, we figure out an error threshold value such that for all error rates that are less than this threshold value, the secure secret key can be established between the legitimate users definitely. Otherwise, the users should abort the protocol. We make an illustration of the protocol under the circumstance that the reverse quantum channel is a depolarizing one with parameter q. Additionally, we compare the error threshold value with some full quantum protocols and several existing semi-quantum ones whose unconditional security proofs have been provided recently.

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

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.

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.

On Alarm Protocol in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Cichoń, Jacek; Kapelko, Rafał; Lemiesz, Jakub; Zawada, Marcin

We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication channel. The problem arise in tasks that sensors have to quickly inform the target user about an alert situation such as presence of fire, dangerous radiation, seismic vibrations, and more. In this paper, we present a protocol which uses O(logn) time slots and show that Ω(logn/loglogn) is a lower bound for used time slots.

Optimized tomography of continuous variable systems using excitation counting

NASA Astrophysics Data System (ADS)

Shen, Chao; Heeres, Reinier W.; Reinhold, Philip; Jiang, Luyao; Liu, Yi-Kai; Schoelkopf, Robert J.; Jiang, Liang

2016-11-01

We propose a systematic procedure to optimize quantum state tomography protocols for continuous variable systems based on excitation counting preceded by a displacement operation. Compared with conventional tomography based on Husimi or Wigner function measurement, the excitation counting approach can significantly reduce the number of measurement settings. We investigate both informational completeness and robustness, and provide a bound of reconstruction error involving the condition number of the sensing map. We also identify the measurement settings that optimize this error bound, and demonstrate that the improved reconstruction robustness can lead to an order-of-magnitude reduction of estimation error with given resources. This optimization procedure is general and can incorporate prior information of the unknown state to further simplify the protocol.

Measurement of eye lens dose for Varian On-Board Imaging with different cone-beam computed tomography acquisition techniques

PubMed Central

Deshpande, Sudesh; Dhote, Deepak; Thakur, Kalpna; Pawar, Amol; Kumar, Rajesh; Kumar, Munish; Kulkarni, M. S.; Sharma, S. D.; Kannan, V.

2016-01-01

The objective of this work was to measure patient eye lens dose for different cone-beam computed tomography (CBCT) acquisition protocols of Varian's On-Board Imaging (OBI) system using optically stimulated luminescence dosimeter (OSLD) and to study the variation in eye lens dose with patient geometry and distance of isocenter to the eye lens. During the experimental measurements, OSLD was placed on the patient between the eyebrows of both eyes in line of nose during CBCT image acquisition to measure eye lens doses. The eye lens dose measurements were carried out for three different cone-beam acquisition protocols (standard dose head, low-dose head [LDH], and high-quality head [HQH]) of Varian OBI. Measured doses were correlated with patient geometry and distance between isocenter and eye lens. Measured eye lens doses for standard head and HQH protocols were in the range of 1.8–3.2 mGy and 4.5–9.9 mGy, respectively. However, the measured eye lens dose for the LDH protocol was in the range of 0.3–0.7 mGy. The measured data indicate that eye lens dose to patient depends on the selected imaging protocol. It was also observed that eye lens dose does not depend on patient geometry but strongly depends on distance between eye lens and treatment field isocenter. However, undoubted advantages of imaging system should not be counterbalanced by inappropriate selection of imaging protocol, especially for very intense imaging protocol. PMID:27651564

Correction of spin diffusion during iterative automated NOE assignment

NASA Astrophysics Data System (ADS)

Linge, Jens P.; Habeck, Michael; Rieping, Wolfgang; Nilges, Michael

2004-04-01

Indirect magnetization transfer increases the observed nuclear Overhauser enhancement (NOE) between two protons in many cases, leading to an underestimation of target distances. Wider distance bounds are necessary to account for this error. However, this leads to a loss of information and may reduce the quality of the structures generated from the inter-proton distances. Although several methods for spin diffusion correction have been published, they are often not employed to derive distance restraints. This prompted us to write a user-friendly and CPU-efficient method to correct for spin diffusion that is fully integrated in our program ambiguous restraints for iterative assignment (ARIA). ARIA thus allows automated iterative NOE assignment and structure calculation with spin diffusion corrected distances. The method relies on numerical integration of the coupled differential equations which govern relaxation by matrix squaring and sparse matrix techniques. We derive a correction factor for the distance restraints from calculated NOE volumes and inter-proton distances. To evaluate the impact of our spin diffusion correction, we tested the new calibration process extensively with data from the Pleckstrin homology (PH) domain of Mus musculus β-spectrin. By comparing structures refined with and without spin diffusion correction, we show that spin diffusion corrected distance restraints give rise to structures of higher quality (notably fewer NOE violations and a more regular Ramachandran map). Furthermore, spin diffusion correction permits the use of tighter error bounds which improves the distinction between signal and noise in an automated NOE assignment scheme.

An optimized framework for quantitative magnetization transfer imaging of the cervical spinal cord in vivo

PubMed Central

Grussu, Francesco; Ianus, Andrada; Schneider, Torben; Prados, Ferran; Fairney, James; Ourselin, Sebastien; Alexander, Daniel C.; Cercignani, Mara; Gandini Wheeler‐Kingshott, Claudia A.M.; Samson, Rebecca S.

2017-01-01

Purpose To develop a framework to fully characterize quantitative magnetization transfer indices in the human cervical cord in vivo within a clinically feasible time. Methods A dedicated spinal cord imaging protocol for quantitative magnetization transfer was developed using a reduced field‐of‐view approach with echo planar imaging (EPI) readout. Sequence parameters were optimized based in the Cramer‐Rao‐lower bound. Quantitative model parameters (i.e., bound pool fraction, free and bound pool transverse relaxation times [ T2F, T2B], and forward exchange rate [k FB]) were estimated implementing a numerical model capable of dealing with the novelties of the sequence adopted. The framework was tested on five healthy subjects. Results Cramer‐Rao‐lower bound minimization produces optimal sampling schemes without requiring the establishment of a steady‐state MT effect. The proposed framework allows quantitative voxel‐wise estimation of model parameters at the resolution typically used for spinal cord imaging (i.e. 0.75 × 0.75 × 5 mm3), with a protocol duration of ∼35 min. Quantitative magnetization transfer parametric maps agree with literature values. Whole‐cord mean values are: bound pool fraction = 0.11(±0.01), T2F = 46.5(±1.6) ms, T2B = 11.0(±0.2) µs, and k FB = 1.95(±0.06) Hz. Protocol optimization has a beneficial effect on reproducibility, especially for T2B and k FB. Conclusion The framework developed enables robust characterization of spinal cord microstructure in vivo using qMT. Magn Reson Med 79:2576–2588, 2018. © 2017 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited. PMID:28921614

Electron transfer flavoprotein domain II orientation monitored using double electron-electron resonance between an enzymatically reduced, native FAD cofactor, and spin labels

PubMed Central

Swanson, Michael A; Kathirvelu, Velavan; Majtan, Tomas; Frerman, Frank E; Eaton, Gareth R; Eaton, Sandra S

2011-01-01

Human electron transfer flavoprotein (ETF) is a soluble mitochondrial heterodimeric flavoprotein that links fatty acid β-oxidation to the main respiratory chain. The crystal structure of human ETF bound to medium chain acyl-CoA dehydrogenase indicates that the flavin adenine dinucleotide (FAD) domain (αII) is mobile, which permits more rapid electron transfer with donors and acceptors by providing closer access to the flavin and allows ETF to accept electrons from at least 10 different flavoprotein dehydrogenases. Sequence homology is high and low-angle X-ray scattering is identical for Paracoccus denitrificans (P. denitrificans) and human ETF. To characterize the orientations of the αII domain of P. denitrificans ETF, distances between enzymatically reduced FAD and spin labels in the three structural domains were measured by double electron-electron resonance (DEER) at X- and Q-bands. An FAD to spin label distance of 2.8 ± 0.15 nm for the label in the FAD-containing αII domain (A210C) agreed with estimates from the crystal structure (3.0 nm), molecular dynamics simulations (2.7 nm), and rotamer library analysis (2.8 nm). Distances between the reduced FAD and labels in αI (A43C) were between 4.0 and 4.5 ± 0.35 nm and for βIII (A111C) the distance was 4.3 ± 0.15 nm. These values were intermediate between estimates from the crystal structure of P. denitrificans ETF and a homology model based on substrate-bound human ETF. These distances suggest that the αII domain adopts orientations in solution that are intermediate between those which are observed in the crystal structures of free ETF (closed) and ETF bound to a dehydrogenase (open). PMID:21308847

Effect of Cultural Distance on Translation of Culture-Bound Texts

ERIC Educational Resources Information Center

Rafieyan, Vahid

2016-01-01

Sociolinguistic and sociocultural features of the source language can be ideally transferred to the target language when the translator's cultural background knowledge has a high overlap with the source language culture. This signifies the crucial role of national cultural distance from the source language society in the quality of translation of…

Investigation of the binding of a carbohydrate-mimetic peptide to its complementary anticarbohydrate antibody by STD-NMR spectroscopy and molecular-dynamics simulations.

PubMed

Szczepina, Monica G; Bleile, Dustin W; Pinto, B Mario

2011-10-04

Saturation transfer difference (STD)-NMR spectroscopy was used to probe experimentally the bioactive solution conformation of the carbohydrate mimic MDWNMHAA 1 of the O-polysaccharide of Shigella flexneri Y when bound to its complementary antibody, mAb SYA/J6. Molecular dynamics simulations using the ZymeCAD™ Molecular Dynamics platform were also undertaken to give a more accurate picture of the conformational flexibility and the possibilities for bound ligand conformations. The ligand topology, or the dynamic epitope, was mapped with the CORCEMA-ST (COmplete Relaxation and Conformational Exchange Matrix Analysis of Saturation Transfer) program that calculates a total matrix analysis of relaxation and exchange effects to generate predicted STD-NMR intensities from simulation. The comparison of these predicted STD enhancements with experimental data was used to select a representative binding mode. A protocol that employed theoretical STD effects calculated at snapshots during the entire course of a molecular dynamics (MD) trajectory of the peptide bound to the Fv portion of the antibody, and not the averaged atomic positions of receptor-ligand complexes, was also examined. In addition, the R factor was calculated on the basis of STD (fit) to avoid T1 bias, and an effective R factor, R(eff), was defined such that if the calculated STD (fit) for proton k was within error of the experimental STD (fit) for proton k, then that calculated STD (fit) for proton k was not included in the calculation of the R factor. This protocol was effective in deriving the antibody-bound solution conformation of the peptide which also differed from the bound conformation determined by X-ray crystallography; however, several discrepancies between experimental and calculated STD (fit) values were observed. The bound conformation was therefore further refined with a simulated annealing refinement protocol known as STD-NMR intensity-restrained CORCEMA optimization (SICO) to give a more accurate representation of the bound peptide epitope. Further optimization was required in this case, but a satisfactory correlation between experimental and calculated STD values was obtained. Attempts were also made to obtain STD enhancements with a synthetic pentasaccharide hapten, corresponding to the O-polysaccharide, while bound to the antibody. However, unfavorable kinetics of binding in this system prevented sufficient STD build-up, which, in turn, hindered a rigorous analysis via full STD build-up curves. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Generation of distributed W-states over long distances

NASA Astrophysics Data System (ADS)

Li, Yi

2017-08-01

Ultra-secure quantum communication between distant locations requires distributed entangled states between nodes. Various methodologies have been proposed to tackle this technological challenge, of which the so-called DLCZ protocol is the most promising and widely adopted scheme. This paper aims to extend this well-known protocol to a multi-node setting where the entangled W-state is generated between nodes over long distances. The generation of multipartite W-states is the foundation of quantum networks, paving the way for quantum communication and distributed quantum computation.

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

PubMed Central

2012-01-01

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

Analytical Measurement of Discrete Hydrogen Sulfide Pools in Biological Specimens

PubMed Central

Shen, Xinggui; Peter, Elvis A.; Bir, Shyamal; Wang, Rui; Kevil, Christopher G.

2015-01-01

Hydrogen sulfide (H2S) is a ubiquitous gaseous signaling molecule that plays a vital role in numerous cellular functions and has become the focus of many research endeavors including pharmaco-therapeutic manipulation. Amongst the challenges facing the field is the accurate measurement of biologically active H2S. We have recently reported that the typically used methylene blue method and its associated results are invalid and do not measure bonafide H2S. The complexity of analytical H2S measurement reflects the fact that hydrogen sulfide is a volatile gas and exists in the body in different forms, including a free form, an acid labile pool and as bound sulfane sulfur. Here we describe a new protocol to discretely measure specific H2S pools using the monobromobimane method coupled with RP-HPLC. This new protocol involves selective liberation, trapping and derivatization of H2S. Acid-labile H2S is released by incubating the sample in an acidic solution (pH 2.6) of 100 mM phosphate buffer with 0.1 mM DTPA, in an enclosed system to contain volatilized H2S. Volatilized H2S is then trapped in 100 mM Tris-HCl (pH 9.5, 0.1 mM DTPA) and then reacted with excess monobromobimane. In a separate aliquot, the contribution of bound sulfane sulfur pool was measured by incubating the sample with 1 mM TCEP (Tris(2-carboxyethyl)phosphine hydrochloride), a reducing agent to reduce disulfide bonds, in 100 mM phosphate buffer (pH 2.6, 0.1 mM DTPA), and H2S measurement performed in an analogous manner to the one described above. The acid labile pool was determined by subtracting the free hydrogen sulfide value from the value obtained by the acid liberation protocol. The bound sulfane sulfur pool was determined by subtracting the H2S measurement from the acid liberation protocol alone compared to that of TCEP plus acidic conditions. In summary, our new method protocol allows very sensitive and accurate measurement of the three primary biological pools of H2S including free, acid labile, and bound sulfane sulfur in various biological specimens. PMID:22561703

On the optimality of individual entangling-probe attacks against BB84 quantum key distribution

NASA Astrophysics Data System (ADS)

Herbauts, I. M.; Bettelli, S.; Hã¼bel, H.; Peev, M.

2008-02-01

Some MIT researchers [Phys. Rev. A 75, 042327 (2007)] have recently claimed that their implementation of the Slutsky-Brandt attack [Phys. Rev. A 57, 2383 (1998); Phys. Rev. A 71, 042312 (2005)] to the BB84 quantum-key-distribution (QKD) protocol puts the security of this protocol “to the test” by simulating “the most powerful individual-photon attack” [Phys. Rev. A 73, 012315 (2006)]. A related unfortunate news feature by a scientific journal [G. Brumfiel, Quantum cryptography is hacked, News @ Nature (april 2007); Nature 447, 372 (2007)] has spurred some concern in the QKD community and among the general public by misinterpreting the implications of this work. The present article proves the existence of a stronger individual attack on QKD protocols with encrypted error correction, for which tight bounds are shown, and clarifies why the claims of the news feature incorrectly suggest a contradiction with the established “old-style” theory of BB84 individual attacks. The full implementation of a quantum cryptographic protocol includes a reconciliation and a privacy-amplification stage, whose choice alters in general both the maximum extractable secret and the optimal eavesdropping attack. The authors of [Phys. Rev. A 75, 042327 (2007)] are concerned only with the error-free part of the so-called sifted string, and do not consider faulty bits, which, in the version of their protocol, are discarded. When using the provably superior reconciliation approach of encrypted error correction (instead of error discard), the Slutsky-Brandt attack is no more optimal and does not “threaten” the security bound derived by Lütkenhaus [Phys. Rev. A 59, 3301 (1999)]. It is shown that the method of Slutsky and collaborators [Phys. Rev. A 57, 2383 (1998)] can be adapted to reconciliation with error correction, and that the optimal entangling probe can be explicitly found. Moreover, this attack fills Lütkenhaus bound, proving that it is tight (a fact which was not previously known).

Volumes and intrinsic diameters of hypersurfaces

NASA Astrophysics Data System (ADS)

Paeng, Seong-Hun

2015-09-01

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

“Local” Dark Energy Outflows Around Galaxy Groups and Rich Clusters

NASA Astrophysics Data System (ADS)

Byrd, Gene G.; Chernin, A. D.; Teerikorpi, P.; Dolgachev, V. P.; Kanter, A. A.; Domozhilova, L. M.; Valtonen, M.

2013-01-01

First detected at large Gpc distances, dark energy is a vacuum energy formulated as Einstein's cosmological constant, Λ. We have found its effects on “small” 1-3 Mpc scales in our Local Group. We have now found these effects in other nearby groups using member Doppler shifts and 3D distances from group centers (Cen A-M83; M81-M82; CV I). For the larger 20-30 Mpc Virgo and Fornax clusters, we now have found similar effects. Observationally, for both groups and clusters, gravity dominates a bound central system. The system gravitation and dark energy create a “zero-gravity” radius (R_{ZG}) from the center where the two balance. Smaller members bound inside R_{ZG} may be pulled out along with the less bound members which recede farther. A linear increase of recession with distance results which approaches a linear global Hubble law. These outflows are seen around groups in cosmological simulations which include galaxies as small as ~10^{-4} of the group mass. Scaled plots of asymptotic recessional velocity, V/(H(R_{ZG})), versus distance/ R_{ZG} of the outer galaxies are very similar for both the small groups and large clusters. This similarity on 1-30 Mpc scales suggests that a quasi-stationary bound central component and an expanding outflow applies to a wide range of groups and clusters due to small scale action of dark energy. Our new text book: Byrd, G., Chernin, A., Terrikorpi, P. and Valtonen, M. 2012, "Paths to Dark Energy: Theory and Observation," de Gruyter, Berlin/Boston, contains background and cosmological simulation plots. Group data and scaled plots are in our new article: A. D. Chernin, P. Teerikorpi, V. P. Dolgachev, A. A. Kanter, L. M. Domozhilova, M. J. Valtonen, and G. G. Byrd, 2012, Astronomy Reports, Vol. 56 , p. 653-669.

Experimental Quantum Coin Tossing

NASA Astrophysics Data System (ADS)

Molina-Terriza, G.; Vaziri, A.; Ursin, R.; Zeilinger, A.

2005-01-01

In this Letter we present the first implementation of a quantum coin-tossing protocol. This protocol belongs to a class of “two-party” cryptographic problems, where the communication partners distrust each other. As with a number of such two-party protocols, the best implementation of the quantum coin tossing requires qutrits, resulting in a higher security than using qubits. In this way, we have also performed the first complete quantum communication protocol with qutrits. In our experiment the two partners succeeded to remotely toss a row of coins using photons entangled in the orbital angular momentum. We also show the experimental bounds of a possible cheater and the ways of detecting him.

Breaking Megrelishvili protocol using matrix diagonalization

NASA Astrophysics Data System (ADS)

Arzaki, Muhammad; Triantoro Murdiansyah, Danang; Adi Prabowo, Satrio

2018-03-01

In this article we conduct a theoretical security analysis of Megrelishvili protocol—a linear algebra-based key agreement between two participants. We study the computational complexity of Megrelishvili vector-matrix problem (MVMP) as a mathematical problem that strongly relates to the security of Megrelishvili protocol. In particular, we investigate the asymptotic upper bounds for the running time and memory requirement of the MVMP that involves diagonalizable public matrix. Specifically, we devise a diagonalization method for solving the MVMP that is asymptotically faster than all of the previously existing algorithms. We also found an important counterintuitive result: the utilization of primitive matrix in Megrelishvili protocol makes the protocol more vulnerable to attacks.

Gaussian operations and privacy

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

Navascues, Miguel; Acin, Antonio

2005-07-15

We consider the possibilities offered by Gaussian states and operations for two honest parties, Alice and Bob, to obtain privacy against a third eavesdropping party, Eve. We first extend the security analysis of the protocol proposed in [Navascues et al. Phys. Rev. Lett. 94, 010502 (2005)]. Then, we prove that a generalized version of this protocol does not allow one to distill a secret key out of bound entangled Gaussian states.

An improved approach to the analysis of drug-protein binding by distance geometry

NASA Technical Reports Server (NTRS)

Goldblum, A.; Kieber-Emmons, T.; Rein, R.

1986-01-01

The calculation of side chain centers of coordinates and the subsequent generation of side chain-side chain and side chain-backbone distance matrices is suggested as an improved method for viewing interactions inside proteins and for the comparison of protein structures. The use of side chain distance matrices is demonstrated with free PTI, and the use of difference distance matrices for side chains is shown for free and trypsin-bound PTI as well as for the X-ray structures of trypsin complexes with PTI and with benzamidine. It is found that conformational variations are reflected in the side chain distance matrices much more than in the standard C-C distance representations.

The Kirchhoff Index of Quasi-Tree Graphs

NASA Astrophysics Data System (ADS)

Xu, Kexiang; Liu, Hongshuang; Das, Kinkar Ch.

2015-03-01

Resistance distance was introduced by Klein and Randić as a generalisation of the classical distance. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this article we characterise the extremal graphs with the maximal Kirchhoff index among all non-trivial quasi-tree graphs of order n. Moreover, we obtain a lower bound on the Kirchhoff index for all non-trivial quasi-tree graphs of order n.

Outward Bound to the Galaxies--One Step at a Time

ERIC Educational Resources Information Center

Ward, R. Bruce; Miller-Friedmann, Jaimie; Sienkiewicz, Frank; Antonucci, Paul

2012-01-01

Less than a century ago, astronomers began to unlock the cosmic distances within and beyond the Milky Way. Understanding the size and scale of the universe is a continuing, step-by-step process that began with the remarkably accurate measurement of the distance to the Moon made by early Greeks. In part, the authors have ITEAMS (Innovative…

Detection of free and covalently bound microcystins in different tissues (liver, intestines, gills, and muscles) of rainbow trout (Oncorhynchus mykiss) by liquid chromatography-tandem mass spectrometry: method characterization.

PubMed

Cadel-Six, Sabrina; Moyenga, David; Magny, Stéphanie; Trotereau, Sophie; Edery, Marc; Krys, Sophie

2014-02-01

So far only a few publications have explored the development of extraction methods of cyanotoxin extracted from complex matrices. With regard to cyanobacterial microcystins (MCs), the data on the contamination of the flesh of aquatic organisms is hard to compare and very limited due to the lack of validated methods. In recent years, evidence that both free and bound fractions of toxin are found in these tissues has highlighted the need to develop effective methods of quantification. Several techniques do exist, but only the Lemieux oxidation has so far been used to investigate complex tissue matrices. In this study, protocols based on the Lemieux approach were adapted for the quantitative chemical analysis of free MC-LR and MMPB derived from bound toxin in the tissues of juvenile trout gavaged with MC-LR. Afterwards, the NF V03 110 guideline was used to characterize the protocols elaborated and evaluate their effectiveness. Copyright © 2013. Published by Elsevier Ltd.

Mass, height of burst, and source–receiver distance constraints on the acoustic coda phase delay method

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

Albert, Sarah; Bowman, Daniel; Rodgers, Arthur

Here, this research uses the acoustic coda phase delay method to estimate relative changes in air temperature between explosions with varying event masses and heights of burst. It also places a bound on source–receiver distance for the method. Previous studies used events with different shapes, height of bursts, and masses and recorded the acoustic codas at source–receiver distances less than 1 km. This research further explores the method using explosions that differ in mass (by up to an order of magnitude) and are placed at varying heights. Source–receiver distances also cover an area out to 7 km. Relative air temperaturemore » change estimates are compared to complementary meteorological observations. Results show that two explosions that differ by an order of magnitude cannot be used with this method because their propagation times in the near field and their fundamental frequencies are different. These differences are expressed as inaccuracies in the relative air temperature change estimates. An order of magnitude difference in mass is also shown to bias estimates higher. Small differences in height of burst do not affect the accuracy of the method. Finally, an upper bound of 1 km on source–receiver distance is provided based on the standard deviation characteristics of the estimates.« less

Mass, height of burst, and source–receiver distance constraints on the acoustic coda phase delay method

DOE PAGES

Albert, Sarah; Bowman, Daniel; Rodgers, Arthur; ...

2018-04-23

Here, this research uses the acoustic coda phase delay method to estimate relative changes in air temperature between explosions with varying event masses and heights of burst. It also places a bound on source–receiver distance for the method. Previous studies used events with different shapes, height of bursts, and masses and recorded the acoustic codas at source–receiver distances less than 1 km. This research further explores the method using explosions that differ in mass (by up to an order of magnitude) and are placed at varying heights. Source–receiver distances also cover an area out to 7 km. Relative air temperaturemore » change estimates are compared to complementary meteorological observations. Results show that two explosions that differ by an order of magnitude cannot be used with this method because their propagation times in the near field and their fundamental frequencies are different. These differences are expressed as inaccuracies in the relative air temperature change estimates. An order of magnitude difference in mass is also shown to bias estimates higher. Small differences in height of burst do not affect the accuracy of the method. Finally, an upper bound of 1 km on source–receiver distance is provided based on the standard deviation characteristics of the estimates.« less

Protein local structure alignment under the discrete Fréchet distance.

PubMed

Zhu, Binhai

2007-12-01

Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance, and with the application of protein-related research, a related discrete Fréchet distance has been used recently. In this paper, following the recent work of Jiang et al. we investigate the protein local structural alignment problem using bounded discrete Fréchet distance. Given m proteins (or protein backbones, which are 3D polygonal chains), each of length O(n), our main results are summarized as follows: * If the number of proteins, m, is not part of the input, then the problem is NP-complete; moreover, under bounded discrete Fréchet distance it is NP-hard to approximate the maximum size common local structure within a factor of n(1-epsilon). These results hold both when all the proteins are static and when translation/rotation are allowed. * If the number of proteins, m, is a constant, then there is a polynomial time solution for the problem.

The Lag Model, a Turbulence Model for Wall Bounded Flows Including Separation

NASA Technical Reports Server (NTRS)

Olsen, Michael E.; Coakley, Thomas J.; Kwak, Dochan (Technical Monitor)

2001-01-01

A new class of turbulence model is described for wall bounded, high Reynolds number flows. A specific turbulence model is demonstrated, with results for favorable and adverse pressure gradient flowfields. Separation predictions are as good or better than either Spalart Almaras or SST models, do not require specification of wall distance, and have similar or reduced computational effort compared with these models.

Architecture of the 99 bp DNA-six-protein regulatory complex of the lambda att site.

PubMed

Sun, Xingmin; Mierke, Dale F; Biswas, Tapan; Lee, Sang Yeol; Landy, Arthur; Radman-Livaja, Marta

2006-11-17

The highly directional and tightly regulated recombination reaction used to site-specifically excise the bacteriophage lambda chromosome out of its E. coli host chromosome requires the binding of six sequence-specific proteins to a 99 bp segment of the phage att site. To gain structural insights into this recombination pathway, we measured 27 FRET distances between eight points on the 99 bp regulatory DNA bound with all six proteins. Triangulation of these distances using a metric matrix distance-geometry algorithm provided coordinates for these eight points. The resulting path for the protein-bound regulatory DNA, which fits well with the genetics, biochemistry, and X-ray crystal structures describing the individual proteins and their interactions with DNA, provides a new structural perspective into the molecular mechanism and regulation of the recombination reaction and illustrates a design by which different families of higher-order complexes can be assembled from different numbers and combinations of the same few proteins.

Discontinuous categories affect information-integration but not rule-based category learning.

PubMed

Maddox, W Todd; Filoteo, J Vincent; Lauritzen, J Scott; Connally, Emily; Hejl, Kelli D

2005-07-01

Three experiments were conducted that provide a direct examination of within-category discontinuity manipulations on the implicit, procedural-based learning and the explicit, hypothesis-testing systems proposed in F. G. Ashby, L. A. Alfonso-Reese, A. U. Turken, and E. M. Waldron's (1998) competition between verbal and implicit systems model. Discontinuous categories adversely affected information-integration but not rule-based category learning. Increasing the magnitude of the discontinuity did not lead to a significant decline in performance. The distance to the bound provides a reasonable description of the generalization profile associated with the hypothesis-testing system, whereas the distance to the bound plus the distance to the trained response region provides a reasonable description of the generalization profile associated with the procedural-based learning system. These results suggest that within-category discontinuity differentially impacts information-integration but not rule-based category learning and provides information regarding the detailed processing characteristics of each category learning system. ((c) 2005 APA, all rights reserved).

An Overview and Empirical Comparison of Distance Metric Learning Methods.

PubMed

Moutafis, Panagiotis; Leng, Mengjun; Kakadiaris, Ioannis A

2016-02-16

In this paper, we first offer an overview of advances in the field of distance metric learning. Then, we empirically compare selected methods using a common experimental protocol. The number of distance metric learning algorithms proposed keeps growing due to their effectiveness and wide application. However, existing surveys are either outdated or they focus only on a few methods. As a result, there is an increasing need to summarize the obtained knowledge in a concise, yet informative manner. Moreover, existing surveys do not conduct comprehensive experimental comparisons. On the other hand, individual distance metric learning papers compare the performance of the proposed approach with only a few related methods and under different settings. This highlights the need for an experimental evaluation using a common and challenging protocol. To this end, we conduct face verification experiments, as this task poses significant challenges due to varying conditions during data acquisition. In addition, face verification is a natural application for distance metric learning because the encountered challenge is to define a distance function that: 1) accurately expresses the notion of similarity for verification; 2) is robust to noisy data; 3) generalizes well to unseen subjects; and 4) scales well with the dimensionality and number of training samples. In particular, we utilize well-tested features to assess the performance of selected methods following the experimental protocol of the state-of-the-art database labeled faces in the wild. A summary of the results is presented along with a discussion of the insights obtained and lessons learned by employing the corresponding algorithms.

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.

Ground-state-entanglement bound for quantum energy teleportation of general spin-chain models

NASA Astrophysics Data System (ADS)

Hotta, Masahiro

2013-03-01

Many-body quantum systems in the ground states have zero-point energy due to the uncertainty relation. In many cases, the system in the ground state accompanies spatially entangled energy density fluctuation via the noncommutativity of the energy density operators, though the total energy takes a fixed value, i.e., the lowest eigenvalue of the Hamiltonian. Quantum energy teleportation (QET) is a protocol for the extraction of the zero-point energy out of one subsystem using information of a remote measurement of another subsystem. From an operational viewpoint of protocol users, QET can be regarded as an effective rapid energy transportation without breaking all physical laws, including causality and local energy conservation. In the protocol, the ground-state entanglement plays a crucial role. In this paper, we show analytically for a general class of spin-chain systems that the entanglement entropy is lower bounded by a positive quadratic function of the teleported energy between the regions of a QET protocol. This supports a general conjecture that ground-state entanglement is an evident physical resource for energy transportation in the context of QET. The result may also deepen our understanding of the energy density fluctuation in condensed-matter systems from a perspective of quantum information theory.

Comprehensive Identification of RNA-Binding Proteins by RNA Interactome Capture.

PubMed

Castello, Alfredo; Horos, Rastislav; Strein, Claudia; Fischer, Bernd; Eichelbaum, Katrin; Steinmetz, Lars M; Krijgsveld, Jeroen; Hentze, Matthias W

2016-01-01

RNA associates with RNA-binding proteins (RBPs) from synthesis to decay, forming dynamic ribonucleoproteins (RNPs). In spite of the preeminent role of RBPs regulating RNA fate, the scope of cellular RBPs has remained largely unknown. We have recently developed a novel and comprehensive method to identify the repertoire of active RBPs of cultured cells, called RNA interactome capture. Using in vivo UV cross-linking on cultured cells, proteins are covalently bound to RNA if the contact between the two is direct ("zero distance"). Protein-RNA complexes are purified by poly(A) tail-dependent oligo(dT) capture and analyzed by quantitative mass spectrometry. Because UV irradiation is applied to living cells and purification is performed using highly stringent washes, RNA interactome capture identifies physiologic and direct protein-RNA interactions. Applied to HeLa cells, this protocol revealed the near-complete repertoire of RBPs, including hundreds of novel RNA binders. Apart from its RBP discovery capacity, quantitative and comparative RNA interactome capture can also be used to study the responses of the RBP repertoire to different physiological cues and processes, including metabolic stress, differentiation, development, or the response to drugs.

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.

Determining relative error bounds for the CVBEM

USGS Publications Warehouse

Hromadka, T.V.

1985-01-01

The Complex Variable Boundary Element Methods provides a measure of relative error which can be utilized to subsequently reduce the error or provide information for further modeling analysis. By maximizing the relative error norm on each boundary element, a bound on the total relative error for each boundary element can be evaluated. This bound can be utilized to test CVBEM convergence, to analyze the effects of additional boundary nodal points in reducing the modeling error, and to evaluate the sensitivity of resulting modeling error within a boundary element from the error produced in another boundary element as a function of geometric distance. ?? 1985.

Performance comparison of token ring protocols for hard-real-time communication

NASA Technical Reports Server (NTRS)

Kamat, Sanjay; Zhao, Wei

1992-01-01

The ability to guarantee the deadlines of synchronous messages while maintaining a good aggregate throughput is an important consideration in the design of distributed real-time systems. In this paper, we study two token ring protocols, the priority driven protocol and the timed token protocol, for their suitability for hard real-time systems. Both these protocols use a token to control access to the transmission medium. In a priority driven protocol, messages are assigned priorities and the protocol ensures that messages are transmitted in the order of their priorities. Timed token protocols do not provide for priority arbitration but ensure that the maximum access delay for a station is bounded. For both protocols, we first derive the schedulability conditions under which the transmission deadlines of a given set of synchronous messages can be guaranteed. Subsequently, we use these schedulability conditions to quantitatively compare the average case behavior of the protocols. This comparison demonstrates that each of the protocols has its domain of superior performance and neither dominates the other for the entire range of operating conditions.

The Effect of Increasing Jump Steps on Stance Leg Joint Kinetics in Bounding.

PubMed

Kariyama, Yasushi; Hobara, Hiroaki; Zushi, Koji

2018-06-20

Jump distance per step in bounding exercises from the standing position increases with increasing number of steps. We examined the hypothesis that the joint kinetic variables of the stance leg would also increase accordingly. Eleven male athletes (sprinters and jumpers) performed bounding exercise, starting from the double-leg standing posture, and covered the longest distance possible by performing a series of seven forward alternating single-leg jumps. Kinematic and kinetic data were calculated using the data by a motion capture system and force platforms. Hip extension joint work were decreased at third step (1 st : 1.07±0.22, 3 rd : 0.45±0.15, 5 th : 0.47±0.14 J•kg -1 ; partial η 2 : 0.86), and hip abduction joint power were increased (1 st : 7.53±3.29, 3 rd : 13.50±4.44, 5 th : 21.37±9.93 W•kg -1 ; partial η 2 : 0.58); the knee extension joint power were increased until the third step (1 st : 14.43±4.94, 3 rd : 17.13±3.59, 5 th : 14.28±2.86 W•kg -1 ; partial η 2 : 0.29), and ankle plantar flexion joint power increased (1 st : 34.14±5.33, 3 rd : 37.46±4.45, 5 th : 40.11±5.66 W•kg -1 ; partial η 2 : 0.53). These results contrast with our hypothesis, and indicate that increasing the jump distance during bounding exercises is not necessarily accompanied by increases in joint kinetics of stance leg. Moreover, changes in joint kinetics vary at different joints and anatomical axes. © Georg Thieme Verlag KG Stuttgart · New York.

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.

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.

Perspectives for laboratory implementation of the Duan-Lukin-Cirac-Zoller protocol for quantum repeaters

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

Mendes, Milrian S.; Felinto, Daniel

2011-12-15

We analyze the efficiency and scalability of the Duan-Lukin-Cirac-Zoller (DLCZ) protocol for quantum repeaters focusing on the behavior of the experimentally accessible measures of entanglement for the system, taking into account crucial imperfections of the stored entangled states. We calculate then the degradation of the final state of the quantum-repeater linear chain for increasing sizes of the chain, and characterize it by a lower bound on its concurrence and the ability to violate the Clausner-Horne-Shimony-Holt inequality. The states are calculated up to an arbitrary number of stored excitations, as this number is not fundamentally bound for experiments involving large atomicmore » ensembles. The measurement by avalanche photodetectors is modeled by ''ON/OFF'' positive operator-valued measure operators. As a result, we are able to consistently test the approximation of the real fields by fields with a finite number of excitations, determining the minimum number of excitations required to achieve a desired precision in the prediction of the various measured quantities. This analysis finally determines the minimum purity of the initial state that is required to succeed in the protocol as the size of the chain increases. We also provide a more accurate estimate for the average time required to succeed in each step of the protocol. The minimum purity analysis and the new time estimates are then combined to trace the perspectives for implementation of the DLCZ protocol in present-day laboratory setups.« less

Perspectives for laboratory implementation of the Duan-Lukin-Cirac-Zoller protocol for quantum repeaters

NASA Astrophysics Data System (ADS)

Mendes, Milrian S.; Felinto, Daniel

2011-12-01

We analyze the efficiency and scalability of the Duan-Lukin-Cirac-Zoller (DLCZ) protocol for quantum repeaters focusing on the behavior of the experimentally accessible measures of entanglement for the system, taking into account crucial imperfections of the stored entangled states. We calculate then the degradation of the final state of the quantum-repeater linear chain for increasing sizes of the chain, and characterize it by a lower bound on its concurrence and the ability to violate the Clausner-Horne-Shimony-Holt inequality. The states are calculated up to an arbitrary number of stored excitations, as this number is not fundamentally bound for experiments involving large atomic ensembles. The measurement by avalanche photodetectors is modeled by “ON/OFF” positive operator-valued measure operators. As a result, we are able to consistently test the approximation of the real fields by fields with a finite number of excitations, determining the minimum number of excitations required to achieve a desired precision in the prediction of the various measured quantities. This analysis finally determines the minimum purity of the initial state that is required to succeed in the protocol as the size of the chain increases. We also provide a more accurate estimate for the average time required to succeed in each step of the protocol. The minimum purity analysis and the new time estimates are then combined to trace the perspectives for implementation of the DLCZ protocol in present-day laboratory setups.

New Results on Unconditionally Secure Multi-receiver Manual Authentication

NASA Astrophysics Data System (ADS)

Wang, Shuhong; Safavi-Naini, Reihaneh

Manual authentication is a recently proposed model of communication motivated by the settings where the only trusted infrastructure is a low bandwidth authenticated channel, possibly realized by the aid of a human, that connects the sender and the receiver who are otherwise connected through an insecure channel and do not have any shared key or public key infrastructure. A good example of such scenarios is pairing of devices in Bluetooth. Manual authentication systems are studied in computational and information theoretic security model and protocols with provable security have been proposed. In this paper we extend the results in information theoretic model in two directions. Firstly, we extend a single receiver scenario to multireceiver case where the sender wants to authenticate the same message to a group of receivers. We show new attacks (compared to single receiver case) that can launched in this model and demonstrate that the single receiver lower bound 2log(1/ɛ) + O(1) on the bandwidth of manual channel stays valid in the multireceiver scenario. We further propose a protocol that achieves this bound and provides security, in the sense that we define, if up to c receivers are corrupted. The second direction is the study of non-interactive protocols in unconditionally secure model. We prove that unlike computational security framework, without interaction a secure authentication protocol requires the bandwidth of the manual channel to be at least the same as the message size, hence non-trivial protocols do not exist.

Establishing security of quantum key distribution without monitoring disturbance

NASA Astrophysics Data System (ADS)

Koashi, Masato

2015-10-01

In conventional quantum key distribution (QKD) protocols, the information leak to an eavesdropper is estimated through the basic principle of quantum mechanics dictated in the original version of Heisenberg's uncertainty principle. The amount of leaked information on a shared sifted key is bounded from above essentially by using information-disturbance trade-off relations, based on the amount of signal disturbance measured via randomly sampled or inserted probe signals. Here we discuss an entirely different avenue toward the private communication, which does not rely on the information disturbance trade-off relations and hence does not require a monitoring of signal disturbance. The independence of the amount of privacy amplification from that of disturbance tends to give it a high tolerance on the channel noises. The lifting of the burden of precise statistical estimation of disturbance leads to a favorable finite-key-size effect. A protocol based on the novel principle can be implemented by only using photon detectors and classical optics tools: a laser, a phase modulator, and an interferometer. The protocol resembles the differential-phase-shift QKD protocol in that both share a simple binary phase shift keying on a coherent train of weak pulses from a laser. The difference lies in the use of a variable-delay interferometer in the new protocol, which randomly changes the combination of pulse pairs to be superposed. This extra randomness has turned out to be enough to upper-bound the information extracted by the eavesdropper, regardless of how they have disturbed the quantum signal.

Distance versus near visual acuity in amblyopia

PubMed Central

Christoff, Alex; Repka, Michael X.; Kaminski, Brett M.; Holmes, Jonathan M.; Ch, B

2011-01-01

Purpose There are conflicting reports about whether distance and near visual acuity are similar in eyes with amblyopia. The purpose of this study is to compare monocular distance visual acuity with near visual acuity in amblyopic eyes of children. Methods Subjects 2 to 6 years of age were evaluated in a randomized trial of amblyopia therapy for moderate amblyopia (20/40 to 20/80) due to anisometropia, strabismus, or both. Prior to initiating the protocol-prescribed therapy, subjects had best-corrected visual acuity measured with standardized protocols at 3 meters and 0.4 meters using single-surrounded HOTV optotypes. Results A total of 129 subjects were included. The mean amblyopic eye visual acuity was similar at distance and near (mean, 0.45 logMAR at distance versus 0.45 logMAR at near; mean difference, +0.00, 95% CI, −0.03 to 0.03). Of the 129 subjects, 86 (67%) tested within one line at distance and near, 19 (15%) tested more than one logMAR line better at distance, and 24 (19%) tested more than one logMAR line better at near. The mean visual acuity difference between distance and near did not differ by cause of amblyopia, age, or spherical equivalent refractive error. Conclusions We found no systematic difference between distance and near visual acuity in 2- to 6-year-old children with moderate amblyopia associated with strabismus and/or anisometropia. Individual differences between distance and near visual acuity are likely due to test–retest variability. PMID:21907115

An optimized framework for quantitative magnetization transfer imaging of the cervical spinal cord in vivo.

PubMed

Battiston, Marco; Grussu, Francesco; Ianus, Andrada; Schneider, Torben; Prados, Ferran; Fairney, James; Ourselin, Sebastien; Alexander, Daniel C; Cercignani, Mara; Gandini Wheeler-Kingshott, Claudia A M; Samson, Rebecca S

2018-05-01

To develop a framework to fully characterize quantitative magnetization transfer indices in the human cervical cord in vivo within a clinically feasible time. A dedicated spinal cord imaging protocol for quantitative magnetization transfer was developed using a reduced field-of-view approach with echo planar imaging (EPI) readout. Sequence parameters were optimized based in the Cramer-Rao-lower bound. Quantitative model parameters (i.e., bound pool fraction, free and bound pool transverse relaxation times [ T2F, T2B], and forward exchange rate [k FB ]) were estimated implementing a numerical model capable of dealing with the novelties of the sequence adopted. The framework was tested on five healthy subjects. Cramer-Rao-lower bound minimization produces optimal sampling schemes without requiring the establishment of a steady-state MT effect. The proposed framework allows quantitative voxel-wise estimation of model parameters at the resolution typically used for spinal cord imaging (i.e. 0.75 × 0.75 × 5 mm 3 ), with a protocol duration of ∼35 min. Quantitative magnetization transfer parametric maps agree with literature values. Whole-cord mean values are: bound pool fraction = 0.11(±0.01), T2F = 46.5(±1.6) ms, T2B = 11.0(±0.2) µs, and k FB  = 1.95(±0.06) Hz. Protocol optimization has a beneficial effect on reproducibility, especially for T2B and k FB . The framework developed enables robust characterization of spinal cord microstructure in vivo using qMT. Magn Reson Med 79:2576-2588, 2018. © 2017 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited. © 2017 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine.

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

NASA Astrophysics Data System (ADS)

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

2016-01-01

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

A New On-Line Diagnosis Protocol for the SPIDER Family of Byzantine Fault Tolerant Architectures

NASA Technical Reports Server (NTRS)

Geser, Alfons; Miner, Paul S.

2004-01-01

This paper presents the formal verification of a new protocol for online distributed diagnosis for the SPIDER family of architectures. An instance of the Scalable Processor-Independent Design for Electromagnetic Resilience (SPIDER) architecture consists of a collection of processing elements communicating over a Reliable Optical Bus (ROBUS). The ROBUS is a specialized fault-tolerant device that guarantees Interactive Consistency, Distributed Diagnosis (Group Membership), and Synchronization in the presence of a bounded number of physical faults. Formal verification of the original SPIDER diagnosis protocol provided a detailed understanding that led to the discovery of a significantly more efficient protocol. The original protocol was adapted from the formally verified protocol used in the MAFT architecture. It required O(N) message exchanges per defendant to correctly diagnose failures in a system with N nodes. The new protocol achieves the same diagnostic fidelity, but only requires O(1) exchanges per defendant. This paper presents this new diagnosis protocol and a formal proof of its correctness using PVS.

Evaluation of refractive correction for standard automated perimetry in eyes wearing multifocal contact lenses

PubMed Central

Hirasawa, Kazunori; Ito, Hikaru; Ohori, Yukari; Takano, Yui; Shoji, Nobuyuki

2017-01-01

AIM To evaluate the refractive correction for standard automated perimetry (SAP) in eyes with refractive multifocal contact lenses (CL) in healthy young participants. METHODS Twenty-nine eyes of 29 participants were included. Accommodation was paralyzed in all participants with 1% cyclopentolate hydrochloride. SAP was performed using the Humphrey SITA-standard 24-2 and 10-2 protocol under three refractive conditions: monofocal CL corrected for near distance (baseline); multifocal CL corrected for distance (mCL-D); and mCL-D corrected for near vision using a spectacle lens (mCL-N). Primary outcome measures were the foveal threshold, mean deviation (MD), and pattern standard deviation (PSD). RESULTS The foveal threshold of mCL-N with both the 24-2 and 10-2 protocols significantly decreased by 2.2-2.5 dB (P<0.001), while that of mCL-D with the 24-2 protocol significantly decreased by 1.5 dB (P=0.0427), as compared with that of baseline. Although there was no significant difference between the MD of baseline and mCL-D with the 24-2 and 10-2 protocols, the MD of mCL-N was significantly decreased by 1.0-1.3 dB (P<0.001) as compared with that of both baseline and mCL-D, with both 24-2 and 10-2 protocols. There was no significant difference in the PSD among the three refractive conditions with both the 24-2 and 10-2 protocols. CONCLUSION Despite the induced mydriasis and the optical design of the multifocal lens used in this study, our results indicated that, when the dome-shaped visual field test is performed with eyes with large pupils and wearing refractive multifocal CLs, distance correction without additional near correction is to be recommended. PMID:29062776

Evaluation of refractive correction for standard automated perimetry in eyes wearing multifocal contact lenses.

PubMed

Hirasawa, Kazunori; Ito, Hikaru; Ohori, Yukari; Takano, Yui; Shoji, Nobuyuki

2017-01-01

To evaluate the refractive correction for standard automated perimetry (SAP) in eyes with refractive multifocal contact lenses (CL) in healthy young participants. Twenty-nine eyes of 29 participants were included. Accommodation was paralyzed in all participants with 1% cyclopentolate hydrochloride. SAP was performed using the Humphrey SITA-standard 24-2 and 10-2 protocol under three refractive conditions: monofocal CL corrected for near distance (baseline); multifocal CL corrected for distance (mCL-D); and mCL-D corrected for near vision using a spectacle lens (mCL-N). Primary outcome measures were the foveal threshold, mean deviation (MD), and pattern standard deviation (PSD). The foveal threshold of mCL-N with both the 24-2 and 10-2 protocols significantly decreased by 2.2-2.5 dB ( P <0.001), while that of mCL-D with the 24-2 protocol significantly decreased by 1.5 dB ( P =0.0427), as compared with that of baseline. Although there was no significant difference between the MD of baseline and mCL-D with the 24-2 and 10-2 protocols, the MD of mCL-N was significantly decreased by 1.0-1.3 dB ( P <0.001) as compared with that of both baseline and mCL-D, with both 24-2 and 10-2 protocols. There was no significant difference in the PSD among the three refractive conditions with both the 24-2 and 10-2 protocols. Despite the induced mydriasis and the optical design of the multifocal lens used in this study, our results indicated that, when the dome-shaped visual field test is performed with eyes with large pupils and wearing refractive multifocal CLs, distance correction without additional near correction is to be recommended.

Towards a hybrid energy efficient multi-tree-based optimized routing protocol for wireless networks.

PubMed

Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

2012-12-13

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm.

Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

PubMed Central

Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

2012-01-01

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm. PMID:23443398

The Eccentric Behavior of Nearly Frozen Orbits

NASA Technical Reports Server (NTRS)

Sweetser, Theodore H.; Vincent, Mark A.

2013-01-01

Frozen orbits are orbits which have only short-period changes in their mean eccentricity and argument of periapse, so that they basically keep a fixed orientation within their plane of motion. Nearly frozen orbits are those whose eccentricity and argument of periapse have values close to those of a frozen orbit. We call them "nearly" frozen because their eccentricity vector (a vector whose polar coordinates are eccentricity and argument of periapse) will stay within a bounded distance from the frozen orbit eccentricity vector, circulating around it over time. For highly inclined orbits around the Earth, this distance is effectively constant over time. Furthermore, frozen orbit eccentricity values are low enough that these orbits are essentially eccentric (i.e., off center) circles, so that nearly frozen orbits around Earth are bounded above and below by frozen orbits.

Electron transfer flavoprotein domain II orientation monitored using double electron-electron resonance between an enzymatically reduced, native FAD cofactor, and spin labels.

PubMed

Swanson, Michael A; Kathirvelu, Velavan; Majtan, Tomas; Frerman, Frank E; Eaton, Gareth R; Eaton, Sandra S

2011-03-01

Human electron transfer flavoprotein (ETF) is a soluble mitochondrial heterodimeric flavoprotein that links fatty acid β-oxidation to the main respiratory chain. The crystal structure of human ETF bound to medium chain acyl-CoA dehydrogenase indicates that the flavin adenine dinucleotide (FAD) domain (αII) is mobile, which permits more rapid electron transfer with donors and acceptors by providing closer access to the flavin and allows ETF to accept electrons from at least 10 different flavoprotein dehydrogenases. Sequence homology is high and low-angle X-ray scattering is identical for Paracoccus denitrificans (P. denitrificans) and human ETF. To characterize the orientations of the αII domain of P. denitrificans ETF, distances between enzymatically reduced FAD and spin labels in the three structural domains were measured by double electron-electron resonance (DEER) at X- and Q-bands. An FAD to spin label distance of 2.8 ± 0.15 nm for the label in the FAD-containing αII domain (A210C) agreed with estimates from the crystal structure (3.0 nm), molecular dynamics simulations (2.7 nm), and rotamer library analysis (2.8 nm). Distances between the reduced FAD and labels in αI (A43C) were between 4.0 and 4.5 ± 0.35 nm and for βIII (A111C) the distance was 4.3 ± 0.15 nm. These values were intermediate between estimates from the crystal structure of P. denitrificans ETF and a homology model based on substrate-bound human ETF. These distances suggest that the αII domain adopts orientations in solution that are intermediate between those which are observed in the crystal structures of free ETF (closed) and ETF bound to a dehydrogenase (open). Copyright © 2011 The Protein Society.

Biased decoy-state measurement-device-independent quantum cryptographic conferencing with finite resources.

PubMed

Chen, RuiKe; Bao, WanSu; Zhou, Chun; Li, Hongwei; Wang, Yang; Bao, HaiZe

2016-03-21

In recent years, a large quantity of work have been done to narrow the gap between theory and practice in quantum key distribution (QKD). However, most of them are focus on two-party protocols. Very recently, Yao Fu et al proposed a measurement-device-independent quantum cryptographic conferencing (MDI-QCC) protocol and proved its security in the limit of infinitely long keys. As a step towards practical application for MDI-QCC, we design a biased decoy-state measurement-device-independent quantum cryptographic conferencing protocol and analyze the performance of the protocol in both the finite-key and infinite-key regime. From numerical simulations, we show that our decoy-state analysis is tighter than Yao Fu et al. That is, we can achieve the nonzero asymptotic secret key rate in long distance with approximate to 200km and we also demonstrate that with a finite size of data (say 10¹¹ to 10¹³ signals) it is possible to perform secure MDI-QCC over reasonable distances.

Science Teacher Educators' Engagement with Pedagogical Content Knowledge and Scientific Inquiry in Predominantly Paper-Based Distance Learning Programs

ERIC Educational Resources Information Center

Fraser, William J.

2017-01-01

This article focuses on the dilemmas science educators face when having to introduce Pedagogical Content Knowledge (PCK) to science student teachers in a predominantly paper-based distance learning environment. It draws on the premise that science education is bound by the Nature of Science (NOS), and by the Nature of Scientific Inquiry (NOSI).…

Symmetry in Shadow

NASA Image and Video Library

2007-03-01

Magnificent blue and gold Saturn floats obliquely as one of its gravity-bound companions, Dione, hangs in the distance. The darkened rings seem to nearly touch their shadowy reverse images on the planet below

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

NASA Technical Reports Server (NTRS)

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

1990-01-01

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

Performance analysis of optimal power allocation in wireless cooperative communication systems

NASA Astrophysics Data System (ADS)

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

2013-03-01

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

Degree of coherence for vectorial electromagnetic fields as the distance between correlation matrices.

PubMed

Luis, Alfredo

2007-04-01

We assess the degree of coherence of vectorial electromagnetic fields in the space-frequency domain as the distance between the cross-spectral density matrix and the identity matrix representing completely incoherent light. This definition is compared with previous approaches. It is shown that this distance provides an upper bound for the degree of coherence and visibility for any pair of scalar waves obtained by linear combinations of the original fields. This same approach emerges when applying a previous definition of global coherence to a Young interferometer.

Semiannual Report, October 1, 1989 through March 31, 1990 (Institute for Computer Applications in Science and Engineering)

DTIC Science & Technology

1990-06-01

synchronization . We consider the performance of various synchronization protocols by deriving upper and lower bounds on optimal perfor- mance, upper bounds on Time ...from universities and from industry, who have resident appointments for limited periods of time , and by consultants. Members of NASA’s research staff...convergence to steady state is also being studied together with D. Gottlieb. The idea is to generalize the concept of local- time stepping by minimizing the

Update on the recommended viewing protocol for FAXIL threshold contrast detail detectability test objects used in television fluoroscopy.

PubMed

Launders, J H; McArdle, S; Workman, A; Cowen, A R

1995-01-01

The significance of varying the viewing conditions that may affect the perceived threshold contrast of X-ray television fluoroscopy systems has been investigated. Factors investigated include the ambient room lighting and the viewing distance. The purpose of this study is to find the optimum viewing protocol with which to measure the threshold detection index. This is a particular problem when trying to compare the image quality of television fluoroscopy systems in different input field sizes. The results show that the viewing distance makes a significant difference to the perceived threshold contrast, whereas the ambient light conditions make no significant difference. Experienced observers were found to be capable of finding the optimum viewing distance for detecting details of each size, in effect using a flexible viewing distance. This allows the results from different field sizes to be normalized to account for both the magnification and the entrance air kerma rate differences, which in turn allow for a direct comparison of performance in different field sizes.

Position Extrema in Keplerian Relative Motion: A Gröbner Basis Approach

NASA Astrophysics Data System (ADS)

Allgeier, Shawn E.; Fitz-Coy, Norman G.; Erwin, R. Scott

2012-12-01

This paper analyzes the relative motion between two spacecraft in orbit. Specifically, the paper provides bounds for relative spacecraft position-based measures which impact spacecraft formation-flight mission design and analysis. Previous efforts have provided bounds for the separation distance between two spacecraft. This paper presents a methodology for bounding the local vertical, horizontal, and cross track components of the relative position vector in a spacecraft centered, rotating reference frame. Three metrics are derived and a methodology for bounding them is presented. The solution of the extremal equations for the metrics is formulated as an affine variety and obtained using a Gröbner basis reduction. No approximations are utilized and the only assumption is that the two spacecraft are in bound Keplerian orbits. Numerical examples are included to demonstrate the efficacy of the method. The metrics have utility to the mission designer of formation flight architectures, with relevance to Earth observation constellations.

Bounding entanglement spreading after a local quench

NASA Astrophysics Data System (ADS)

Drumond, Raphael C.; Móller, Natália S.

2017-06-01

We consider the variation of von Neumann entropy of subsystem reduced states of general many-body lattice spin systems due to local quantum quenches. We obtain Lieb-Robinson-like bounds that are independent of the subsystem volume. The main assumptions are that the Hamiltonian satisfies a Lieb-Robinson bound and that the volume of spheres on the lattice grows at most exponentially with their radius. More specifically, the bound exponentially increases with time but exponentially decreases with the distance between the subsystem and the region where the quench takes place. The fact that the bound is independent of the subsystem volume leads to stronger constraints (than previously known) on the propagation of information throughout many-body systems. In particular, it shows that bipartite entanglement satisfies an effective "light cone," regardless of system size. Further implications to t density-matrix renormalization-group simulations of quantum spin chains and limitations to the propagation of information are discussed.

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.

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.

Direct measurement of weakly nonequilibrium system entropy is consistent with Gibbs–Shannon form

PubMed Central

2017-01-01

Stochastic thermodynamics extends classical thermodynamics to small systems in contact with one or more heat baths. It can account for the effects of thermal fluctuations and describe systems far from thermodynamic equilibrium. A basic assumption is that the expression for Shannon entropy is the appropriate description for the entropy of a nonequilibrium system in such a setting. Here we measure experimentally this function in a system that is in local but not global equilibrium. Our system is a micron-scale colloidal particle in water, in a virtual double-well potential created by a feedback trap. We measure the work to erase a fraction of a bit of information and show that it is bounded by the Shannon entropy for a two-state system. Further, by measuring directly the reversibility of slow protocols, we can distinguish unambiguously between protocols that can and cannot reach the expected thermodynamic bounds. PMID:29073017

Two new Controlled not Gate Based Quantum Secret Sharing Protocols without Entanglement Attenuation

NASA Astrophysics Data System (ADS)

Zhu, Zhen-Chao; Hu, Ai-Qun; Fu, An-Min

2016-05-01

In this paper, we propose two new controlled not gate based quantum secret sharing protocols. In these two protocols, each photon only travels once, which guarantees the agents located in long distance can be able to derive the dealer's secret without suffering entanglement attenuation problem. The protocols are secure against trojan horse attack, intercept-resend attack, entangle-measure attack and entanglement-swapping attack. The theoretical efficiency for qubits of these two protocols can approach 100 %, except those used for eavesdropping checking, all entangled states can be used for final secret sharing.

Production of Candida antaractica Lipase B Gene Open Reading Frame using Automated PCR Gene Assembly Protocol on Robotic Workcell & Expression in Ethanologenic Yeast for use as Resin-Bound Biocatalyst in Biodiesel Production

USDA-ARS?s Scientific Manuscript database

A synthetic Candida antarctica lipase B (CALB) gene open reading frame (ORF) for expression in yeast was produced using an automated PCR assembly and DNA purification protocol on an integrated robotic workcell. The lycotoxin-1 (Lyt-1) C3 variant gene ORF was added in-frame with the CALB ORF to pote...

Zagreb Amblyopia Preschool Screening Study: near and distance visual acuity testing increase the diagnostic accuracy of screening for amblyopia.

PubMed

Bušić, Mladen; Bjeloš, Mirjana; Petrovečki, Mladen; Kuzmanović Elabjer, Biljana; Bosnar, Damir; Ramić, Senad; Miletić, Daliborka; Andrijašević, Lidija; Kondža Krstonijević, Edita; Jakovljević, Vid; Bišćan Tvrdi, Ana; Predović, Jurica; Kokot, Antonio; Bišćan, Filip; Kovačević Ljubić, Mirna; Motušić Aras, Ranka

2016-02-01

To present and evaluate a new screening protocol for amblyopia in preschool children. Zagreb Amblyopia Preschool Screening (ZAPS) study protocol performed screening for amblyopia by near and distance visual acuity (VA) testing of 15 648 children aged 48-54 months attending kindergartens in the City of Zagreb County between September 2011 and June 2014 using Lea Symbols in lines test. If VA in either eye was >0.1 logMAR, the child was re-tested, if failed at re-test, the child was referred to comprehensive eye examination at the Eye Clinic. 78.04% of children passed the screening test. Estimated prevalence of amblyopia was 8.08%. Testability, sensitivity, and specificity of the ZAPS study protocol were 99.19%, 100.00%, and 96.68% respectively. The ZAPS study used the most discriminative VA test with optotypes in line as they do not underestimate amblyopia. The estimated prevalence of amblyopia was considerably higher than reported elsewhere. To the best of our knowledge, the ZAPS study protocol reached the highest sensitivity and specificity when evaluating diagnostic accuracy of VA tests for screening. The pass level defined at ≤0.1 logMAR for 4-year-old children, using Lea Symbols in lines missed no amblyopia cases, advocating that both near and distance VA testing should be performed when screening for amblyopia.

Zagreb Amblyopia Preschool Screening Study: near and distance visual acuity testing increase the diagnostic accuracy of screening for amblyopia

PubMed Central

Bušić, Mladen; Bjeloš, Mirjana; Petrovečki, Mladen; Kuzmanović Elabjer, Biljana; Bosnar, Damir; Ramić, Senad; Miletić, Daliborka; Andrijašević, Lidija; Kondža Krstonijević, Edita; Jakovljević, Vid; Bišćan Tvrdi, Ana; Predović, Jurica; Kokot, Antonio; Bišćan, Filip; Kovačević Ljubić, Mirna; Motušić Aras, Ranka

2016-01-01

Aim To present and evaluate a new screening protocol for amblyopia in preschool children. Methods Zagreb Amblyopia Preschool Screening (ZAPS) study protocol performed screening for amblyopia by near and distance visual acuity (VA) testing of 15 648 children aged 48-54 months attending kindergartens in the City of Zagreb County between September 2011 and June 2014 using Lea Symbols in lines test. If VA in either eye was >0.1 logMAR, the child was re-tested, if failed at re-test, the child was referred to comprehensive eye examination at the Eye Clinic. Results 78.04% of children passed the screening test. Estimated prevalence of amblyopia was 8.08%. Testability, sensitivity, and specificity of the ZAPS study protocol were 99.19%, 100.00%, and 96.68% respectively. Conclusion The ZAPS study used the most discriminative VA test with optotypes in lines as they do not underestimate amblyopia. The estimated prevalence of amblyopia was considerably higher than reported elsewhere. To the best of our knowledge, the ZAPS study protocol reached the highest sensitivity and specificity when evaluating diagnostic accuracy of VA tests for screening. The pass level defined at ≤0.1 logMAR for 4-year-old children, using Lea Symbols in lines missed no amblyopia cases, advocating that both near and distance VA testing should be performed when screening for amblyopia. PMID:26935612

The validity of the ActiPed for physical activity monitoring.

PubMed

Brown, D K; Grimwade, D; Martinez-Bussion, D; Taylor, M J D; Gladwell, V F

2013-05-01

The ActiPed (FitLinxx) is a uniaxial accelerometer, which objectively measures physical activity, uploads the data wirelessly to a website, allowing participants and researchers to view activity levels remotely. The aim was to validate ActiPed's step count, distance travelled and activity time against direct observation. Further, to compare against pedometer (YAMAX), accelerometer (ActiGraph) and manufacturer's guidelines. 22 participants, aged 28±7 years, undertook 4 protocols, including walking on different surfaces and incremental running protocol (from 2 mph to 8 mph). Bland-Altman plots allowed comparison of direct observation against ActiPed estimates. For step count, the ActiPed showed a low % bias in all protocols: walking on a treadmill (-1.30%), incremental treadmill protocol (-1.98%), walking over grass (-1.67%), and walking over concrete (-0.93%). When differentiating between walking and running step count the ActiPed showed a % bias of 4.10% and -6.30%, respectively. The ActiPed showed >95% accuracy for distance and duration estimations overall, although underestimated distance (p<0.01) for walking over grass and concrete. Overall, the ActiPed showed acceptable levels of accuracy comparable to previous validated pedometers and accelerometers. The accuracy combined with the simple and informative remote gathering of data, suggests that the ActiPed could be a useful tool in objective physical activity monitoring. © Georg Thieme Verlag KG Stuttgart · New York.

Secure satellite communication using multi-photon tolerant quantum communication protocol

NASA Astrophysics Data System (ADS)

Darunkar, Bhagyashri; Punekar, Nikhil; Verma, Pramode K.

2015-09-01

This paper proposes and analyzes the potential of a multi-photon tolerant quantum communication protocol to secure satellite communication. For securing satellite communication, quantum cryptography is the only known unconditionally secure method. A number of recent experiments have shown feasibility of satellite-aided global quantum key distribution (QKD) using different methods such as: Use of entangled photon pairs, decoy state methods, and entanglement swapping. The use of single photon in these methods restricts the distance and speed over which quantum cryptography can be applied. Contemporary quantum cryptography protocols like the BB84 and its variants suffer from the limitation of reaching the distances of only Low Earth Orbit (LEO) at the data rates of few kilobits per second. This makes it impossible to develop a general satellite-based secure global communication network using the existing protocols. The method proposed in this paper allows secure communication at the heights of the Medium Earth Orbit (MEO) and Geosynchronous Earth Orbit (GEO) satellites. The benefits of the proposed method are two-fold: First it enables the realization of a secure global communication network based on satellites and second it provides unconditional security for satellite networks at GEO heights. The multi-photon approach discussed in this paper ameliorates the distance and speed issues associated with quantum cryptography through the use of contemporary laser communication (lasercom) devices. This approach can be seen as a step ahead towards global quantum communication.

An Introduction for Distance Educators [and] Five Essential Factors Every Administrator Needs To Know about Integrated Telecommunications Infrastructures.

ERIC Educational Resources Information Center

Saba, Farhad; Mahon, J. Michael

1999-01-01

Discusses telecommunications developments that are affecting distance educators. Topics include bandwidth; educational radio and television; instructional television-fixed services (ITFS); cable television; communication satellites; computers; digital telecommunications; the Internet; other protocols; future systems; telephone switches and…

Distance constraints on activation of TRPV4 channels by AKAP150-bound PKCα in arterial myocytes

PubMed Central

Moreno, Claudia M.; O’Dwyer, Samantha; Woods, Sean

2017-01-01

TRPV4 (transient receptor potential vanilloid 4) channels are Ca2+-permeable channels that play a key role in regulating vascular tone. In arterial myocytes, opening of TRPV4 channels creates local increases in Ca2+ influx, detectable optically as “TRPV4 sparklets.” TRPV4 sparklet activity can be enhanced by the action of the vasoconstrictor angiotensin II (AngII). This modulation depends on the activation of subcellular signaling domains that comprise protein kinase C α (PKCα) bound to the anchoring protein AKAP150. Here, we used super-resolution nanoscopy, patch-clamp electrophysiology, Ca2+ imaging, and mathematical modeling approaches to test the hypothesis that AKAP150-dependent modulation of TRPV4 channels is critically dependent on the distance between these two proteins in the sarcolemma of arterial myocytes. Our data show that the distance between AKAP150 and TRPV4 channel clusters varies with sex and arterial bed. Consistent with our hypothesis, we further find that basal and AngII-induced TRPV4 channel activity decays exponentially as the distance between TRPV4 and AKAP150 increases. Our data suggest a maximum radius of action of ∼200 nm for local modulation of TRPV4 channels by AKAP150-associated PKCα. PMID:28507079

A genotyping protocol for multiple tissue types from the polyploid tree species Sequoia sempervirens (Cupressaceae)1

PubMed Central

Narayan, Lakshmi; Dodd, Richard S.; O’Hara, Kevin L.

2015-01-01

Premise of the study: Identifying clonal lineages in asexually reproducing plants using microsatellite markers is complicated by the possibility of nonidentical genotypes from the same clonal lineage due to somatic mutations, null alleles, and scoring errors. We developed and tested a clonal identification protocol that is robust to these issues for the asexually reproducing hexaploid tree species coast redwood (Sequoia sempervirens). Methods: Microsatellite data from four previously published and two newly developed primers were scored using a modified protocol, and clones were identified using Bruvo genetic distances. The effectiveness of this clonal identification protocol was assessed using simulations and by genotyping a test set of paired samples of different tissue types from the same trees. Results: Data from simulations showed that our protocol allowed us to accurately identify clonal lineages. Multiple test samples from the same trees were identified correctly, although certain tissue type pairs had larger genetic distances on average. Discussion: The methods described in this paper will allow for the accurate identification of coast redwood clones, facilitating future studies of the reproductive ecology of this species. The techniques used in this paper can be applied to studies of other clonal organisms as well. PMID:25798341

A genotyping protocol for multiple tissue types from the polyploid tree species Sequoia sempervirens (Cupressaceae).

PubMed

Narayan, Lakshmi; Dodd, Richard S; O'Hara, Kevin L

2015-03-01

Identifying clonal lineages in asexually reproducing plants using microsatellite markers is complicated by the possibility of nonidentical genotypes from the same clonal lineage due to somatic mutations, null alleles, and scoring errors. We developed and tested a clonal identification protocol that is robust to these issues for the asexually reproducing hexaploid tree species coast redwood (Sequoia sempervirens). Microsatellite data from four previously published and two newly developed primers were scored using a modified protocol, and clones were identified using Bruvo genetic distances. The effectiveness of this clonal identification protocol was assessed using simulations and by genotyping a test set of paired samples of different tissue types from the same trees. Data from simulations showed that our protocol allowed us to accurately identify clonal lineages. Multiple test samples from the same trees were identified correctly, although certain tissue type pairs had larger genetic distances on average. The methods described in this paper will allow for the accurate identification of coast redwood clones, facilitating future studies of the reproductive ecology of this species. The techniques used in this paper can be applied to studies of other clonal organisms as well.

Synthesis of all-hydrocarbon stapled α-helical peptides by ring-closing olefin metathesis.

PubMed

Kim, Young-Woo; Grossmann, Tom N; Verdine, Gregory L

2011-06-01

This protocol provides a detailed procedure for the preparation of stapled α-helical peptides, which have proven their potential as useful molecular probes and as next-generation therapeutics. Two crucial features of this protocol are (i) the construction of peptide substrates containing hindered α-methyl, α-alkenyl amino acids and (ii) the ring-closing olefin metathesis (RCM) of the resulting resin-bound peptide substrates. The stapling systems described in this protocol, namely bridging one or two turns of an α-helix, are highly adaptable to most peptide sequences, resulting in favorable RCM kinetics, helix stabilization and promotion of cellular uptake.

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

Caravelli, Francesco

The dynamics of purely memristive circuits has been shown to depend on a projection operator which expresses the Kirchhoff constraints, is naturally non-local in nature, and does represent the interaction between memristors. In the present paper we show that for the case of planar circuits, for which a meaningful Hamming distance can be defined, the elements of such projector can be bounded by exponentially decreasing functions of the distance. We provide a geometrical interpretation of the projector elements in terms of determinants of Dirichlet Laplacian of the dual circuit. For the case of linearized dynamics of the circuit for whichmore » a solution is known, this can be shown to provide a light cone bound for the interaction between memristors. Furthermore, this result establishes a finite speed of propagation of signals across the network, despite the non-local nature of the system.« less

On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream

NASA Astrophysics Data System (ADS)

Yu, Nam Yul

2017-12-01

The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix embedding a secret keystream. The keystream is obtained by a keystream generator of stream ciphers, where the initial seed becomes the secret key of the CS-based cryptosystem. For security analysis, the total variation distance, bounded by the relative entropy and the Hellinger distance, is examined as a security measure for the indistinguishability. By developing upper bounds on the distance measures, we show that the CS-based cryptosystem can be computationally secure in terms of the indistinguishability, as long as the keystream length for each encryption is sufficiently large with low compression and sparsity ratios. In addition, we consider a potential chosen plaintext attack (CPA) from an adversary, which attempts to recover the key of the CS-based cryptosystem. Associated with the key recovery attack, we show that the computational security of our CS-based cryptosystem is brought by the mathematical intractability of a constrained integer least-squares (ILS) problem. For a sub-optimal, but feasible key recovery attack, we consider a successive approximate maximum-likelihood detection (SAMD) and investigate the performance by developing an upper bound on the success probability. Through theoretical and numerical analyses, we demonstrate that our CS-based cryptosystem can be secure against the key recovery attack through the SAMD.

Development of a valid simulation assessment for a military dismounted assault task.

PubMed

Silk, Aaron J; Billing, Daniel C

2013-03-01

The Australian Defence Force is currently developing physical standards commensurate with job demands. Vital to this development process has been the accurate profiling of common military tasks. One such task required of all dismounted combat soldiers, an offensive assault on an enemy force, was the subject of in-depth profiling. In addition to overall assault performance, potential differences among patrol roles (scout, gunner, and flank) were investigated. Three different mock assaults of 100 to 150 m were performed by three patrols comprising qualified experienced infantry soldiers. Each soldier was fitted with a heart rate monitor and wore a global positioning device. Average assault duration was 6.5 minutes and required nineteen 7-m bounds performed on a 22-seconds duty cycle at 75% heart rate reserve and a work to rest ratio 1:4. Assaults conducted in more densely vegetated terrain resulted in significantly reduced (p < 0.05) bound distance, bound duration, and movement velocity. Results indicated significant performance differences (p < 0.05) among patrol roles for external load carried, heart rate response, bound duration, and distance covered while movement velocity was not different (p > 0.05). As a result of profiling the assault task, a valid simulation capable of assessing soldiers' physical capacity to perform this task was developed. Reprint & Copyright © 2013 Association of Military Surgeons of the U.S.

Conserved active site residues limit inhibition of a copper-containing nitrite reductase by small molecules.

PubMed

Tocheva, Elitza I; Eltis, Lindsay D; Murphy, Michael E P

2008-04-15

The interaction of copper-containing dissimilatory nitrite reductase from Alcaligenes faecalis S-6 ( AfNiR) with each of five small molecules was studied using crystallography and steady-state kinetics. Structural studies revealed that each small molecule interacted with the oxidized catalytic type 2 copper of AfNiR. Three small molecules (formate, acetate and nitrate) mimic the substrate by having at least two oxygen atoms for bidentate coordination to the type 2 copper atom. These three anions bound to the copper ion in the same asymmetric, bidentate manner as nitrite. Consistent with their weak inhibition of the enzyme ( K i >50 mM), the Cu-O distances in these AfNiR-inhibitor complexes were approximately 0.15 A longer than that observed in the AfNiR-nitrite complex. The binding mode of each inhibitor is determined in part by steric interactions with the side chain of active site residue Ile257. Moreover, the side chain of Asp98, a conserved residue that hydrogen bonds to type 2 copper-bound nitrite and nitric oxide, was either disordered or pointed away from the inhibitors. Acetate and formate inhibited AfNiR in a mixed fashion, consistent with the occurrence of second acetate binding site in the AfNiR-acetate complex that occludes access to the type 2 copper. A fourth small molecule, nitrous oxide, bound to the oxidized metal in a side-on fashion reminiscent of nitric oxide to the reduced copper. Nevertheless, nitrous oxide bound at a farther distance from the metal. The fifth small molecule, azide, inhibited the reduction of nitrite by AfNiR most strongly ( K ic = 2.0 +/- 0.1 mM). This ligand bound to the type 2 copper center end-on with a Cu-N c distance of approximately 2 A, and was the only inhibitor to form a hydrogen bond with Asp98. Overall, the data substantiate the roles of Asp98 and Ile257 in discriminating substrate from other small anions.

Gaussian error correction of quantum states in a correlated noisy channel.

PubMed

Lassen, Mikael; Berni, Adriano; Madsen, Lars S; Filip, Radim; Andersen, Ulrik L

2013-11-01

Noise is the main obstacle for the realization of fault-tolerant quantum information processing and secure communication over long distances. In this work, we propose a communication protocol relying on simple linear optics that optimally protects quantum states from non-Markovian or correlated noise. We implement the protocol experimentally and demonstrate the near-ideal protection of coherent and entangled states in an extremely noisy channel. Since all real-life channels are exhibiting pronounced non-Markovian behavior, the proposed protocol will have immediate implications in improving the performance of various quantum information protocols.

A Scholar's Journey: Using the Internet for Adult and Distance Education Research.

ERIC Educational Resources Information Center

Ellsworth, Jill H.

1993-01-01

Discusses use of the Internet for research on adult and distance education. Highlights include a description of the Internet; scholarly discussion lists; Telnet; FTP (File Transfer Protocol); scholarship and research, including access to university library catalogs and electronic journals; and online information about networks, including user…

Security of a discretely signaled continuous variable quantum key distribution protocol for high rate systems.

PubMed

Zhang, Zheshen; Voss, Paul L

2009-07-06

We propose a continuous variable based quantum key distribution protocol that makes use of discretely signaled coherent light and reverse error reconciliation. We present a rigorous security proof against collective attacks with realistic lossy, noisy quantum channels, imperfect detector efficiency, and detector electronic noise. This protocol is promising for convenient, high-speed operation at link distances up to 50 km with the use of post-selection.

High-rate measurement-device-independent quantum cryptography

NASA Astrophysics Data System (ADS)

Pirandola, Stefano; Ottaviani, Carlo; Spedalieri, Gaetana; Weedbrook, Christian; Braunstein, Samuel L.; Lloyd, Seth; Gehring, Tobias; Jacobsen, Christian S.; Andersen, Ulrik L.

2015-06-01

Quantum cryptography achieves a formidable task—the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction has been the introduction of measurement-device independence, where the secret key between two parties is established by the measurement of an untrusted relay. Unfortunately, although qubit-implemented protocols can reach long distances, their key rates are typically very low, unsuitable for the demands of a metropolitan network. Here we show, theoretically and experimentally, that a solution can come from the use of continuous-variable systems. We design a coherent-state network protocol able to achieve remarkably high key rates at metropolitan distances, in fact three orders of magnitude higher than those currently achieved. Our protocol could be employed to build high-rate quantum networks where devices securely connect to nearby access points or proxy servers.

Recrystallization of freezable bound water in aqueous solutions of medium concentration

NASA Astrophysics Data System (ADS)

Lishan, Zhao; Liqing, Pan; Ailing, Ji; Zexian, Cao; Qiang, Wang

2016-07-01

For aqueous solutions with freezable bound water, vitrification and recrystallization are mingled, which brings difficulty to application and misleads the interpretation of relevant experiments. Here, we report a quantification scheme for the freezable bound water based on the water-content dependence of glass transition temperature, by which also the concentration range for the solutions that may undergo recrystallization finds a clear definition. Furthermore, we find that depending on the amount of the freezable bound water, different temperature protocols should be devised to achieve a complete recrystallization. Our results may be helpful for understanding the dynamics of supercooled aqueous solutions and for improving their manipulation in various industries. Project supported by the Knowledge Innovation Project of Chinese Academy of Sciences on Water Science Research (Grant No. KJZD-EW-M03) and the National Natural Science Foundation of China (Grant Nos. 11474325 and 11290161).

QKD-based quantum private query without a failure probability

NASA Astrophysics Data System (ADS)

Liu, Bin; Gao, Fei; Huang, Wei; Wen, QiaoYan

2015-10-01

In this paper, we present a quantum-key-distribution (QKD)-based quantum private query (QPQ) protocol utilizing single-photon signal of multiple optical pulses. It maintains the advantages of the QKD-based QPQ, i.e., easy to implement and loss tolerant. In addition, different from the situations in the previous QKD-based QPQ protocols, in our protocol, the number of the items an honest user will obtain is always one and the failure probability is always zero. This characteristic not only improves the stability (in the sense that, ignoring the noise and the attack, the protocol would always succeed), but also benefits the privacy of the database (since the database will no more reveal additional secrets to the honest users). Furthermore, for the user's privacy, the proposed protocol is cheat sensitive, and for security of the database, we obtain an upper bound for the leaked information of the database in theory.

Quantum key distribution with an unknown and untrusted source

NASA Astrophysics Data System (ADS)

Zhao, Yi; Qi, Bing; Lo, Hoi-Kwong

2008-05-01

The security of a standard bidirectional “plug-and-play” quantum key distribution (QKD) system has been an open question for a long time. This is mainly because its source is equivalently controlled by an eavesdropper, which means the source is unknown and untrusted. Qualitative discussion on this subject has been made previously. In this paper, we solve this question directly by presenting the quantitative security analysis on a general class of QKD protocols whose sources are unknown and untrusted. The securities of standard Bennett-Brassard 1984 protocol, weak+vacuum decoy state protocol, and one-decoy state protocol, with unknown and untrusted sources are rigorously proved. We derive rigorous lower bounds to the secure key generation rates of the above three protocols. Our numerical simulation results show that QKD with an untrusted source gives a key generation rate that is close to that with a trusted source.

Cryptographic robustness of a quantum cryptography system using phase-time coding

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

Molotkov, S. N.

2008-01-15

A cryptographic analysis is presented of a new quantum key distribution protocol using phase-time coding. An upper bound is obtained for the error rate that guarantees secure key distribution. It is shown that the maximum tolerable error rate for this protocol depends on the counting rate in the control time slot. When no counts are detected in the control time slot, the protocol guarantees secure key distribution if the bit error rate in the sifted key does not exceed 50%. This protocol partially discriminates between errors due to system defects (e.g., imbalance of a fiber-optic interferometer) and eavesdropping. In themore » absence of eavesdropping, the counts detected in the control time slot are not caused by interferometer imbalance, which reduces the requirements for interferometer stability.« less

Polarization entanglement purification for concatenated Greenberger-Horne-Zeilinger state

NASA Astrophysics Data System (ADS)

Zhou, Lan; Sheng, Yu-Bo

2017-10-01

Entanglement purification plays a fundamental role in long-distance quantum communication. In the paper, we put forward the first polarization entanglement purification protocol (EPP) for one type of nonlocal logic-qubit entanglement, i.e., concatenated Greenberger-Horne-Zeilinger (C-GHZ) state, resorting to the photon-atom interaction in low-quality (Q) cavity. In contrast to existing EPPs, this protocol can purify the bit-flip error and phase-flip error in both physic and logic level. Instead of measuring the photons directly, this protocol only requires to measure the atom states to judge whether the protocol is successful. In this way, the purified logic entangled states can be preserved for further application. Moreover, it makes this EPP repeatable so as to obtain a higher fidelity of logic entangled states. As the logic-qubit entanglement utilizes the quantum error correction (QEC) codes, which has an inherent stability against noise and decoherence, this EPP combined with the QEC codes may provide a double protection for the entanglement from the channel noise and may have potential applications in long-distance quantum communication.

Determination of molecular configuration by debye length modulation.

PubMed

Vacic, Aleksandar; Criscione, Jason M; Rajan, Nitin K; Stern, Eric; Fahmy, Tarek M; Reed, Mark A

2011-09-07

Silicon nanowire field effect transistors (FETs) have emerged as ultrasensitive, label-free biodetectors that operate by sensing bound surface charge. However, the ionic strength of the environment (i.e., the Debye length of the solution) dictates the effective magnitude of the surface charge. Here, we show that control of the Debye length determines the spatial extent of sensed bound surface charge on the sensor. We apply this technique to different methods of antibody immobilization, demonstrating different effective distances of induced charge from the sensor surface.

Optimal strategies in the neighborhood of a collision course

NASA Technical Reports Server (NTRS)

Gutman, S.; Leitmann, G.

1976-01-01

We consider a simple differential game between pursuer P and evader E in the neighborhood of a nominal collision course. The payoff is the terminal lateral miss-distance. The control of each player is his acceleration normal to his velocity vector, and both players' controls are bounded. Saddlepoint strategies are deduced for three combinations of the acceleration bounds and are shown to be related to the sign of the derivative of the orientation of the line of sight (L.O.S.).

A Note on the Kirchhoff and Additive Degree-Kirchhoff Indices of Graphs

NASA Astrophysics Data System (ADS)

Yang, Yujun; Klein, Douglas J.

2015-06-01

Two resistance-distance-based graph invariants, namely, the Kirchhoff index and the additive degree-Kirchhoff index, are studied. A relation between them is established, with inequalities for the additive degree-Kirchhoff index arising via the Kirchhoff index along with minimum, maximum, and average degrees. Bounds for the Kirchhoff and additive degree-Kirchhoff indices are also determined, and extremal graphs are characterised. In addition, an upper bound for the additive degree-Kirchhoff index is established to improve a previously known result.

Long distance quantum teleportation

NASA Astrophysics Data System (ADS)

Xia, Xiu-Xiu; Sun, Qi-Chao; Zhang, Qiang; Pan, Jian-Wei

2018-01-01

Quantum teleportation is a core protocol in quantum information science. Besides revealing the fascinating feature of quantum entanglement, quantum teleportation provides an ultimate way to distribute quantum state over extremely long distance, which is crucial for global quantum communication and future quantum networks. In this review, we focus on the long distance quantum teleportation experiments, especially those employing photonic qubits. From the viewpoint of real-world application, both the technical advantages and disadvantages of these experiments are discussed.

Lossless Brownian Information Engine

NASA Astrophysics Data System (ADS)

Paneru, Govind; Lee, Dong Yun; Tlusty, Tsvi; Pak, Hyuk Kyu

2018-01-01

We report on a lossless information engine that converts nearly all available information from an error-free feedback protocol into mechanical work. Combining high-precision detection at a resolution of 1 nm with ultrafast feedback control, the engine is tuned to extract the maximum work from information on the position of a Brownian particle. We show that the work produced by the engine achieves a bound set by a generalized second law of thermodynamics, demonstrating for the first time the sharpness of this bound. We validate a generalized Jarzynski equality for error-free feedback-controlled information engines.

Lossless Brownian Information Engine.

PubMed

Paneru, Govind; Lee, Dong Yun; Tlusty, Tsvi; Pak, Hyuk Kyu

2018-01-12

We report on a lossless information engine that converts nearly all available information from an error-free feedback protocol into mechanical work. Combining high-precision detection at a resolution of 1 nm with ultrafast feedback control, the engine is tuned to extract the maximum work from information on the position of a Brownian particle. We show that the work produced by the engine achieves a bound set by a generalized second law of thermodynamics, demonstrating for the first time the sharpness of this bound. We validate a generalized Jarzynski equality for error-free feedback-controlled information engines.

Bounds on Nonsymmetric Divergence Measure in terms of Other Symmetric and Nonsymmetric Divergence Measures

PubMed Central

Jain, K. C.; Chhabra, Praphull

2014-01-01

Vajda (1972) studied a generalized divergence measure of Csiszar's class, so called “Chi-m divergence measure.” Variational distance and Chi-square divergence are the special cases of this generalized divergence measure at m = 1 and m = 2, respectively. In this work, nonparametric nonsymmetric measure of divergence, a particular part of Vajda generalized divergence at m = 4, is taken and characterized. Its bounds are studied in terms of some well-known symmetric and nonsymmetric divergence measures of Csiszar's class by using well-known information inequalities. Comparison of this divergence with others is done. Numerical illustrations (verification) regarding bounds of this divergence are presented as well. PMID:27437464

Relationships of pediatric anthropometrics for CT protocol selection.

PubMed

Phillips, Grace S; Stanescu, Arta-Luana; Alessio, Adam M

2014-07-01

Determining the optimal CT technique to minimize patient radiation exposure while maintaining diagnostic utility requires patient-specific protocols that are based on patient characteristics. This work develops relationships between different anthropometrics and CT image noise to determine appropriate protocol classification schemes. We measured the image noise in 387 CT examinations of pediatric patients (222 boys, 165 girls) of the chest, abdomen, and pelvis and generated mathematic relationships between image noise and patient lateral and anteroposterior dimensions, age, and weight. At the chest level, lateral distance (ld) across the body is strongly correlated with weight (ld = 0.23 × weight + 16.77; R(2) = 0.93) and is less well correlated with age (ld = 1.10 × age + 17.13; R(2) = 0.84). Similar trends were found for anteroposterior dimensions and at the abdomen level. Across all studies, when acquisition-specific parameters are factored out of the noise, the log of image noise was highly correlated with lateral distance (R(2) = 0.72) and weight (R(2) = 0.72) and was less correlated with age (R(2) = 0.62). Following first-order relationships of image noise and scanner technique, plots were formed to show techniques that could achieve matched noise across the pediatric population. Patient lateral distance and weight are essentially equally effective metrics to base maximum technique settings for pediatric patient-specific protocols. These metrics can also be used to help categorize appropriate reference levels for CT technique and size-specific dose estimates across the pediatric population.

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

Hayden, Patrick; Winter, Andreas; Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol BS8 1UB

We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR (Einstein-Podolsky-Rosen) pairs and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. While concentration is known to requiremore » no communication whatsoever, the best known protocol for dilution, discovered by H.-K. Lo and S. Popescu [Phys. Rev. Lett. 83, 1459 (1999)], requires exchange of a number of bits that is of the order of the square root of the number of EPR pairs. Here we prove a matching lower bound of the same asymptotic order, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks. We also discuss states for which the minimal communication cost is proportional to their entanglement, such as the states recently introduced in the context of 'embezzling entanglement' (W. van Dam and P. Hayden, e-print quant-ph/0201041)« less

Constraints on T-Odd, P-Even Interactions from Electric Dipole Moments

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

A. Kurylov; G. C. McLaughlin; M.J. Ramsey-Musolf

2001-03-01

We construct the relationship between nonrenormalizable,effective, time-reversal violating (TV) parity-conserving (PC) interactions of quarks and gauge bosons and various low-energy TVPC and TV parity-violating (PV) observables. Using effective field theory methods, we delineate the scenarios under which experimental limits on permanent electric dipole moments (EDM's) of the electron, neutron, and neutral atoms as well as limits on TVPC observables provide the most stringent bounds on new TVPC interactions. Under scenarios in which parity invariance is restored at short distances, the one-loop EDM of elementary fermions generate the most severe constraints. The limits derived from the atomic EDM of {sup 199}Hgmore » are considerably weaker. When parity symmetry remains broken at short distances, direct TVPC search limits provide the least ambiguous bounds. The direct limits follow from TVPC interactions between two quarks.« less

Constructions for finite-state codes

NASA Technical Reports Server (NTRS)

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

1987-01-01

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

Locality of interactions for planar memristive circuits

DOE PAGES

Caravelli, Francesco

2017-11-08

The dynamics of purely memristive circuits has been shown to depend on a projection operator which expresses the Kirchhoff constraints, is naturally non-local in nature, and does represent the interaction between memristors. In the present paper we show that for the case of planar circuits, for which a meaningful Hamming distance can be defined, the elements of such projector can be bounded by exponentially decreasing functions of the distance. We provide a geometrical interpretation of the projector elements in terms of determinants of Dirichlet Laplacian of the dual circuit. For the case of linearized dynamics of the circuit for whichmore » a solution is known, this can be shown to provide a light cone bound for the interaction between memristors. Furthermore, this result establishes a finite speed of propagation of signals across the network, despite the non-local nature of the system.« less

Recyclable amplification for single-photon entanglement from photon loss and decoherence

NASA Astrophysics Data System (ADS)

Zhou, Lan; Chen, Ling-Quan; Zhong, Wei; Sheng, Yu-Bo

2018-01-01

We put forward a highly efficient recyclable single-photon assisted amplification protocol, which can protect single-photon entanglement (SPE) from photon loss and decoherence. Making use of quantum nondemolition detection gates constructed with the help of cross-Kerr nonlinearity, our protocol has some attractive advantages. First, the parties can recover less-entangled SPE to be maximally entangled SPE, and reduce photon loss simultaneously. Second, if the protocol fails, the parties can repeat the protocol to reuse some discarded items, which can increase the success probability. Third, when the protocol is successful, they can similarly repeat the protocol to further increase the fidelity of the SPE. Thereby, our protocol provides a possible way to obtain high entanglement, high fidelity and high success probability simultaneously. In particular, our protocol shows higher success probability in the practical high photon loss channel. Based on the above features, our amplification protocol has potential for future application in long-distance quantum communication.

Vertical and Horizontal Jump Capacity in International Cerebral Palsy Football Players.

PubMed

Reina, Raúl; Iturricastillo, Aitor; Sabido, Rafael; Campayo-Piernas, Maria; Yanci, Javier

2018-05-01

To evaluate the reliability and validity of vertical and horizontal jump tests in football players with cerebral palsy (FPCP) and to analyze the jump performance differences between current International Federation for Cerebral Palsy Football functional classes (ie, FT5-FT8). A total of 132 international parafootballers (25.8 [6.7] y; 70.0 [9.1] kg; 175.7 [7.3] cm; 22.8 [2.8] kg·m -2 ; and 10.7 [7.5] y training experience) participated in the study. The participants were classified according to the International Federation for Cerebral Palsy Football classification rules, and a group of 39 players without cerebral palsy was included in the study as a control group. Football players' vertical and horizontal jump performance was assessed. All the tests showed good to excellent relative intrasession reliability scores, both in FPCP and in the control group (intraclass correlation = .78-.97, SEM < 10.5%). Significant between-groups differences (P < .001) were obtained in the countermovement jump, standing broad jump, 4 bounds for distance, and triple hop for distance dominant leg and nondominant leg. The control group performed higher/farther jumps with regard to all the FPCP classes, obtaining significant differences and moderate to large effect sizes (ESs) (.85 < ES < 5.54, P < .01). Players in FT8 class (less severe impairments) had significantly higher scores in all the jump tests than players in the lower classes (ES = moderate to large, P < .01). The vertical and horizontal jump tests performed in this study could be applied to the classification procedures and protocols for FPCP.

Synthetic velocity gradient map of the San Francisco Bay region, California, supports use of average block velocities to estimate fault slip rate where effective locking depth is small relative to inter-fault distance

NASA Astrophysics Data System (ADS)

Graymer, R. W.; Simpson, R. W.

2014-12-01

Graymer and Simpson (2013, AGU Fall Meeting) showed that in a simple 2D multi-fault system (vertical, parallel, strike-slip faults bounding blocks without strong material property contrasts) slip rate on block-bounding faults can be reasonably estimated by the difference between the mean velocity of adjacent blocks if the ratio of the effective locking depth to the distance between the faults is 1/3 or less ("effective" locking depth is a synthetic parameter taking into account actual locking depth, fault creep, and material properties of the fault zone). To check the validity of that observation for a more complex 3D fault system and a realistic distribution of observation stations, we developed a synthetic suite of GPS velocities from a dislocation model, with station location and fault parameters based on the San Francisco Bay region. Initial results show that if the effective locking depth is set at the base of the seismogenic zone (about 12-15 km), about 1/2 the interfault distance, the resulting synthetic velocity observations, when clustered, do a poor job of returning the input fault slip rates. However, if the apparent locking depth is set at 1/2 the distance to the base of the seismogenic zone, or about 1/4 the interfault distance, the synthetic velocity field does a good job of returning the input slip rates except where the fault is in a strong restraining orientation relative to block motion or where block velocity is not well defined (for example west of the northern San Andreas Fault where there are no observations to the west in the ocean). The question remains as to where in the real world a low effective locking depth could usefully model fault behavior. Further tests are planned to define the conditions where average cluster-defined block velocities can be used to reliably estimate slip rates on block-bounding faults. These rates are an important ingredient in earthquake hazard estimation, and another tool to provide them should be useful.

A new class of finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2014-02-01

This paper is devoted to investigating the finite-time consensus problem for a multi-agent system in networks with undirected topology. A new class of global continuous time-invariant consensus protocols is constructed for each single-integrator agent dynamics with the aid of Lyapunov functions. In particular, it is shown that the settling time of the proposed new class of finite-time consensus protocols is upper bounded for arbitrary initial conditions. This makes it possible for network consensus problems that the convergence time is designed and estimated offline for a given undirected information flow and a group volume of agents. Finally, a numerical simulation example is presented as a proof of concept.

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

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2016-04-01

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

Continuous-variable quantum authentication of physical unclonable keys: Security against an emulation attack

NASA Astrophysics Data System (ADS)

Nikolopoulos, Georgios M.

2018-01-01

We consider a recently proposed entity authentication protocol in which a physical unclonable key is interrogated by random coherent states of light, and the quadratures of the scattered light are analyzed by means of a coarse-grained homodyne detection. We derive a sufficient condition for the protocol to be secure against an emulation attack in which an adversary knows the challenge-response properties of the key and moreover, he can access the challenges during the verification. The security analysis relies on Holevo's bound and Fano's inequality, and suggests that the protocol is secure against the emulation attack for a broad range of physical parameters that are within reach of today's technology.

Quantum Private Queries

NASA Astrophysics Data System (ADS)

Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo

2008-06-01

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.

Some Protocols For Optical-Fiber Digital Communications

NASA Technical Reports Server (NTRS)

Yeh, Cavour; Gerla, Mario

1989-01-01

One works best in heavy traffic, another, in light traffic. Three protocols proposed for digital communications among stations connected by passive taps to pair of uni-directional optical-fiber buses. Mediate round-robin, bounded-delay access to buses by all stations and particularly suited to fast transmission. Partly because transmission medium passive (no relay stations) and partly because protocols distribute control of network among all stations with provision for addition and deletion of stations (no control stations), communication network able to resist and recover from failures. Implicit token propagates in one direction on one bus and in opposite direction on other bus, minimizing interval of silence between end of one round and beginning of next.

An automated method for modeling proteins on known templates using distance geometry.

PubMed

Srinivasan, S; March, C J; Sudarsanam, S

1993-02-01

We present an automated method incorporated into a software package, FOLDER, to fold a protein sequence on a given three-dimensional (3D) template. Starting with the sequence alignment of a family of homologous proteins, tertiary structures are modeled using the known 3D structure of one member of the family as a template. Homologous interatomic distances from the template are used as constraints. For nonhomologous regions in the model protein, the lower and the upper bounds for the interatomic distances are imposed by steric constraints and the globular dimensions of the template, respectively. Distance geometry is used to embed an ensemble of structures consistent with these distance bounds. Structures are selected from this ensemble based on minimal distance error criteria, after a penalty function optimization step. These structures are then refined using energy optimization methods. The method is tested by simulating the alpha-chain of horse hemoglobin using the alpha-chain of human hemoglobin as the template and by comparing the generated models with the crystal structure of the alpha-chain of horse hemoglobin. We also test the packing efficiency of this method by reconstructing the atomic positions of the interior side chains beyond C beta atoms of a protein domain from a known 3D structure. In both test cases, models retain the template constraints and any additionally imposed constraints while the packing of the interior residues is optimized with no short contacts or bond deformations. To demonstrate the use of this method in simulating structures of proteins with nonhomologous disulfides, we construct a model of murine interleukin (IL)-4 using the NMR structure of human IL-4 as the template. The resulting geometry of the nonhomologous disulfide in the model structure for murine IL-4 is consistent with standard disulfide geometry.

Size distribution and clothing-air partitioning of polycyclic aromatic hydrocarbons generated by barbecue.

PubMed

Lao, Jia-Yong; Wu, Chen-Chou; Bao, Lian-Jun; Liu, Liang-Ying; Shi, Lei; Zeng, Eddy Y

2018-10-15

Barbecue (BBQ) is one of the most popular cooking activities with charcoal worldwide and produces abundant polycyclic aromatic hydrocarbons (PAHs) and particulate matter. Size distribution and clothing-air partitioning of particle-bound PAHs are significant for assessing potential health hazards to humans due to exposure to BBQ fumes, but have not been examined adequately. To address this issue, particle and gaseous samples were collected at 2-m and 10-m distances from a cluster of four BBQ stoves. Personal samplers and cotton clothes were carried by volunteers sitting near the BBQ stoves. Particle-bound PAHs (especially 4-6 rings) derived from BBQ fumes were mostly affiliated with fine particles in the size range of 0.18-1.8 μm. High molecular-weight PAHs were mostly unimodal peaking in fine particles and consequently had small geometric mean diameters and standard deviations. Source diagnostics indicated that particle-bound PAHs in BBQ fumes were generated primarily by combustion of charcoal, fat content in food, and oil. The influences of BBQ fumes on the occurrence of particle-bound PAHs decreased with increasing distance from BBQ stoves, due to increased impacts of ambient sources, especially by petrogenic sources and to a lesser extent by wind speed and direction. Octanol-air and clothing-air partition coefficients of PAHs obtained from personal air samples were significantly correlated to each other. High molecular-weight PAHs had higher area-normalized clothing-air partition coefficients in cotton clothes, i.e., cotton fabrics may be a significant reservoir of higher molecular-weight PAHs. Particle-bound PAHs from barbecue fumes are generated largely from charcoal combustion and food-charred emissions and mainly affiliated with fine particles. Copyright © 2018. Published by Elsevier B.V.

ChIP-chip.

PubMed

Kim, Tae Hoon; Dekker, Job

2018-05-01

ChIP-chip can be used to analyze protein-DNA interactions in a region-wide and genome-wide manner. DNA microarrays contain PCR products or oligonucleotide probes that are designed to represent genomic sequences. Identification of genomic sites that interact with a specific protein is based on competitive hybridization of the ChIP-enriched DNA and the input DNA to DNA microarrays. The ChIP-chip protocol can be divided into two main sections: Amplification of ChIP DNA and hybridization of ChIP DNA to arrays. A large amount of DNA is required to hybridize to DNA arrays, and hybridization to a set of multiple commercial arrays that represent the entire human genome requires two rounds of PCR amplifications. The relative hybridization intensity of ChIP DNA and that of the input DNA is used to determine whether the probe sequence is a potential site of protein-DNA interaction. Resolution of actual genomic sites bound by the protein is dependent on the size of the chromatin and on the genomic distance between the probes on the array. As with expression profiling using gene chips, ChIP-chip experiments require multiple replicates for reliable statistical measure of protein-DNA interactions. © 2018 Cold Spring Harbor Laboratory Press.

Iterative tailoring of optical quantum states with homodyne measurements.

PubMed

Etesse, Jean; Kanseri, Bhaskar; Tualle-Brouri, Rosa

2014-12-01

As they can travel long distances, free space optical quantum states are good candidates for carrying information in quantum information technology protocols. These states, however, are often complex to produce and require protocols whose success probability drops quickly with an increase of the mean photon number. Here we propose a new protocol for the generation and growth of arbitrary states, based on one by one coherent adjunctions of the simple state superposition α|0〉 + β|1〉. Due to the nature of the protocol, which allows for the use of quantum memories, it can lead to high performances.

Application of Intra-Oral Dental Scanners in the Digital Workflow of Implantology

PubMed Central

van der Meer, Wicher J.; Andriessen, Frank S.; Wismeijer, Daniel; Ren, Yijin

2012-01-01

Intra-oral scanners will play a central role in digital dentistry in the near future. In this study the accuracy of three intra-oral scanners was compared. Materials and methods: A master model made of stone was fitted with three high precision manufactured PEEK cylinders and scanned with three intra-oral scanners: the CEREC (Sirona), the iTero (Cadent) and the Lava COS (3M). In software the digital files were imported and the distance between the centres of the cylinders and the angulation between the cylinders was assessed. These values were compared to the measurements made on a high accuracy 3D scan of the master model. Results: The distance errors were the smallest and most consistent for the Lava COS. The distance errors for the Cerec were the largest and least consistent. All the angulation errors were small. Conclusions: The Lava COS in combination with a high accuracy scanning protocol resulted in the smallest and most consistent errors of all three scanners tested when considering mean distance errors in full arch impressions both in absolute values and in consistency for both measured distances. For the mean angulation errors, the Lava COS had the smallest errors between cylinders 1–2 and the largest errors between cylinders 1–3, although the absolute difference with the smallest mean value (iTero) was very small (0,0529°). An expected increase in distance and/or angular errors over the length of the arch due to an accumulation of registration errors of the patched 3D surfaces could be observed in this study design, but the effects were statistically not significant. Clinical relevance For making impressions of implant cases for digital workflows, the most accurate scanner with the scanning protocol that will ensure the most accurate digital impression should be used. In our study model that was the Lava COS with the high accuracy scanning protocol. PMID:22937030

Simulation of devices mobility to estimate wireless channel quality metrics in 5G networks

NASA Astrophysics Data System (ADS)

Orlov, Yu.; Fedorov, S.; Samuylov, A.; Gaidamaka, Yu.; Molchanov, D.

2017-07-01

The problem of channel quality estimation for devices in a wireless 5G network is formulated. As a performance metrics of interest we choose the signal-to-interference-plus-noise ratio, which depends essentially on the distance between the communicating devices. A model with a plurality of moving devices in a bounded three-dimensional space and a simulation algorithm to determine the distances between the devices for a given motion model are devised.

Semihierarchical quantum repeaters based on moderate lifetime quantum memories

NASA Astrophysics Data System (ADS)

Liu, Xiao; Zhou, Zong-Quan; Hua, Yi-Lin; Li, Chuan-Feng; Guo, Guang-Can

2017-01-01

The construction of large-scale quantum networks relies on the development of practical quantum repeaters. Many approaches have been proposed with the goal of outperforming the direct transmission of photons, but most of them are inefficient or difficult to implement with current technology. Here, we present a protocol that uses a semihierarchical structure to improve the entanglement distribution rate while reducing the requirement of memory time to a range of tens of milliseconds. This protocol can be implemented with a fixed distance of elementary links and fixed requirements on quantum memories, which are independent of the total distance. This configuration is especially suitable for scalable applications in large-scale quantum networks.

Detecting many-body-localization lengths with cold atoms

NASA Astrophysics Data System (ADS)

Guo, Xuefei; Li, Xiaopeng

2018-03-01

Considering ultracold atoms in optical lattices, we propose experimental protocols to study many-body-localization (MBL) length and criticality in quench dynamics. Through numerical simulations with exact diagonalization, we show that in the MBL phase the perturbed density profile following a local quench remains exponentially localized in postquench dynamics. The size of this density profile after long-time-dynamics defines a localization length, which tends to diverge at the MBL-to-ergodic transition as we increase the system size. The determined localization transition point agrees with previous exact diagonalization calculations using other diagnostics. Our numerical results provide evidence for violation of the Harris-Chayes bound for the MBL criticality. The critical exponent ν can be extracted from our proposed dynamical procedure, which can then be used directly in experiments to determine whether the Harris-Chayes-bound holds for the MBL transition. These proposed protocols to detect localization criticality are justified by benchmarking to the well-established results for the noninteracting three-dimensional Anderson localization.

Location and magnetic relaxation properties of the stable tyrosine radical in photosystem II.

PubMed

Innes, J B; Brudvig, G W

1989-02-07

Dipolar interactions with neighboring metal ions can cause enhanced spin-lattice relaxation of free radicals. We have applied the theory of dipolar relaxation enhancement and shown that the dependence of the enhanced relaxation on the protein structure surrounding the free radical can be used to obtain distances from the free radical to the protein surface. To test the theoretical predictions, we have examined the effect of added Dy3+ complexes on the microwave power saturation of free radicals in two protein complexes of known structure: myoglobin nitroxide and the reaction center from Rhodobacter sphaeroides. Three cases have been considered: (1) metal ions bound to a specific site, (2) metal ions bound randomly over the protein surface, and (3) metal ions distributed randomly in solution. Only case 3, which assumes no specific binding, gave good agreement between the distances obtained by using the two model systems. The effect of added Dy3+ complexes on the microwave power saturation of signal IIslow from photosystem II (PSII) was used to determine the location of the stable tyrosine radical giving rise to signal IIslow. Assuming that the surface of a membrane-bound protein can be approximated as planar, we have obtained distances from the tyrosine radical to the membrane surface in thylakoids, in PSII membranes, and in Tris-washed PSII membranes. The distances we have determined are in good agreement with those predicted on the basis of a structural homology between the D1 and D2 subunits of PSII and the structurally characterized L and M subunits of the reaction center from purple non-sulfur bacteria. We have also examined the temperature dependence of the microwave power at half-saturation (P1/2) of signal IIslow from 4 to 200 K in dark-adapted PSII membranes. Above 70 K, the P1/2 increases as T2.5, which is consistent with a Raman relaxation mechanism.(ABSTRACT TRUNCATED AT 250 WORDS)

The fate of scattered planets

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

Bromley, Benjamin C.; Kenyon, Scott J., E-mail: bromley@physics.utah.edu, E-mail: skenyon@cfa.harvard.edu

2014-12-01

As gas giant planets evolve, they may scatter other planets far from their original orbits to produce hot Jupiters or rogue planets that are not gravitationally bound to any star. Here, we consider planets cast out to large orbital distances on eccentric, bound orbits through a gaseous disk. With simple numerical models, we show that super-Earths can interact with the gas through dynamical friction to settle in the remote outer regions of a planetary system. Outcomes depend on planet mass, the initial scattered orbit, and the evolution of the time-dependent disk. Efficient orbital damping by dynamical friction requires planets atmore » least as massive as the Earth. More massive, longer-lived disks damp eccentricities more efficiently than less massive, short-lived ones. Transition disks with an expanding inner cavity can circularize orbits at larger distances than disks that experience a global (homologous) decay in surface density. Thus, orbits of remote planets may reveal the evolutionary history of their primordial gas disks. A remote planet with an orbital distance ∼100 AU from the Sun is plausible and might explain correlations in the orbital parameters of several distant trans-Neptunian objects.« less

Real-Time System Verification by Kappa-Induction

NASA Technical Reports Server (NTRS)

Pike, Lee S.

2005-01-01

We report the first formal verification of a reintegration protocol for a safety-critical, fault-tolerant, real-time distributed embedded system. A reintegration protocol increases system survivability by allowing a node that has suffered a fault to regain state consistent with the operational nodes. The protocol is verified in the Symbolic Analysis Laboratory (SAL), where bounded model checking and decision procedures are used to verify infinite-state systems by k-induction. The protocol and its environment are modeled as synchronizing timeout automata. Because k-induction is exponential with respect to k, we optimize the formal model to reduce the size of k. Also, the reintegrator's event-triggered behavior is conservatively modeled as time-triggered behavior to further reduce the size of k and to make it invariant to the number of nodes modeled. A corollary is that a clique avoidance property is satisfied.

Faithful teleportation with partially entangled states

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

Gour, Gilad

2004-10-01

We write explicitly a general protocol for faithful teleportation of a d-state particle (qudit) via a partially entangled pair of (pure) n-state particles. The classical communication cost (CCC) of the protocol is log{sub 2}(nd) bits, and it is implemented by a projective measurement performed by Alice, and a unitary operator performed by Bob (after receiving from Alice the measurement result). We prove the optimality of our protocol by a comparison with the concentrate and teleport strategy. We also show that if d>n/2, or if there is no residual entanglement left after the faithful teleportation, the CCC of any protocol ismore » at least log{sub 2}(nd) bits. Furthermore, we find a lower bound on the CCC in the process transforming one bipartite state to another by means of local operation and classical communication.« less

Advanced teleprocessing systems

NASA Astrophysics Data System (ADS)

Kleinrock, L.; Gerla, M.

1982-09-01

This Annual Technical Report covers research covering the period from October 1, 1981 to September 30, 1982. This contract has three primary designated research areas: packet radio systems, resource sharing and allocation, and distributed processing and control. This report contains abstracts of publications which summarize research results in these areas followed by the main body of the report which is devoted to a study of channel access protocols that are executed by the nodes of a network to schedule their transmissions on multi-access broadcast channel. In particular the main body consists of a Ph.D. dissertation, Channel Access Protocols for Multi-Hop Broadcast Packet Radio Networks. This work discusses some new channel access protocols useful for mobile radio networks. Included is an analysis of slotted ALOHA and some tight bounds on the performance of all possible protocols in a mobile environment.

Sensitivity regularization of the Cramér-Rao lower bound to minimize B1 nonuniformity effects in quantitative magnetization transfer imaging.

PubMed

Boudreau, Mathieu; Pike, G Bruce

2018-05-07

To develop and validate a regularization approach of optimizing B 1 insensitivity of the quantitative magnetization transfer (qMT) pool-size ratio (F). An expression describing the impact of B 1 inaccuracies on qMT fitting parameters was derived using a sensitivity analysis. To simultaneously optimize for robustness against noise and B 1 inaccuracies, the optimization condition was defined as the Cramér-Rao lower bound (CRLB) regularized by the B 1 -sensitivity expression for the parameter of interest (F). The qMT protocols were iteratively optimized from an initial search space, with and without B 1 regularization. Three 10-point qMT protocols (Uniform, CRLB, CRLB+B 1 regularization) were compared using Monte Carlo simulations for a wide range of conditions (e.g., SNR, B 1 inaccuracies, tissues). The B 1 -regularized CRLB optimization protocol resulted in the best robustness of F against B 1 errors, for a wide range of SNR and for both white matter and gray matter tissues. For SNR = 100, this protocol resulted in errors of less than 1% in mean F values for B 1 errors ranging between -10 and 20%, the range of B 1 values typically observed in vivo in the human head at field strengths of 3 T and less. Both CRLB-optimized protocols resulted in the lowest σ F values for all SNRs and did not increase in the presence of B 1 inaccuracies. This work demonstrates a regularized optimization approach for improving the robustness of auxiliary measurements (e.g., B 1 ) sensitivity of qMT parameters, particularly the pool-size ratio (F). Predicting substantially less B 1 sensitivity using protocols optimized with this method, B 1 mapping could even be omitted for qMT studies primarily interested in F. © 2018 International Society for Magnetic Resonance in Medicine.

Multi-site Study of Diffusion Metric Variability: Characterizing the Effects of Site, Vendor, Field Strength, and Echo Time using the Histogram Distance.

PubMed

Helmer, K G; Chou, M-C; Preciado, R I; Gimi, B; Rollins, N K; Song, A; Turner, J; Mori, S

2016-02-27

MRI-based multi-site trials now routinely include some form of diffusion-weighted imaging (DWI) in their protocol. These studies can include data originating from scanners built by different vendors, each with their own set of unique protocol restrictions, including restrictions on the number of available gradient directions, whether an externally-generated list of gradient directions can be used, and restrictions on the echo time (TE). One challenge of multi-site studies is to create a common imaging protocol that will result in a reliable and accurate set of diffusion metrics. The present study describes the effect of site, scanner vendor, field strength, and TE on two common metrics: the first moment of the diffusion tensor field (mean diffusivity, MD), and the fractional anisotropy (FA). We have shown in earlier work that ROI metrics and the mean of MD and FA histograms are not sufficiently sensitive for use in site characterization. Here we use the distance between whole brain histograms of FA and MD to investigate within- and between-site effects. We concluded that the variability of DTI metrics due to site, vendor, field strength, and echo time could influence the results in multi-center trials and that histogram distance is sensitive metrics for each of these variables.

An Enzymatic Treatment of Soil-Bound Prions Effectively Inhibits Replication ▿

PubMed Central

Saunders, Samuel E.; Bartz, Jason C.; Vercauteren, Kurt C.; Bartelt-Hunt, Shannon L.

2011-01-01

Chronic wasting disease (CWD) and scrapie can be transmitted through indirect environmental routes, possibly via soil, and a practical decontamination strategy for prion-contaminated soil is currently unavailable. In the laboratory, an enzymatic treatment under environmentally relevant conditions (22°C, pH 7.4) can degrade soil-bound PrPSc below the limits of Western blot detection. We developed and used a quantitative serial protein misfolding cyclic amplification (PMCA) protocol to characterize the amplification efficiency of treated soil samples relative to controls of known infectious titer. Our results suggest large (104- to >106-fold) decreases in soil-bound prion infectivity following enzyme treatment, demonstrating that a mild enzymatic treatment could effectively reduce the risk of prion disease transmission via soil or other environmental surfaces. PMID:21571886

Security of Distributed-Phase-Reference Quantum Key Distribution

NASA Astrophysics Data System (ADS)

Moroder, Tobias; Curty, Marcos; Lim, Charles Ci Wen; Thinh, Le Phuc; Zbinden, Hugo; Gisin, Nicolas

2012-12-01

Distributed-phase-reference quantum key distribution stands out for its easy implementation with present day technology. For many years, a full security proof of these schemes in a realistic setting has been elusive. We solve this long-standing problem and present a generic method to prove the security of such protocols against general attacks. To illustrate our result, we provide lower bounds on the key generation rate of a variant of the coherent-one-way quantum key distribution protocol. In contrast to standard predictions, it appears to scale quadratically with the system transmittance.

Correlation Decay in Fermionic Lattice Systems with Power-Law Interactions at Nonzero Temperature

NASA Astrophysics Data System (ADS)

Hernández-Santana, Senaida; Gogolin, Christian; Cirac, J. Ignacio; Acín, Antonio

2017-09-01

We study correlations in fermionic lattice systems with long-range interactions in thermal equilibrium. We prove a bound on the correlation decay between anticommuting operators and generalize a long-range Lieb-Robinson-type bound. Our results show that in these systems of spatial dimension D with, not necessarily translation invariant, two-site interactions decaying algebraically with the distance with an exponent α ≥2 D , correlations between such operators decay at least algebraically to 0 with an exponent arbitrarily close to α at any nonzero temperature. Our bound is asymptotically tight, which we demonstrate by a high temperature expansion and by numerically analyzing density-density correlations in the one-dimensional quadratic (free, exactly solvable) Kitaev chain with long-range pairing.

Binary weight distributions of some Reed-Solomon codes

NASA Technical Reports Server (NTRS)

Pollara, F.; Arnold, S.

1992-01-01

The binary weight distributions of the (7,5) and (15,9) Reed-Solomon (RS) codes and their duals are computed using the MacWilliams identities. Several mappings of symbols to bits are considered and those offering the largest binary minimum distance are found. These results are then used to compute bounds on the soft-decoding performance of these codes in the presence of additive Gaussian noise. These bounds are useful for finding large binary block codes with good performance and for verifying the performance obtained by specific soft-coding algorithms presently under development.

Quantum key distribution with passive decoy state selection

NASA Astrophysics Data System (ADS)

Mauerer, Wolfgang; Silberhorn, Christine

2007-05-01

We propose a quantum key distribution scheme which closely matches the performance of a perfect single photon source. It nearly attains the physical upper bound in terms of key generation rate and maximally achievable distance. Our scheme relies on a practical setup based on a parametric downconversion source and present day, nonideal photon-number detection. Arbitrary experimental imperfections which lead to bit errors are included. We select decoy states by classical postprocessing. This allows one to improve the effective signal statistics and achievable distance.

Spatiotemporal correlation buildup after an interaction quench in the Luttinger model

NASA Astrophysics Data System (ADS)

Abeling, Nils O.; Kehrein, Stefan

We study the evolution of density-density correlations at different times and distances in the exactly solvable Luttinger model after a sudden quench from the ground state. We discuss the difference between correlations and susceptibilities, and how these results can be interpreted from the point of view of Lieb-Robinson bounds. For the correlation functions we specifically show that pre-quench entanglement in the ground state leads to algebraically decaying long distance tails outside the light cone.

A protocol for monitoring soft tissue motion under compression garments during drop landings.

PubMed

Mills, Chris; Scurr, Joanna; Wood, Louise

2011-06-03

This study used a single-subject design to establish a valid and reliable protocol for monitoring soft tissue motion under compression garments during drop landings. One male participant performed six 40 cm drop landings onto a force platform, in three compression conditions (none, medium high). Five reflective markers placed on the thigh under the compression garment and five over the garment were filmed using two cameras (1000 Hz). Following manual digitisation, marker coordinates were reconstructed and their resultant displacements and maximum change in separation distance between skin and garment markers were calculated. To determine reliability of marker application, 35 markers were attached to the thigh over the high compression garment and filmed. Markers were then removed and re-applied on three occasions; marker separation and distance to thigh centre of gravity were calculated. Results showed similar ground reaction forces during landing trials. Significant reductions in the maximum change in separation distance between markers from no compression to high compression landings were reported. Typical errors in marker movement under and over the garment were 0.1mm in medium and high compression landings. Re-application of markers showed mean typical errors of 1mm in marker separation and <3mm relative to thigh centre of gravity. This paper presents a novel protocol that demonstrates sufficient sensitivity to detect reductions in soft tissue motion during landings in high compression garments compared to no compression. Additionally, markers placed under or over the garment demonstrate low variance in movement, and the protocol reports good reliability in marker re-application. Copyright © 2011 Elsevier Ltd. All rights reserved.

Effects of Data Replication on Data Exfiltration in Mobile Ad Hoc Networks Utilizing Reactive Protocols

DTIC Science & Technology

2015-03-01

2.5.5 Availability Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 2.6 Simulation Environments...routing scheme can prove problematic. Two prominent proactive protocols, 7 Destination-Sequenced Distance-Vector (DSDV) and Optimized Link State...distributed file management systems such as Tahoe- LAFS as part of its replication scheme . Altman and De Pellegrini [4] examine the impact of FEC and

A multimetric, map-aware routing protocol for VANETs in urban areas.

PubMed

Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Aguilar Igartua, Mónica; Rebollo-Monedero, David; de la Cruz Llopis, Luis J; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

2014-01-28

In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery.

Extended analysis of the Trojan-horse attack in quantum key distribution

NASA Astrophysics Data System (ADS)

Vinay, Scott E.; Kok, Pieter

2018-04-01

The discrete-variable quantum key distribution protocols based on the 1984 protocol of Bennett and Brassard (BB84) are known to be secure against an eavesdropper, Eve, intercepting the flying qubits and performing any quantum operation on them. However, these protocols may still be vulnerable to side-channel attacks. We investigate the Trojan-horse side-channel attack where Eve sends her own state into Alice's apparatus and measures the reflected state to estimate the key. We prove that the separable coherent state is optimal for Eve among the class of multimode Gaussian attack states, even in the presence of thermal noise. We then provide a bound on the secret key rate in the case where Eve may use any separable state.

An Enhanced Reservation-Based MAC Protocol for IEEE 802.15.4 Networks

PubMed Central

Afonso, José A.; Silva, Helder D.; Macedo, Pedro; Rocha, Luis A.

2011-01-01

The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling standard for wireless sensor networks. In order to support applications requiring dedicated bandwidth or bounded delay, it provides a reservation-based scheme named Guaranteed Time Slot (GTS). However, the GTS scheme presents some drawbacks, such as inefficient bandwidth utilization and support to a maximum of only seven devices. This paper presents eLPRT (enhanced Low Power Real Time), a new reservation-based MAC protocol that introduces several performance enhancing features in comparison to the GTS scheme. This MAC protocol builds on top of LPRT (Low Power Real Time) and includes various mechanisms designed to increase data transmission reliability against channel errors, improve bandwidth utilization and increase the number of supported devices. A motion capture system based on inertial and magnetic sensors has been used to validate the protocol. The effectiveness of the performance enhancements introduced by each of the new features is demonstrated through the provision of both simulation and experimental results. PMID:22163826

Robustness of quantum key distribution with discrete and continuous variables to channel noise

NASA Astrophysics Data System (ADS)

Lasota, Mikołaj; Filip, Radim; Usenko, Vladyslav C.

2017-06-01

We study the robustness of quantum key distribution protocols using discrete or continuous variables to the channel noise. We introduce the model of such noise based on coupling of the signal to a thermal reservoir, typical for continuous-variable quantum key distribution, to the discrete-variable case. Then we perform a comparison of the bounds on the tolerable channel noise between these two kinds of protocols using the same noise parametrization, in the case of implementation which is perfect otherwise. Obtained results show that continuous-variable protocols can exhibit similar robustness to the channel noise when the transmittance of the channel is relatively high. However, for strong loss discrete-variable protocols are superior and can overcome even the infinite-squeezing continuous-variable protocol while using limited nonclassical resources. The requirement on the probability of a single-photon production which would have to be fulfilled by a practical source of photons in order to demonstrate such superiority is feasible thanks to the recent rapid development in this field.

Quantum key distribution with an unknown and untrusted source

NASA Astrophysics Data System (ADS)

Zhao, Yi; Qi, Bing; Lo, Hoi-Kwong

2009-03-01

The security of a standard bi-directional ``plug & play'' quantum key distribution (QKD) system has been an open question for a long time. This is mainly because its source is equivalently controlled by an eavesdropper, which means the source is unknown and untrusted. Qualitative discussion on this subject has been made previously. In this paper, we present the first quantitative security analysis on a general class of QKD protocols whose sources are unknown and untrusted. The securities of standard BB84 protocol, weak+vacuum decoy state protocol, and one-decoy decoy state protocol, with unknown and untrusted sources are rigorously proved. We derive rigorous lower bounds to the secure key generation rates of the above three protocols. Our numerical simulation results show that QKD with an untrusted source gives a key generation rate that is close to that with a trusted source. Our work is published in [1]. [4pt] [1] Y. Zhao, B. Qi, and H.-K. Lo, Phys. Rev. A, 77:052327 (2008).

Diphytanyl glycerol ether distributions in sediments of the Orca Basin

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

Pease, T.K.; VanVleet, E.S.; Barre, J.S.

1992-09-01

Archaebacterially produced diphytanyl glycerol ether (DPGE) was examined in core sediments from the Orca Basin, an anoxic hypersaline basin in the northwestern Gulf of Mexico, to observe its spatial variability and potential origin. A differential extraction protocol was employed to quantify the isopranyl glycerol ethers associated with unbound, intermediate-bound, and kerogen-bound lipid fractions. Archaebacterial lipids were evident at all depths for the unbound and intermediate-bound fractions. Concentrations of DPGE ranged from 0.51 to 2.91 [mu]g/g dry sediment at the surface and showed secondary maxima deeper in basin sediments. Intermediate-bound DPGE concentrations exhibited an inverse relationship to unbound DPGE concentrations. Kerogen-boundmore » DPGE concentrations were normally below detection limits. Earlier studies describing the general homogeneity of lipid components within the overlying brine and at the brine/seawater interface suggest that the large-scale sedimentary DPGE variations observed in this study result from spatial and temporal variations in in-situ production by methanogenic or extremely halophilic archaebacteria.« less

Comparison of Cryopreservation Protocols (Single and Two-steps) and Thawing (Fast and Slow) for Canine Sperm.

PubMed

Brito, Maíra M; Lúcio, Cristina F; Angrimani, Daniel S R; Losano, João Diego A; Dalmazzo, Andressa; Nichi, Marcílio; Vannucchi, Camila I

2017-01-02

In addition to the existence of several cryopreservation protocols, no systematic research has been carried out in order to confirm the suitable protocol for canine sperm. This study aims to assess the effect of adding 5% glycerol during cryopreservation at 37°C (one-step) and 5°C (two-steps), in addition of testing two thawing protocols (37°C for 30 seconds, and 70°C for 8 seconds). We used 12 sperm samples divided into four experimental groups: Single-Step - Slow Thawing Group; Two-Step - Slow Thawing Group; Single-Step - Fast Thawing Group; and Two-Step - Fast Thawing Group. Frozen-thawed samples were submitted to automated analysis of sperm motility, evaluation of plasmatic membrane integrity, acrosomal integrity, mitochondrial activity, sperm morphology, sperm susceptibility to oxidative stress, and sperm binding assay to perivitellinic membrane of chicken egg yolk. Considering the comparison between freezing protocols, no statistical differences were verified for any of the response variables. When comparison between thawing protocols was performed, slow thawing protocol presented higher sperm count bound to perivitelline membrane of chicken egg yolk, compared to fast thawing protocol. Regardless of the freezing process, the slow thawing protocol can be recommended for the large scale cryopreservation of canine semen, since it shows a consistent better functional result.

Verification of a Byzantine-Fault-Tolerant Self-stabilizing Protocol for Clock Synchronization

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2008-01-01

This paper presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system except for the presence of sufficient good nodes, thus making the weakest possible assumptions and producing the strongest results. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV). The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space.

Continuous-variable measurement-device-independent quantum key distribution with photon subtraction

NASA Astrophysics Data System (ADS)

Ma, Hong-Xin; Huang, Peng; Bai, Dong-Yun; Wang, Shi-Yu; Bao, Wan-Su; Zeng, Gui-Hua

2018-04-01

It has been found that non-Gaussian operations can be applied to increase and distill entanglement between Gaussian entangled states. We show the successful use of the non-Gaussian operation, in particular, photon subtraction operation, on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol. The proposed method can be implemented based on existing technologies. Security analysis shows that the photon subtraction operation can remarkably increase the maximal transmission distance of the CV-MDI-QKD protocol, which precisely make up for the shortcoming of the original CV-MDI-QKD protocol, and one-photon subtraction operation has the best performance. Moreover, the proposed protocol provides a feasible method for the experimental implementation of the CV-MDI-QKD protocol.

Role of memory errors in quantum repeaters

NASA Astrophysics Data System (ADS)

Hartmann, L.; Kraus, B.; Briegel, H.-J.; Dür, W.

2007-03-01

We investigate the influence of memory errors in the quantum repeater scheme for long-range quantum communication. We show that the communication distance is limited in standard operation mode due to memory errors resulting from unavoidable waiting times for classical signals. We show how to overcome these limitations by (i) improving local memory and (ii) introducing two operational modes of the quantum repeater. In both operational modes, the repeater is run blindly, i.e., without waiting for classical signals to arrive. In the first scheme, entanglement purification protocols based on one-way classical communication are used allowing to communicate over arbitrary distances. However, the error thresholds for noise in local control operations are very stringent. The second scheme makes use of entanglement purification protocols with two-way classical communication and inherits the favorable error thresholds of the repeater run in standard mode. One can increase the possible communication distance by an order of magnitude with reasonable overhead in physical resources. We outline the architecture of a quantum repeater that can possibly ensure intercontinental quantum communication.

Emotional Safety in Outdoor and Experiential Education.

ERIC Educational Resources Information Center

Talbot, Wendy

This paper introduces the concept of emotional safety in outdoor programming. Information and protocols developed by the Canadian Outward Bound Wilderness School are included that outline procedures that staff follow in the event of an "assault" on any student, volunteer, or staff. For clarification, definitions are given for emotional,…

Multiple wavelength interferometry for distance measurements of moving objects with nanometer uncertainty

NASA Astrophysics Data System (ADS)

Kuschmierz, R.; Czarske, J.; Fischer, A.

2014-08-01

Optical measurement techniques offer great opportunities in diverse applications, such as lathe monitoring and microfluidics. Doppler-based interferometric techniques enable simultaneous measurement of the lateral velocity and axial distance of a moving object. However, there is a complementarity between the unambiguous axial measurement range and the uncertainty of the distance. Therefore, we present an extended sensor setup, which provides an unambiguous axial measurement range of 1 mm while achieving uncertainties below 100 nm. Measurements at a calibration system are performed. When using a pinhole for emulating a single scattering particle, the tumbling motion of the rotating object is resolved with a distance uncertainty of 50 nm. For measurements at the rough surface, the distance uncertainty amounts to 280 nm due to a lower signal-to-noise ratio. Both experimental results are close to the respective Cramér-Rao bound, which is derived analytically for both surface and single particle measurements.

3. WALL PAPER MILL, POWER HOUSE, AND MERCHANDISE BUILDING IN ...

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

3. WALL PAPER MILL, POWER HOUSE, AND MERCHANDISE BUILDING IN DISTANCE, PRINTING AND ADVERTISING BUILDING, AND ALLSTATE BUILDING, VIEW TO NORTHWEST - Sears Roebuck & Company Mail Order Plant, Bounded by Lexington & Grenshaw Streets, Kedzie Avenue & Independence Boulevard, Chicago, Cook County, IL

Randomness Amplification under Minimal Fundamental Assumptions on the Devices

NASA Astrophysics Data System (ADS)

Ramanathan, Ravishankar; Brandão, Fernando G. S. L.; Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Wojewódka, Hanna

2016-12-01

Recently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components and in a situation where the violation of a Bell inequality only guarantees that some outcomes of the device for specific inputs exhibit randomness? Here, we solve this question and present a device-independent protocol for randomness amplification of Santha-Vazirani sources using a device consisting of two nonsignaling components. We show that the protocol can amplify any such source that is not fully deterministic into a fully random source while tolerating a constant noise rate and prove the composable security of the protocol against general no-signaling adversaries. Our main innovation is the proof that even the partial randomness certified by the two-party Bell test [a single input-output pair (u* , x* ) for which the conditional probability P (x*|u*) is bounded away from 1 for all no-signaling strategies that optimally violate the Bell inequality] can be used for amplification. We introduce the methodology of a partial tomographic procedure on the empirical statistics obtained in the Bell test that ensures that the outputs constitute a linear min-entropy source of randomness. As a technical novelty that may be of independent interest, we prove that the Santha-Vazirani source satisfies an exponential concentration property given by a recently discovered generalized Chernoff bound.

Megahertz-Rate Semi-Device-Independent Quantum Random Number Generators Based on Unambiguous State Discrimination

NASA Astrophysics Data System (ADS)

Brask, Jonatan Bohr; Martin, Anthony; Esposito, William; Houlmann, Raphael; Bowles, Joseph; Zbinden, Hugo; Brunner, Nicolas

2017-05-01

An approach to quantum random number generation based on unambiguous quantum state discrimination is developed. We consider a prepare-and-measure protocol, where two nonorthogonal quantum states can be prepared, and a measurement device aims at unambiguously discriminating between them. Because the states are nonorthogonal, this necessarily leads to a minimal rate of inconclusive events whose occurrence must be genuinely random and which provide the randomness source that we exploit. Our protocol is semi-device-independent in the sense that the output entropy can be lower bounded based on experimental data and a few general assumptions about the setup alone. It is also practically relevant, which we demonstrate by realizing a simple optical implementation, achieving rates of 16.5 Mbits /s . Combining ease of implementation, a high rate, and a real-time entropy estimation, our protocol represents a promising approach intermediate between fully device-independent protocols and commercial quantum random number generators.

Network Security via Biometric Recognition of Patterns of Gene Expression

NASA Technical Reports Server (NTRS)

Shaw, Harry C.

2016-01-01

Molecular biology provides the ability to implement forms of information and network security completely outside the bounds of legacy security protocols and algorithms. This paper addresses an approach which instantiates the power of gene expression for security. Molecular biology provides a rich source of gene expression and regulation mechanisms, which can be adopted to use in the information and electronic communication domains. Conventional security protocols are becoming increasingly vulnerable due to more intensive, highly capable attacks on the underlying mathematics of cryptography. Security protocols are being undermined by social engineering and substandard implementations by IT (Information Technology) organizations. Molecular biology can provide countermeasures to these weak points with the current security approaches. Future advances in instruments for analyzing assays will also enable this protocol to advance from one of cryptographic algorithms to an integrated system of cryptographic algorithms and real-time assays of gene expression products.

Network Security via Biometric Recognition of Patterns of Gene Expression

NASA Technical Reports Server (NTRS)

Shaw, Harry C.

2016-01-01

Molecular biology provides the ability to implement forms of information and network security completely outside the bounds of legacy security protocols and algorithms. This paper addresses an approach which instantiates the power of gene expression for security. Molecular biology provides a rich source of gene expression and regulation mechanisms, which can be adopted to use in the information and electronic communication domains. Conventional security protocols are becoming increasingly vulnerable due to more intensive, highly capable attacks on the underlying mathematics of cryptography. Security protocols are being undermined by social engineering and substandard implementations by IT organizations. Molecular biology can provide countermeasures to these weak points with the current security approaches. Future advances in instruments for analyzing assays will also enable this protocol to advance from one of cryptographic algorithms to an integrated system of cryptographic algorithms and real-time expression and assay of gene expression products.

Model Checking a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.

DTN routing in body sensor networks with dynamic postural partitioning.

PubMed

Quwaider, Muhannad; Biswas, Subir

2010-11-01

This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

Protocol for evaluating the effects of a therapeutic foot exercise program on injury incidence, foot functionality and biomechanics in long-distance runners: a randomized controlled trial.

PubMed

Matias, Alessandra B; Taddei, Ulisses T; Duarte, Marcos; Sacco, Isabel C N

2016-04-14

Overall performance, particularly in a very popular sports activity such as running, is typically influenced by the status of the musculoskeletal system and the level of training and conditioning of the biological structures. Any change in the musculoskeletal system's biomechanics, especially in the feet and ankles, will strongly influence the biomechanics of runners, possibly predisposing them to injuries. A thorough understanding of the effects of a therapeutic approach focused on feet biomechanics, on strength and functionality of lower limb muscles will contribute to the adoption of more effective therapeutic and preventive strategies for runners. A randomized, prospective controlled and parallel trial with blind assessment is designed to study the effects of a "ground-up" therapeutic approach focused on the foot-ankle complex as it relates to the incidence of running-related injuries in the lower limbs. One hundred and eleven (111) healthy long-distance runners will be randomly assigned to either a control (CG) or intervention (IG) group. IG runners will participate in a therapeutic exercise protocol for the foot-ankle for 8 weeks, with 1 directly supervised session and 3 remotely supervised sessions per week. After the 8-week period, IG runners will keep exercising for the remaining 10 months of the study, supervised only by web-enabled software three times a week. At baseline, 2 months, 4 months and 12 months, all runners will be assessed for running-related injuries (primary outcome), time for the occurrence of the first injury, foot health and functionality, muscle trophism, intrinsic foot muscle strength, dynamic foot arch strain and lower-limb biomechanics during walking and running (secondary outcomes). This is the first randomized clinical trial protocol to assess the effect of an exercise protocol that was designed specifically for the foot-and-ankle complex on running-related injuries to the lower limbs of long-distance runners. We intend to show that the proposed protocol is an innovative and effective approach to decreasing the incidence of injuries. We also expect a lengthening in the time of occurrence of the first injury, an improvement in foot function, an increase in foot muscle mass and strength and beneficial biomechanical changes while running and walking after a year of exercising. Clinicaltrials.gov Identifier NCT02306148 (November 28, 2014) under the name "Effects of Foot Strengthening on the Prevalence of Injuries in Long Distance Runners". Committee of Ethics in Research of the School of Medicine of the University of Sao Paulo (18/03/2015, Protocol # 031/15).

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

Traffic Management for Emergency Vehicle Priority Based on Visual Sensing.

PubMed

Nellore, Kapileswar; Hancke, Gerhard P

2016-11-10

Vehicular traffic is endlessly increasing everywhere in the world and can cause terrible traffic congestion at intersections. Most of the traffic lights today feature a fixed green light sequence, therefore the green light sequence is determined without taking the presence of the emergency vehicles into account. Therefore, emergency vehicles such as ambulances, police cars, fire engines, etc. stuck in a traffic jam and delayed in reaching their destination can lead to loss of property and valuable lives. This paper presents an approach to schedule emergency vehicles in traffic. The approach combines the measurement of the distance between the emergency vehicle and an intersection using visual sensing methods, vehicle counting and time sensitive alert transmission within the sensor network. The distance between the emergency vehicle and the intersection is calculated for comparison using Euclidean distance, Manhattan distance and Canberra distance techniques. The experimental results have shown that the Euclidean distance outperforms other distance measurement techniques. Along with visual sensing techniques to collect emergency vehicle information, it is very important to have a Medium Access Control (MAC) protocol to deliver the emergency vehicle information to the Traffic Management Center (TMC) with less delay. Then only the emergency vehicle is quickly served and can reach the destination in time. In this paper, we have also investigated the MAC layer in WSNs to prioritize the emergency vehicle data and to reduce the transmission delay for emergency messages. We have modified the medium access procedure used in standard IEEE 802.11p with PE-MAC protocol, which is a new back off selection and contention window adjustment scheme to achieve low broadcast delay for emergency messages. A VANET model for the UTMS is developed and simulated in NS-2. The performance of the standard IEEE 802.11p and the proposed PE-MAC is analysed in detail. The NS-2 simulation results have shown that the PE-MAC outperforms the IEEE 802.11p in terms of average end-to-end delay, throughput and energy consumption. The performance evaluation results have proven that the proposed PE-MAC prioritizes the emergency vehicle data and delivers the emergency messages to the TMC with less delay compared to the IEEE 802.11p. The transmission delay of the proposed PE-MAC is also compared with the standard IEEE 802.15.4, and Enhanced Back-off Selection scheme for IEEE 802.15.4 protocol [EBSS, an existing protocol to ensure fast transmission of the detected events on the road towards the TMC] and the comparative results have proven the effectiveness of the PE-MAC over them. Furthermore, this research work will provide an insight into the design of an intelligent urban traffic management system for the effective management of emergency vehicles and will help to save lives and property.

NMR and computational methods applied to the 3- dimensional structure determination of DNA and ligand-DNA complexes in solution

NASA Astrophysics Data System (ADS)

Smith, Jarrod Anson

2D homonuclear 1H NMR methods and restrained molecular dynamics (rMD) calculations have been applied to determining the three-dimensional structures of DNA and minor groove-binding ligand-DNA complexes in solution. The structure of the DNA decamer sequence d(GCGTTAACGC)2 has been solved both with a distance-based rMD protocol and an NOE relaxation matrix backcalculation-based protocol in order to probe the relative merits of the different refinement methods. In addition, three minor groove binding ligand-DNA complexes have been examined. The solution structure of the oligosaccharide moiety of the antitumor DNA scission agent calicheamicin γ1I has been determined in complex with a decamer duplex containing its high affinity 5'-TCCT- 3' binding sequence. The structure of the complex reinforces the belief that the oligosaccharide moiety is responsible for the sequence selective minor-groove binding activity of the agent, and critical intermolecular contacts are revealed. The solution structures of both the (+) and (-) enantiomers of the minor groove binding DNA alkylating agent duocarmycin SA have been determined in covalent complex with the undecamer DNA duplex d(GACTAATTGTC).d(GAC AATTAGTC). The results support the proposal that the alkylation activity of the duocarmycin antitumor antibiotics is catalyzed by a binding-induced conformational change in the ligand which activates the cyclopropyl group for reaction with the DNA. Comparisons between the structures of the two enantiomers covalently bound to the same DNA sequence at the same 5'-AATTA-3 ' site have provided insight into the binding orientation and site selectivity, as well as the relative rates of reactivity of these two agents.

A Multiscale Approach to Modelling Drug Metabolism by Membrane-Bound Cytochrome P450 Enzymes

PubMed Central

Sansom, Mark S. P.; Mulholland, Adrian J.

2014-01-01

Cytochrome P450 enzymes are found in all life forms. P450s play an important role in drug metabolism, and have potential uses as biocatalysts. Human P450s are membrane-bound proteins. However, the interactions between P450s and their membrane environment are not well-understood. To date, all P450 crystal structures have been obtained from engineered proteins, from which the transmembrane helix was absent. A significant number of computational studies have been performed on P450s, but the majority of these have been performed on the solubilised forms of P450s. Here we present a multiscale approach for modelling P450s, spanning from coarse-grained and atomistic molecular dynamics simulations to reaction modelling using hybrid quantum mechanics/molecular mechanics (QM/MM) methods. To our knowledge, this is the first application of such an integrated multiscale approach to modelling of a membrane-bound enzyme. We have applied this protocol to a key human P450 involved in drug metabolism: CYP3A4. A biologically realistic model of CYP3A4, complete with its transmembrane helix and a membrane, has been constructed and characterised. The dynamics of this complex have been studied, and the oxidation of the anticoagulant R-warfarin has been modelled in the active site. Calculations have also been performed on the soluble form of the enzyme in aqueous solution. Important differences are observed between the membrane and solution systems, most notably for the gating residues and channels that control access to the active site. The protocol that we describe here is applicable to other membrane-bound enzymes. PMID:25033460

Formation of 2,4-D bound residues in soils: New insights into microbial metabolism.

PubMed

Botero, Liliana Rocío; Mougin, Chistian; Peñuela, Gustavo; Barriuso, Enrique

2017-04-15

The microbial contribution to the formation of bound residues in soils is studied by characterizing the metabolic activity of three microorganisms (Trametes versicolor, Fusarium solani and Ralstonia eutropha) on 14 C-2,4-dichlorophenoxyacetic acid (2,4-D) during incubation in synthetic liquid media and soil. A fractionation protocol was applied to quantify the 14 C-2,4-D that was incorporated into the biomass among biomolecular-like fractions. Successive fractionation of microbial biomass was implemented to break up and quantify the methanol/dichloromethane fraction (corresponding to the 14 C-lipid-like fraction), the trichloroacetic acid fraction (or hydrolysed 14 C-polysaccharide-like fraction) and the acid hydrolysable fraction (or the hydrolysed 14 C-protein-like fraction). Relevant differences in the 2,4-D degradation and biomass radioactivity distribution among the three microorganisms were found. The 14 C-protein-like fraction was the most consistent biomass fraction for reflecting the pesticide use capacity of the microorganisms under liquid and soil conditions. 2,4-D and its metabolite 4-chlorophenol were detected in methanol/dichloromethane and trichloroacetic acid fractions of the biomass of microorganisms exhibiting a low capacity to mineralize 2,4-D, thus proving that the microbial participation in the formation of bound residues while conserving the initial pesticide structure under natural soil conditions may be intimately associated with the lipid- and polysaccharide-like constituents. The fractionation protocol differentiates between 14 C that is incorporated into biomass as a biomolecular constituent and the pesticide or its metabolites that accumulate in the biomass and thus correspond to the stricto sensu definition of bound residues. Copyright © 2017 Elsevier B.V. All rights reserved.

A multiscale approach to modelling drug metabolism by membrane-bound cytochrome P450 enzymes.

PubMed

Lonsdale, Richard; Rouse, Sarah L; Sansom, Mark S P; Mulholland, Adrian J

2014-07-01

Cytochrome P450 enzymes are found in all life forms. P450s play an important role in drug metabolism, and have potential uses as biocatalysts. Human P450s are membrane-bound proteins. However, the interactions between P450s and their membrane environment are not well-understood. To date, all P450 crystal structures have been obtained from engineered proteins, from which the transmembrane helix was absent. A significant number of computational studies have been performed on P450s, but the majority of these have been performed on the solubilised forms of P450s. Here we present a multiscale approach for modelling P450s, spanning from coarse-grained and atomistic molecular dynamics simulations to reaction modelling using hybrid quantum mechanics/molecular mechanics (QM/MM) methods. To our knowledge, this is the first application of such an integrated multiscale approach to modelling of a membrane-bound enzyme. We have applied this protocol to a key human P450 involved in drug metabolism: CYP3A4. A biologically realistic model of CYP3A4, complete with its transmembrane helix and a membrane, has been constructed and characterised. The dynamics of this complex have been studied, and the oxidation of the anticoagulant R-warfarin has been modelled in the active site. Calculations have also been performed on the soluble form of the enzyme in aqueous solution. Important differences are observed between the membrane and solution systems, most notably for the gating residues and channels that control access to the active site. The protocol that we describe here is applicable to other membrane-bound enzymes.

Model Checking a Byzantine-Fault-Tolerant Self-Stabilizing Protocol for Distributed Clock Synchronization Systems

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2007-01-01

This report presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV) [SMV]. The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space. Also, additional innovative state space reduction techniques are introduced that can be used in future verification efforts applied to this and other protocols.

Leadership Online: Expanding the Horizon

ERIC Educational Resources Information Center

Phelps, Kirstin

2012-01-01

With an increase of online teaching, social media, and use of classroom technology by both location-bound and distance students, how do educators teach and learn leadership through online tools? The International Leadership Association (ILA, 2009) guidelines, specifically the overarching questions for teaching and learning, provide direction in…

X-ray structural characterization of imidazolylcobalamin and histidinylcobalamin: cobalamin models for aquacobalamin bound to the B12 transporter protein transcobalamin.

PubMed

Hannibal, Luciana; Bunge, Scott D; van Eldik, Rudi; Jacobsen, Donald W; Kratky, Christoph; Gruber, Karl; Brasch, Nicola E

2007-04-30

The X-ray structures of imidazolylcobalamin (ImCbl) and histidinylcobalamin (HisCbl) are reported. These structures are of interest given that the recent structures of human and bovine transcobalamin prepared in their holo forms from aquacobalamin show a histidine residue of the metalloprotein bound at the beta-axial site of the cobalamin (Wuerges, J. et al. Proc. Natl. Acad. Sci. U.S.A. 2006, 103, 4386-4391). The beta-axial Co-N bond distances for ImCbl and HisCbl are 1.94(1) and 1.951(7) A, respectively. The alpha-axial Co-N bond distances to the 5,6-dimethylbenzimidazole are 2.01(1) and 1.979(8) A for ImCbl and HisCbl, respectively, and are typical for cobalamins with weak sigma-donor ligands at the beta-axial site. The corrin fold angles of 11.8(3) degrees (ImCbl) and 12.0(3) degrees (HisCbl) are smaller than those typically observed for cobalamins.

On the more accurate channel model and positioning based on time-of-arrival for visible light localization

NASA Astrophysics Data System (ADS)

Amini, Changeez; Taherpour, Abbas; Khattab, Tamer; Gazor, Saeed

2017-01-01

This paper presents an improved propagation channel model for the visible light in indoor environments. We employ this model to derive an enhanced positioning algorithm using on the relation between the time-of-arrivals (TOAs) and the distances for two cases either by assuming known or unknown transmitter and receiver vertical distances. We propose two estimators, namely the maximum likelihood estimator and an estimator by employing the method of moments. To have an evaluation basis for these methods, we calculate the Cramer-Rao lower bound (CRLB) for the performance of the estimations. We show that the proposed model and estimations result in a superior performance in positioning when the transmitter and receiver are perfectly synchronized in comparison to the existing state-of-the-art counterparts. Moreover, the corresponding CRLB of the proposed model represents almost about 20 dB reduction in the localization error bound in comparison with the previous model for some practical scenarios.

Exploiting Uniformly 13C-Labeled Carbohydrates for Probing Carbohydrate-Protein Interactions by NMR Spectroscopy.

PubMed

Nestor, Gustav; Anderson, Taigh; Oscarson, Stefan; Gronenborn, Angela M

2017-05-03

NMR of a uniformly 13 C-labeled carbohydrate was used to elucidate the atomic details of a sugar-protein complex. The structure of the 13 C-labeled Manα(1-2)Manα(1-2)ManαOMe trisaccharide ligand, when bound to cyanovirin-N (CV-N), was characterized and revealed that in the complex the glycosidic linkage torsion angles between the two reducing-end mannoses are different from the free trisaccharide. Distances within the carbohydrate were employed for conformational analysis, and NOE-based distance mapping between sugar and protein revealed that Manα(1-2)Manα(1-2)ManαOMe is bound more intimately with its two reducing-end mannoses into the domain A binding site of CV-N than with the nonreducing end unit. Taking advantage of the 13 C spectral dispersion of 13 C-labeled carbohydrates in isotope-filtered experiments is a versatile means for a simultaneous mapping of the binding interactions on both, the carbohydrate and the protein.

Dark Energy Domination In The Virgocentric Flow

NASA Astrophysics Data System (ADS)

Byrd, Gene; Chernin, A. D.; Karachentsev, I. D.; Teerikorpi, P.; Valtonen, M.; Dolgachev, V. P.; Domozhilova, L. M.

2011-04-01

Dark energy (DE) was first observationally detected at large Gpc distances. If it is a vacuum energy formulated as Einstein's cosmological constant, Λ, DE should also have dynamical effects at much smaller scales. Previously, we found its effects on much smaller Mpc scales in our Local Group (LG) as well as in other nearby groups. We used new HST observations of member 3D distances from the group centers and Doppler shifts. We find each group's gravity dominates a bound central system of galaxies but DE antigravity results in a radial recession increasing with distance from the group center of the outer members. Here we focus on the much larger (but still cosmologically local) Virgo Cluster and systems around it using new observations of velocities and distances. We propose an analytic model whose key parameter is the zero-gravity radius (ZGR) from the cluster center where gravity and DE antigravity balance. DE brings regularity to the Virgocentric flow. Beyond Virgo's 10 Mpc ZGR, the flow curves to approach a linear global Hubble law at larger distances. The Virgo cluster and its outer flow are similar to the Local Group and its local outflow with a scaling factor of about 10; the ZGR for Virgo is 10 times larger than that of the LG. The similarity of the two systems on the scales of 1 to 30 Mpc suggests that a quasi-stationary bound central component and an expanding outflow applies to a wide range of groups and clusters due to small scale action of DE as well as gravity. Chernin, et al 2009 Astronomy and Astrophysics 507, 1271 http://arxiv.org/abs/1006.0066 http://arxiv.org/abs/1006.0555

Search for Gravitational Waves Associated with Gamma-Ray Bursts during the First Advanced LIGO Observing Run and Implications for the Origin of GRB 150906B

NASA Astrophysics Data System (ADS)

Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Ajith, P.; Allen, B.; Allocca, A.; Altin, P. A.; Ananyeva, A.; Anderson, S. B.; Anderson, W. G.; Appert, S.; Arai, K.; Araya, M. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Avila-Alvarez, A.; Babak, S.; Bacon, P.; Bader, M. K. M.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bavigadda, V.; Bazzan, M.; Bécsy, B.; Beer, C.; Bejger, M.; Belahcene, I.; Belgin, M.; Bell, A. S.; Berger, B. K.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Billman, C. R.; Birch, J.; Birney, R.; Birnholtz, O.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blackman, J.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Boer, M.; Bogaert, G.; Bohe, A.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Broida, J. E.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Brunett, S.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Calderón Bustillo, J.; Callister, T. A.; Calloni, E.; Camp, J. B.; Canepa, M.; Cannon, K. C.; Cao, H.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Casanueva Diaz, J.; Casentini, C.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Cerboni Baiardi, L.; Cerretani, G.; Cesarini, E.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Cheeseboro, B. D.; Chen, H. Y.; Chen, Y.; Cheng, H.-P.; Chincarini, A.; Chiummo, A.; Chmiel, T.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, A. J. K.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Cocchieri, C.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C. G.; Cominsky, L.; Constancio, M., Jr.; Conti, L.; Cooper, S. J.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J.-P.; Countryman, S. T.; Couvares, P.; Covas, P. B.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cullen, T. J.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Dálya, G.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dasgupta, A.; Da Silva Costa, C. F.; Dattilo, V.; Dave, I.; Davier, M.; Davies, G. S.; Davis, D.; Daw, E. J.; Day, B.; Day, R.; De, S.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Devenson, J.; Devine, R. C.; Dhurandhar, S.; Díaz, M. C.; Di Fiore, L.; Di Giovanni, M.; Di Girolamo, T.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Virgilio, A.; Doctor, Z.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dorrington, I.; Douglas, R.; Dovale Álvarez, M.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Eisenstein, R. A.; Essick, R. C.; Etienne, Z.; Etzel, T.; Evans, M.; Evans, T. M.; Everett, R.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Farinon, S.; Farr, B.; Farr, W. M.; Fauchon-Jones, E. J.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Fernández Galiana, A.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fong, H.; Forsyth, S. S.; Fournier, J.-D.; Frasca, S.; Frasconi, F.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fries, E. M.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H.; Gadre, B. U.; Gaebel, S. M.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S. G.; Garufi, F.; Gaur, G.; Gayathri, V.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; George, J.; Gergely, L.; Germain, V.; Ghonge, S.; Ghosh, Abhirup; Ghosh, A.; Ghosh, Archisman; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glaefke, A.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gonzalez Castro, J. M.; Gopakumar, A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Grado, A.; Graef, C.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hacker, J. J.; Hall, B. R.; Hall, E. D.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Healy, J.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Henry, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hofman, D.; Holt, K.; Holz, D. E.; Hopkins, P.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Indik, N.; Ingram, D. R.; Inta, R.; Isa, H. N.; Isac, J.-M.; Isi, M.; Isogai, T.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; Junker, J.; Kalaghatgi, C. V.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karki, S.; Karvinen, K. S.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kaur, T.; Kawabe, K.; Kéfélian, F.; Keitel, D.; Kelley, D. B.; Kennedy, R.; Key, J. S.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, Chunglee; Kim, J. C.; Kim, Whansun; Kim, W.; Kim, Y.-M.; Kimbrell, S. J.; King, E. J.; King, P. J.; Kirchhoff, R.; Kissel, J. S.; Klein, B.; Kleybolte, L.; Klimenko, S.; Koch, P.; Koehlenbeck, S. M.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Krämer, C.; Kringel, V.; Krishnan, B.; Królak, A.; Kuehn, G.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Lackey, B. D.; Landry, M.; Lang, R. N.; Lange, J.; Lantz, B.; Lanza, R. K.; Lartaux-Vollard, A.; Lasky, P. D.; Laxen, M.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, K.; Lehmann, J.; Lenon, A.; Leonardi, M.; Leong, J. R.; Leroy, N.; Letendre, N.; Levin, Y.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Liu, J.; Lockerbie, N. A.; Lombardi, A. L.; London, L. T.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lovelace, G.; Lück, H.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macfoy, S.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magaña-Sandoval, F.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martynov, D. V.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Mastrogiovanni, S.; Matichard, F.; Matone, L.; Mavalvala, N.; Mazumder, N.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McGrath, C.; McGuire, S. C.; McIntyre, G.; McIver, J.; McManus, D. J.; McRae, T.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Melatos, A.; Mendell, G.; Mendoza-Gandara, D.; Mercer, R. A.; Merilh, E. L.; Merzougui, M.; Meshkov, S.; Messenger, C.; Messick, C.; Metzdorff, R.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, A. L.; Miller, A.; Miller, B. B.; Miller, J.; Millhouse, M.; Minenkov, Y.; Ming, J.; Mirshekari, S.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mours, B.; Mow-Lowry, C. M.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Muniz, E. A. M.; Murray, P. G.; Mytidis, A.; Napier, K.; Nardecchia, I.; Naticchioni, L.; Nelemans, G.; Nelson, T. J. N.; Neri, M.; Nery, M.; Neunzert, A.; Newport, J. M.; Newton, G.; Nguyen, T. T.; Nielsen, A. B.; Nissanke, S.; Nitz, A.; Noack, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Overmier, H.; Owen, B. J.; Pace, A. E.; Page, J.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perez, C. J.; Perreca, A.; Perri, L. M.; Pfeiffer, H. P.; Phelps, M.; Piccinni, O. J.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poe, M.; Poggiani, R.; Popolizio, P.; Post, A.; Powell, J.; Prasad, J.; Pratt, J. W. W.; Predoi, V.; Prestegard, T.; Prijatelj, M.; Principe, M.; Privitera, S.; Prodi, G. A.; Prokhorov, L. G.; Puncken, O.; Punturo, M.; Puppo, P.; Pürrer, M.; Qi, H.; Qin, J.; Qiu, S.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rajan, C.; Rakhmanov, M.; Rapagnani, P.; Raymond, V.; Razzano, M.; Re, V.; Read, J.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Rhoades, E.; Ricci, F.; Riles, K.; Rizzo, M.; Robertson, N. A.; Robie, R.; Robinet, F.; Rocchi, A.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, R.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Sakellariadou, M.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sampson, L. M.; Sanchez, E. J.; Sandberg, V.; Sanders, J. R.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O.; Savage, R. L.; Sawadsky, A.; Schale, P.; Scheuer, J.; Schmidt, E.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schönbeck, A.; Schreiber, E.; Schuette, D.; Schwalbe, S. G.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Setyawati, Y.; Shaddock, D. A.; Shaffer, T. J.; Shahriar, M. S.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sieniawska, M.; Sigg, D.; Silva, A. D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, B.; Smith, J. R.; Smith, R. J. E.; Son, E. J.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Spencer, A. P.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stevenson, S. P.; Stone, R.; Strain, K. A.; Straniero, N.; Stratta, G.; Strigin, S. E.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sunil, S.; Sutton, P. J.; Swinkels, B. L.; Szczepańczyk, M. J.; Szolgyen, A.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tápai, M.; Taracchini, A.; Taylor, R.; Theeg, T.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thrane, E.; Tippens, T.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Toland, K.; Tomlinson, C.; Tonelli, M.; Tornasi, Z.; Torrie, C. I.; Töyrä, D.; Travasso, F.; Traylor, G.; Trifirò, D.; Trinastic, J.; Tringali, M. C.; Trozzo, L.; Tse, M.; Tso, R.; Turconi, M.; Tuyenbayev, D.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahlbruch, H.; Vajente, G.; Valdes, G.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Varma, V.; Vass, S.; Vasúth, M.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Venugopalan, G.; Verkindt, D.; Vetrano, F.; Viceré, A.; Viets, A. D.; Vinciguerra, S.; Vine, D. J.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D. V.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, M.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Watchi, J.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Weßels, P.; Westphal, T.; Wette, K.; Whelan, J. T.; Whiting, B. F.; Whittle, C.; Williams, D.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wittel, H.; Woan, G.; Woehler, J.; Worden, J.; Wright, J. L.; Wu, D. S.; Wu, G.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yap, M. J.; Yu, Hang; Yu, Haocun; Yvert, M.; Zadrożny, A.; Zangrando, L.; Zanolin, M.; Zendri, J.-P.; Zevin, M.; Zhang, L.; Zhang, M.; Zhang, T.; Zhang, Y.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, X. J.; Zucker, M. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration; Aptekar, R. L.; Frederiks, D. D.; Golenetskii, S. V.; Golovin, D. V.; Hurley, K.; Litvak, M. L.; Mitrofanov, I. G.; Rau, A.; Sanin, A. B.; Svinkin, D. S.; von Kienlin, A.; Zhang, X.; IPN Collaboration

2017-06-01

We present the results of the search for gravitational waves (GWs) associated with γ-ray bursts detected during the first observing run of the Advanced Laser Interferometer Gravitational-Wave Observatory (LIGO). We find no evidence of a GW signal for any of the 41 γ-ray bursts for which LIGO data are available with sufficient duration. For all γ-ray bursts, we place lower bounds on the distance to the source using the optimistic assumption that GWs with an energy of {10}-2{M}⊙ {c}2 were emitted within the 16-500 Hz band, and we find a median 90% confidence limit of 71 Mpc at 150 Hz. For the subset of 19 short/hard γ-ray bursts, we place lower bounds on distance with a median 90% confidence limit of 90 Mpc for binary neutron star (BNS) coalescences, and 150 and 139 Mpc for neutron star-black hole coalescences with spins aligned to the orbital angular momentum and in a generic configuration, respectively. These are the highest distance limits ever achieved by GW searches. We also discuss in detail the results of the search for GWs associated with GRB 150906B, an event that was localized by the InterPlanetary Network near the local galaxy NGC 3313, which is at a luminosity distance of 54 Mpc (z = 0.0124). Assuming the γ-ray emission is beamed with a jet half-opening angle ≤slant 30^\\circ , we exclude a BNS and a neutron star-black hole in NGC 3313 as the progenitor of this event with confidence >99%. Further, we exclude such progenitors up to a distance of 102 Mpc and 170 Mpc, respectively.

Multi-site Study of Diffusion Metric Variability: Characterizing the Effects of Site, Vendor, Field Strength, and Echo Time using the Histogram Distance

PubMed Central

Helmer, K. G.; Chou, M-C.; Preciado, R. I.; Gimi, B.; Rollins, N. K.; Song, A.; Turner, J.; Mori, S.

2016-01-01

MRI-based multi-site trials now routinely include some form of diffusion-weighted imaging (DWI) in their protocol. These studies can include data originating from scanners built by different vendors, each with their own set of unique protocol restrictions, including restrictions on the number of available gradient directions, whether an externally-generated list of gradient directions can be used, and restrictions on the echo time (TE). One challenge of multi-site studies is to create a common imaging protocol that will result in a reliable and accurate set of diffusion metrics. The present study describes the effect of site, scanner vendor, field strength, and TE on two common metrics: the first moment of the diffusion tensor field (mean diffusivity, MD), and the fractional anisotropy (FA). We have shown in earlier work that ROI metrics and the mean of MD and FA histograms are not sufficiently sensitive for use in site characterization. Here we use the distance between whole brain histograms of FA and MD to investigate within- and between-site effects. We concluded that the variability of DTI metrics due to site, vendor, field strength, and echo time could influence the results in multi-center trials and that histogram distance is sensitive metrics for each of these variables. PMID:27350723

Protocol for a Delay-Tolerant Data-Communication Network

NASA Technical Reports Server (NTRS)

Torgerson, Jordan; Hooke, Adrian; Burleigh, Scott; Fall, Kevin

2004-01-01

As its name partly indicates, the Delay-Tolerant Networking (DTN) Bundle Protocol is a protocol for delay-tolerant transmission of data via communication networks. This protocol was conceived as a result of studies of how to adapt Internet protocols so that Internet-like services could be provided across interplanetary distances in support of deep-space exploration. The protocol, and software to implement the protocol, is being developed in collaboration among experts at NASA's Jet Propulsion Laboratory and other institutions. No current Internet protocols can accommodate long transmission delay times or intermittent link connectivity. The DTN Bundle Protocol represents a departure from the standard Internet assumption that a continuous path is available from a host computer to a client computer: It provides for routing of data through networks that may be disjointed and may be characterized by long transmission delays. In addition to networks that include deepspace communication links, examples of such networks include terrestrial ones within which branches are temporarily disconnected. The protocol is based partly on the definition of a message-based overlay above the transport layers of the networks on which it is hosted.

A Routing Protocol for Packet Radio Networks

DTIC Science & Technology

1995-01-01

table of node K is a matrix containing, for each destination L and each neighbor of K (say M ), the distance to L ( NEOPRQ ) and the predecessor ( S OP Q...identifier T The distance to the destination ( N OP ) T The predecessor of the shortest path chosen toward L ( S OP ) T The successor ( U OP ) of the shortest...P and the predecessor is updated as S OP À ¾ S Q P . Thus, a node can determine whether or not an update received from M affects its other distance

Detection of proteins on blot transfer membranes.

PubMed

Sasse, Joachim; Gallagher, Sean R

2003-11-01

In the basic and alternate protocols of this unit, proteins are stained after electroblotting from polyacrylamide gels to blot transfer membranes. If the samples of interest are electrophoresed in duplicate and transferred to a blot transfer membrane, half of the membrane can be stained to determine the efficiency of transfer to the membrane and the other half can be used for immunoblotting (i.e., western blotting). Detection limits of each staining method are given along with a list of compatible blot transfer membranes and gels. A support protocol describes a method for alkali treatment that enhances subsequent staining of bound proteins.

Fast casual multicast

NASA Technical Reports Server (NTRS)

Birman, Kenneth; Schiper, Andre; Stephenson, Pat

1990-01-01

A new protocol is presented that efficiently implements a reliable, causally ordered multicast primitive and is easily extended into a totally ordered one. Intended for use in the ISIS toolkit, it offers a way to bypass the most costly aspects of ISIS while benefiting from virtual synchrony. The facility scales with bounded overhead. Measured speedups of more than an order of magnitude were obtained when the protocol was implemented within ISIS. One conclusion is that systems such as ISIS can achieve performance competitive with the best existing multicast facilities--a finding contradicting the widespread concern that fault-tolerance may be unacceptably costly.

The effect of personalized versus standard patient protocols for radiostereometric analysis (RSA).

PubMed

Muharemovic, O; Troelsen, A; Thomsen, M G; Kallemose, T; Gosvig, K K

2018-05-01

Increasing pressure in the clinic requires a more standardized approach to radiostereometric analysis (RSA) imaging. The aim of this study was to investigate whether implementation of personalized RSA patient protocols could increase image quality and decrease examination time and the number of exposure repetitions. Forty patients undergoing primary total hip arthroplasty were equally randomized to either a case or a control group. Radiographers in the case group were assisted by personalized patient protocols containing information about each patient's post-operative RSA imaging. Radiographers in the control group used a standard RSA protocol. At three months, radiographers in the case group significantly reduced (p < 0.001) the number of exposures by 1.6, examination time with 19.2 min, and distance between centrum of prosthesis and centrum of calibration field with 34.1 mm when compared to post-operative (baseline) results. At twelve months, the case group significantly reduced (p < 0.001) number of exposures by two, examination time with 22.5 min, and centrum of prosthesis to centrum of calibration field distance with 43.1 mm when compared to baseline results. No significant improvements were found in the control group at any time point. There is strong evidence that personalized RSA patient protocols have a positive effect on image quality and radiation dose savings. Implementation of personal patient protocols as a RSA standard will contribute to the reduction of examination time, thus ensuring a cost benefit for department and patient safety. Copyright © 2017 The College of Radiographers. Published by Elsevier Ltd. All rights reserved.

Acromiohumeral Distance and 3-Dimensional Scapular Position Change After Overhead Muscle Fatigue

PubMed Central

Maenhout, Annelies; Dhooge, Famke; Van Herzeele, Maarten; Palmans, Tanneke; Cools, Ann

2015-01-01

Context: Muscle fatigue due to repetitive and prolonged overhead sports activity is considered an important factor contributing to impingement-related rotator cuff pathologic conditions in overhead athletes. The evidence on scapular and glenohumeral kinematic changes after fatigue is contradicting and prohibits conclusions about how shoulder muscle fatigue affects acromiohumeral distance. Objective: To investigate the effect of a fatigue protocol resembling overhead sports activity on acromiohumeral distance and 3-dimensional scapular position in overhead athletes. Design: Cross-sectional study. Setting: Institutional laboratory. Patients or Other Participants: A total of 29 healthy recreational overhead athletes (14 men, 15 women; age = 22.23 ± 2.82 years, height = 178.3 ± 7.8 cm, mass = 71.6 ± 9.5 kg). Intervention(s) The athletes were tested before and after a shoulder muscle-fatiguing protocol. Main Outcome Measure(s) Acromiohumeral distance was measured using ultrasound, and scapular position was determined with an electromagnetic motion-tracking system. Both measurements were performed at 3 elevation positions (0°, 45°, and 60° of abduction). We used a 3-factor mixed model for data analysis. Results: After fatigue, the acromiohumeral distance increased when the upper extremity was actively positioned at 45° (Δ = 0.78 ± 0.24 mm, P = .002) or 60° (Δ = 0.58 ± 0.23 mm, P = .02) of abduction. Scapular position changed after fatigue to a more externally rotated position at 45° (Δ = 4.97° ± 1.13°, P < .001) and 60° (Δ = 4.61° ± 1.90°, P = .001) of abduction, a more upwardly rotated position at 45° (Δ = 6.10° ± 1.30°, P < .001) and 60° (Δ = 7.20° ± 1.65°, P < .001) of abduction, and a more posteriorly tilted position at 0°, 45°, and 60° of abduction (Δ = 1.98° ± 0.41°, P < .001). Conclusions: After a fatiguing protocol, we found changes in acromiohumeral distance and scapular position that corresponded with an impingement-sparing situation. PMID:25594913

Optimality of Gaussian attacks in continuous-variable quantum cryptography.

PubMed

Navascués, Miguel; Grosshans, Frédéric; Acín, Antonio

2006-11-10

We analyze the asymptotic security of the family of Gaussian modulated quantum key distribution protocols for continuous-variables systems. We prove that the Gaussian unitary attack is optimal for all the considered bounds on the key rate when the first and second momenta of the canonical variables involved are known by the honest parties.

Security bound of cheat sensitive quantum bit commitment.

PubMed

He, Guang Ping

2015-03-23

Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the sender's committed bit before it is unveiled, while his cheating can pass the security check with a probability not less than 50%. The sender's cheating is also studied. The optimal CSQBC protocols that can minimize the sum of the cheating probabilities of both parties are found to be trivial, as they are practically useless. We also discuss the possibility of building a fair protocol in which both parties can cheat with equal probabilities.

Humidity control as a strategy for lattice optimization applied to crystals of HLA-A*1101 complexed with variant peptides from dengue virus

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

Chotiyarnwong, Pojchong; Medical Molecular Biology Unit, Faculty of Medicine, Siriraj Hospital, Mahidol University; Stewart-Jones, Guillaume B.

Crystals of an MHC class I molecule bound to naturally occurring peptide variants from the dengue virus NS3 protein contained high levels of solvent and required optimization of cryoprotectant and dehydration protocols for each complex to yield well ordered diffraction, a process facilitated by the use of a free-mounting system. T-cell recognition of the antigenic peptides presented by MHC class I molecules normally triggers protective immune responses, but can result in immune enhancement of disease. Cross-reactive T-cell responses may underlie immunopathology in dengue haemorrhagic fever. To analyze these effects at the molecular level, the functional MHC class I molecule HLA-A*1101more » was crystallized bound to six naturally occurring peptide variants from the dengue virus NS3 protein. The crystals contained high levels of solvent and required optimization of the cryoprotectant and dehydration protocols for each complex to yield well ordered diffraction, a process that was facilitated by the use of a free-mounting system.« less

On Wiener polarity index of bicyclic networks.

PubMed

Ma, Jing; Shi, Yongtang; Wang, Zhen; Yue, Jun

2016-01-11

Complex networks are ubiquitous in biological, physical and social sciences. Network robustness research aims at finding a measure to quantify network robustness. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks. Wiener type indices are known to depend both on the network's number of nodes and topology. The Wiener polarity index is also related to the cluster coefficient of networks. In this paper, based on some graph transformations, we determine the sharp upper bound of the Wiener polarity index among all bicyclic networks. These bounds help to understand the underlying quantitative graph measures in depth.

Analysis of calcium-induced conformational changes in calcium-binding allergens and quantitative determination of their IgE binding properties.

PubMed

Parody, Nuria; Fuertes, Miguel Angel; Alonso, Carlos; Pico de Coaña, Yago

2013-01-01

The polcalcin family is one of the most epidemiologically relevant families of calcium-binding allergens. Polcalcins are potent plant allergens that contain one or several EF-hand motifs and their allergenicity is primarily associated with the Ca(2+)-bound form of the protein. Conformation, stability, as well as IgE recognition of calcium-binding allergens greatly depend on the presence of protein-bound calcium ions. We describe a protocol that uses three techniques (SDS-PAGE, circular dichroism spectroscopy, and ELISA) to describe the effects that calcium has on the structural changes in an allergen and its IgE binding properties.

156 Mbps Ultrahigh-Speed Wireless LAN Prototype in the 38 GHz Band

NASA Astrophysics Data System (ADS)

Wu, Gang; Inoue, Masugi; Murakami, Homare; Hase, Yoshihiro

2001-12-01

This paper describes a 156 Mbps ultrahigh-speed wireless LAN operating in the 38 GHz millimeter (mm)-wave band. The system is a third prototype developed at the Communications Research Laboratory since 1998. Compared with the previous prototypes, the system is faster (156 Mbps) and smaller (volume of radio transceiver less than 1000 cc), it has a larger service area (two overlapping basic service sets), and a longer transmission distance (the protocol can support a distance of more than two hundred meters). The development is focused on the physical layer and the data link control layer, and thus a GMSK-based mm-wave transceiver and an enhanced RS-ISMA (reservation-based slotted idle signal multiple access) protocol are key development components. This paper describes the prototype system's design, configuration, and implementation.

Performance evaluation of reactive and proactive routing protocol in IEEE 802.11 ad hoc network

NASA Astrophysics Data System (ADS)

Hamma, Salima; Cizeron, Eddy; Issaka, Hafiz; Guédon, Jean-Pierre

2006-10-01

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show the appropriate routing protocol for two kinds of communication services (data and voice).

Characterization of lithium coordination sites with magic-angle spinning NMR

NASA Astrophysics Data System (ADS)

Haimovich, A.; Goldbourt, A.

2015-05-01

Lithium, in the form of lithium carbonate, is one of the most common drugs for bipolar disorder. Lithium is also considered to have an effect on many other cellular processes hence it possesses additional therapeutic as well as side effects. In order to quantitatively characterize the binding mode of lithium, it is required to identify the interacting species and measure their distances from the metal center. Here we use magic-angle spinning (MAS) solid-state NMR to study the binding site of lithium in complex with glycine and water (LiGlyW). Such a compound is a good enzyme mimetic since lithium is four-coordinated to one water molecule and three carboxylic groups. Distance measurements to carbons are performed using a 2D transferred echo double resonance (TEDOR) MAS solid-state NMR experiment, and water binding is probed by heteronuclear high-resolution proton-lithium and proton-carbon correlation (wPMLG-HETCOR) experiments. Both HETCOR experiments separate the main complex from impurities and non-specifically bound lithium species, demonstrating the sensitivity of the method to probe the species in the binding site. Optimizations of the TEDOR pulse scheme in the case of a quadrupolar nucleus with a small quadrupole coupling constant show that it is most efficient when pulses are positioned on the spin-1/2 (carbon-13) nucleus. Since the intensity of the TEDOR signal is not normalized, careful data analysis that considers both intensity and dipolar oscillations has to be performed. Nevertheless we show that accurate distances can be extracted for both carbons of the bound glycine and that these distances are consistent with the X-ray data and with lithium in a tetrahedral environment. The lithium environment in the complex is very similar to the binding site in inositol monophosphatase, an enzyme associated with bipolar disorder and the putative target for lithium therapy. A 2D TEDOR experiment applied to the bacterial SuhB gene product of this enzyme was designed to probe direct correlations between lithium, the enzyme inhibitor, and the closest carboxyl carbons of the binding site. At this point, the chemical shift of the bound carboxyl groups in this 29 kDa enzyme could be determined.

Pre-polishing on a CNC platform with bound abrasive contour tools

NASA Astrophysics Data System (ADS)

Schoeffer, Adrienne E.

2003-05-01

Deterministic micorgrinding (DMG) of optical glasses and ceramics is the commercial manufacturing process of choice to shape glass surfaces prior to final finishing. This process employs rigid bound matrix diamond tooling resulting in surface roughness values of 3-51.tm peak to valley and 100-400nm rms, as well as mid-spatial frequency tool marks that require subsequent removal in secondary finishing steps. The ability to pre-polish optical surfaces within the grinding platform would reduce final finishing process times. Bound abrasive contour wheels containing cerium oxide, alumina or zirconia abrasives were constructed with an epoxy matrix. The effects of abrasive type, composition, and erosion promoters were examined for tool hardness (Shore D), and tested with commercial optical glasses in an OptiproTM CNC grinding platform. Metrology protocols were developed to examine tool wear and subsequent surface roughness. Work is directed to demonstrating effective material removal, improved surface roughness and cutter mark removal.

Prepolishing on a CNC platform with bound abrasive contour tools

NASA Astrophysics Data System (ADS)

Schoeffler, Adrienne E.; Gregg, Leslie L.; Schoen, John M.; Fess, Edward M.; Hakiel, Michael; Jacobs, Stephen D.

2003-05-01

Deterministic microgrinding (DMG) of optical glasses and ceramics is the commercial manufacturing process of choice to shape glass surfaces prior to final finishing. This process employs rigid bound matrix diamond tooling resulting in surface roughness values of 3-5μm peak to valley and 100-400nm rms, as well as mid-spatial frequency tool marks that require subsequent removal in secondary finishing steps. The ability to pre-polish optical surfaces within the grinding platform would reduce final finishing process times. Bound abrasive contour wheels containing cerium oxide, alumina or zirconia abrasives were constructed with an epoxy matrix. The effects of abrasive type, composition, and erosion promoters were examined for tool hardness (Shore D), and tested with commercial optical glasses in an Optipro CNC grinding platform. Metrology protocols were developed to examine tool wear and subsequent surface roughness. Work is directed to demonstrating effective material removal, improved surface roughness and cutter mark removal.

Quantum discord bounds the amount of distributed entanglement.

PubMed

Chuan, T K; Maillard, J; Modi, K; Paterek, T; Paternostro, M; Piani, M

2012-08-17

The ability to distribute quantum entanglement is a prerequisite for many fundamental tests of quantum theory and numerous quantum information protocols. Two distant parties can increase the amount of entanglement between them by means of quantum communication encoded in a carrier that is sent from one party to the other. Intriguingly, entanglement can be increased even when the exchanged carrier is not entangled with the parties. However, in light of the defining property of entanglement stating that it cannot increase under classical communication, the carrier must be quantum. Here we show that, in general, the increase of relative entropy of entanglement between two remote parties is bounded by the amount of nonclassical correlations of the carrier with the parties as quantified by the relative entropy of discord. We study implications of this bound, provide new examples of entanglement distribution via unentangled states, and put further limits on this phenomenon.

Three-party authenticated key agreements for optimal communication

PubMed Central

Lee, Tian-Fu; Hwang, Tzonelih

2017-01-01

Authenticated key agreements enable users to determine session keys, and to securely communicate with others over an insecure channel via the session keys. This study investigates the lower bounds on communications for three-party authenticated key agreements and considers whether or not the sub-keys for generating a session key can be revealed in the channel. Since two clients do not share any common secret key, they require the help of the server to authenticate their identities and exchange confidential and authenticated information over insecure networks. However, if the session key security is based on asymmetric cryptosystems, then revealing the sub-keys cannot compromise the session key. The clients can directly exchange the sub-keys and reduce the transmissions. In addition, authenticated key agreements were developed by using the derived results of the lower bounds on communications. Compared with related approaches, the proposed protocols had fewer transmissions and realized the lower bounds on communications. PMID:28355253

A Hierarchical Algorithm for Fast Debye Summation with Applications to Small Angle Scattering

PubMed Central

Gumerov, Nail A.; Berlin, Konstantin; Fushman, David; Duraiswami, Ramani

2012-01-01

Debye summation, which involves the summation of sinc functions of distances between all pair of atoms in three dimensional space, arises in computations performed in crystallography, small/wide angle X-ray scattering (SAXS/WAXS) and small angle neutron scattering (SANS). Direct evaluation of Debye summation has quadratic complexity, which results in computational bottleneck when determining crystal properties, or running structure refinement protocols that involve SAXS or SANS, even for moderately sized molecules. We present a fast approximation algorithm that efficiently computes the summation to any prescribed accuracy ε in linear time. The algorithm is similar to the fast multipole method (FMM), and is based on a hierarchical spatial decomposition of the molecule coupled with local harmonic expansions and translation of these expansions. An even more efficient implementation is possible when the scattering profile is all that is required, as in small angle scattering reconstruction (SAS) of macromolecules. We examine the relationship of the proposed algorithm to existing approximate methods for profile computations, and show that these methods may result in inaccurate profile computations, unless an error bound derived in this paper is used. Our theoretical and computational results show orders of magnitude improvement in computation complexity over existing methods, while maintaining prescribed accuracy. PMID:22707386

Fast Entanglement Establishment via Local Dynamics for Quantum Repeater Networks

NASA Astrophysics Data System (ADS)

Gyongyosi, Laszlo; Imre, Sandor

Quantum entanglement is a necessity for future quantum communication networks, quantum internet, and long-distance quantum key distribution. The current approaches of entanglement distribution require high-delay entanglement transmission, entanglement swapping to extend the range of entanglement, high-cost entanglement purification, and long-lived quantum memories. We introduce a fundamental protocol for establishing entanglement in quantum communication networks. The proposed scheme does not require entanglement transmission between the nodes, high-cost entanglement swapping, entanglement purification, or long-lived quantum memories. The protocol reliably establishes a maximally entangled system between the remote nodes via dynamics generated by local Hamiltonians. The method eliminates the main drawbacks of current schemes allowing fast entanglement establishment with a minimized delay. Our solution provides a fundamental method for future long-distance quantum key distribution, quantum repeater networks, quantum internet, and quantum-networking protocols. This work was partially supported by the GOP-1.1.1-11-2012-0092 project sponsored by the EU and European Structural Fund, by the Hungarian Scientific Research Fund - OTKA K-112125, and by the COST Action MP1006.

Estimating occupancy and abundance of stream amphibians using environmental DNA from filtered water samples

USGS Publications Warehouse

Pilliod, David S.; Goldberg, Caren S.; Arkle, Robert S.; Waits, Lisette P.

2013-01-01

Environmental DNA (eDNA) methods for detecting aquatic species are advancing rapidly, but with little evaluation of field protocols or precision of resulting estimates. We compared sampling results from traditional field methods with eDNA methods for two amphibians in 13 streams in central Idaho, USA. We also evaluated three water collection protocols and the influence of sampling location, time of day, and distance from animals on eDNA concentration in the water. We found no difference in detection or amount of eDNA among water collection protocols. eDNA methods had slightly higher detection rates than traditional field methods, particularly when species occurred at low densities. eDNA concentration was positively related to field-measured density, biomass, and proportion of transects occupied. Precision of eDNA-based abundance estimates increased with the amount of eDNA in the water and the number of replicate subsamples collected. eDNA concentration did not vary significantly with sample location in the stream, time of day, or distance downstream from animals. Our results further advance the implementation of eDNA methods for monitoring aquatic vertebrates in stream habitats.

Long-Range Big Quantum-Data Transmission.

PubMed

Zwerger, M; Pirker, A; Dunjko, V; Briegel, H J; Dür, W

2018-01-19

We introduce an alternative type of quantum repeater for long-range quantum communication with improved scaling with the distance. We show that by employing hashing, a deterministic entanglement distillation protocol with one-way communication, one obtains a scalable scheme that allows one to reach arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates. In practical terms, we show that, also with moderate resources of a few hundred qubits at each repeater station, one can reach intercontinental distances. At the same time, a measurement-based implementation allows one to tolerate high loss but also operational and memory errors of the order of several percent per qubit. This opens the way for long-distance communication of big quantum data.

Long-Range Big Quantum-Data Transmission

NASA Astrophysics Data System (ADS)

Zwerger, M.; Pirker, A.; Dunjko, V.; Briegel, H. J.; Dür, W.

2018-01-01

We introduce an alternative type of quantum repeater for long-range quantum communication with improved scaling with the distance. We show that by employing hashing, a deterministic entanglement distillation protocol with one-way communication, one obtains a scalable scheme that allows one to reach arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates. In practical terms, we show that, also with moderate resources of a few hundred qubits at each repeater station, one can reach intercontinental distances. At the same time, a measurement-based implementation allows one to tolerate high loss but also operational and memory errors of the order of several percent per qubit. This opens the way for long-distance communication of big quantum data.

Improve the Communication, Decrease the Distance: The Investigation into Problematic Communication and Delays in Inter-Hospital Transfer of Rural Trauma Patients

ERIC Educational Resources Information Center

Avtgis, Theodore A.; Polack, E. Phillips; Martin, Matthew M.; Rossi, Daniel

2010-01-01

Time delays in the treatment and transfer of trauma patients is a contributing factor responsible for many fatalities. Time delays are more characteristic of rural trauma systems due to factors such as greater distance, and delays in accident reporting. Efforts to reduce the trauma transfer process have resulted in many changes in protocol and use…

Telecommunications Protocol Processing Subsystem Using Reconfigurable Interoperable Gate Arrays

NASA Technical Reports Server (NTRS)

Pang, Jackson; Pingree, Paula; Torgerson, J. Leigh

2006-01-01

Deep Space Telecommunications Requirements: 1) Automated file transfer across inter-planetary distances; 2) Limited communication periods; 3) Reliable transport; 4) Delay and Disruption Tolerant; and 5) Asymmetric Data Channels.

Continuous-flow centrifugation to collect suspended sediment for chemical analysis

USGS Publications Warehouse

Conn, Kathleen E.; Dinicola, Richard S.; Black, Robert W.; Cox, Stephen E.; Sheibley, Richard W.; Foreman, James R.; Senter, Craig A.; Peterson, Norman T.

2016-12-22

Recent advances in suspended-sediment monitoring tools and surrogate technologies have greatly improved the ability to quantify suspended-sediment concentrations and to estimate daily, seasonal, and annual suspended-sediment fluxes from rivers to coastal waters. However, little is known about the chemical composition of suspended sediment, and how it may vary spatially between water bodies and temporally within a single system owing to climate, seasonality, land use, and other natural and anthropogenic drivers. Many water-quality contaminants, such as organic and inorganic chemicals, nutrients, and pathogens, preferentially partition in sediment rather than water. Suspended sediment-bound chemical concentrations may be undetected during analysis of unfiltered water samples, owing to small water sample volumes and analytical limitations. Quantification of suspended sediment‑bound chemical concentrations is needed to improve estimates of total chemical concentrations, chemical fluxes, and exposure levels of aquatic organisms and humans in receiving environments. Despite these needs, few studies or monitoring programs measure the chemical composition of suspended sediment, largely owing to the difficulty in consistently obtaining samples of sufficient quality and quantity for laboratory analysis.A field protocol is described here utilizing continuous‑flow centrifugation for the collection of suspended sediment for chemical analysis. The centrifuge used for development of this method is small, lightweight, and portable for the field applications described in this protocol. Project scoping considerations, deployment of equipment and system layout options, and results from various field and laboratory quality control experiments are described. The testing confirmed the applicability of the protocol for the determination of many inorganic and organic chemicals sorbed on suspended sediment, including metals, pesticides, polycyclic aromatic hydrocarbons, and polychlorinated biphenyls. The particle-size distribution of the captured sediment changes to a more fine-grained sample during centrifugation, and the necessity to account for this change when extrapolating chemical concentrations on the centrifuged sediment sample to the environmental water system is discussed.The data produced using this method will help eliminate a data gap of suspended sediment-bound chemical concentrations, and will support management decisions, such as chemical source-control efforts or in-stream restoration activities. When coupled with streamflow and sediment flux data, it will improve estimates of riverine chemical fluxes, and will aid in assessing the importance and impacts of suspended sediment-bound chemicals to downstream freshwater and coastal marine ecosystems.

Efficient Regressions via Optimally Combining Quantile Information*

PubMed Central

Zhao, Zhibiao; Xiao, Zhijie

2014-01-01

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

A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol

NASA Technical Reports Server (NTRS)

Moore, J. Strother

1992-01-01

In this paper we present a formal model of asynchronous communication as a function in the Boyer-Moore logic. The function transforms the signal stream generated by one processor into the signal stream consumed by an independently clocked processor. This transformation 'blurs' edges and 'dilates' time due to differences in the phases and rates of the two clocks and the communications delay. The model can be used quantitatively to derive concrete performance bounds on asynchronous communications at ISO protocol level 1 (physical level). We develop part of the reusable formal theory that permits the convenient application of the model. We use the theory to show that a biphase mark protocol can be used to send messages of arbitrary length between two asynchronous processors. We study two versions of the protocol, a conventional one which uses cells of size 32 cycles and an unconventional one which uses cells of size 18. We conjecture that the protocol can be proved to work under our model for smaller cell sizes and more divergent clock rates but the proofs would be harder.

A detailed protocol for chromatin immunoprecipitation in the yeast Saccharomyces cerevisiae.

PubMed

Grably, Melanie; Engelberg, David

2010-01-01

Critical cellular processes such as DNA replication, DNA damage repair, and transcription are mediated and regulated by DNA-binding proteins. Many efforts have been invested therefore in developing methods that monitor the dynamics of protein-DNA association. As older techniques such as DNA footprinting, and electrophoretic mobility shift assays (EMSA) could be applied mostly in vitro, the development of the chromatin immunoprecipitation (ChIP) method, which allows quantitative measurement of protein-bound DNA most accurately in vivo, revolutionized our capabilities of understanding the mechanisms underlying the aforementioned processes. Furthermore, this powerful tool could be applied at the genomic-scale providing a global picture of the protein-DNA complexes at the entire genome.The procedure is conceptually simple; involves rapid crosslinking of proteins to DNA by the addition of formaldehyde to the culture, shearing the DNA and immunoprecipitating the protein of interest while covalently bound to its DNA targets. Following decrosslinking, DNA that was coimmunoprecipitated could be amplified by PCR or could serve as a probe of a genomic microarray to identify all DNA fragments that were bound to the protein.Although simple in principle, the method is not trivial to implement and the results might be misleading if proper controls are not included in the experiment. In this chapter, we provide therefore a highly detailed protocol of ChIP assay as is applied successfully in our laboratory. We pay special attention to describe every small detail, in order that any investigator could readily and successfully apply this important and powerful technology.

Efficient organ localization using multi-label convolutional neural networks in thorax-abdomen CT scans

NASA Astrophysics Data System (ADS)

Efrain Humpire-Mamani, Gabriel; Arindra Adiyoso Setio, Arnaud; van Ginneken, Bram; Jacobs, Colin

2018-04-01

Automatic localization of organs and other structures in medical images is an important preprocessing step that can improve and speed up other algorithms such as organ segmentation, lesion detection, and registration. This work presents an efficient method for simultaneous localization of multiple structures in 3D thorax-abdomen CT scans. Our approach predicts the location of multiple structures using a single multi-label convolutional neural network for each orthogonal view. Each network takes extra slices around the current slice as input to provide extra context. A sigmoid layer is used to perform multi-label classification. The output of the three networks is subsequently combined to compute a 3D bounding box for each structure. We used our approach to locate 11 structures of interest. The neural network was trained and evaluated on a large set of 1884 thorax-abdomen CT scans from patients undergoing oncological workup. Reference bounding boxes were annotated by human observers. The performance of our method was evaluated by computing the wall distance to the reference bounding boxes. The bounding boxes annotated by the first human observer were used as the reference standard for the test set. Using the best configuration, we obtained an average wall distance of 3.20~+/-~7.33 mm in the test set. The second human observer achieved 1.23~+/-~3.39 mm. For all structures, the results were better than those reported in previously published studies. In conclusion, we proposed an efficient method for the accurate localization of multiple organs. Our method uses multiple slices as input to provide more context around the slice under analysis, and we have shown that this improves performance. This method can easily be adapted to handle more organs.

A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks.

PubMed

Sundararajan, T V P; Sumithra, M G; Maheswar, R

2014-01-01

In a Medical Wireless Network (MWN), sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP) selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks

PubMed Central

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole. PMID:28121992

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.

PubMed

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

The improvement and simulation for LEACH clustering routing protocol

NASA Astrophysics Data System (ADS)

Ji, Ai-guo; Zhao, Jun-xiang

2017-01-01

An energy-balanced unequal multi-hop clustering routing protocol LEACH-EUMC is proposed in this paper. The candidate cluster head nodes are elected firstly, then they compete to be formal cluster head nodes by adding energy and distance factors, finally the date are transferred to sink through multi-hop. The results of simulation show that the improved algorithm is better than LEACH in network lifetime, energy consumption and the amount of data transmission.

Traffic Management for Emergency Vehicle Priority Based on Visual Sensing

PubMed Central

Nellore, Kapileswar; Hancke, Gerhard P.

2016-01-01

Vehicular traffic is endlessly increasing everywhere in the world and can cause terrible traffic congestion at intersections. Most of the traffic lights today feature a fixed green light sequence, therefore the green light sequence is determined without taking the presence of the emergency vehicles into account. Therefore, emergency vehicles such as ambulances, police cars, fire engines, etc. stuck in a traffic jam and delayed in reaching their destination can lead to loss of property and valuable lives. This paper presents an approach to schedule emergency vehicles in traffic. The approach combines the measurement of the distance between the emergency vehicle and an intersection using visual sensing methods, vehicle counting and time sensitive alert transmission within the sensor network. The distance between the emergency vehicle and the intersection is calculated for comparison using Euclidean distance, Manhattan distance and Canberra distance techniques. The experimental results have shown that the Euclidean distance outperforms other distance measurement techniques. Along with visual sensing techniques to collect emergency vehicle information, it is very important to have a Medium Access Control (MAC) protocol to deliver the emergency vehicle information to the Traffic Management Center (TMC) with less delay. Then only the emergency vehicle is quickly served and can reach the destination in time. In this paper, we have also investigated the MAC layer in WSNs to prioritize the emergency vehicle data and to reduce the transmission delay for emergency messages. We have modified the medium access procedure used in standard IEEE 802.11p with PE-MAC protocol, which is a new back off selection and contention window adjustment scheme to achieve low broadcast delay for emergency messages. A VANET model for the UTMS is developed and simulated in NS-2. The performance of the standard IEEE 802.11p and the proposed PE-MAC is analysed in detail. The NS-2 simulation results have shown that the PE-MAC outperforms the IEEE 802.11p in terms of average end-to-end delay, throughput and energy consumption. The performance evaluation results have proven that the proposed PE-MAC prioritizes the emergency vehicle data and delivers the emergency messages to the TMC with less delay compared to the IEEE 802.11p. The transmission delay of the proposed PE-MAC is also compared with the standard IEEE 802.15.4, and Enhanced Back-off Selection scheme for IEEE 802.15.4 protocol [EBSS, an existing protocol to ensure fast transmission of the detected events on the road towards the TMC] and the comparative results have proven the effectiveness of the PE-MAC over them. Furthermore, this research work will provide an insight into the design of an intelligent urban traffic management system for the effective management of emergency vehicles and will help to save lives and property. PMID:27834924

Scalability enhancement of AODV using local link repairing

NASA Astrophysics Data System (ADS)

Jain, Jyoti; Gupta, Roopam; Bandhopadhyay, T. K.

2014-09-01

Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load.

Quantum repeaters using continuous-variable teleportation

NASA Astrophysics Data System (ADS)

Dias, Josephine; Ralph, T. C.

2017-02-01

Quantum optical states are fragile and can become corrupted when passed through a lossy communication channel. Unlike for classical signals, optical amplifiers cannot be used to recover quantum signals. Quantum repeaters have been proposed as a way of reducing errors and hence increasing the range of quantum communications. Current protocols target specific discrete encodings, for example quantum bits encoded on the polarization of single photons. We introduce a more general approach that can reduce the effect of loss on any quantum optical encoding, including those based on continuous variables such as the field amplitudes. We show that in principle the protocol incurs a resource cost that scales polynomially with distance. We analyze the simplest implementation and find that while its range is limited it can still achieve useful improvements in the distance over which quantum entanglement of field amplitudes can be distributed.

Quantum-locked key distribution at nearly the classical capacity rate.

PubMed

Lupo, Cosmo; Lloyd, Seth

2014-10-17

Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.

Quantum key distribution with prepare-and-measure Bell test

PubMed Central

Tan, Yong-gang

2016-01-01

The prepare-and-measure quantum key distribution (QKD) has the merits of fast speed, high key generation rate, and easy implementation. However, the detector side channel attacks greatly undermine the security of the key bits. The eavesdropper, Eve, exploits the flaws of the detectors to obtain illegal information without violating quantum principles. It means that she can intervene in the communication without being detected. A prepare-and-measure Bell test protocol will be proposed. By randomly carrying out Bell test at the side of the information receiver, Bob, Eve’s illegal information gain within the detector side channel attack can be well bounded. This protocol does not require any improvement on the detectors used in available prepare-and-measure QKD. Though we only illustrate its application in the BB84 protocol, it is applicable for any prepare-and-measure QKD. PMID:27733771

An improved method for differentiating cell-bound from internalized particles by imaging flow cytometry.

PubMed

Smirnov, Asya; Solga, Michael D; Lannigan, Joanne; Criss, Alison K

2015-08-01

Recognition, binding, internalization, and elimination of pathogens and cell debris are important functions of professional as well as non-professional phagocytes. However, high-throughput methods for quantifying cell-associated particles and discriminating bound from internalized particles have been lacking. Here we describe a protocol for using imaging flow cytometry to quantify the attached and phagocytosed particles that are associated with a population of cells. Cells were exposed to fluorescent particles, fixed, and exposed to an antibody of a different fluorophore that recognizes the particles. The antibody is added without cell permeabilization, such that the antibody only binds extracellular particles. Cells with and without associated particles were identified by imaging flow cytometry. For each cell with associated particles, a spot count algorithm was employed to quantify the number of extracellular (double fluorescent) and intracellular (single fluorescent) particles per cell, from which the percent particle internalization was determined. The spot count algorithm was empirically validated by examining the fluorescence and phase contrast images acquired by the flow cytometer. We used this protocol to measure binding and internalization of the bacterium Neisseria gonorrhoeae by primary human neutrophils, using different bacterial variants and under different cellular conditions. The results acquired using imaging flow cytometry agreed with findings that were previously obtained using conventional immunofluorescence microscopy. This protocol provides a rapid, powerful method for measuring the association and internalization of any particle by any cell type. Copyright © 2015 Elsevier B.V. All rights reserved.

Oil on Paper: A Collaborative Conservation Challenge

PubMed Central

Herro, Holly; Nolley, Scott; Cowan, Wendy; Wright, Kristi

2018-01-01

The application of oil-based leather dressing, while once considered a best practice in libraries, led to undesirable long-term consequences for bound materials. At the National Institutes of Health (NIH) in the National Library of Medicine (NLM), many leather-bound volumes had multiple applications of a mixture of neatsfoot oil and lanolin dressings liberally applied. The oils not only absorbed into the leather bindings but also migrated onto the pastedowns, end sheets, gutters, and text blocks. The oiling process at NLM was documented by call number, year(s), number of applications, and dressing formula. While investigating treatment options, the NLM senior conservator consulted a paintings and objects conservator for insight on viable options for the removal of oil from artifacts. An art-on-paper conservator joined the collaborative effort to develop a treatment protocol for NLM’s oil saturated collections. Together, they investigated the issue and devised an effective method for removal of this oil from the NIH collection materials. The protocol involves washing with an alkaline solution followed by alternating applications of petroleum ether and acetone applied either over suction or by immersion. Oil components are solubilized by the alternating polarities of the solvents and then removed from the paper using suction or immersion. After the oil is removed, the paper is washed again with alkaline water to remove any remaining water soluble discoloration. This article will explore further details of the treatment protocol, its development and applications, and the benefits of cross-disciplinary collaboration. PMID:29630074

Optimal Measurements for Simultaneous Quantum Estimation of Multiple Phases

NASA Astrophysics Data System (ADS)

Pezzè, Luca; Ciampini, Mario A.; Spagnolo, Nicolò; Humphreys, Peter C.; Datta, Animesh; Walmsley, Ian A.; Barbieri, Marco; Sciarrino, Fabio; Smerzi, Augusto

2017-09-01

A quantum theory of multiphase estimation is crucial for quantum-enhanced sensing and imaging and may link quantum metrology to more complex quantum computation and communication protocols. In this Letter, we tackle one of the key difficulties of multiphase estimation: obtaining a measurement which saturates the fundamental sensitivity bounds. We derive necessary and sufficient conditions for projective measurements acting on pure states to saturate the ultimate theoretical bound on precision given by the quantum Fisher information matrix. We apply our theory to the specific example of interferometric phase estimation using photon number measurements, a convenient choice in the laboratory. Our results thus introduce concepts and methods relevant to the future theoretical and experimental development of multiparameter estimation.

Lazy checkpoint coordination for bounding rollback propagation

NASA Technical Reports Server (NTRS)

Wang, Yi-Min; Fuchs, W. Kent

1992-01-01

Independent checkpointing allows maximum process autonomy but suffers from potential domino effects. Coordinated checkpointing eliminates the domino effect by sacrificing a certain degree of process autonomy. In this paper, we propose the technique of lazy checkpoint coordination which preserves process autonomy while employing communication-induced checkpoint coordination for bounding rollback propagation. The introduction of the notion of laziness allows a flexible trade-off between the cost for checkpoint coordination and the average rollback distance. Worst-case overhead analysis provides a means for estimating the extra checkpoint overhead. Communication trace-driven simulation for several parallel programs is used to evaluate the benefits of the proposed scheme for real applications.

A study of polaritonic transparency in couplers made from excitonic materials

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

Singh, Mahi R.; Racknor, Chris

2015-03-14

We have studied light matter interaction in quantum dot and exciton-polaritonic coupler hybrid systems. The coupler is made by embedding two slabs of an excitonic material (CdS) into a host excitonic material (ZnO). An ensemble of non-interacting quantum dots is doped in the coupler. The bound exciton polariton states are calculated in the coupler using the transfer matrix method in the presence of the coupling between the external light (photons) and excitons. These bound exciton-polaritons interact with the excitons present in the quantum dots and the coupler is acting as a reservoir. The Schrödinger equation method has been used tomore » calculate the absorption coefficient in quantum dots. It is found that when the distance between two slabs (CdS) is greater than decay length of evanescent waves the absorption spectrum has two peaks and one minimum. The minimum corresponds to a transparent state in the system. However, when the distance between the slabs is smaller than the decay length of evanescent waves, the absorption spectra has three peaks and two transparent states. In other words, one transparent state can be switched to two transparent states when the distance between the two layers is modified. This could be achieved by applying stress and strain fields. It is also found that transparent states can be switched on and off by applying an external control laser field.« less

Any Two Learning Algorithms Are (Almost) Exactly Identical

NASA Technical Reports Server (NTRS)

Wolpert, David H.

2000-01-01

This paper shows that if one is provided with a loss function, it can be used in a natural way to specify a distance measure quantifying the similarity of any two supervised learning algorithms, even non-parametric algorithms. Intuitively, this measure gives the fraction of targets and training sets for which the expected performance of the two algorithms differs significantly. Bounds on the value of this distance are calculated for the case of binary outputs and 0-1 loss, indicating that any two learning algorithms are almost exactly identical for such scenarios. As an example, for any two algorithms A and B, even for small input spaces and training sets, for less than 2e(-50) of all targets will the difference between A's and B's generalization performance of exceed 1%. In particular, this is true if B is bagging applied to A, or boosting applied to A. These bounds can be viewed alternatively as telling us, for example, that the simple English phrase 'I expect that algorithm A will generalize from the training set with an accuracy of at least 75% on the rest of the target' conveys 20,000 bytes of information concerning the target. The paper ends by discussing some of the subtleties of extending the distance measure to give a full (non-parametric) differential geometry of the manifold of learning algorithms.

Lanthanide-based NMR: a tool to investigate component distribution in mixed-monolayer-protected nanoparticles.

PubMed

Guarino, Gaetano; Rastrelli, Federico; Scrimin, Paolo; Mancin, Fabrizio

2012-05-02

Gd(3+) ions, once bound to the monolayer of organic molecules coating the surface of gold nanoparticles, produce a paramagnetic relaxation enhancement (PRE) that broadens and eventually cancels the signals of the nuclear spins located nearby (within 1.6 nm distance). In the case of nanoparticles coated with mixed monolayers, the signals arising from the different coating molecules experience different PRE, depending on their distance from the binding site. As a consequence, observation of the signal broadening patterns provides direct information on the monolayer organization. © 2012 American Chemical Society

Decentralized Routing and Diameter Bounds in Entangled Quantum Networks

NASA Astrophysics Data System (ADS)

Gyongyosi, Laszlo; Imre, Sandor

2017-04-01

Entangled quantum networks are a necessity for any future quantum internet, long-distance quantum key distribution, and quantum repeater networks. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multi-level entangled network structure. The level of entanglement between the quantum nodes determines the hop distance, the number of spanned nodes, and the probability of the existence of an entangled link in the network. In this work we define a decentralized routing for entangled quantum networks. We show that the probability distribution of the entangled links can be modeled by a specific distribution in a base-graph. The results allow us to perform efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes. We give bounds on the maximum value of the total number of entangled links of a path. The proposed scheme can be directly applied in practical quantum communications and quantum networking scenarios. This work was partially supported by the Hungarian Scientific Research Fund - OTKA K-112125.

Eu(III) sorption to TiO2 (anatase and rutile): batch, XPS, and EXAFS studies.

PubMed

Tan, Xiaoli; Fan, Qiaohui; Wang, Xiangke; Grambow, Bernd

2009-05-01

The sorption of Eu(III) on anatase and rutile was studied as a function of ionic strength, humic acid (HA, 7.5 mg/L), and electrolyte anions over a large range of pH (2-12). The presence of HA significantly affected Eu(III) sorption to anatase and rutile. The sorption of Eu(III) on anatase and rutile was independent of ionic strength. Results of an X-ray photoelectron spectroscopy (XPS) analysis showed that Eu(III) was chemically present within the near-surface of TiO2 due to the formation of triple bond SOEu and triple bond SOHAEu complexes. An extended X-ray absorption fine structure (EXAFS) technique was applied to characterize the local structural environment of the adsorbed Eu(III), and the results indicated that Eu(III) was bound to about seven or eight O atoms at a distance of about 2.40 A. The functional groups of surface-bound HA were expected to be involved in the sorption process. The measured Eu-Ti distance confirmed the formation of inner-sphere sorption complexes on a TiO2 surface.

Residual energy level based clustering routing protocol for wireless sensor networks

NASA Astrophysics Data System (ADS)

Yuan, Xu; Zhong, Fangming; Chen, Zhikui; Yang, Deli

2015-12-01

The wireless sensor networks, which nodes prone to premature death, with unbalanced energy consumption and a short life time, influenced the promotion and application of this technology in internet of things in agriculture. This paper proposes a clustering routing protocol based on the residual energy level (RELCP). RELCP includes three stages: the selection of cluster head, establishment of cluster and data transmission. RELCP considers the remaining energy level and distance to base station, while election of cluster head nodes and data transmitting. Simulation results demonstrate that the protocol can efficiently balance the energy dissipation of all nodes, and prolong the network lifetime.

Percolation bounds for decoding thresholds with correlated erasures in quantum LDPC codes

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen; Pryadko, Leonid

Correlations between errors can dramatically affect decoding thresholds, in some cases eliminating the threshold altogether. We analyze the existence of a threshold for quantum low-density parity-check (LDPC) codes in the case of correlated erasures. When erasures are positively correlated, the corresponding multi-variate Bernoulli distribution can be modeled in terms of cluster errors, where qubits in clusters of various size can be marked all at once. In a code family with distance scaling as a power law of the code length, erasures can be always corrected below percolation on a qubit adjacency graph associated with the code. We bound this correlated percolation transition by weighted (uncorrelated) percolation on a specially constructed cluster connectivity graph, and apply our recent results to construct several bounds for the latter. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-14-1-0272.

Gauge field localization on brane worlds

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

Guerrero, Rommel; Rodriguez, R. Omar; Melfo, Alejandra

2010-04-15

We consider the effects of spacetime curvature and brane thickness on the localization of gauge fields on a brane via kinetic terms induced by localized fermions. We find that in a warped geometry with an infinitely thin brane, both the infrared and the ultraviolet behavior of the electromagnetic propagator are affected, providing a more stringent bound on the brane's tension than that coming from the requirement of four-dimensional gravity on the brane. On the other hand, for a thick wall in a flat spacetime, where the fermions are localized by means of a Yukawa coupling, we find that four-dimensional electromagnetismmore » is recovered in a region bounded from above by the same critical distance appearing in the thin case, but also from below by a new scale related to the brane's thickness and the electromagnetic couplings. This imposes very stringent bounds on the brane's thickness which seem to invalidate the localization mechanism for this case.« less

Effectiveness of AODV Protocol under Hidden Node Environment

NASA Astrophysics Data System (ADS)

Garg, Ruchi; Sharma, Himanshu; Kumar, Sumit

IEEE 802.11 is a standard for mobile ad hoc networks (MANET), implemented with various different protocols. Ad Hoc on Demand Distance Vector Routing (AODV) is one of the several protocols of IEEE 802.11, intended to provide various Quality of Service (QOS) parameters under acceptable range. To avoid the collision and interference the MAC protocol has only two solutions, one, to sense the physical carrier and second, to use the RTS/CTS handshake mechanism. But with the help of these methods AODV is not free from the problem of hidden nodes like other several protocols. Under the hidden node environment, performance of AODV depends upon various factors. The position of receiver and sender among the other nodes is very crucial and it affects the performance. Under the various situations the AODV is simulated with the help of NS2 and the outcomes are discussed.

Finite-size analysis of continuous-variable measurement-device-independent quantum key distribution

NASA Astrophysics Data System (ADS)

Zhang, Xueying; Zhang, Yichen; Zhao, Yijia; Wang, Xiangyu; Yu, Song; Guo, Hong

2017-10-01

We study the impact of the finite-size effect on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocol, mainly considering the finite-size effect on the parameter estimation procedure. The central-limit theorem and maximum likelihood estimation theorem are used to estimate the parameters. We also analyze the relationship between the number of exchanged signals and the optimal modulation variance in the protocol. It is proved that when Charlie's position is close to Bob, the CV-MDI QKD protocol has the farthest transmission distance in the finite-size scenario. Finally, we discuss the impact of finite-size effects related to the practical detection in the CV-MDI QKD protocol. The overall results indicate that the finite-size effect has a great influence on the secret-key rate of the CV-MDI QKD protocol and should not be ignored.

Continuous hierarchical slope-aspect color display for parametric surfaces

NASA Technical Reports Server (NTRS)

Moellering, Harold J. (Inventor); Kimerling, A. Jon (Inventor)

1994-01-01

A method for generating an image of a parametric surface, such as the aspect of terrain which maximizes color contrast to permit easy discrimination of the magnitude, ranges, intervals or classes of a surface parameter while making it easy for the user to visualize the form of the surface, such as a landscape. The four pole colors of the opponent process color theory are utilized to represent intervals or classes at 90 degree angles. The color perceived as having maximum measured luminance is selected to portray the color having an azimuth of an assumed light source and the color showing minimum measured luminance portrays the diametrically opposite azimuth. The 90 degree intermediate azimuths are portrayed by unique colors of intermediate measured luminance, such as red and green. Colors between these four pole colors are used which are perceived as mixtures or combinations of their bounding colors and are arranged progressively between their bounding colors to have perceived proportional mixtures of the bounding colors which are proportional to the interval's angular distance from its bounding colors.

Testing the Quantum-Classical Boundary and Dimensionality of Quantum Systems

NASA Astrophysics Data System (ADS)

Shun, Poh Hou

Quantum theory introduces a cut between the observer and the observed system [1], but does not provide a definition of what is an observer [2]. Based on an informational def- inition of the observer, Grinbaum has recently [3] predicted an upper bound on bipartite correlations in the Clauser-Horne-Shimony-Holt (CHSH) Bell scenario equal to 2.82537, which is slightly smaller than the Tsirelson bound [4] of standard quantum theory, but is consistent with all the available experimental results [5--17]. Not being able to exceed Grin- baum's limit would support that quantum theory is only an effective description of a more fundamental theory and would have a deep impact in physics and quantum information processing. In this thesis, we present a test of the CHSH inequality on photon pairs in maximally entangled states of polarization in which a value 2.8276 +/- 0.00082 is observed, violating Grinbaum's bound by 2.72 standard deviations and providing the smallest distance with respect to Tsirelson's bound ever reported, namely, 0.0008 +/- 0.00082. (Abstract shortened by UMI.).

Decaying spectral oscillations in a Majorana wire with finite coherence length

NASA Astrophysics Data System (ADS)

Fleckenstein, C.; Domínguez, F.; Traverso Ziani, N.; Trauzettel, B.

2018-04-01

Motivated by recent experiments, we investigate the excitation energy of a proximitized Rashba wire in the presence of a position dependent pairing. In particular, we focus on the spectroscopic pattern produced by the overlap between two Majorana bound states that appear for values of the Zeeman field smaller than the value necessary for reaching the bulk topological superconducting phase. The two Majorana bound states can arise because locally the wire is in the topological regime. We find three parameter ranges with different spectral properties: crossings, anticrossings, and asymptotic reduction of the energy as a function of the applied Zeeman field. Interestingly, all these cases have already been observed experimentally. Moreover, since an increment of the magnetic field implies the increase of the distance between the Majorana bound states, the amplitude of the energy oscillations, when present, gets reduced. The existence of the different Majorana scenarios crucially relies on the fact that the two Majorana bound states have distinct k -space structures. We develop analytical models that clearly explain the microscopic origin of the predicted behavior.

Finite-data-size study on practical universal blind quantum computation

NASA Astrophysics Data System (ADS)

Zhao, Qiang; Li, Qiong

2018-07-01

The universal blind quantum computation with weak coherent pulses protocol is a practical scheme to allow a client to delegate a computation to a remote server while the computation hidden. However, in the practical protocol, a finite data size will influence the preparation efficiency in the remote blind qubit state preparation (RBSP). In this paper, a modified RBSP protocol with two decoy states is studied in the finite data size. The issue of its statistical fluctuations is analyzed thoroughly. The theoretical analysis and simulation results show that two-decoy-state case with statistical fluctuation is closer to the asymptotic case than the one-decoy-state case with statistical fluctuation. Particularly, the two-decoy-state protocol can achieve a longer communication distance than the one-decoy-state case in this statistical fluctuation situation.

Two-dimensional distributed-phase-reference protocol for quantum key distribution

NASA Astrophysics Data System (ADS)

Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A. Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

2016-12-01

Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable.

Two-dimensional distributed-phase-reference protocol for quantum key distribution.

PubMed

Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

2016-12-22

Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable.

Two-dimensional distributed-phase-reference protocol for quantum key distribution

PubMed Central

Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A. Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

2016-01-01

Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable. PMID:28004821

Production of Truncated Candida antarctica Lipase B Gene Using Automated PCR Gene Assembly Protocol and Expression in Yeast for use in Ethanol and Biodiesel Production.

USDA-ARS?s Scientific Manuscript database

An improved column-based process for production of biodiesel was developed using a column containing a strongly basic anion-exchange resin in sequence with a column containing a resin to which a lipase biocatalyst is bound. Currently most biodiesel is produced by transesterification of triglyceride...

A simple elution strategy for biotinylated proteins bound to streptavidin conjugated beads using excess biotin and heat.

PubMed

Cheah, Joleen S; Yamada, Soichiro

2017-12-02

Protein-protein interactions are the molecular basis of cell signaling. Recently, proximity based biotin identification (BioID) has emerged as an alternative approach to traditional co-immunoprecipitation. In this protocol, a mutant biotin ligase promiscuously labels proximal binding partners with biotin, and resulting biotinylated proteins are purified using streptavidin conjugated beads. This approach does not require preservation of protein complexes in vitro, making it an ideal approach to identify transient or weak protein complexes. However, due to the high affinity bond between streptavidin and biotin, elution of biotinylated proteins from streptavidin conjugated beads requires harsh denaturing conditions, which are often incompatible with downstream processing. To effectively release biotinylated proteins bound to streptavidin conjugated beads, we designed a series of experiments to determine optimal binding and elution conditions. Interestingly, the concentrations of SDS and IGEPAL-CA630 during the incubation with streptavidin conjugated beads were the key to effective elution of biotinylated proteins using excess biotin and heating. This protocol provides an alternative method to isolate biotinylated proteins from streptavidin conjugated beads that is suitable for further downstream analysis. Copyright © 2017 Elsevier Inc. All rights reserved.

Sputnik Planitia, Pluto Convection Cell Surface Velocities of ~10 Centimeters per Year Based on Sublimation Pit Distribution

NASA Astrophysics Data System (ADS)

Buhler, Peter Benjamin; Ingersoll, Andrew P.

2017-10-01

Sputnik Planitia, Pluto contains cellular landforms with areas on the order of a few 102-103 km2 that are likely the surface manifestation of convective overturn in a vast basin of nitrogen ice. The cells have sublimation pits on them, with smaller pits near their centers and larger pits near their edges. We map over 12,000 pits on seven cells and find that the pit radii increase by between 2.1 ± 0.4 and 5.9 ± 0.8 × 10-3 m per meter away from the cell center, depending on the cell. Due to finite data resolution, this is a lower bound on the size increase. Conservatively accounting for resolution effects yields upper bounds on the size vs. distance distribution of 4.2 ± 0.2 to 23.4 ± 1.5 × 10-3 m m-1. In order to convert the pit size vs. distance distribution into a pit age vs. distance distribution, we use an analytic model to calculate that pit radii grow via sublimation at a rate of 3.6 [+2.1,-0.6] × 10-4 m yr-1. Combined with the mapped distribution of pit radii, this yields surface velocities between 1.5 [+1.0,-0.2] and 6.2 [+3.4,-1.4] cm yr-1 for the slowest cell and surface velocities between 8.1 [+5.5,-1.0] and 17.9 [+8.9,-5.1] cm yr-1 for the fastest cell; the lower bound estimate for each cell accounts for resolution effects, while the upper bound estimate does not. These convection rates imply that the surface ages at the edge of cells reach approximately 4.2 to 8.9 × 105 yr, depending on the cell. The rates we find are comparable to rates of ~6 cm yr-1 that were previously obtained from modeling of the convective overturn in Sputnik Planitia [McKinnon, W.B. et al., 2016, Nature, 534(7605), 82-85]. Finally, we find that the minimum viscosity at the surface of the convection cells is of order 1016 to 1017 Pa s; we find that pits would relax away before sublimating to their observed radii of several hundred meters if the viscosity were lower than this value.

Particle bombardment - mediated gene transfer and GFP transient expression in Seteria viridis.

PubMed

Mookkan, Muruganantham

2018-04-03

Setaria viridis is one of the most important model grasses in studying monocot plant biology. Transient gene expression study is a very important tool in plant biotechnology, functional genomics, and CRISPR-Cas9 genome editing technology via particle bombardment. In this study, a particle bombardment-mediated protocol was developed to introduce DNA into Setaria viridis in vitro leaf explants. In addition, physical and biological parameters, such as helium pressure, distance from stopping screen to the target tissues, DNA concentration, and number of bombardments, were tested and optimized. Optimum concentration of transient GFP expression was achieved using 1.5 ug plasmid DNA with 0.6 mm gold particles and 6 cm bombardment distance, using 1,100 psi. Doubling the bombardment instances provides the maximum number of foci of transient GFP expression. This simple protocol will be helpful for genomics studies in the S. viridis monocot model.

Long-distance quantum key distribution with imperfect devices

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

Lo Piparo, Nicoló; Razavi, Mohsen

2014-12-04

Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secure key generation rate per memory, R{sub QKD}. The two schemes under investigation are the one proposed by Duan et al. in [Nat. 414, 413 (2001)] and that of Sangouard et al. proposed in [Phys. Rev. A 76, 050301 (2007)]. We consider various sources of imperfections in the latter protocol, such as a nonzero double-photon probability for the source, dark count per pulse, channel loss and inefficiencies in photodetectors and memories, to find the rate for different nesting levels.more » We determine the maximum value of the double-photon probability beyond which it is not possible to share a secret key anymore. We find the crossover distance for up to three nesting levels. We finally compare the two protocols.« less

Improving the maximum transmission distance of continuous-variable quantum key distribution using a noiseless amplifier

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

Blandino, Rémi; Etesse, Jean; Grangier, Philippe

2014-12-04

We show that the maximum transmission distance of continuous-variable quantum key distribution in presence of a Gaussian noisy lossy channel can be arbitrarily increased using a heralded noiseless linear amplifier. We explicitly consider a protocol using amplitude and phase modulated coherent states with reverse reconciliation. Assuming that the secret key rate drops to zero for a line transmittance T{sub lim}, we find that a noiseless amplifier with amplitude gain g can improve this value to T{sub lim}/g{sup 2}, corresponding to an increase in distance proportional to log g. We also show that the tolerance against noise is increased.

Modelling optimal location for pre-hospital helicopter emergency medical services.

PubMed

Schuurman, Nadine; Bell, Nathaniel J; L'Heureux, Randy; Hameed, Syed M

2009-05-09

Increasing the range and scope of early activation/auto launch helicopter emergency medical services (HEMS) may alleviate unnecessary injury mortality that disproportionately affects rural populations. To date, attempts to develop a quantitative framework for the optimal location of HEMS facilities have been absent. Our analysis used five years of critical care data from tertiary health care facilities, spatial data on origin of transport and accurate road travel time catchments for tertiary centres. A location optimization model was developed to identify where the expansion of HEMS would cover the greatest population among those currently underserved. The protocol was developed using geographic information systems (GIS) to measure populations, distances and accessibility to services. Our model determined Royal Inland Hospital (RIH) was the optimal site for an expanded HEMS - based on denominator population, distance to services and historical usage patterns. GIS based protocols for location of emergency medical resources can provide supportive evidence for allocation decisions - especially when resources are limited. In this study, we were able to demonstrate conclusively that a logical choice exists for location of additional HEMS. This protocol could be extended to location analysis for other emergency and health services.

Secure and Robust Transmission and Verification of Unknown Quantum States in Minkowski Space

PubMed Central

Kent, Adrian; Massar, Serge; Silman, Jonathan

2014-01-01

An important class of cryptographic applications of relativistic quantum information work as follows. B generates a random qudit and supplies it to A at point P. A is supposed to transmit it at near light speed c to to one of a number of possible pairwise spacelike separated points Q1, …, Qn. A's transmission is supposed to be secure, in the sense that B cannot tell in advance which Qj will be chosen. This poses significant practical challenges, since secure reliable long-range transmission of quantum data at speeds near to c is presently not easy. Here we propose different techniques to overcome these diffculties. We introduce protocols that allow secure long-range implementations even when both parties control only widely separated laboratories of small size. In particular we introduce a protocol in which A needs send the qudit only over a short distance, and securely transmits classical information (for instance using a one time pad) over the remaining distance. We further show that by using parallel implementations of the protocols security can be maintained in the presence of moderate amounts of losses and errors. PMID:24469425

Dark energy domination in the Virgocentric flow

NASA Astrophysics Data System (ADS)

Chernin, A. D.; Karachentsev, I. D.; Nasonova, O. G.; Teerikorpi, P.; Valtonen, M. J.; Dolgachev, V. P.; Domozhilova, L. M.; Byrd, G. G.

2010-09-01

Context. The standard ΛCDM cosmological model implies that all celestial bodies are embedded in a perfectly uniform dark energy background, represented by Einstein's cosmological constant, and experience its repulsive antigravity action. Aims: Can dark energy have strong dynamical effects on small cosmic scales as well as globally? Continuing our efforts to clarify this question, we now focus on the Virgo Cluster and the flow of expansion around it. Methods: We interpret the Hubble diagram from a new database of velocities and distances of galaxies in the cluster and its environment, using a nonlinear analytical model, which incorporates the antigravity force in terms of Newtonian mechanics. The key parameter is the zero-gravity radius, the distance at which gravity and antigravity are in balance. Results: 1. The interplay between the gravity of the cluster and the antigravity of the dark energy background determines the kinematical structure of the system and controls its evolution. 2. The gravity dominates the quasi-stationary bound cluster, while the antigravity controls the Virgocentric flow, bringing order and regularity to the flow, which reaches linearity and the global Hubble rate at distances ⪆15 Mpc. 3. The cluster and the flow form a system similar to the Local Group and its outflow. In the velocity-distance diagram, the cluster-flow structure reproduces the group-flow structure with a scaling factor of about 10; the zero-gravity radius for the cluster system is also 10 times larger. Conclusions: The phase and dynamical similarity of the systems on the scales of 1-30 Mpc suggests that a two-component pattern may be universal for groups and clusters: a quasi-stationary bound central component and an expanding outflow around it, caused by the nonlinear gravity-antigravity interplay with the dark energy dominating in the flow component.

The X-ray Crystal Structure of Glutathionylcobalamin Revealed

PubMed Central

Hannibal, Luciana; Smith, Clyde A.

2010-01-01

The first evidence of a complex between glutathione and cobalamin, glutathionylcobalamin (GSCbl), was presented by Wagner and Bernhauer more than 40 years ago (Ann N Y Acad Sci, 1964, 112, 580). More recently, NMR and EXAFS solution studies by Brown et al (Biochemistry, 1993, 32, 8421) and Scheuring et al. (Biochemistry, 1994, 33, 6310), respectively, provided evidence that the glutathionyl moiety in GSCbl is bound to the cobalt center via a Co-S bond. Despite continued efforts, the structural analysis of glutathionylcobalamin in the solid state has remained elusive. Here we report the first atomic resolution crystal structure of GSCbl, refined to a crystallographic R-factor of 0.0683. The glutathione moiety is bound to the cobalt center through the sulfur atom as expected, with a Co-S bond distance of 2.295(1) A. This distance agrees with the distance obtained from the EXAFS analysis of GSCbl (2.280(5) Å). However, the bond to the axial α-5,6-dimethylbenzimidazole base (DMB), 2.074(3) Å, is significantly shorter than that determined from the EXAFS measurements (Co-N3B = 2.15(3) Å). The corrin fold angle is 24.7°, the highest ever reported for a cobalamin structure, and points in the direction of the β-face of the corrin, towards the glutathione (GS−). The GS− ligand has been modeled in two conformations, each featuring distinct hydrogen bonding interactions. In both conformations, the α-carboxylate group of the GS− ligand interacts with the generally rigid side chain a of the cobalamin molecule, resulting in two distinct conformations. A comparison with the structure of other thiolatocobalamins revealed high similarity in the positions of the atoms in the cysteinyl moiety, the fold of the corrin rings, and the Co-S bond distances. PMID:20863098

The X-ray crystal structure of glutathionylcobalamin revealed.

PubMed

Hannibal, Luciana; Smith, Clyde A; Jacobsen, Donald W

2010-11-01

The first evidence of a complex between glutathione and cobalamin, glutathionylcobalamin (GSCbl), was presented by Wagner and Bernhauer more than 40 years ago (Ann. N.Y. Acad. Sci. 1964, 112, 580). More recently, NMR and EXAFS solution studies by Brown et al. (Biochemistry 1993, 32, 8421) and Scheuring et al. (Biochemistry 1994, 33, 6310), respectively, provided evidence that the glutathionyl moiety in GSCbl is bound to the cobalt center via a Co-S bond. Despite continued efforts, the structural analysis of glutathionylcobalamin in the solid state has remained elusive. Here, we report the first atomic resolution crystal structure of GSCbl, refined to a crystallographic R factor of 0.0683. The glutathione moiety is bound to the cobalt center through the sulfur atom as expected, with a Co-S bond distance of 2.295(1) Å. This distance agrees with the distance obtained from the EXAFS analysis of GSCbl (2.280(5) Å). However, the bond to the axial α-5,6-dimethylbenzimidazole base (DMB), 2.074(3) Å, is significantly shorter than that determined from the EXAFS measurements (Co-N3B = 2.15(3) Å). The corrin fold angle is 24.7°, the highest ever reported for a cobalamin structure, and points in the direction of the β face of the corrin, toward the glutathione (GS(-)). The GS(-) ligand has been modeled in two conformations, each featuring distinct hydrogen bonding interactions. In both conformations, the α-carboxylate group of the GS(-) ligand interacts with the generally rigid side chain a of the cobalamin molecule, resulting in two distinct conformations. A comparison with the structure of other thiolatocobalamins revealed high similarity in the positions of the atoms in the cysteinyl moiety, the fold of the corrin rings, and the Co-S bond distances.

Reexamination of quantum bit commitment: The possible and the impossible

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

D'Ariano, Giacomo Mauro; Kretschmann, Dennis; Institut fuer Mathematische Physik, Technische Universitaet Braunschweig, Mendelssohnstrasse 3, 38106 Braunschweig

2007-09-15

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. We give a strengthened and explicit proof of this result. We extend its scope to a much larger variety of protocols, which may have an arbitrary number of rounds, in which both classical and quantum information is exchanged, and which may include aborts and resets. Moreover, we do not consider the receiver to be bound to a fixed 'honest' strategy, so that 'anonymous state protocols', which were recently suggested as a possible way to beat the known no-go results, aremore » also covered. We show that any concealing protocol allows the sender to find a cheating strategy, which is universal in the sense that it works against any strategy of the receiver. Moreover, if the concealing property holds only approximately, the cheat goes undetected with a high probability, which we explicitly estimate. The proof uses an explicit formalization of general two-party protocols, which is applicable to more general situations, and an estimate about the continuity of the Stinespring dilation of a general quantum channel. The result also provides a natural characterization of protocols that fall outside the standard setting of unlimited available technology and thus may allow secure bit commitment. We present such a protocol whose security, perhaps surprisingly, relies on decoherence in the receiver's laboratory.« less

Continuous-variable quantum key distribution based on a plug-and-play dual-phase-modulated coherent-states protocol

NASA Astrophysics Data System (ADS)

Huang, Duan; Huang, Peng; Wang, Tao; Li, Huasheng; Zhou, Yingming; Zeng, Guihua

2016-09-01

We propose and experimentally demonstrate a continuous-variable quantum key distribution (CV-QKD) protocol using dual-phase-modulated coherent states. We show that the modulation scheme of our protocol works equivalently to that of the Gaussian-modulated coherent-states (GMCS) protocol, but shows better experimental feasibility in the plug-and-play configuration. Besides, it waives the necessity of propagation of a local oscillator (LO) between legitimate users and generates a real local LO for quantum measurement. Our protocol is proposed independent of the one-way GMCS QKD without sending a LO [Opt. Lett. 40, 3695 (2015), 10.1364/OL.40.003695; Phys. Rev. X 5, 041009 (2015), 10.1103/PhysRevX.5.041009; Phys. Rev. X 5, 041010 (2015), 10.1103/PhysRevX.5.041010]. In those recent works, the system stability will suffer the impact of polarization drifts induced by environmental perturbations, and two independent frequency-locked laser sources are necessary to achieve reliable coherent detection. In the proposed protocol, these previous problems can be resolved. We derive the security bounds for our protocol against collective attacks, and we also perform a proof-of-principle experiment to confirm the utility of our proposal in real-life applications. Such an efficient scheme provides a way of removing the security loopholes associated with the transmitting LO, which have been a notoriously hard problem in continuous-variable quantum communication.

Exponential Sensitivity and its Cost in Quantum Physics

PubMed Central

Gilyén, András; Kiss, Tamás; Jex, Igor

2016-01-01

State selective protocols, like entanglement purification, lead to an essentially non-linear quantum evolution, unusual in naturally occurring quantum processes. Sensitivity to initial states in quantum systems, stemming from such non-linear dynamics, is a promising perspective for applications. Here we demonstrate that chaotic behaviour is a rather generic feature in state selective protocols: exponential sensitivity can exist for all initial states in an experimentally realisable optical scheme. Moreover, any complex rational polynomial map, including the example of the Mandelbrot set, can be directly realised. In state selective protocols, one needs an ensemble of initial states, the size of which decreases with each iteration. We prove that exponential sensitivity to initial states in any quantum system has to be related to downsizing the initial ensemble also exponentially. Our results show that magnifying initial differences of quantum states (a Schrödinger microscope) is possible; however, there is a strict bound on the number of copies needed. PMID:26861076

Capacity estimation and verification of quantum channels with arbitrarily correlated errors.

PubMed

Pfister, Corsin; Rol, M Adriaan; Mantri, Atul; Tomamichel, Marco; Wehner, Stephanie

2018-01-02

The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel's quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel's one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment.

Exponential Sensitivity and its Cost in Quantum Physics.

PubMed

Gilyén, András; Kiss, Tamás; Jex, Igor

2016-02-10

State selective protocols, like entanglement purification, lead to an essentially non-linear quantum evolution, unusual in naturally occurring quantum processes. Sensitivity to initial states in quantum systems, stemming from such non-linear dynamics, is a promising perspective for applications. Here we demonstrate that chaotic behaviour is a rather generic feature in state selective protocols: exponential sensitivity can exist for all initial states in an experimentally realisable optical scheme. Moreover, any complex rational polynomial map, including the example of the Mandelbrot set, can be directly realised. In state selective protocols, one needs an ensemble of initial states, the size of which decreases with each iteration. We prove that exponential sensitivity to initial states in any quantum system has to be related to downsizing the initial ensemble also exponentially. Our results show that magnifying initial differences of quantum states (a Schrödinger microscope) is possible; however, there is a strict bound on the number of copies needed.

Reynolds number effects on mixing due to topological chaos.

PubMed

Smith, Spencer A; Warrier, Sangeeta

2016-03-01

Topological chaos has emerged as a powerful tool to investigate fluid mixing. While this theory can guarantee a lower bound on the stretching rate of certain material lines, it does not indicate what fraction of the fluid actually participates in this minimally mandated mixing. Indeed, the area in which effective mixing takes place depends on physical parameters such as the Reynolds number. To help clarify this dependency, we numerically simulate the effects of a batch stirring device on a 2D incompressible Newtonian fluid in the laminar regime. In particular, we calculate the finite time Lyapunov exponent (FTLE) field for three different stirring protocols, one topologically complex (pseudo-Anosov) and two simple (finite-order), over a range of viscosities. After extracting appropriate measures indicative of both the amount of mixing and the area of effective mixing from the FTLE field, we see a clearly defined Reynolds number range in which the relative efficacy of the pseudo-Anosov protocol over the finite-order protocols justifies the application of topological chaos. More unexpectedly, we see that while the measures of effective mixing area increase with increasing Reynolds number for the finite-order protocols, they actually exhibit non-monotonic behavior for the pseudo-Anosov protocol.

Achieving sink node anonymity in tactical wireless sensor networks using a reactive routing protocol

DTIC Science & Technology

2017-06-01

transmit their information through the network based on the specific protocols that are implemented. Nodes may be designed to perform any combination of...band, and one channel in the 868-MHz band. The IEEE 802.15.4 standard is designed to provide Low-Rate Wireless Personal Area Network (LR-WPAN...MANETs and is currently a draft at the IETF Network Working Group [9]. It was derived from the Ad hoc On -Demand Distance Vector (AODV) routing

A multi-hop teleportation protocol of arbitrary four-qubit states through intermediate nodes

NASA Astrophysics Data System (ADS)

Choudhury, Binayak S.; Samanta, Soumen

Teleportation processes over long distances become affected by the almost inevitable existence of noise which interferes with the entangled quantum channels. In view of this, intermediate nodes are introduced in the scheme. These nodes are connected in series through quantum entanglement. In this paper, we present a protocol for transferring an entangled four-particle cluster-type state in an integrated manner through the intermediate nodes. Its efficiency and advantage over the corresponding part by part teleportation process is discussed.

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

Yasuda, Satoshi; Yanagi, Takanori; Yamada, Masafumi D.

Highlights: •Dipolar EPR detects the distance between the spin-labeled kinesin α-1 and α-2 helices. •The distance has at least two populations: 1.5 nm (in crystal form: 20%) and >2.5 nm. •The short distance conformer was populated 40% in the apo state with microtubules. •ATP analog or ADP binding caused the 1.5 nm distance to be less populated (∼20%). •The α-1 helix moves closer to the neck-linker (away from α-2) to facilitate docking. -- Abstract: In kinesin X-ray crystal structures, the N-terminal region of the α-1 helix is adjacent to the adenine ring of the bound nucleotide, while the C-terminal regionmore » of the helix is near the neck-linker (NL). Here, we monitor the displacement of the α-1 helix within a kinesin monomer bound to microtubules (MTs) in the presence or absence of nucleotides using site-directed spin labeling EPR. Kinesin was doubly spin-labeled at the α-1 and α-2 helices, and the resulting EPR spectrum showed dipolar broadening. The inter-helix distance distribution showed that 20% of the spins have a peak characteristic of 1.4–1.7 nm separation, which is similar to what is predicted from the X-ray crystal structure, albeit 80% were beyond the sensitivity limit (>2.5 nm) of the method. Upon MT binding, the fraction of kinesin exhibiting an inter-helix distance of 1.4–1.7 nm in the presence of AMPPNP (a non-hydrolysable ATP analog) and ADP was 20% and 25%, respectively. In the absence of nucleotide, this fraction increased to 40–50%. These nucleotide-induced changes in the fraction of kinesin undergoing displacement of the α-1 helix were found to be related to the fraction in which the NL undocked from the motor core. It is therefore suggested that a shift in the α-1 helix conformational equilibrium occurs upon nucleotide binding and release, and this shift controls NL docking onto the motor core.« less

Release of kinesin from vesicles by hsc70 and regulation of fast axonal transport

NASA Technical Reports Server (NTRS)

Tsai, M. Y.; Morfini, G.; Szebenyi, G.; Brady, S. T.

2000-01-01

The nature of kinesin interactions with membrane-bound organelles and mechanisms for regulation of kinesin-based motility have both been surprisingly difficult to define. Most kinesin is recovered in supernatants with standard protocols for purification of motor proteins, but kinesin recovered on membrane-bound organelles is tightly bound. Partitioning of kinesin between vesicle and cytosolic fractions is highly sensitive to buffer composition. Addition of either N-ethylmaleimide or EDTA to homogenization buffers significantly increased the fraction of kinesin bound to organelles. Given that an antibody against kinesin light chain tandem repeats also releases kinesin from vesicles, these observations indicated that specific cytoplasmic factors may regulate kinesin release from membranes. Kinesin light tandem repeats contain DnaJ-like motifs, so the effects of hsp70 chaperones were evaluated. Hsc70 released kinesin from vesicles in an MgATP-dependent and N-ethylmaleimide-sensitive manner. Recombinant kinesin light chains inhibited kinesin release by hsc70 and stimulated the hsc70 ATPase. Hsc70 actions may provide a mechanism to regulate kinesin function by releasing kinesin from cargo in specific subcellular domains, thereby effecting delivery of axonally transported materials.

Position-based coding and convex splitting for private communication over quantum channels

NASA Astrophysics Data System (ADS)

Wilde, Mark M.

2017-10-01

The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender X, a legitimate quantum receiver B, and a quantum eavesdropper E. The goal of a private communication protocol that uses such a channel is for the sender X to transmit a message in such a way that the legitimate receiver B can decode it reliably, while the eavesdropper E learns essentially nothing about which message was transmitted. The ɛ -one-shot private capacity of a cq wiretap channel is equal to the maximum number of bits that can be transmitted over the channel, such that the privacy error is no larger than ɛ \\in (0,1). The present paper provides a lower bound on the ɛ -one-shot private classical capacity, by exploiting the recently developed techniques of Anshu, Devabathini, Jain, and Warsi, called position-based coding and convex splitting. The lower bound is equal to a difference of the hypothesis testing mutual information between X and B and the "alternate" smooth max-information between X and E. The one-shot lower bound then leads to a non-trivial lower bound on the second-order coding rate for private classical communication over a memoryless cq wiretap channel.

Abstract Conceptual Feature Ratings Predict Gaze within Written Word Arrays: Evidence from a Visual Wor(l)d Paradigm

ERIC Educational Resources Information Center

Primativo, Silvia; Reilly, Jamie; Crutch, Sebastian J

2017-01-01

The Abstract Conceptual Feature (ACF) framework predicts that word meaning is represented within a high-dimensional semantic space bounded by weighted contributions of perceptual, affective, and encyclopedic information. The ACF, like latent semantic analysis, is amenable to distance metrics between any two words. We applied predictions of the ACF…

One-time pad, complexity of verification of keys, and practical security of quantum cryptography

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

Molotkov, S. N., E-mail: sergei.molotkov@gmail.com

2016-11-15

A direct relation between the complexity of the complete verification of keys, which is one of the main criteria of security in classical systems, and a trace distance used in quantum cryptography is demonstrated. Bounds for the minimum and maximum numbers of verification steps required to determine the actual key are obtained.

A Comparison of Student Persistence and Performance in Online and Classroom Business Statistics Experiences

ERIC Educational Resources Information Center

McLaren, Constance H.

2004-01-01

As universities extend their distance education offerings to reach more time- and place-bound students, the degree to which online students are successful, as compared to their classroom counterparts, is of interest to accreditation review boards and others charged with assessment. Teaching faculty use information about the effectiveness of their…

RNA interactome capture in yeast.

PubMed

Beckmann, Benedikt M

2017-04-15

RNA-binding proteins (RBPs) are key players in post-transcriptional regulation of gene expression in eukaryotic cells. To be able to unbiasedly identify RBPs in Saccharomyces cerevisiae, we developed a yeast RNA interactome capture protocol which employs RNA labeling, covalent UV crosslinking of RNA and proteins at 365nm wavelength (photoactivatable-ribonucleoside-enhanced crosslinking, PAR-CL) and finally purification of the protein-bound mRNA. The method can be easily implemented in common workflows and takes about 3days to complete. Next to a comprehensive explanation of the method, we focus on our findings about the choice of crosslinking in yeast and discuss the rationale of individual steps in the protocol. Copyright © 2016. Published by Elsevier Inc.

Decoy-state quantum key distribution with more than three types of photon intensity pulses

NASA Astrophysics Data System (ADS)

Chau, H. F.

2018-04-01

The decoy-state method closes source security loopholes in quantum key distribution (QKD) using a laser source. In this method, accurate estimates of the detection rates of vacuum and single-photon events plus the error rate of single-photon events are needed to give a good enough lower bound of the secret key rate. Nonetheless, the current estimation method for these detection and error rates, which uses three types of photon intensities, is accurate up to about 1 % relative error. Here I report an experimentally feasible way that greatly improves these estimates and hence increases the one-way key rate of the BB84 QKD protocol with unbiased bases selection by at least 20% on average in realistic settings. The major tricks are the use of more than three types of photon intensities plus the fact that estimating bounds of the above detection and error rates is numerically stable, although these bounds are related to the inversion of a high condition number matrix.

Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

NASA Astrophysics Data System (ADS)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

A binary linear programming formulation of the graph edit distance.

PubMed

Justice, Derek; Hero, Alfred

2006-08-01

A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. The new metric is shown to perform quite well in comparison to existing metrics when applied to a database of chemical graphs.

Iterated Gate Teleportation and Blind Quantum Computation.

PubMed

Pérez-Delgado, Carlos A; Fitzsimons, Joseph F

2015-06-05

Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraint only holds in limited scenarios, and show how to overcome it using a novel method of iterated gate teleportations. This technique enables drastic reductions in the communication required for distributed quantum protocols, extending beyond the blind computation setting. Applied to blind quantum computation, this technique offers significant efficiency improvements, and in some scenarios offers an exponential reduction in communication requirements.

Quantum dice rolling: a multi-outcome generalization of quantum coin flipping

NASA Astrophysics Data System (ADS)

Aharon, N.; Silman, J.

2010-03-01

The problem of quantum dice rolling (DR)—a generalization of the problem of quantum coin flipping (CF) to more than two outcomes and parties—is studied in both its weak and strong variants. We prove by construction that quantum mechanics allows for (i) weak N-sided DR admitting arbitrarily small bias for any N and (ii) two-party strong N-sided DR saturating Kitaev's bound for any N. To derive (ii) we also prove by construction that quantum mechanics allows for (iii) strong imbalanced CF saturating Kitaev's bound for any degree of imbalance. Furthermore, as a corollary of (ii) we introduce a family of optimal 2m-party strong nm-sided DR protocols for any pair m and n.

Hamiltonian identifiability assisted by single-probe measurement

NASA Astrophysics Data System (ADS)

Sone, Akira; Cappellaro, Paola; Quantum Engineering Group Team

2017-04-01

We study the Hamiltonian identifiability of a many-body spin- 1 / 2 system assisted by the measurement on a single quantum probe based on the eigensystem realization algorithm (ERA) approach employed in. We demonstrate a potential application of Gröbner basis to the identifiability test of the Hamiltonian, and provide the necessary experimental resources, such as the lower bound in the number of the required sampling points, the upper bound in total required evolution time, and thus the total measurement time. Focusing on the examples of the identifiability in the spin chain model with nearest-neighbor interaction, we classify the spin-chain Hamiltonian based on its identifiability, and provide the control protocols to engineer the non-identifiable Hamiltonian to be an identifiable Hamiltonian.

Radiation enhanced antiferromagnetic exchange between spins in a superconducting host

NASA Astrophysics Data System (ADS)

Akkaravarawong, Kamphol; Vayrynen, Jukka; Sau, Jay; Glazman, Leonid; Yao, Norman

2017-04-01

A magnetic impurity on a conventional superconductor can host a localized bound state whose energy lies inside the superconducting gap. If the distance between two such impurities is smaller than the coherence length, the presence of these so-called Yu-Shiba-Rusinov (YSR) bound states can induce an antiferromagnetic exchange interaction between the impurities, falling off as 1 /r2 . Although the YSR interaction exhibits a slower decay than conventional RKKY interactions, its strength is significantly weaker, making it extremely challenging to experimentally observe. We demonstrate that the strength of the YSR interaction can be enhanced via radiation assisted virtual occupation, and that the signature of this coupling can naturally be observed through spectroscopy.

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

NASA Astrophysics Data System (ADS)

Gessner, Manuel; Smerzi, Augusto

2018-02-01

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

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

NASA Astrophysics Data System (ADS)

Albeverio, Sergio; Tamura, Hiroshi

2018-04-01

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

Nonlinear compression of temporal solitons in an optical waveguide via inverse engineering

NASA Astrophysics Data System (ADS)

Paul, Koushik; Sarma, Amarendra K.

2018-03-01

We propose a novel method based on the so-called shortcut-to-adiabatic passage techniques to achieve fast compression of temporal solitons in a nonlinear waveguide. We demonstrate that soliton compression could be achieved, in principle, at an arbitrarily small distance by inverse-engineering the pulse width and the nonlinearity of the medium. The proposed scheme could possibly be exploited for various short-distance communication protocols and may be even in nonlinear guided wave-optics devices and generation of ultrashort soliton pulses.

Support from the relationship of genetic and geographic distance in human populations for a serial founder effect originating in Africa

PubMed Central

Ramachandran, Sohini; Deshpande, Omkar; Roseman, Charles C.; Rosenberg, Noah A.; Feldman, Marcus W.; Cavalli-Sforza, L. Luca

2005-01-01

Equilibrium models of isolation by distance predict an increase in genetic differentiation with geographic distance. Here we find a linear relationship between genetic and geographic distance in a worldwide sample of human populations, with major deviations from the fitted line explicable by admixture or extreme isolation. A close relationship is shown to exist between the correlation of geographic distance and genetic differentiation (as measured by FST) and the geographic pattern of heterozygosity across populations. Considering a worldwide set of geographic locations as possible sources of the human expansion, we find that heterozygosities in the globally distributed populations of the data set are best explained by an expansion originating in Africa and that no geographic origin outside of Africa accounts as well for the observed patterns of genetic diversity. Although the relationship between FST and geographic distance has been interpreted in the past as the result of an equilibrium model of drift and dispersal, simulation shows that the geographic pattern of heterozygosities in this data set is consistent with a model of a serial founder effect starting at a single origin. Given this serial-founder scenario, the relationship between genetic and geographic distance allows us to derive bounds for the effects of drift and natural selection on human genetic variation. PMID:16243969

Automated electrotransformation of Escherichia coli on a digital microfluidic platform using bioactivated magnetic beads.

PubMed

Moore, J A; Nemat-Gorgani, M; Madison, A C; Sandahl, M A; Punnamaraju, S; Eckhardt, A E; Pollack, M G; Vigneault, F; Church, G M; Fair, R B; Horowitz, M A; Griffin, P B

2017-01-01

This paper reports on the use of a digital microfluidic platform to perform multiplex automated genetic engineering (MAGE) cycles on droplets containing Escherichia coli cells. Bioactivated magnetic beads were employed for cell binding, washing, and media exchange in the preparation of electrocompetent cells in the electrowetting-on-dieletric (EWoD) platform. On-cartridge electroporation was used to deliver oligonucleotides into the cells. In addition to the optimization of a magnetic bead-based benchtop protocol for generating and transforming electrocompetent E. coli cells, we report on the implementation of this protocol in a fully automated digital microfluidic platform. Bead-based media exchange and electroporation pulse conditions were optimized on benchtop for transformation frequency to provide initial parameters for microfluidic device trials. Benchtop experiments comparing electrotransformation of free and bead-bound cells are presented. Our results suggest that dielectric shielding intrinsic to bead-bound cells significantly reduces electroporation field exposure efficiency. However, high transformation frequency can be maintained in the presence of magnetic beads through the application of more intense electroporation pulses. As a proof of concept, MAGE cycles were successfully performed on a commercial EWoD cartridge using variations of the optimal magnetic bead-based preparation procedure and pulse conditions determined by the benchtop results. Transformation frequencies up to 22% were achieved on benchtop; this frequency was matched within 1% (21%) by MAGE cycles on the microfluidic device. However, typical frequencies on the device remain lower, averaging 9% with a standard deviation of 9%. The presented results demonstrate the potential of digital microfluidics to perform complex and automated genetic engineering protocols.

Automated electrotransformation of Escherichia coli on a digital microfluidic platform using bioactivated magnetic beads

PubMed Central

Moore, J. A.; Nemat-Gorgani, M.; Madison, A. C.; Punnamaraju, S.; Eckhardt, A. E.; Pollack, M. G.; Church, G. M.; Fair, R. B.; Horowitz, M. A.; Griffin, P. B.

2017-01-01

This paper reports on the use of a digital microfluidic platform to perform multiplex automated genetic engineering (MAGE) cycles on droplets containing Escherichia coli cells. Bioactivated magnetic beads were employed for cell binding, washing, and media exchange in the preparation of electrocompetent cells in the electrowetting-on-dieletric (EWoD) platform. On-cartridge electroporation was used to deliver oligonucleotides into the cells. In addition to the optimization of a magnetic bead-based benchtop protocol for generating and transforming electrocompetent E. coli cells, we report on the implementation of this protocol in a fully automated digital microfluidic platform. Bead-based media exchange and electroporation pulse conditions were optimized on benchtop for transformation frequency to provide initial parameters for microfluidic device trials. Benchtop experiments comparing electrotransformation of free and bead-bound cells are presented. Our results suggest that dielectric shielding intrinsic to bead-bound cells significantly reduces electroporation field exposure efficiency. However, high transformation frequency can be maintained in the presence of magnetic beads through the application of more intense electroporation pulses. As a proof of concept, MAGE cycles were successfully performed on a commercial EWoD cartridge using variations of the optimal magnetic bead-based preparation procedure and pulse conditions determined by the benchtop results. Transformation frequencies up to 22% were achieved on benchtop; this frequency was matched within 1% (21%) by MAGE cycles on the microfluidic device. However, typical frequencies on the device remain lower, averaging 9% with a standard deviation of 9%. The presented results demonstrate the potential of digital microfluidics to perform complex and automated genetic engineering protocols. PMID:28191268

Rosetta FlexPepDock ab-initio: simultaneous folding, docking and refinement of peptides onto their receptors.

PubMed

Raveh, Barak; London, Nir; Zimmerman, Lior; Schueler-Furman, Ora

2011-04-29

Flexible peptides that fold upon binding to another protein molecule mediate a large number of regulatory interactions in the living cell and may provide highly specific recognition modules. We present Rosetta FlexPepDock ab-initio, a protocol for simultaneous docking and de-novo folding of peptides, starting from an approximate specification of the peptide binding site. Using the Rosetta fragments library and a coarse-grained structural representation of the peptide and the receptor, FlexPepDock ab-initio samples efficiently and simultaneously the space of possible peptide backbone conformations and rigid-body orientations over the receptor surface of a given binding site. The subsequent all-atom refinement of the coarse-grained models includes full side-chain modeling of both the receptor and the peptide, resulting in high-resolution models in which key side-chain interactions are recapitulated. The protocol was applied to a benchmark in which peptides were modeled over receptors in either their bound backbone conformations or in their free, unbound form. Near-native peptide conformations were identified in 18/26 of the bound cases and 7/14 of the unbound cases. The protocol performs well on peptides from various classes of secondary structures, including coiled peptides with unusual turns and kinks. The results presented here significantly extend the scope of state-of-the-art methods for high-resolution peptide modeling, which can now be applied to a wide variety of peptide-protein interactions where no prior information about the peptide backbone conformation is available, enabling detailed structure-based studies and manipulation of those interactions. © 2011 Raveh et al.

Rosetta FlexPepDock ab-initio: Simultaneous Folding, Docking and Refinement of Peptides onto Their Receptors

PubMed Central

Raveh, Barak; London, Nir; Zimmerman, Lior; Schueler-Furman, Ora

2011-01-01

Flexible peptides that fold upon binding to another protein molecule mediate a large number of regulatory interactions in the living cell and may provide highly specific recognition modules. We present Rosetta FlexPepDock ab-initio, a protocol for simultaneous docking and de-novo folding of peptides, starting from an approximate specification of the peptide binding site. Using the Rosetta fragments library and a coarse-grained structural representation of the peptide and the receptor, FlexPepDock ab-initio samples efficiently and simultaneously the space of possible peptide backbone conformations and rigid-body orientations over the receptor surface of a given binding site. The subsequent all-atom refinement of the coarse-grained models includes full side-chain modeling of both the receptor and the peptide, resulting in high-resolution models in which key side-chain interactions are recapitulated. The protocol was applied to a benchmark in which peptides were modeled over receptors in either their bound backbone conformations or in their free, unbound form. Near-native peptide conformations were identified in 18/26 of the bound cases and 7/14 of the unbound cases. The protocol performs well on peptides from various classes of secondary structures, including coiled peptides with unusual turns and kinks. The results presented here significantly extend the scope of state-of-the-art methods for high-resolution peptide modeling, which can now be applied to a wide variety of peptide-protein interactions where no prior information about the peptide backbone conformation is available, enabling detailed structure-based studies and manipulation of those interactions. PMID:21572516

Ab initio study on electronically excited states of lithium isocyanide, LiNC

NASA Astrophysics Data System (ADS)

Yasumatsu, Hisato; Jeung, Gwang-Hi

2014-01-01

The electronically excited states of the lithium isocyanide molecule, LiNC, were studied by means of ab initio calculations. The bonding nature of LiNC up to ∼10 eV is discussed on the basis of the potential energy surfaces according to the interaction between the ion-pair and covalent states. The ion-pair states are described by Coulomb attractive interaction in the long distance range, while the covalent ones are almost repulsive or bound with a very shallow potential dent. These two states interact each other to form adiabatic potential energy surfaces with non-monotonic change in the potential energy with the internuclear distance.

Development and validation of an HPLC-method for determination of free and bound phenolic acids in cereals after solid-phase extraction.

PubMed

Irakli, Maria N; Samanidou, Victoria F; Biliaderis, Costas G; Papadoyannis, Ioannis N

2012-10-01

Whole cereal grains are a good source of phenolic acids associated with reduced risk of chronic diseases. This paper reports the development and validation of a high-performance liquid chromatography-diode array detection (HPLC-DAD) method for the determination of phenolic acids in cereals in either free or bound form. Extraction of free phenolic acids and clean-up was performed by an optimised solid-phase extraction (SPE) protocol on Oasis HLB cartridges using aqueous methanol as eluant. The mean recovery of analytes ranged between 84% and 106%. Bound phenolic acids were extracted using alkaline hydrolysis with mean recoveries of 80-95%, except for gallic acid, caffeic acid and protocatechuic acid. Both free and bound phenolic extracts were separated on a Nucleosil 100 C18 column, 5 μm (250 mm × 4.6 mm) thermostated at 30 °C, using a linear gradient elution system consisting of 1% (v/v) acetic acid in methanol. Method validation was performed by means of linearity, accuracy, intra-day and inter-day precision and sensitivity. Detection limits ranged between 0.13 and 0.18 μg/g. The method was applied to the analysis of free and bound phenolic acids contents in durum wheat, bread wheat, barley, oat, rice, rye, corn and triticale. Copyright © 2012 Elsevier Ltd. All rights reserved.

30-Second bound and pore water concentration mapping of cortical bone using 2D UTE with optimized half-pulses.

PubMed

Manhard, Mary Kate; Harkins, Kevin D; Gochberg, Daniel F; Nyman, Jeffry S; Does, Mark D

2017-03-01

MRI of cortical bone has the potential to offer new information about fracture risk. Current methods are typically performed with 3D acquisitions, which suffer from long scan times and are generally limited to extremities. This work proposes using 2D UTE with half pulses for quantitatively mapping bound and pore water in cortical bone. Half-pulse 2D UTE methods were implemented on a 3T Philips Achieva scanner using an optimized slice-select gradient waveform, with preparation pulses to selectively image bound or pore water. The 2D methods were quantitatively compared with previously implemented 3D methods in the tibia in five volunteers. The mean difference between bound and pore water concentration acquired from 3D and 2D sequences was 0.6 and 0.9 mol 1 H/L bone (3 and 12%, respectively). While 2D pore water methods tended to slightly overestimate concentrations relative to 3D methods, differences were less than scan-rescan uncertainty and expected differences between healthy and fracture-prone bones. Quantitative bound and pore water concentration mapping in cortical bone can be accelerated by 2 orders of magnitude using 2D protocols with optimized half-pulse excitation. Magn Reson Med 77:945-950, 2017. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Device-independent secret-key-rate analysis for quantum repeaters

NASA Astrophysics Data System (ADS)

Holz, Timo; Kampermann, Hermann; Bruß, Dagmar

2018-01-01

The device-independent approach to quantum key distribution (QKD) aims to establish a secret key between two or more parties with untrusted devices, potentially under full control of a quantum adversary. The performance of a QKD protocol can be quantified by the secret key rate, which can be lower bounded via the violation of an appropriate Bell inequality in a setup with untrusted devices. We study secret key rates in the device-independent scenario for different quantum repeater setups and compare them to their device-dependent analogon. The quantum repeater setups under consideration are the original protocol by Briegel et al. [Phys. Rev. Lett. 81, 5932 (1998), 10.1103/PhysRevLett.81.5932] and the hybrid quantum repeater protocol by van Loock et al. [Phys. Rev. Lett. 96, 240501 (2006), 10.1103/PhysRevLett.96.240501]. For a given repeater scheme and a given QKD protocol, the secret key rate depends on a variety of parameters, such as the gate quality or the detector efficiency. We systematically analyze the impact of these parameters and suggest optimized strategies.

Extending the Applicability of Exact Nuclear Overhauser Enhancements to Large Proteins and RNA.

PubMed

Nichols, Parker; Born, Alexandra; Henen, Morkos; Strotz, Dean; Chi, Celestine N; Güntert, Peter; Vögeli, Beat Rolf

2018-06-08

Distance-dependent NOEs are one of the most popular and important experimental restraints for calculating NMR structures. Despite this, they are mostly employed as semi-quantitative upper distance bounds, which discards a wealth of information that is encoded in the cross-relaxation rate constant. Information that is lost includes exact distances between protons and dynamics that occur on the sub-millisecond time-scale. Our recently introduced exact measurement of the NOE (eNOE) requires little additional experimental effort relative to other NMR observables. So far, we have used eNOEs to calculate multi-state ensembles of proteins up to ~150 residues. Here, we briefly revisit the eNOE methodology and present two new directions for the use of eNOEs: Applications to large proteins and RNA. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Convergence and Sampling in Determining Free Energy Landscapes for Membrane Protein Association

PubMed Central

2016-01-01

Potential of mean force (PMF) calculations are used to characterize the free energy landscape of protein–lipid and protein–protein association within membranes. Coarse-grained simulations allow binding free energies to be determined with reasonable statistical error. This accuracy relies on defining a good collective variable to describe the binding and unbinding transitions, and upon criteria for assessing the convergence of the simulation toward representative equilibrium sampling. As examples, we calculate protein–lipid binding PMFs for ANT/cardiolipin and Kir2.2/PIP2, using umbrella sampling on a distance coordinate. These highlight the importance of replica exchange between windows for convergence. The use of two independent sets of simulations, initiated from bound and unbound states, provide strong evidence for simulation convergence. For a model protein–protein interaction within a membrane, center-of-mass distance is shown to be a poor collective variable for describing transmembrane helix–helix dimerization. Instead, we employ an alternative intermolecular distance matrix RMS (DRMS) coordinate to obtain converged PMFs for the association of the glycophorin transmembrane domain. While the coarse-grained force field gives a reasonable Kd for dimerization, the majority of the bound population is revealed to be in a near-native conformation. Thus, the combination of a refined reaction coordinate with improved sampling reveals previously unnoticed complexities of the dimerization free energy landscape. We propose the use of replica-exchange umbrella sampling starting from different initial conditions as a robust approach for calculation of the binding energies in membrane simulations. PMID:27807980

Convergence and Sampling in Determining Free Energy Landscapes for Membrane Protein Association.

PubMed

Domański, Jan; Hedger, George; Best, Robert B; Stansfeld, Phillip J; Sansom, Mark S P

2017-04-20

Potential of mean force (PMF) calculations are used to characterize the free energy landscape of protein-lipid and protein-protein association within membranes. Coarse-grained simulations allow binding free energies to be determined with reasonable statistical error. This accuracy relies on defining a good collective variable to describe the binding and unbinding transitions, and upon criteria for assessing the convergence of the simulation toward representative equilibrium sampling. As examples, we calculate protein-lipid binding PMFs for ANT/cardiolipin and Kir2.2/PIP 2 , using umbrella sampling on a distance coordinate. These highlight the importance of replica exchange between windows for convergence. The use of two independent sets of simulations, initiated from bound and unbound states, provide strong evidence for simulation convergence. For a model protein-protein interaction within a membrane, center-of-mass distance is shown to be a poor collective variable for describing transmembrane helix-helix dimerization. Instead, we employ an alternative intermolecular distance matrix RMS (D RMS ) coordinate to obtain converged PMFs for the association of the glycophorin transmembrane domain. While the coarse-grained force field gives a reasonable K d for dimerization, the majority of the bound population is revealed to be in a near-native conformation. Thus, the combination of a refined reaction coordinate with improved sampling reveals previously unnoticed complexities of the dimerization free energy landscape. We propose the use of replica-exchange umbrella sampling starting from different initial conditions as a robust approach for calculation of the binding energies in membrane simulations.

Ecological systems as computer networks: Long distance sea dispersal as a communication medium between island plant populations.

PubMed

Sanaa, Adnen; Ben Abid, Samir; Boulila, Abdennacer; Messaoud, Chokri; Boussaid, Mohamed; Ben Fadhel, Najeh

2016-06-01

Ecological systems are known to exchange genetic material through animal species migration and seed dispersal for plants. Isolated plant populations have developed long distance dispersal as a means of propagation which rely on meteorological such as anemochory and hydrochory for coast, island and river bank dwelling species. Long distance dispersal by water, in particular, in the case of water current bound islands, calls for the analogy with computer networks, where each island and nearby mainland site plays the role of a network node, the water currents play the role of a transmission channel, and water borne seeds as data packets. In this paper we explore this analogy to model long distance dispersal of seeds among island and mainland populations, when traversed with water currents, in order to model and predict their future genetic diversity. The case of Pancratium maritimum L. populations in Tunisia is used as a proof of concept, where their genetic diversity is extrapolated. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

SU-E-J-11: Measurement of Eye Lens Dose for Varian On-Board Imaging with Different CBCT Acquisition Techniques

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

Deshpande, S; Dhote, D; Kumar, R

Purpose: To measure actual patient eye lens dose for different cone beam computed tomography (CBCT) acquisition protocol of Varian’s On Board Imagining (OBI) system using Optically Stimulated Luminescence (OSL) dosimeter and study the eye lens dose with patient geometry and distance of isocenter to the eye lens Methods: OSL dosimeter was used to measure eye lens dose of patient. OSL dosimeter was placed on patient forehead center during CBCT image acquisition to measure eye lens dose. For three different cone beam acquisition protocol (standard dose head, low dose head and high quality head) of Varian On-Board Imaging, eye lens dosesmore » were measured. Measured doses were correlated with patient geometry and distance between isocenter to eye lens. Results: Measured eye lens dose for standard dose head was in the range of 1.8 mGy to 3.2 mGy, for high quality head protocol dose was in range of 4.5mGy to 9.9 mGy whereas for low dose head was in the range of 0.3mGy to 0.7mGy. Dose to eye lens is depends upon position of isocenter. For posterioraly located tumor eye lens dose is less. Conclusion: From measured doses it can be concluded that by proper selection of imagining protocol and frequency of imaging, it is possible to restrict the eye lens dose below the new limit set by ICRP. However, undoubted advantages of imaging system should be counter balanced by careful consideration of imaging protocol especially for very intense imaging sequences for Adoptive Radiotherapy or IMRT.« less

Comparison of breathing gated CT images generated using a 5DCT technique and a commercial clinical protocol in a porcine model

PubMed Central

O’Connell, Dylan P.; Thomas, David H.; Dou, Tai H.; Lamb, James M.; Feingold, Franklin; Low, Daniel A.; Fuld, Matthew K.; Sieren, Jered P.; Sloan, Chelsea M.; Shirk, Melissa A.; Hoffman, Eric A.; Hofmann, Christian

2015-01-01

Purpose: To demonstrate that a “5DCT” technique which utilizes fast helical acquisition yields the same respiratory-gated images as a commercial technique for regular, mechanically produced breathing cycles. Methods: Respiratory-gated images of an anesthetized, mechanically ventilated pig were generated using a Siemens low-pitch helical protocol and 5DCT for a range of breathing rates and amplitudes and with standard and low dose imaging protocols. 5DCT reconstructions were independently evaluated by measuring the distances between tissue positions predicted by a 5D motion model and those measured using deformable registration, as well by reconstructing the originally acquired scans. Discrepancies between the 5DCT and commercial reconstructions were measured using landmark correspondences. Results: The mean distance between model predicted tissue positions and deformably registered tissue positions over the nine datasets was 0.65 ± 0.28 mm. Reconstructions of the original scans were on average accurate to 0.78 ± 0.57 mm. Mean landmark displacement between the commercial and 5DCT images was 1.76 ± 1.25 mm while the maximum lung tissue motion over the breathing cycle had a mean value of 27.2 ± 4.6 mm. An image composed of the average of 30 deformably registered images acquired with a low dose protocol had 6 HU image noise (single standard deviation) in the heart versus 31 HU for the commercial images. Conclusions: An end to end evaluation of the 5DCT technique was conducted through landmark based comparison to breathing gated images acquired with a commercial protocol under highly regular ventilation. The techniques were found to agree to within 2 mm for most respiratory phases and most points in the lung. PMID:26133604

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks

PubMed Central

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. PMID:27258013

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

PubMed

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

Blind quantum computation over a collective-noise channel

NASA Astrophysics Data System (ADS)

Takeuchi, Yuki; Fujii, Keisuke; Ikuta, Rikizo; Yamamoto, Takashi; Imoto, Nobuyuki

2016-05-01

Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and outputs. The quantum channel between Alice and Bob is noisy, and the loss over the long-distance quantum communication should also be taken into account. Here we propose to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which we call DFS-BQC. We propose three variations of DFS-BQC protocols. One of them, a coherent-light-assisted DFS-BQC protocol, allows Alice to faithfully send the signal photons with a probability proportional to a transmission rate of the quantum channel. In all cases, we combine the ideas based on DFS and the Broadbent-Fitzsimons-Kashefi protocol, which is one of the BQC protocols, without degrading unconditional security. The proposed DFS-based schemes are generic and hence can be applied to other BQC protocols where Alice sends quantum states to Bob.

Practical decoy state for quantum key distribution

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

Ma Xiongfeng; Qi Bing; Zhao Yi

2005-07-15

Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution (QKD). Here, we present a general theory of the decoy state protocol based on only two decoy states and one signal state. We perform optimization on the choice of intensities of the two decoy states and the signal state. Our result shows that a decoy state protocol with only two types of decoy states - the vacuum and a weak decoy state - asymptotically approaches the theoretical limit of the most general type of decoy state protocol (with an infinite numbermore » of decoy states). We also present a one-decoy-state protocol. Moreover, we provide estimations on the effects of statistical fluctuations and suggest that, even for long-distance (larger than 100 km) QKD, our two-decoy-state protocol can be implemented with only a few hours of experimental data. In conclusion, decoy state quantum key distribution is highly practical.« less

The Rise of E-learning and Opportunities for Indian Family Physicians.

PubMed

Datta, Chayan

2012-01-01

The IT (information technology) revolution is sweeping across the globe. Distance, location and costs have become irrelevant. With availability of newer communication tools, medical education and practice are bound to be transformed. Rapid advancement of science requires medical professionals to update their knowledge constantly. Online interface for CME (Continued Medical Education) presents an exciting opportunity as an E learning tool.

Planar optical waveguide based sandwich assay sensors and processes for the detection of biological targets including protein markers, pathogens and cellular debris

DOEpatents

Martinez, Jennifer S [Santa Fe, NM; Swanson, Basil I [Los Alamos, NM; Grace, Karen M [Los Alamos, NM; Grace, Wynne K [Los Alamos, NM; Shreve, Andrew P [Santa Fe, NM

2009-06-02

An assay element is described including recognition ligands bound to a film on a single mode planar optical waveguide, the film from the group of a membrane, a polymerized bilayer membrane, and a self-assembled monolayer containing polyethylene glycol or polypropylene glycol groups therein and an assay process for detecting the presence of a biological target is described including injecting a biological target-containing sample into a sensor cell including the assay element, with the recognition ligands adapted for binding to selected biological targets, maintaining the sample within the sensor cell for time sufficient for binding to occur between selected biological targets within the sample and the recognition ligands, injecting a solution including a reporter ligand into the sensor cell; and, interrogating the sample within the sensor cell with excitation light from the waveguide, the excitation light provided by an evanescent field of the single mode penetrating into the biological target-containing sample to a distance of less than about 200 nanometers from the waveguide thereby exciting the fluorescent-label in any bound reporter ligand within a distance of less than about 200 nanometers from the waveguide and resulting in a detectable signal.

Planar optical waveguide based sandwich assay sensors and processes for the detection of biological targets including early detection of cancers

DOEpatents

Martinez, Jennifer S [Santa Fe, NM; Swanson, Basil I [Los Alamos, NM; Shively, John E [Arcadia, CA; Li, Lin [Monrovia, CA

2009-06-02

An assay element is described including recognition ligands adapted for binding to carcinoembryonic antigen (CEA) bound to a film on a single mode planar optical waveguide, the film from the group of a membrane, a polymerized bilayer membrane, and a self-assembled monolayer containing polyethylene glycol or polypropylene glycol groups therein and an assay process for detecting the presence of CEA is described including injecting a possible CEA-containing sample into a sensor cell including the assay element, maintaining the sample within the sensor cell for time sufficient for binding to occur between CEA present within the sample and the recognition ligands, injecting a solution including a reporter ligand into the sensor cell; and, interrogating the sample within the sensor cell with excitation light from the waveguide, the excitation light provided by an evanescent field of the single mode penetrating into the biological target-containing sample to a distance of less than about 200 nanometers from the waveguide thereby exciting any bound reporter ligand within a distance of less than about 200 nanometers from the waveguide and resulting in a detectable signal.

The neural correlate of colour distances revealed with competing synaesthetic and real colours.

PubMed

Laeng, Bruno; Hugdahl, Kenneth; Specht, Karsten

2011-03-01

Synaesthetes claim to perceive illusory colours when reading alphanumeric symbols so that two colours are said to be bound to the same letter or digit (i.e., the colour of the ink, e.g., black, and an additional, synaesthetic, colour). To explore the neural correlates of this phenomenon, we used a Stroop single-letter colour-naming task and found that distances in colour space between the illusory and real colours of a letter target (as computed from either the RGB or CIExyY coordinates of colours) systematically influenced the degree of neuronal activation in colour-processing brain regions. The synaesthetes also activated the same fronto-parietal network during the classic colour-word Stroop task and single-letter tasks. We conclude that the same neural substrate that supports the conscious experience of colour, as triggered by physical wavelength, supports the experience of synaesthetic colours. Thus, two colour attributes (one that is wavelength-dependent and one that is illusory) can be bound to the same stimulus position and simultaneously engage the colour areas in proportion to their similarity in colour space. Copyright © 2009 Elsevier Srl. All rights reserved.

Coloring geographical threshold graphs

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

Bradonjic, Milan; Percus, Allon; Muller, Tobias

We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyzemore » the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.« less

Einstein-Podolsky-Rosen steering: Its geometric quantification and witness

NASA Astrophysics Data System (ADS)

Ku, Huan-Yu; Chen, Shin-Liang; Budroni, Costantino; Miranowicz, Adam; Chen, Yueh-Nan; Nori, Franco

2018-02-01

We propose a measure of quantum steerability, namely, a convex steering monotone, based on the trace distance between a given assemblage and its corresponding closest assemblage admitting a local-hidden-state (LHS) model. We provide methods to estimate such a quantity, via lower and upper bounds, based on semidefinite programming. One of these upper bounds has a clear geometrical interpretation as a linear function of rescaled Euclidean distances in the Bloch sphere between the normalized quantum states of (i) a given assemblage and (ii) an LHS assemblage. For a qubit-qubit quantum state, these ideas also allow us to visualize various steerability properties of the state in the Bloch sphere via the so-called LHS surface. In particular, some steerability properties can be obtained by comparing such an LHS surface with a corresponding quantum steering ellipsoid. Thus, we propose a witness of steerability corresponding to the difference of the volumes enclosed by these two surfaces. This witness (which reveals the steerability of a quantum state) enables one to find an optimal measurement basis, which can then be used to determine the proposed steering monotone (which describes the steerability of an assemblage) optimized over all mutually unbiased bases.

Slope-aspect color shading for parametric surfaces

NASA Technical Reports Server (NTRS)

Moellering, Harold J. (Inventor); Kimerling, A. Jon (Inventor)

1991-01-01

The invention is a method for generating an image of a parametric surface, such as the compass direction toward which each surface element of terrain faces, commonly called the slope-aspect azimuth of the surface element. The method maximizes color contrast to permit easy discrimination of the magnitude, ranges, intervals or classes of a surface parameter while making it easy for the user to visualize the form of the surface, such as a landscape. The four pole colors of the opponent process color theory are utilized to represent intervals or classes at 90 degree angles. The color perceived as having maximum measured luminance is selected to portray the color having an azimuth of an assumed light source and the color showing minimum measured luminance portrays the diametrically opposite azimuth. The 90 degree intermediate azimuths are portrayed by unique colors of intermediate measured luminance, such as red and green. Colors between these four pole colors are used which are perceived as mixtures or combinations of their bounding colors and are arranged progressively between their bounding colors to have perceived proportional mixtures of the bounding colors which are proportional to the interval's angular distance from its bounding colors.

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

PubMed

Chandon, Pierre; Ordabayeva, Nailya

2017-02-01

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

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling.

PubMed

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-09-18

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling

PubMed Central

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-01-01

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols. PMID:26393608

The Free Energy Landscape of Small Molecule Unbinding

PubMed Central

Huang, Danzhi; Caflisch, Amedeo

2011-01-01

The spontaneous dissociation of six small ligands from the active site of FKBP (the FK506 binding protein) is investigated by explicit water molecular dynamics simulations and network analysis. The ligands have between four (dimethylsulphoxide) and eleven (5-diethylamino-2-pentanone) non-hydrogen atoms, and an affinity for FKBP ranging from 20 to 0.2 mM. The conformations of the FKBP/ligand complex saved along multiple trajectories (50 runs at 310 K for each ligand) are grouped according to a set of intermolecular distances into nodes of a network, and the direct transitions between them are the links. The network analysis reveals that the bound state consists of several subbasins, i.e., binding modes characterized by distinct intermolecular hydrogen bonds and hydrophobic contacts. The dissociation kinetics show a simple (i.e., single-exponential) time dependence because the unbinding barrier is much higher than the barriers between subbasins in the bound state. The unbinding transition state is made up of heterogeneous positions and orientations of the ligand in the FKBP active site, which correspond to multiple pathways of dissociation. For the six small ligands of FKBP, the weaker the binding affinity the closer to the bound state (along the intermolecular distance) are the transition state structures, which is a new manifestation of Hammond behavior. Experimental approaches to the study of fragment binding to proteins have limitations in temporal and spatial resolution. Our network analysis of the unbinding simulations of small inhibitors from an enzyme paints a clear picture of the free energy landscape (both thermodynamics and kinetics) of ligand unbinding. PMID:21390201

The free energy landscape of small molecule unbinding.

PubMed

Huang, Danzhi; Caflisch, Amedeo

2011-02-01

The spontaneous dissociation of six small ligands from the active site of FKBP (the FK506 binding protein) is investigated by explicit water molecular dynamics simulations and network analysis. The ligands have between four (dimethylsulphoxide) and eleven (5-diethylamino-2-pentanone) non-hydrogen atoms, and an affinity for FKBP ranging from 20 to 0.2 mM. The conformations of the FKBP/ligand complex saved along multiple trajectories (50 runs at 310 K for each ligand) are grouped according to a set of intermolecular distances into nodes of a network, and the direct transitions between them are the links. The network analysis reveals that the bound state consists of several subbasins, i.e., binding modes characterized by distinct intermolecular hydrogen bonds and hydrophobic contacts. The dissociation kinetics show a simple (i.e., single-exponential) time dependence because the unbinding barrier is much higher than the barriers between subbasins in the bound state. The unbinding transition state is made up of heterogeneous positions and orientations of the ligand in the FKBP active site, which correspond to multiple pathways of dissociation. For the six small ligands of FKBP, the weaker the binding affinity the closer to the bound state (along the intermolecular distance) are the transition state structures, which is a new manifestation of Hammond behavior. Experimental approaches to the study of fragment binding to proteins have limitations in temporal and spatial resolution. Our network analysis of the unbinding simulations of small inhibitors from an enzyme paints a clear picture of the free energy landscape (both thermodynamics and kinetics) of ligand unbinding.

[Treatment of severe intermittent claudication: ORACLE-PGE1 short term study. A randomised 40-week study. Evaluation of efficacy and costs].

PubMed

Cesarone, M R; Belcaro, G; Nicolaides, A N; Griffin, M; Geroulakos, G; Ramaswami, G; Cazaubon, M; Barsotti, A; Vasdekis, S; Christopoulos, D; Agus, G; Bavera, P; Mondani, P; Ippolito, E; Flenda, F

2002-12-01

The efficacy and cost of prostaglandin E1 (PGE1) in severe intermittent claudication was studied comparing a long-term protocol (LTP) with a short-term protocol (STP) in a randomised 40-week study. Phase 1 was a 2-week run-in phase (no treatment) for both protocols. In LTP, phase 2 was the main treatment phase. Treatment was performed with 2-hour infusions (60 micro g PGE1, 5 days each week for 4 weeks. In phase 3 (4-week interval period), PGE1 was administered twice a week (same dosage). In phase 4 (40 weeks), no PGE1 were used. In STP, phase 2 treatment was performed in two days by a 2-hour infusion (60 micro g PGE1 twice a day in 2 days). The same cycle was repeated every 4 weeks. A treadmill test was performed at inclusion, at the beginning of each phase and at the end of weeks 12, 16, 20 32 and 40. A progressive training plan (walking) and reduction in risk factors plan was used in both groups. Out of the 1276 included patients 1165 completed the study (606 in LTP group; 559 in the STP). Drop-outs were 111. The two groups were comparable in distribution, risk factors and smoking. Intention-to-treat analysis indicated an increase in pain free walking distance (PFWD). The absolute and percent increase in pain-free walking distance (PFWD) was comparable in both LTP and STP groups with a significative increase in TWD at 4 weeks. At 20 and 40 weeks increase was up to 219% in the LTP and 460% in the STP group (p<0.02). Comparable results concerning PFWD were obtained in the two groups. Both treatments were well tolerated. No side effect was observed. Local effects were observed in 8.5% of the treated subjects in the LTP and 4% in the STP. The average cost of the LTP protocol was 8786 Euro. For STP the costs was 946 (10.8% of LTP). For both protocols the cost of the infusion was 24% of the total for the LTP and 35% in the STP. Therefore 75% of the cost is not drug-related. In conclusion between-group-analysis favours STP considering walking distance and costs. Results indicate good efficacy and tolerability of PGE1 treatment particularly STP.

Efficient DNP NMR of Membrane Proteins: Sample Preparation Protocols, Sensitivity, and Radical Location

PubMed Central

Liao, Shu Y.; Lee, Myungwoon; Wang, Tuo; Sergeyev, Ivan V.; Hong, Mei

2016-01-01

Although dynamic nuclear polarization (DNP) has dramatically enhanced solid-state NMR spectral sensitivities of many synthetic materials and some biological macromolecules, recent studies of membrane-protein DNP using exogenously doped paramagnetic radicals as polarizing agents have reported varied and sometimes surprisingly limited enhancement factors. This motivated us to carry out a systematic evaluation of sample preparation protocols for optimizing the sensitivity of DNP NMR spectra of membrane-bound peptides and proteins at cryogenic temperatures of ~110 K. We show that mixing the radical with the membrane by direct titration instead of centrifugation gives a significant boost to DNP enhancement. We quantify the relative sensitivity enhancement between AMUPol and TOTAPOL, two commonly used radicals, and between deuterated and protonated lipid membranes. AMUPol shows ~4 fold higher sensitivity enhancement than TOTAPOL, while deuterated lipid membrane does not give net higher sensitivity for the membrane peptides than protonated membrane. Overall, a ~100 fold enhancement between the microwave-on and microwave-off spectra can be achieved on lipid-rich membranes containing conformationally disordered peptides, and absolute sensitivity gains of 105–160 can be obtained between low-temperature DNP spectra and high-temperature non-DNP spectra. We also measured the paramagnetic relaxation enhancement of lipid signals by TOTAPOL and AMUPol, to determine the depths of these two radicals in the lipid bilayer. Our data indicate a bimodal distribution of both radicals, a surface-bound fraction and a membrane-bound fraction where the nitroxides lie at ~10 Å from the membrane surface. TOTAPOL appears to have a higher membrane-embedded fraction than AMUPol. These results should be useful for membrane-protein solid-state NMR studies under DNP conditions and provide insights into how biradicals interact with phospholipid membranes. PMID:26873390

Lanthanides in soils of the Cherepovets steel mill impact zone

NASA Astrophysics Data System (ADS)

Ladonin, D. V.

2017-06-01

Contents of different lanthanide forms in soddy-calcareous soils at different distances from the Cherepovets steel mill (Vologda oblast) have been studied. Increased contents of Pr and Tb are found in soils near the pollution source. Less manifested increases in the contents of other lanthanides (from La to Gd) are also observed. Along with the increase in total content, technogenic pollution increases the content of acid-soluble lanthanides and affects their degree of extraction. The residual fraction strongly bound to aluminosilicates contains 80 to 95% of lanthanides. Soil processes result in the partial binding of lanthanides with organic matter (5-18% of their total content) and Fe and Mn (hydr)oxides (0.1-5% of the total content). The individual properties of lanthanides are clearly manifested in their interaction with these soil components. The highest share of the fraction bound to organic matter contains medium lanthanides, and the highest share of the fraction bound to Fe and Mn (hydr)oxides contains heavy lanthanides.

An invariance property of generalized Pearson random walks in bounded geometries

NASA Astrophysics Data System (ADS)

Mazzolo, Alain

2009-03-01

Invariance properties of random walks in bounded domains are a topic of growing interest since they contribute to improving our understanding of diffusion in confined geometries. Recently, limited to Pearson random walks with exponentially distributed straight paths, it has been shown that under isotropic uniform incidence, the average length of the trajectories through the domain is independent of the random walk characteristic and depends only on the ratio of the volume's domain over its surface. In this paper, thanks to arguments of integral geometry, we generalize this property to any isotropic bounded stochastic process and we give the conditions of its validity for isotropic unbounded stochastic processes. The analytical form for the traveled distance from the boundary to the first scattering event that ensures the validity of the Cauchy formula is also derived. The generalization of the Cauchy formula is an analytical constraint that thus concerns a very wide range of stochastic processes, from the original Pearson random walk to a Rayleigh distribution of the displacements, covering many situations of physical importance.

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

NASA Technical Reports Server (NTRS)

Lee, P. J.

1984-01-01

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Scalable Lunar Surface Networks and Adaptive Orbit Access

NASA Technical Reports Server (NTRS)

Wang, Xudong

2015-01-01

Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.

Self-Configuration and Self-Optimization Process in Heterogeneous Wireless Networks

PubMed Central

Guardalben, Lucas; Villalba, Luis Javier García; Buiati, Fábio; Sobral, João Bosco Mangueira; Camponogara, Eduardo

2011-01-01

Self-organization in Wireless Mesh Networks (WMN) is an emergent research area, which is becoming important due to the increasing number of nodes in a network. Consequently, the manual configuration of nodes is either impossible or highly costly. So it is desirable for the nodes to be able to configure themselves. In this paper, we propose an alternative architecture for self-organization of WMN based on Optimized Link State Routing Protocol (OLSR) and the ad hoc on demand distance vector (AODV) routing protocols as well as using the technology of software agents. We argue that the proposed self-optimization and self-configuration modules increase the throughput of network, reduces delay transmission and network load, decreases the traffic of HELLO messages according to network’s scalability. By simulation analysis, we conclude that the self-optimization and self-configuration mechanisms can significantly improve the performance of OLSR and AODV protocols in comparison to the baseline protocols analyzed. PMID:22346584

Self-configuration and self-optimization process in heterogeneous wireless networks.

PubMed

Guardalben, Lucas; Villalba, Luis Javier García; Buiati, Fábio; Sobral, João Bosco Mangueira; Camponogara, Eduardo

2011-01-01

Self-organization in Wireless Mesh Networks (WMN) is an emergent research area, which is becoming important due to the increasing number of nodes in a network. Consequently, the manual configuration of nodes is either impossible or highly costly. So it is desirable for the nodes to be able to configure themselves. In this paper, we propose an alternative architecture for self-organization of WMN based on Optimized Link State Routing Protocol (OLSR) and the ad hoc on demand distance vector (AODV) routing protocols as well as using the technology of software agents. We argue that the proposed self-optimization and self-configuration modules increase the throughput of network, reduces delay transmission and network load, decreases the traffic of HELLO messages according to network's scalability. By simulation analysis, we conclude that the self-optimization and self-configuration mechanisms can significantly improve the performance of OLSR and AODV protocols in comparison to the baseline protocols analyzed.

An energy-efficient data gathering protocol in large wireless sensor network

NASA Astrophysics Data System (ADS)

Wang, Yamin; Zhang, Ruihua; Tao, Shizhong

2006-11-01

Wireless sensor network consisting of a large number of small sensors with low-power transceiver can be an effective tool for gathering data in a variety of environment. The collected data must be transmitted to the base station for further processing. Since a network consists of sensors with limited battery energy, the method for data gathering and routing must be energy efficient in order to prolong the lifetime of the network. In this paper, we presented an energy-efficient data gathering protocol in wireless sensor network. The new protocol used data fusion technology clusters nodes into groups and builds a chain among the cluster heads according to a hybrid of the residual energy and distance to the base station. Results in stochastic geometry are used to derive the optimum parameter of our algorithm that minimizes the total energy spent in the network. Simulation results show performance superiority of the new protocol.

Discrete Fluctuations in Memory Erasure without Energy Cost

NASA Astrophysics Data System (ADS)

Croucher, Toshio; Bedkihal, Salil; Vaccaro, Joan A.

2017-02-01

According to Landauer's principle, erasing one bit of information incurs a minimum energy cost. Recently, Vaccaro and Barnett (VB) explored information erasure within the context of generalized Gibbs ensembles and demonstrated that for energy-degenerate spin reservoirs the cost of erasure can be solely in terms of a minimum amount of spin angular momentum and no energy. As opposed to the Landauer case, the cost of erasure in this case is associated with an intrinsically discrete degree of freedom. Here we study the discrete fluctuations in this cost and the probability of violation of the VB bound. We also obtain a Jarzynski-like equality for the VB erasure protocol. We find that the fluctuations below the VB bound are exponentially suppressed at a far greater rate and more tightly than for an equivalent Jarzynski expression for VB erasure. We expose a trade-off between the size of the fluctuations and the cost of erasure. We find that the discrete nature of the fluctuations is pronounced in the regime where reservoir spins are maximally polarized. We also state the first laws of thermodynamics corresponding to the conservation of spin angular momentum for this particular erasure protocol. Our work will be important for novel heat engines based on information erasure schemes that do not incur an energy cost.

CABS-dock web server for the flexible docking of peptides to proteins without prior knowledge of the binding site

PubMed Central

Kurcinski, Mateusz; Jamroz, Michal; Blaszczyk, Maciej; Kolinski, Andrzej; Kmiecik, Sebastian

2015-01-01

Protein–peptide interactions play a key role in cell functions. Their structural characterization, though challenging, is important for the discovery of new drugs. The CABS-dock web server provides an interface for modeling protein–peptide interactions using a highly efficient protocol for the flexible docking of peptides to proteins. While other docking algorithms require pre-defined localization of the binding site, CABS-dock does not require such knowledge. Given a protein receptor structure and a peptide sequence (and starting from random conformations and positions of the peptide), CABS-dock performs simulation search for the binding site allowing for full flexibility of the peptide and small fluctuations of the receptor backbone. This protocol was extensively tested over the largest dataset of non-redundant protein–peptide interactions available to date (including bound and unbound docking cases). For over 80% of bound and unbound dataset cases, we obtained models with high or medium accuracy (sufficient for practical applications). Additionally, as optional features, CABS-dock can exclude user-selected binding modes from docking search or to increase the level of flexibility for chosen receptor fragments. CABS-dock is freely available as a web server at http://biocomp.chem.uw.edu.pl/CABSdock. PMID:25943545

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.

Cryptography from noisy storage.

PubMed

Wehner, Stephanie; Schaffner, Christian; Terhal, Barbara M

2008-06-06

We show how to implement cryptographic primitives based on the realistic assumption that quantum storage of qubits is noisy. We thereby consider individual-storage attacks; i.e., the dishonest party attempts to store each incoming qubit separately. Our model is similar to the model of bounded-quantum storage; however, we consider an explicit noise model inspired by present-day technology. To illustrate the power of this new model, we show that a protocol for oblivious transfer is secure for any amount of quantum-storage noise, as long as honest players can perform perfect quantum operations. Our model also allows us to show the security of protocols that cope with noise in the operations of the honest players and achieve more advanced tasks such as secure identification.

Machine learning approaches to evaluate correlation patterns in allosteric signaling: A case study of the PDZ2 domain

NASA Astrophysics Data System (ADS)

Botlani, Mohsen; Siddiqui, Ahnaf; Varma, Sameer

2018-06-01

Many proteins are regulated by dynamic allostery wherein regulator-induced changes in structure are comparable with thermal fluctuations. Consequently, understanding their mechanisms requires assessment of relationships between and within conformational ensembles of different states. Here we show how machine learning based approaches can be used to simplify this high-dimensional data mining task and also obtain mechanistic insight. In particular, we use these approaches to investigate two fundamental questions in dynamic allostery. First, how do regulators modify inter-site correlations in conformational fluctuations (Cij)? Second, how are regulator-induced shifts in conformational ensembles at two different sites in a protein related to each other? We address these questions in the context of the human protein tyrosine phosphatase 1E's PDZ2 domain, which is a model protein for studying dynamic allostery. We use molecular dynamics to generate conformational ensembles of the PDZ2 domain in both the regulator-bound and regulator-free states. The employed protocol reproduces methyl deuterium order parameters from NMR. Results from unsupervised clustering of Cij combined with flow analyses of weighted graphs of Cij show that regulator binding significantly alters the global signaling network in the protein; however, not by altering the spatial arrangement of strongly interacting amino acid clusters but by modifying the connectivity between clusters. Additionally, we find that regulator-induced shifts in conformational ensembles, which we evaluate by repartitioning ensembles using supervised learning, are, in fact, correlated. This correlation Δij is less extensive compared to Cij, but in contrast to Cij, Δij depends inversely on the distance from the regulator binding site. Assuming that Δij is an indicator of the transduction of the regulatory signal leads to the conclusion that the regulatory signal weakens with distance from the regulatory site. Overall, this work provides new approaches to analyze high-dimensional molecular simulation data and also presents applications that yield new insight into dynamic allostery.

Protecting single-photon entanglement with practical entanglement source

NASA Astrophysics Data System (ADS)

Zhou, Lan; Ou-Yang, Yang; Wang, Lei; Sheng, Yu-Bo

2017-06-01

Single-photon entanglement (SPE) is important for quantum communication and quantum information processing. However, SPE is sensitive to photon loss. In this paper, we discuss a linear optical amplification protocol for protecting SPE. Different from the previous protocols, we exploit the practical spontaneous parametric down-conversion (SPDC) source to realize the amplification, for the ideal entanglement source is unavailable in current quantum technology. Moreover, we prove that the amplification using the entanglement generated from SPDC source as auxiliary is better than the amplification assisted with single photons. The reason is that the vacuum state from SPDC source will not affect the amplification, so that it can be eliminated automatically. This protocol may be useful in future long-distance quantum communications.

Simultaneous dense coding affected by fluctuating massless scalar field

NASA Astrophysics Data System (ADS)

Huang, Zhiming; Ye, Yiyong; Luo, Darong

2018-04-01

In this paper, we investigate the simultaneous dense coding (SDC) protocol affected by fluctuating massless scalar field. The noisy model of SDC protocol is constructed and the master equation that governs the SDC evolution is deduced. The success probabilities of SDC protocol are discussed for different locking operators under the influence of vacuum fluctuations. We find that the joint success probability is independent of the locking operators, but other success probabilities are not. For quantum Fourier transform and double controlled-NOT operators, the success probabilities drop with increasing two-atom distance, but SWAP operator is not. Unlike the SWAP operator, the success probabilities of Bob and Charlie are different. For different noisy interval values, different locking operators have different robustness to noise.

Finite-size analysis of a continuous-variable quantum key distribution

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

Leverrier, Anthony; Grosshans, Frederic; Grangier, Philippe

2010-06-15

The goal of this paper is to extend the framework of finite-size analysis recently developed for quantum key distribution to continuous-variable protocols. We do not solve this problem completely here, and we mainly consider the finite-size effects on the parameter estimation procedure. Despite the fact that some questions are left open, we are able to give an estimation of the secret key rate for protocols which do not contain a postselection procedure. As expected, these results are significantly more pessimistic than those obtained in the asymptotic regime. However, we show that recent continuous-variable protocols are able to provide fully securemore » secret keys in the finite-size scenario, over distances larger than 50 km.« less

Implicit Block ACK Scheme for IEEE 802.11 WLANs

PubMed Central

Sthapit, Pranesh; Pyun, Jae-Young

2016-01-01

The throughput of IEEE 802.11 standard is significantly bounded by the associated Medium Access Control (MAC) overhead. Because of the overhead, an upper limit exists for throughput, which is bounded, including situations where data rates are extremely high. Therefore, an overhead reduction is necessary to achieve higher throughput. The IEEE 802.11e amendment introduced the block ACK mechanism, to reduce the number of control messages in MAC. Although the block ACK scheme greatly reduces overhead, further improvements are possible. In this letter, we propose an implicit block ACK method that further reduces the overhead associated with IEEE 802.11e’s block ACK scheme. The mathematical analysis results are presented for both the original protocol and the proposed scheme. A performance improvement of greater than 10% was achieved with the proposed implementation.

Reynolds number effects on mixing due to topological chaos

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

Smith, Spencer A.; Warrier, Sangeeta

2016-03-15

Topological chaos has emerged as a powerful tool to investigate fluid mixing. While this theory can guarantee a lower bound on the stretching rate of certain material lines, it does not indicate what fraction of the fluid actually participates in this minimally mandated mixing. Indeed, the area in which effective mixing takes place depends on physical parameters such as the Reynolds number. To help clarify this dependency, we numerically simulate the effects of a batch stirring device on a 2D incompressible Newtonian fluid in the laminar regime. In particular, we calculate the finite time Lyapunov exponent (FTLE) field for threemore » different stirring protocols, one topologically complex (pseudo-Anosov) and two simple (finite-order), over a range of viscosities. After extracting appropriate measures indicative of both the amount of mixing and the area of effective mixing from the FTLE field, we see a clearly defined Reynolds number range in which the relative efficacy of the pseudo-Anosov protocol over the finite-order protocols justifies the application of topological chaos. More unexpectedly, we see that while the measures of effective mixing area increase with increasing Reynolds number for the finite-order protocols, they actually exhibit non-monotonic behavior for the pseudo-Anosov protocol.« less

Optimization of fringe-type laser anemometers for turbine engine component testing

NASA Technical Reports Server (NTRS)

Seasholtz, R. G.; Oberle, L. G.; Weikle, D. H.

1984-01-01

The fringe type laser anemometer is analyzed using the Cramer-Rao bound for the variance of the estimate of the Doppler frequency as a figure of merit. Mie scattering theory is used to calculate the Doppler signal wherein both the amplitude and phase of the scattered light are taken into account. The noise from wall scatter is calculated using the wall bidirectional reflectivity and the irradiance of the incident beams. A procedure is described to determine the optimum aperture mask for the probe volume located a given distance from a wall. The expected performance of counter type processors is also discussed in relation to the Cramer-Rao bound. Numerical examples are presented for a coaxial backscatter anemometer.

Identification and calculation of the universal asymptote for drag reduction by polymers in wall bounded turbulence.

PubMed

Benzi, Roberto; De Angelis, Elisabetta; L'vov, Victor S; Procaccia, Itamar

2005-11-04

Drag reduction by polymers in wall turbulence is bounded from above by a universal maximal drag reduction (MDR) velocity profile that is a log law, estimated experimentally by Virk as V+(y+) approximately 11.7logy+ - 17. Here V+(y+) and y+ are the mean streamwise velocity and the distance from the wall in "wall" units. In this Letter we propose that this MDR profile is an edge solution of the Navier-Stokes equations (with an effective viscosity profile) beyond which no turbulent solutions exist. This insight rationalizes the universality of the MDR and provides a maximum principle which allows an ab initio calculation of the parameters in this law without any viscoelastic experimental input.

BKT phase transition in a 2D system with long-range dipole-dipole interaction

NASA Astrophysics Data System (ADS)

Fedichev, P. O.; Men'shikov, L. I.

2012-01-01

We consider phase transitions in 2D XY-like systems with long-range dipole-dipole interactions and demonstrate that BKT-type phase transition always occurs separating the ordered (ferroelectric) and the disordered (paraelectric) phases. The low-temperature phase corresponds to a thermal state with bound vortex-antivortex pairs characterized by linear attraction at large distances. Using the Maier-Schwabl topological charge model, we show that bound vortex pairs polarize and screen the vortex-antivortex interaction, leaving only the logarithmic attraction at sufficiently large separations between the vortices. At higher temperatures the pairs dissociate and the phase transition similar to BKT occurs, though at a larger temperature than in a system without the dipole-dipole interaction.

Titanium Dioxide Coating Prepared by Use of a Suspension-Solution Plasma-Spray Process

NASA Astrophysics Data System (ADS)

Du, Lingzhong; Coyle, Thomas W.; Chien, Ken; Pershin, Larry; Li, Tiegang; Golozar, Mehdi

2015-08-01

Titanium dioxide coatings were prepared from titanium isopropoxide solution containing nano TiO2 particles by use of a plasma-spray process. The effects of stand-off distance on coating composition and microstructure were investigated and compared with those for pure solution precursor and a water-based suspension of TiO2. The results showed that the anatase content of the coating increased with increasing stand-off distance and the rate of deposition decreased with increasing spray distance. Anatase nanoparticles in solution were incorporated into the coatings without phase transformation whereas most of the TiO2 in the precursor solution was transformed into rutile. The microstructure of preserved anatase particles bound by rutile improved the efficiency of deposition of the coating. The amount of anatase phase can be adjusted by variation of the ratio of solution to added anatase TiO2 nanoparticles.

A resolution measure for three-dimensional microscopy

PubMed Central

Chao, Jerry; Ram, Sripad; Abraham, Anish V.; Ward, E. Sally; Ober, Raimund J.

2009-01-01

A three-dimensional (3D) resolution measure for the conventional optical microscope is introduced which overcomes the drawbacks of the classical 3D (axial) resolution limit. Formulated within the context of a parameter estimation problem and based on the Cramer-Rao lower bound, this 3D resolution measure indicates the accuracy with which a given distance between two objects in 3D space can be determined from the acquired image. It predicts that, given enough photons from the objects of interest, arbitrarily small distances of separation can be estimated with prespecified accuracy. Using simulated images of point source pairs, we show that the maximum likelihood estimator is capable of attaining the accuracy predicted by the resolution measure. We also demonstrate how different factors, such as extraneous noise sources and the spatial orientation of the imaged object pair, can affect the accuracy with which a given distance of separation can be determined. PMID:20161040

THE EFFECTS OF SCALE, DISTANCE AND TIME ON DRINKING WATER SYSTEMS RESEARCH

EPA Science Inventory

This presentation introduces and describes many components related to what generates and/or controls the concentrations of metals and other constituents in drinking water. Emphasis is placed on ways in which sampling protocol affects apparent levels of constituents, and the magn...

Local Area Networks: Part I.

ERIC Educational Resources Information Center

Dessy, Raymond E.

1982-01-01

Local area networks are common communication conduits allowing various terminals, computers, discs, printers, and other electronic devices to intercommunicate over short distances. Discusses the vocabulary of such networks including RS-232C point-to-point and IEEE-488 multidrop protocols; error detection; message packets; multiplexing; star, ring,…

Improved exogenous DNA uptake in bovine spermatozoa and gene expression in embryos using membrane destabilizing agents in ICSI-SMGT.

PubMed

Sánchez-Villalba, Esther; Arias, María Elena; Zambrano, Fabiola; Loren, Pía; Felmer, Ricardo

2018-02-01

Sperm-mediated gene transfer (SMGT) is a simple, fast, and economical biotechnological tool for producing transgenic animals. However, transgene expression with this technique in bovine embryos is still inefficient due to low uptake and binding of exogenous DNA in spermatozoa. The present study evaluated the effects of sperm membrane destabilization on the binding capacity, location and quantity of bound exogenous DNA in cryopreserved bovine spermatozoa using Triton X-100 (TX-100), lysolecithin (LL) and sodium hydroxide (NaOH). Effects of these treatments were also evaluated by intracytoplasmic sperm injection (ICSI)-SMGT. Results showed that all treatments bound exogenous DNA to spermatozoa including the control. Spermatozoa treated with different membrane destabilizing agents bound the exogenous DNA throughout the head and tail of spermatozoa, compared with the control, in which binding occurred mainly in the post-acrosomal region and tail. The amount of exogenous DNA bound to spermatozoa was much higher for the different sperm treatments than the control (P < 0.05), most likely due to the damage induced by these treatments to the plasma and acrosomal membranes. Exogenous gene expression in embryos was also improved by these treatments. These results demonstrated that sperm membrane destabilization could be a novel strategy in bovine SMGT protocols for the generation of transgenic embryos by ICSI.

Preparation of the Nuclear Matrix for Parallel Microscopy and Biochemical Analyses.

PubMed

Wilson, Rosemary H C; Hesketh, Emma L; Coverley, Dawn

2016-01-04

Immobilized proteins within the nucleus are usually identified by treating cells with detergent. The detergent-resistant fraction is often assumed to be chromatin and is described as such in many studies. However, this fraction consists of both chromatin-bound and nuclear-matrix-bound proteins. To investigate nuclear-matrix-bound proteins alone, further separation of these fractions is required; the DNA must be removed so that the remaining proteins can be compared with those from untreated cells. This protocol uses a nonionic detergent (Triton X-100) to remove membranes and soluble proteins from cells under physiologically relevant salt concentrations, followed by extraction with 0.5 m NaCl, digestion with DNase I, and removal of fragmented DNA. It uses a specialized buffer (cytoskeletal buffer) to stabilize the cytoskeleton and nuclear matrix in relatively gentle conditions. Nuclear matrix proteins can then be assessed by either immunofluorescence (IF) and immunoblotting (IB). IB has the advantage of resolving different forms of a protein of interest, and the soluble fractions can be analyzed. The major advantage of IF analysis is that individual cells (rather than homogenized populations) can be monitored, and the spatial arrangement of proteins bound to residual nuclear structures can be revealed. © 2016 Cold Spring Harbor Laboratory Press.

Magnetic Materials Suitable for Fission Power Conversion in Space Missions

NASA Technical Reports Server (NTRS)

Bowman, Cheryl L.

2012-01-01

Terrestrial fission reactors use combinations of shielding and distance to protect power conversion components from elevated temperature and radiation. Space mission systems are necessarily compact and must minimize shielding and distance to enhance system level efficiencies. Technology development efforts to support fission power generation scenarios for future space missions include studying the radiation tolerance of component materials. The fundamental principles of material magnetism are reviewed and used to interpret existing material radiation effects data for expected fission power conversion components for target space missions. Suitable materials for the Fission Power System (FPS) Project are available and guidelines are presented for bounding the elevated temperature/radiation tolerance envelope for candidate magnetic materials.

Hydrodynamic interaction of trapped active Janus particles in two dimensions

NASA Astrophysics Data System (ADS)

Debnath, Tanwi; Li, Yunyun; Ghosh, Pulak K.; Marchesoni, Fabio

2018-04-01

The dynamics of a pair of identical artificial microswimmers bound inside two harmonic traps, in a thin sheared fluid film, is numerically investigated. In a two-dimensional Oseen approximation, the hydrodynamic pair coupling is long-ranged and proportional to the particle radius to film thickness ratio. On increasing such ratio above a certain threshold, a transition occurs between a free regime, where each swimmer orbits in its own trap with random phase, and a strong synchronization regime, where the two swimmers strongly repel each other to an average distance larger than both the trap distance and their free orbit diameter. Moreover, the swimmers tend to synchronize their positions opposite the center of the system.

Ancient microbes from halite fluid inclusions: optimized surface sterilization and DNA extraction.

PubMed

Sankaranarayanan, Krithivasan; Timofeeff, Michael N; Spathis, Rita; Lowenstein, Tim K; Lum, J Koji

2011-01-01

Fluid inclusions in evaporite minerals (halite, gypsum, etc.) potentially preserve genetic records of microbial diversity and changing environmental conditions of Earth's hydrosphere for nearly one billion years. Here we describe a robust protocol for surface sterilization and retrieval of DNA from fluid inclusions in halite that, unlike previously published methods, guarantees removal of potentially contaminating surface-bound DNA. The protocol involves microscopic visualization of cell structures, deliberate surface contamination followed by surface sterilization with acid and bleach washes, and DNA extraction using Amicon centrifugal filters. Methods were verified on halite crystals of four different ages from Saline Valley, California (modern, 36 ka, 64 ka, and 150 ka), with retrieval of algal and archaeal DNA, and characterization of the algal community using ITS1 sequences. The protocol we developed opens up new avenues for study of ancient microbial ecosystems in fluid inclusions, understanding microbial evolution across geological time, and investigating the antiquity of life on earth and other parts of the solar system.

Use of optokinetics based OKCSIB protocol in restoring mobility in primary progressive MS.

PubMed

Chitambira, Benjamin; McConaghy, Ciara

2017-10-04

The case is of a mid-40s patient who developed progressive muscle weakness and loss of mobility over 6 weeks due to primary progressive multiple sclerosis. 2.5 days before admission, she became bed bound with weakness of 1/5 on the Oxford scale. She normally rested for a couple of days after similar periods of worsening symptoms and then got back on her feet although with worse balance. She was treated with optokinetic chart stimulation and sensory interaction for balance (OKCSIB) protocol. Within 2 days of intervention, she was mobile with a delta frame and supervision of one. By the end of a week, she was independently mobile with her delta frame. It is recommended that instead of just practising function, the OKCSIB protocol be used to regain antigravity extensor control loss of which leads to deteriorating function in neurological conditions. © BMJ Publishing Group Ltd (unless otherwise stated in the text of the article) 2017. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

Channel-capacity gain in entanglement-assisted communication protocols based exclusively on linear optics, single-photon inputs, and coincidence photon counting

DOE PAGES

Lougovski, P.; Uskov, D. B.

2015-08-04

Entanglement can effectively increase communication channel capacity as evidenced by dense coding that predicts a capacity gain of 1 bit when compared to entanglement-free protocols. However, dense coding relies on Bell states and when implemented using photons the capacity gain is bounded by 0.585 bits due to one's inability to discriminate between the four optically encoded Bell states. In this research we study the following question: Are there alternative entanglement-assisted protocols that rely only on linear optics, coincidence photon counting, and separable single-photon input states and at the same time provide a greater capacity gain than 0.585 bits? In thismore » study, we show that besides the Bell states there is a class of bipartite four-mode two-photon entangled states that facilitate an increase in channel capacity. We also discuss how the proposed scheme can be generalized to the case of two-photon N-mode entangled states for N=6,8.« less

Generalization of the Time-Energy Uncertainty Relation of Anandan-Aharonov Type

NASA Technical Reports Server (NTRS)

Hirayama, Minoru; Hamada, Takeshi; Chen, Jin

1996-01-01

A new type of time-energy uncertainty relation was proposed recently by Anandan and Aharonov. Their formula, to estimate the lower bound of time-integral of the energy-fluctuation in a quantum state is generalized to the one involving a set of quantum states. This is achieved by obtaining an explicit formula for the distance between two finitely separated points in the Grassman manifold.

Rigidity of quantum steering and one-sided device-independent verifiable quantum computation

NASA Astrophysics Data System (ADS)

Gheorghiu, Alexandru; Wallden, Petros; Kashefi, Elham

2017-02-01

The relationship between correlations and entanglement has played a major role in understanding quantum theory since the work of Einstein et al (1935 Phys. Rev. 47 777-80). Tsirelson proved that Bell states, shared among two parties, when measured suitably, achieve the maximum non-local correlations allowed by quantum mechanics (Cirel’son 1980 Lett. Math. Phys. 4 93-100). Conversely, Reichardt et al showed that observing the maximal correlation value over a sequence of repeated measurements, implies that the underlying quantum state is close to a tensor product of maximally entangled states and, moreover, that it is measured according to an ideal strategy (Reichardt et al 2013 Nature 496 456-60). However, this strong rigidity result comes at a high price, requiring a large number of entangled pairs to be tested. In this paper, we present a significant improvement in terms of the overhead by instead considering quantum steering where the device of the one side is trusted. We first demonstrate a robust one-sided device-independent version of self-testing, which characterises the shared state and measurement operators of two parties up to a certain bound. We show that this bound is optimal up to constant factors and we generalise the results for the most general attacks. This leads us to a rigidity theorem for maximal steering correlations. As a key application we give a one-sided device-independent protocol for verifiable delegated quantum computation, and compare it to other existing protocols, to highlight the cost of trust assumptions. Finally, we show that under reasonable assumptions, the states shared in order to run a certain type of verification protocol must be unitarily equivalent to perfect Bell states.

DNA interactions with a Methylene Blue redox indicator depend on the DNA length and are sequence specific.

PubMed

Farjami, Elaheh; Clima, Lilia; Gothelf, Kurt V; Ferapontova, Elena E

2010-06-01

A DNA molecular beacon approach was used for the analysis of interactions between DNA and Methylene Blue (MB) as a redox indicator of a hybridization event. DNA hairpin structures of different length and guanine (G) content were immobilized onto gold electrodes in their folded states through the alkanethiol linker at the 5'-end. Binding of MB to the folded hairpin DNA was electrochemically studied and compared with binding to the duplex structure formed by hybridization of the hairpin DNA to a complementary DNA strand. Variation of the electrochemical signal from the DNA-MB complex was shown to depend primarily on the DNA length and sequence used: the G-C base pairs were the preferential sites of MB binding in the duplex. For short 20 nts long DNA sequences, the increased electrochemical response from MB bound to the duplex structure was consistent with the increased amount of bound and electrochemically readable MB molecules (i.e. MB molecules that are available for the electron transfer (ET) reaction with the electrode). With longer DNA sequences, the balance between the amounts of the electrochemically readable MB molecules bound to the hairpin DNA and to the hybrid was opposite: a part of the MB molecules bound to the long-sequence DNA duplex seem to be electrochemically mute due to long ET distance. The increasing electrochemical response from MB bound to the short-length DNA hybrid contrasts with the decreasing signal from MB bound to the long-length DNA hybrid and allows an "off"-"on" genosensor development.

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.

Gravitational-wave bursts and stochastic background from superfluid vortex avalanches during pulsar glitches

NASA Astrophysics Data System (ADS)

Warszawski, L.; Melatos, A.

2012-07-01

The current-quadrupole gravitational-wave signal emitted during the spin-up phase of a pulsar glitch is calculated from first principles by modelling the vortex dynamics observed in recent Gross-Pitaevskii simulations of pinned, decelerating quantum condensates. Homogeneous and inhomogeneous unpinning geometries, representing creep- and avalanche-like glitches, provide lower and upper bounds on the gravitational-wave signal strength, respectively. The signal arising from homogeneous glitches is found to scale with the square root of glitch size, whereas the signal from inhomogeneous glitches scales proportional to glitch size. The signal is also computed as a function of vortex travel distance and stellar angular velocity. Convenient amplitude scalings are derived as functions of these parameters. For the typical astrophysical situation, where the glitch duration (in units of the spin period) is large compared to the vortex travel distance (in units of the stellar radius), an individual glitch from an object 1 kpc from Earth generates a wave strain of 10-24[(Δω/ω)/10-7](ω/102 rad s-1)3(Δr/10-2 m)-1, where Δr is the average distance travelled by a vortex during a glitch, Δω/ω is the fractional glitch size and ω is the pulsar angular velocity. The non-detection of a signal from the 2006 Vela glitch in data from the fifth science run conducted by the Laser Interferometer Gravitational-Wave Observatory implies that the glitch duration exceeds ˜10-4 ms. This represents the first observational lower bound on glitch duration to be obtained.

Nuclear magnetic resonance studies of formyltetrahydrofolate synthetase interactions with formate and methylammonium ion.

PubMed

Wendland, M F; Stevens, T H; Buttlaire, D H; Everett, G W; Himes, R H

1983-02-15

Using nuclear magnetic resonance techniques, we have measured the internuclear distances separating the nucleotide-bound metal from the carbon and hydrogen nuclei of formate as well as the carbon of methylammonium cation when bound to formyltetrahydrofolate synthetase. Measurements were made of the paramagnetic effect on the spin-lattice relaxation rates (1/T1) of 13C and 1H nuclei arising from the replacement of Mg2+ with Mn2+, which binds to the enzyme in the form of a metal-nucleotide complex. Distances from Mn2+ to the formate carbon and proton were found to be 6.3 and 7.4 A, respectively, in the E . ATP . Mn2+ . formate complex and 6.0 and 7.1 A, respectively, in the E . ADP . Mn2+ . formate complex. When tetrahydrofolate was added to the latter complex, the exchange of formate was greatly reduced and became rate limiting for relaxation. These results are consistent with substantial conformational effects produced by the binding of the cofactor. The distance from Mn2+ to the methylammonium carbon in the E . ADP . Mn2+ . CH3NH+3, E . ADP . Mn2+ . formate . CH3NH3+, and E . ADP . Mn2+ . tetrahydrofolate . CH3NH3+ complexes was estimated to be in the range of 7.4-12 A. However, in the E . ADP . Mn2+ formate . tetrahydrofolate . CH3NH3+ complex, the data suggest that exchange of cation contributes significantly to relaxation. These results, combined with other known features of the enzyme, suggest that there may be a monovalent cation site within the active site of the enzyme.

Geometric comparison of popular mixture-model distances.

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

Mitchell, Scott A.

2010-09-01

Statistical Latent Dirichlet Analysis produces mixture model data that are geometrically equivalent to points lying on a regular simplex in moderate to high dimensions. Numerous other statistical models and techniques also produce data in this geometric category, even though the meaning of the axes and coordinate values differs significantly. A distance function is used to further analyze these points, for example to cluster them. Several different distance functions are popular amongst statisticians; which distance function is chosen is usually driven by the historical preference of the application domain, information-theoretic considerations, or by the desirability of the clustering results. Relatively littlemore » consideration is usually given to how distance functions geometrically transform data, or the distances algebraic properties. Here we take a look at these issues, in the hope of providing complementary insight and inspiring further geometric thought. Several popular distances, {chi}{sup 2}, Jensen - Shannon divergence, and the square of the Hellinger distance, are shown to be nearly equivalent; in terms of functional forms after transformations, factorizations, and series expansions; and in terms of the shape and proximity of constant-value contours. This is somewhat surprising given that their original functional forms look quite different. Cosine similarity is the square of the Euclidean distance, and a similar geometric relationship is shown with Hellinger and another cosine. We suggest a geodesic variation of Hellinger. The square-root projection that arises in Hellinger distance is briefly compared to standard normalization for Euclidean distance. We include detailed derivations of some ratio and difference bounds for illustrative purposes. We provide some constructions that nearly achieve the worst-case ratios, relevant for contours.« less

A coordination chemistry study of hydrated and solvated cationic vanadium ions in oxidation states +III, +IV, and +V in solution and solid state

PubMed Central

Krakowiak, Joanna; Lundberg, Daniel

2012-01-01

The coordination chemistry of hydrated and solvated vanadium(III), oxovanadium(IV), and dioxovanadium(V) ions in the oxygen donor solvents water, dimethylsulfoxide (dmso) and N,N′-dimethylpropyleneurea (dmpu) has been studied in solution by EXAFS and large angle X-ray scattering (LAXS) and in solid state by single crystal X-ray diffraction and EXAFS. The hydrated vanadium(III) ion has a regular octahedral configuration with a mean V-O bond distance of 1.99 Å. In the hydrated and dimethylsulfoxide solvated oxovanadium(IV) ions vanadium binds strongly to an oxo group at ca. 1.6 Å. The solvent molecule trans to the oxo group is very weakly bound, at ca. 2.2 Å, while the remaining four solvent molecules, with a mean V-O bond distance of 2.0 Å, form a plane slightly below the vanadium atom; the mean O=V-Operp bond angle is ca. 98°. In the dmpu solvated oxovanadium(IV) ion, the space demanding properties of the dmpu molecule leaving no solvent molecule in the trans position to the oxo group which reduces the coordination number to 5. The O=V-O bond angle is consequently much larger, 106°, and the mean V=O and V-O bond distances decrease to 1.58 and 1.97 Å, respectively. The hydrated and dimethylsulfoxide solvated dioxovanadium(V) ions display a very distorted octahedral configuration with the oxo groups in cis position with mean V=O bond distances of 1.6 Å and a O=V=O bond angle of ca. 105°. The solvent molecules trans to the oxo groups are weakly bound, at ca. 2.2 Å, while the remaining two have bond distances of 2.02 Å. The experimental studies of the coordination chemistry of hydrated and solvated vanadium(III,IV,V) ions are complemented by summarizing previously reported crystal structures to yield a comprehensive description of the coordination chemistry of vanadium with oxygen donor ligands. PMID:22950803

Device-independent security of quantum cryptography against collective attacks.

PubMed

Acín, Antonio; Brunner, Nicolas; Gisin, Nicolas; Massar, Serge; Pironio, Stefano; Scarani, Valerio

2007-06-08

We present the optimal collective attack on a quantum key distribution protocol in the "device-independent" security scenario, where no assumptions are made about the way the quantum key distribution devices work or on what quantum system they operate. Our main result is a tight bound on the Holevo information between one of the authorized parties and the eavesdropper, as a function of the amount of violation of a Bell-type inequality.

FTUC: A Flooding Tree Uneven Clustering Protocol for a Wireless Sensor Network.

PubMed

He, Wei; Pillement, Sebastien; Xu, Du

2017-11-23

Clustering is an efficient approach in a wireless sensor network (WSN) to reduce the energy consumption of nodes and to extend the lifetime of the network. Unfortunately, this approach requires that all cluster heads (CHs) transmit their data to the base station (BS), which gives rise to the long distance communications problem, and in multi-hop routing, the CHs near the BS have to forward data from other nodes that lead those CHs to die prematurely, creating the hot zones problem. Unequal clustering has been proposed to solve these problems. Most of the current algorithms elect CH only by considering their competition radius, leading to unevenly distributed cluster heads. Furthermore, global distances values are needed when calculating the competition radius, which is a tedious task in large networks. To face these problems, we propose a flooding tree uneven clustering protocol (FTUC) suited for large networks. Based on the construction of a tree type sub-network to calculate the minimum and maximum distances values of the network, we then apply the unequal cluster theory. We also introduce referenced position circles to evenly elect cluster heads. Therefore, cluster heads are elected depending on the node's residual energy and their distance to a referenced circle. FTUC builds the best inter-cluster communications route by evaluating a cluster head cost function to find the best next hop to the BS. The simulation results show that the FTUC algorithm decreases the energy consumption of the nodes and balances the global energy consumption effectively, thus extending the lifetime of the network.

On the inversion-indel distance

PubMed Central

2013-01-01

Background The inversion distance, that is the distance between two unichromosomal genomes with the same content allowing only inversions of DNA segments, can be computed thanks to a pioneering approach of Hannenhalli and Pevzner in 1995. In 2000, El-Mabrouk extended the inversion model to allow the comparison of unichromosomal genomes with unequal contents, thus insertions and deletions of DNA segments besides inversions. However, an exact algorithm was presented only for the case in which we have insertions alone and no deletion (or vice versa), while a heuristic was provided for the symmetric case, that allows both insertions and deletions and is called the inversion-indel distance. In 2005, Yancopoulos, Attie and Friedberg started a new branch of research by introducing the generic double cut and join (DCJ) operation, that can represent several genome rearrangements (including inversions). Among others, the DCJ model gave rise to two important results. First, it has been shown that the inversion distance can be computed in a simpler way with the help of the DCJ operation. Second, the DCJ operation originated the DCJ-indel distance, that allows the comparison of genomes with unequal contents, considering DCJ, insertions and deletions, and can be computed in linear time. Results In the present work we put these two results together to solve an open problem, showing that, when the graph that represents the relation between the two compared genomes has no bad components, the inversion-indel distance is equal to the DCJ-indel distance. We also give a lower and an upper bound for the inversion-indel distance in the presence of bad components. PMID:24564182

Four-State Continuous-Variable Quantum Key Distribution with Photon Subtraction

NASA Astrophysics Data System (ADS)

Li, Fei; Wang, Yijun; Liao, Qin; Guo, Ying

2018-06-01

Four-state continuous-variable quantum key distribution (CVQKD) is one of the discretely modulated CVQKD which generates four nonorthogonal coherent states and exploits the sign of the measured quadrature of each state to encode information rather than uses the quadrature \\hat {x} or \\hat {p} itself. It has been proven that four-state CVQKD is more suitable than Gaussian modulated CVQKD in terms of transmission distance. In this paper, we propose an improved four-state CVQKD using an non-Gaussian operation, photon subtraction. A suitable photon-subtraction operation can be exploited to improve the maximal transmission of CVQKD in point-to-point quantum communication since it provides a method to enhance the performance of entanglement-based (EB) CVQKD. Photon subtraction not only can lengthen the maximal transmission distance by increasing the signal-to-noise rate but also can be easily implemented with existing technologies. Security analysis shows that the proposed scheme can lengthen the maximum transmission distance. Furthermore, by taking finite-size effect into account we obtain a tighter bound of the secure distance, which is more practical than that obtained in the asymptotic limit.

The statistical fluctuation study of quantum key distribution in means of uncertainty principle

NASA Astrophysics Data System (ADS)

Liu, Dunwei; An, Huiyao; Zhang, Xiaoyu; Shi, Xuemei

2018-03-01

Laser defects in emitting single photon, photon signal attenuation and propagation of error cause our serious headaches in practical long-distance quantum key distribution (QKD) experiment for a long time. In this paper, we study the uncertainty principle in metrology and use this tool to analyze the statistical fluctuation of the number of received single photons, the yield of single photons and quantum bit error rate (QBER). After that we calculate the error between measured value and real value of every parameter, and concern the propagation error among all the measure values. We paraphrase the Gottesman-Lo-Lutkenhaus-Preskill (GLLP) formula in consideration of those parameters and generate the QKD simulation result. In this study, with the increase in coding photon length, the safe distribution distance is longer and longer. When the coding photon's length is N = 10^{11}, the safe distribution distance can be almost 118 km. It gives a lower bound of safe transmission distance than without uncertainty principle's 127 km. So our study is in line with established theory, but we make it more realistic.

New t-gap insertion-deletion-like metrics for DNA hybridization thermodynamic modeling.

PubMed

D'yachkov, Arkadii G; Macula, Anthony J; Pogozelski, Wendy K; Renz, Thomas E; Rykov, Vyacheslav V; Torney, David C

2006-05-01

We discuss the concept of t-gap block isomorphic subsequences and use it to describe new abstract string metrics that are similar to the Levenshtein insertion-deletion metric. Some of the metrics that we define can be used to model a thermodynamic distance function on single-stranded DNA sequences. Our model captures a key aspect of the nearest neighbor thermodynamic model for hybridized DNA duplexes. One version of our metric gives the maximum number of stacked pairs of hydrogen bonded nucleotide base pairs that can be present in any secondary structure in a hybridized DNA duplex without pseudoknots. Thermodynamic distance functions are important components in the construction of DNA codes, and DNA codes are important components in biomolecular computing, nanotechnology, and other biotechnical applications that employ DNA hybridization assays. We show how our new distances can be calculated by using a dynamic programming method, and we derive a Varshamov-Gilbert-like lower bound on the size of some of codes using these distance functions as constraints. We also discuss software implementation of our DNA code design methods.

Equilibria of an epidemic game with piecewise linear social distancing cost.

PubMed

Reluga, Timothy C

2013-10-01

Around the world, infectious disease epidemics continue to threaten people's health. When epidemics strike, we often respond by changing our behaviors to reduce our risk of infection. This response is sometimes called "social distancing." Since behavior changes can be costly, we would like to know the optimal social distancing behavior. But the benefits of changes in behavior depend on the course of the epidemic, which itself depends on our behaviors. Differential population game theory provides a method for resolving this circular dependence. Here, I present the analysis of a special case of the differential SIR epidemic population game with social distancing when the relative infection rate is linear, but bounded below by zero. Equilibrium solutions are constructed in closed-form for an open-ended epidemic. Constructions are also provided for epidemics that are stopped by the deployment of a vaccination that becomes available a fixed-time after the start of the epidemic. This can be used to anticipate a window of opportunity during which mass vaccination can significantly reduce the cost of an epidemic.

Structural changes that occur upon photolysis of the Fe(II)a3 - CO complex in the cytochrome ba3-oxidase of Thermus thermophilus: A combined X-ray crystallographic and infrared spectral study demonstrates CO binding to CuB

PubMed Central

Liu, Bin; Zhang, Yang; Sage, J. Timothy; Soltis, S. Michael; Doukov, Tzanko; Chen, Ying; Stout, C. David; Fee, James A.

2012-01-01

The purpose of the work was to provide a crystallographic demonstration of the venerable idea that CO photolyzed from ferrous heme-a3 moves to the nearby cuprous ion in the cytochrome c oxidases. Crystal structures of CO-bound cytochrome ba3-oxidase from Thermus thermophilus, determined at ~ 2.8 – 3.2 Å resolution, reveal a Fe-C distance of ~2.0 Å, a Cu-O distance of 2.4 Å and a Fe-C-O angle of ~126°. Upon photodissociation at 100 K, X-ray structures indicate loss of Fea3-CO and appearance of CuB-CO having a Cu-C distance of ~1.9 Å and an O-Fe distance of ~2.3 Å. Absolute FTIR spectra recorded from single crystals of reduced ba3–CO that had not been exposed to X-ray radiation, showed several peaks around 1975 cm−1; after photolysis at 100 K, the absolute FTIR spectra also showed a significant peak at 2050 cm−1. Analysis of the “light’ minus ‘dark’ difference spectra showed four very sharp CO stretching bands at 1970 cm−1, 1977 cm−1, 1981 cm−1, and 1985 cm−1, previously assigned to the Fea3-CO complex, and a significantly broader CO stretching band centered at ~2050 cm−1, previously assigned to the CO stretching frequency of CuB bound CO. As expected for light propagating along the tetragonal axis of the P43212 space group, the single crystal spectra exhibit negligible dichroism. Absolute FTIR spectrometry of a CO-laden ba3 crystal, exposed to an amount of X-ray radiation required to obtain structural data sets before FTIR characterization, showed a significant signal due to photogenerated CO2 at 2337 cm−1 and one from traces of CO at 2133 cm−1; while bands associated with CO bound to either Fea3 or to CuB in “light” minus “dark” FTIR difference spectra shifted and broadened in response to X-ray exposure. In spite of considerable radiation damage to the crystals, both X-ray analysis at 2.8 and 3.2 Å and FTIR spectra support the long-held position that photolysis of Fea3-CO in cytochrome c oxidases leads to significant trapping of the CO on the CuB atom; Fea3 and CuB ligation, at the resolutions reported here, are otherwise unaltered. PMID:22226917

Continuous-variable measurement-device-independent quantum key distribution with virtual photon subtraction

NASA Astrophysics Data System (ADS)

Zhao, Yijia; Zhang, Yichen; Xu, Bingjie; Yu, Song; Guo, Hong

2018-04-01

The method of improving the performance of continuous-variable quantum key distribution protocols by postselection has been recently proposed and verified. In continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocols, the measurement results are obtained from untrusted third party Charlie. There is still not an effective method of improving CV-MDI QKD by the postselection with untrusted measurement. We propose a method to improve the performance of coherent-state CV-MDI QKD protocol by virtual photon subtraction via non-Gaussian postselection. The non-Gaussian postselection of transmitted data is equivalent to an ideal photon subtraction on the two-mode squeezed vacuum state, which is favorable to enhance the performance of CV-MDI QKD. In CV-MDI QKD protocol with non-Gaussian postselection, two users select their own data independently. We demonstrate that the optimal performance of the renovated CV-MDI QKD protocol is obtained with the transmitted data only selected by Alice. By setting appropriate parameters of the virtual photon subtraction, the secret key rate and tolerable excess noise are both improved at long transmission distance. The method provides an effective optimization scheme for the application of CV-MDI QKD protocols.

Quantum fingerprinting with coherent states and a constant mean number of photons

NASA Astrophysics Data System (ADS)

Arrazola, Juan Miguel; Lütkenhaus, Norbert

2014-06-01

We present a protocol for quantum fingerprinting that is ready to be implemented with current technology and is robust to experimental errors. The basis of our scheme is an implementation of the signal states in terms of a coherent state in a superposition of time-bin modes. Experimentally, this requires only the ability to prepare coherent states of low amplitude and to interfere them in a balanced beam splitter. The states used in the protocol are arbitrarily close in trace distance to states of O (log2n) qubits, thus exhibiting an exponential separation in abstract communication complexity compared to the classical case. The protocol uses a number of optical modes that is proportional to the size n of the input bit strings but a total mean photon number that is constant and independent of n. Given the expended resources, our protocol achieves a task that is provably impossible using classical communication only. In fact, even in the presence of realistic experimental errors and loss, we show that there exist a large range of input sizes for which our quantum protocol transmits an amount of information that can be more than two orders of magnitude smaller than a classical fingerprinting protocol.

First Rosetta Radio Science Bistatic Radar Observations of 67P/Churyumov-Gerasimenko

NASA Astrophysics Data System (ADS)

Andert, Thomas P.; Remus, Stefan; Simpson, Richard A.; Pätzold, Martin; Asmar, Sami W.; Kahan, Daniel S.; Bird, Mike K.; Häusler, Bernd; Tellmann, Silvia

2015-04-01

The Rosetta spacecraft was successfully inserted on 6th August 2014 into orbit around comet 67P/Churyumov-Gerasimenko. In September Rosetta was placed into bound orbits with an initial distance of 30 km and a decreasing distance until the end October. After lander delivery, bound orbits were maintained again at 20 km and 30 km. One of the objectives of the Rosetta Radio Science Investigations (RSI) is to address the dielectric properties, small-scale roughness, and rotational state of the nucleus of the comet, which can be determined by means of a surface scattering experiment, also known as Bistatic Radar. The radio subsystem transmitter located on board the Rosetta spacecraft beams right circularly polarized radio signals at two wavelengths -3.6 cm (X-Band) and 13 cm (S-Band) - toward the nucleus surface. Part of the impinging radiation is then scattered toward a receiver at a ground station on Earth and recorded. On September 29th, 2014 the first Bistatic Radar experiment ever at a comet was successfully conducted. The distance between 67P/Churyumov-Gerasimenko and Rosetta was 20 km and both right circularly polarized (RCP) and left circularly polarized (LCP) reflected signals from the comet's surface in X-Band were detected during the experiment at the Goldstone complex of the NASA Deep Space Network. The ultra-stable oscillator (USO) on board Rosetta served during the experiment as a very stable reference frequency source. The direct and reflected signal were separated during the experiment by only a fraction of 1 Hz. The extreme stability of the USO allowed a detection and separation of the weak signals even on the required long integration times. Five additional Bistatic Radar experiments were conducted successfully between mid-October and mid-December 2014 with the 70-m DSN ground stations in Goldstone and Canberra at different distances to the comet (10 km, 20 km and 30 km) and reflected signals were observed in each case.

Homogenization of sample absorption for the imaging of large and dense fossils with synchrotron microtomography.

PubMed

Sanchez, Sophie; Fernandez, Vincent; Pierce, Stephanie E; Tafforeau, Paul

2013-09-01

Propagation phase-contrast synchrotron radiation microtomography (PPC-SRμCT) has proved to be very successful for examining fossils. Because fossils range widely in taphonomic preservation, size, shape and density, X-ray computed tomography protocols are constantly being developed and refined. Here we present a 1-h procedure that combines a filtered high-energy polychromatic beam with long-distance PPC-SRμCT (sample to detector: 4-16 m) and an attenuation protocol normalizing the absorption profile (tested on 13-cm-thick and 5.242 g cm(-3) locally dense samples but applicable to 20-cm-thick samples). This approach provides high-quality imaging results, which show marked improvement relative to results from images obtained without the attenuation protocol in apparent transmission, contrast and signal-to-noise ratio. The attenuation protocol involves immersing samples in a tube filled with aluminum or glass balls in association with a U-shaped aluminum profiler. This technique therefore provides access to a larger dynamic range of the detector used for tomographic reconstruction. This protocol homogenizes beam-hardening artifacts, thereby rendering it effective for use with conventional μCT scanners.

A review of tags anti-collision and localization protocols in RFID networks.

PubMed

Ullah, S; Alsalih, W; Alsehaim, A; Alsadhan, N

2012-12-01

Radio Frequency IDentification (RFID) has allowed the realization of ubiquitous tracking and monitoring of physical objects wirelessly with minimum human interactions. It plays a key role in a wide range of applications including asset tracking, contactless payment, access control, transportation and logistics, and other industrial applications. On the other side, RFID systems face several technical challenges that need to be overcome in order to achieve their potential benefits; tags collisions and localization of tagged objects are two important challenges. Numerous anti-collision and localization protocols have been proposed to address these challenges. This paper reviews the state-of-art tags' anti-collision and localization protocols, and provides a deep insight into technical issues of these protocols. The probabilistic and deterministic anti-collision protocols are critically studied and compared in terms of different parameters. We further review distance estimation, scene analysis, and proximity localization schemes and provide useful suggestions. We also introduce a new hybrid direction that utilizes power control to spatially partition the interrogation range of a reader for more efficient anti-collision and localization. Finally, we present the applications of RFID systems in healthcare sectors.

Topics in quantum cryptography, quantum error correction, and channel simulation

NASA Astrophysics Data System (ADS)

Luo, Zhicheng

In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, we prove a regularized formula for the secret key assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel simulation with quantum side information at the receiver. Our main theorem has two important corollaries: rate-distortion theory with quantum side information and common randomness distillation. Simple proofs of achievability of classical multi-terminal source coding problems can be made via a unified approach using the channel simulation theorem as building blocks. The fully quantum generalization of the problem is also conjectured with outer and inner bounds on the achievable rate pairs.

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

Ho, M.; Shi, W; Rinaldo-Mathis, A

Inhibition of human purine nucleoside phosphorylase (PNP) stops growth of activated T-cells and the formation of 6-oxypurine bases, making it a target for leukemia, autoimmune disorders, and gout. Four generations of ribocation transition-state mimics bound to PNP are structurally characterized. Immucillin-H (K*{sub i} = 58 pM, first-generation) contains an iminoribitol cation with four asymmetric carbons. DADMe-Immucillin-H (K*{sub i} = 9 pM, second-generation), uses a methylene-bridged dihydroxypyrrolidine cation with two asymmetric centers. DATMe-Immucillin-H (K*{sub i} = 9 pM, third-generation) contains an open-chain amino alcohol cation with two asymmetric carbons. SerMe-ImmH (K*{sub i} = 5 pM, fourth-generation) uses achiral dihydroxyaminoalcohol seramide asmore » the ribocation mimic. Crystal structures of PNPs establish features of tight binding to be; (1) ion-pair formation between bound phosphate (or its mimic) and inhibitor cation, (2) leaving-group interactions to N1, O6, and N7 of 9-deazahypoxanthine, (3) interaction between phosphate and inhibitor hydroxyl groups, and (4) His257 interacting with the 5{prime}-hydroxyl group. The first generation analogue is an imperfect fit to the catalytic site with a long ion pair distance between the iminoribitol and bound phosphate and weaker interactions to the leaving group. Increasing the ribocation to leaving-group distance in the second- to fourth-generation analogues provides powerful binding interactions and a facile synthetic route to powerful inhibitors. Despite chemical diversity in the four generations of transition-state analogues, the catalytic site geometry is almost the same for all analogues. Multiple solutions in transition-state analogue design are available to convert the energy of catalytic rate enhancement to binding energy in human PNP.« less

How I Found Out about the Internet.

ERIC Educational Resources Information Center

Pawloski, Bob

1994-01-01

A Nebraska consultant/former teacher explains his role in developing Internet accounts for teachers while working on a wetlands distance-learning project and an arts-education consortium. He explains ARTnet and other Internet services, including Telnet, FTP (file transfer protocol), the Gopher retrieval system, NetNews, and Listservs. Sidebars…

Design of a stateless low-latency router architecture for green software-defined networking

NASA Astrophysics Data System (ADS)

Saldaña Cercós, Silvia; Ramos, Ramon M.; Ewald Eller, Ana C.; Martinello, Magnos; Ribeiro, Moisés. R. N.; Manolova Fagertun, Anna; Tafur Monroy, Idelfonso

2015-01-01

Expanding software defined networking (SDN) to transport networks requires new strategies to deal with the large number of flows that future core networks will have to face. New south-bound protocols within SDN have been proposed to benefit from having control plane detached from the data plane offering a cost- and energy-efficient forwarding engine. This paper presents an overview of a new approach named KeyFlow to simultaneously reduce latency, jitter, and power consumption in core network nodes. Results on an emulation platform indicate that round trip time (RTT) can be reduced above 50% compared to the reference protocol OpenFlow, specially when flow tables are densely populated. Jitter reduction has been demonstrated experimentally on a NetFPGA-based platform, and 57.3% power consumption reduction has been achieved.

Microwave promoted simple, efficient and regioselective synthesis of trisubstituted imidazo[1,2-a]benzimidazoles on soluble support.

PubMed

Chen, Li-Hsun; Hsiao, Ya-Shan; Yellol, Gorakh S; Sun, Chung-Ming

2011-03-14

An efficient microwave-assisted and soluble polymer-supported synthesis of medicinally important imidazole-fused benzimidazoles has been developed. The protocol involves the rapid condensation of polymer-bound amino benzimidazoles with various α-bromoketones and subsequent in situ intramolecular cyclization under microwave irradiation resulting in a one pot synthesis of imidazole interlacing benzimidazole polymer conjugates. The condensed product was obtained with excellent regioselectivity. The biologically interesting imidazo[1,2-a]benzimidazoles was released from polymer support at ambient temperature. Diversity in the triheterocyclic nucleus was achieved by the different substitutions at its 2, 3, and 9 positions. The new protocol has the advantages of short reaction time, easy workup process, excellent yields, reduced environmental impact, wide substrate scope and convenient procedure.

BPTAP: A New Approach to IP over DTN

NASA Technical Reports Server (NTRS)

Tsao, Philip; Nguyen, Sam

2012-01-01

Traditional Internet protocols have been widely deployed for a variety of applications. However such protocols generally perform poorly in situations in which, round trip delays are very large (interplanetary distances) or . persistent connectivity is not always available (widely dispersed MANET). Delay/Disruption Tolerant Network (DTN) technology was invented to address these issues: (1) . Relay nodes "take custody" of blocks of network traffic on a hop-by -hop basis and retransmit them in cases of expected or unexpected link outage (2) Bundle lifetime may be configured for long round trip light times. BPTAP is novel by encapsulating Ethernet frames in BP

Entanglement percolation on a quantum internet with scale-free and clustering characters

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

Wu Liang; Zhu Shiqun

The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

Robust Distant Entanglement Generation Using Coherent Multiphoton Scattering

NASA Astrophysics Data System (ADS)

Chan, Ching-Kit; Sham, L. J.

2013-02-01

We describe a protocol to entangle two qubits at a distance by using resonance fluorescence. The scheme makes use of the postselection of large and distinguishable fluorescence signals corresponding to entangled and unentangled qubit states and has the merits of both high success probability and high entanglement fidelity owing to the multiphoton nature. Our result shows that the entanglement generation is robust against photon fluctuations in the fluorescence signals for a wide range of driving fields. We also demonstrate that this new protocol has an average entanglement duration within the decoherence time of corresponding qubit systems, based on current experimental photon efficiency.

Entanglement percolation on a quantum internet with scale-free and clustering characters

NASA Astrophysics Data System (ADS)

Wu, Liang; Zhu, Shiqun

2011-11-01

The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

Robust distant entanglement generation using coherent multiphoton scattering.

PubMed

Chan, Ching-Kit; Sham, L J

2013-02-15

We describe a protocol to entangle two qubits at a distance by using resonance fluorescence. The scheme makes use of the postselection of large and distinguishable fluorescence signals corresponding to entangled and unentangled qubit states and has the merits of both high success probability and high entanglement fidelity owing to the multiphoton nature. Our result shows that the entanglement generation is robust against photon fluctuations in the fluorescence signals for a wide range of driving fields. We also demonstrate that this new protocol has an average entanglement duration within the decoherence time of corresponding qubit systems, based on current experimental photon efficiency.

Solid-Phase Biological Assays for Drug Discovery

NASA Astrophysics Data System (ADS)

Forsberg, Erica M.; Sicard, Clémence; Brennan, John D.

2014-06-01

In the past 30 years, there has been a significant growth in the use of solid-phase assays in the area of drug discovery, with a range of new assays being used for both soluble and membrane-bound targets. In this review, we provide some basic background to typical drug targets and immobilization protocols used in solid-phase biological assays (SPBAs) for drug discovery, with emphasis on particularly labile biomolecular targets such as kinases and membrane-bound receptors, and highlight some of the more recent approaches for producing protein microarrays, bioaffinity columns, and other devices that are central to small molecule screening by SPBA. We then discuss key applications of such assays to identify drug leads, with an emphasis on the screening of mixtures. We conclude by highlighting specific advantages and potential disadvantages of SPBAs, particularly as they relate to particular assay formats.

Hamiltonian identifiability assisted by a single-probe measurement

NASA Astrophysics Data System (ADS)

Sone, Akira; Cappellaro, Paola

2017-02-01

We study the Hamiltonian identifiability of a many-body spin-1 /2 system assisted by the measurement on a single quantum probe based on the eigensystem realization algorithm approach employed in Zhang and Sarovar, Phys. Rev. Lett. 113, 080401 (2014), 10.1103/PhysRevLett.113.080401. We demonstrate a potential application of Gröbner basis to the identifiability test of the Hamiltonian, and provide the necessary experimental resources, such as the lower bound in the number of the required sampling points, the upper bound in total required evolution time, and thus the total measurement time. Focusing on the examples of the identifiability in the spin-chain model with nearest-neighbor interaction, we classify the spin-chain Hamiltonian based on its identifiability, and provide the control protocols to engineer the nonidentifiable Hamiltonian to be an identifiable Hamiltonian.

Quantum speedup of Monte Carlo methods.

PubMed

Montanaro, Ashley

2015-09-08

Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition functions. In this work, we describe a quantum algorithm which can accelerate Monte Carlo methods in a very general setting. The algorithm estimates the expected output value of an arbitrary randomized or quantum subroutine with bounded variance, achieving a near-quadratic speedup over the best possible classical algorithm. Combining the algorithm with the use of quantum walks gives a quantum speedup of the fastest known classical algorithms with rigorous performance bounds for computing partition functions, which use multiple-stage Markov chain Monte Carlo techniques. The quantum algorithm can also be used to estimate the total variation distance between probability distributions efficiently.

Enhancing nuclear quadrupole resonance (NQR) signature detection leveraging interference suppression algorithms

NASA Astrophysics Data System (ADS)

DeBardelaben, James A.; Miller, Jeremy K.; Myrick, Wilbur L.; Miller, Joel B.; Gilbreath, G. Charmaine; Bajramaj, Blerta

2012-06-01

Nuclear quadrupole resonance (NQR) is a radio frequency (RF) magnetic spectroscopic technique that has been shown to detect and identify a wide range of explosive materials containing quadrupolar nuclei. The NQR response signal provides a unique signature of the material of interest. The signal is, however, very weak and can be masked by non-stationary RF interference (RFI) and thermal noise, limiting detection distance. In this paper, we investigate the bounds on the NQR detection range for ammonium nitrate. We leverage a low-cost RFI data acquisition system composed of inexpensive B-field sensing and commercial-off-the-shelf (COTS) software-defined radios (SDR). Using collected data as RFI reference signals, we apply adaptive filtering algorithms to mitigate RFI and enable NQR detection techniques to approach theoretical range bounds in tactical environments.

Quantum speedup of Monte Carlo methods

PubMed Central

Montanaro, Ashley

2015-01-01

Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition functions. In this work, we describe a quantum algorithm which can accelerate Monte Carlo methods in a very general setting. The algorithm estimates the expected output value of an arbitrary randomized or quantum subroutine with bounded variance, achieving a near-quadratic speedup over the best possible classical algorithm. Combining the algorithm with the use of quantum walks gives a quantum speedup of the fastest known classical algorithms with rigorous performance bounds for computing partition functions, which use multiple-stage Markov chain Monte Carlo techniques. The quantum algorithm can also be used to estimate the total variation distance between probability distributions efficiently. PMID:26528079

Luneburg-lens-like structural Pauli attractive core of the nuclear force at short distances

NASA Astrophysics Data System (ADS)

Miller, Gerald A.

2018-07-01

A recent paper Ohkubo (2017) [1] found that the measured S10 phase shifts can be reproduced using a deeply attractive nucleon-nucleon potential. We find that the deuteron would decay strongly via pion emission to the deeply bound state arising in this potential. Therefore the success of a deeply attractive potential in describing phase shifts must be regarded only as an interesting curiosity.

Actinide Isotope Ratios Measured by Resonance Ionization Mass Spectrometry: Optimization of Ionization Schemes and Demonstration Using Nuclear Fallout

DTIC Science & Technology

2017-12-01

Massive particles arrive later than lighter particles. The uncertainty in the time of the ions formation and the distance travelled results in the...response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and...9 2. The Time -Dependent Schrödinger Equation ............................12 3. Stimulated Excitation to Bound States

Subset Selection Procedures: A Review and an Assessment

DTIC Science & Technology

1984-02-01

distance function (Alam and Rizvi, 1966; Gupta, 1966; Gupta and Studden, 1970), generalized variance ( Gnanadesikan and Gupta, 1970), and multiple... Gnanadesikan (1966) considered a location type procedure based on sample component means. Except in the case of bivariate normal, only a lower bound of the...Frischtak, 1973; Gnanadesikan , 1966) for ranking multivariate normal populations but the results in these cases are very limited in scope or are asymptotic

Distance-Based Configurational Entropy of Proteins from Molecular Dynamics Simulations

PubMed Central

Fogolari, Federico; Corazza, Alessandra; Fortuna, Sara; Soler, Miguel Angel; VanSchouwen, Bryan; Brancolini, Giorgia; Corni, Stefano; Melacini, Giuseppe; Esposito, Gennaro

2015-01-01

Estimation of configurational entropy from molecular dynamics trajectories is a difficult task which is often performed using quasi-harmonic or histogram analysis. An entirely different approach, proposed recently, estimates local density distribution around each conformational sample by measuring the distance from its nearest neighbors. In this work we show this theoretically well grounded the method can be easily applied to estimate the entropy from conformational sampling. We consider a set of systems that are representative of important biomolecular processes. In particular: reference entropies for amino acids in unfolded proteins are obtained from a database of residues not participating in secondary structure elements;the conformational entropy of folding of β2-microglobulin is computed from molecular dynamics simulations using reference entropies for the unfolded state;backbone conformational entropy is computed from molecular dynamics simulations of four different states of the EPAC protein and compared with order parameters (often used as a measure of entropy);the conformational and rototranslational entropy of binding is computed from simulations of 20 tripeptides bound to the peptide binding protein OppA and of β2-microglobulin bound to a citrate coated gold surface. This work shows the potential of the method in the most representative biological processes involving proteins, and provides a valuable alternative, principally in the shown cases, where other approaches are problematic. PMID:26177039

Distance-Based Configurational Entropy of Proteins from Molecular Dynamics Simulations.

PubMed

Fogolari, Federico; Corazza, Alessandra; Fortuna, Sara; Soler, Miguel Angel; VanSchouwen, Bryan; Brancolini, Giorgia; Corni, Stefano; Melacini, Giuseppe; Esposito, Gennaro

2015-01-01

Estimation of configurational entropy from molecular dynamics trajectories is a difficult task which is often performed using quasi-harmonic or histogram analysis. An entirely different approach, proposed recently, estimates local density distribution around each conformational sample by measuring the distance from its nearest neighbors. In this work we show this theoretically well grounded the method can be easily applied to estimate the entropy from conformational sampling. We consider a set of systems that are representative of important biomolecular processes. In particular: reference entropies for amino acids in unfolded proteins are obtained from a database of residues not participating in secondary structure elements;the conformational entropy of folding of β2-microglobulin is computed from molecular dynamics simulations using reference entropies for the unfolded state;backbone conformational entropy is computed from molecular dynamics simulations of four different states of the EPAC protein and compared with order parameters (often used as a measure of entropy);the conformational and rototranslational entropy of binding is computed from simulations of 20 tripeptides bound to the peptide binding protein OppA and of β2-microglobulin bound to a citrate coated gold surface. This work shows the potential of the method in the most representative biological processes involving proteins, and provides a valuable alternative, principally in the shown cases, where other approaches are problematic.

Comparison of physical activities of female football players in junior high school and high school.

PubMed

Inoue, Yuri; Otani, Yoshitaka; Takemasa, Seiichi

2017-08-01

[Purpose] This study aimed to compare physical activities between junior high school and high school female football players in order to explain the factors that predispose to a higher incidence of sports injuries in high school female football players. [Subjects and Methods] Twenty-nine female football players participated. Finger floor distance, the center of pressure during single limb stance with eyes open and closed, the 40-m linear sprint time, hip abduction and extension muscle strength and isokinetic knee flexion and extension peak torque were measured. The modified Star Excursion Balance Test, the three-steps bounding test and three-steps hopping tests, agility test 1 (Step 50), agility test 2 (Forward run), curl-up test for 30 seconds and the Yo-Yo intermittent recovery test were performed. [Results] The high school group was only significantly faster than the junior high school group in the 40-m linear sprint time and in the agility tests. The distance of the bounding test in the high school group was longer than that in the junior high school group. [Conclusion] Agility and speed increase with growth; however, muscle strength and balance do not develop alongside. This unbalanced development may cause a higher incidence of sports injuries in high school football players.

Benchmarking Commercial Conformer Ensemble Generators.

PubMed

Friedrich, Nils-Ole; de Bruyn Kops, Christina; Flachsenberg, Florian; Sommer, Kai; Rarey, Matthias; Kirchmair, Johannes

2017-11-27

We assess and compare the performance of eight commercial conformer ensemble generators (ConfGen, ConfGenX, cxcalc, iCon, MOE LowModeMD, MOE Stochastic, MOE Conformation Import, and OMEGA) and one leading free algorithm, the distance geometry algorithm implemented in RDKit. The comparative study is based on a new version of the Platinum Diverse Dataset, a high-quality benchmarking dataset of 2859 protein-bound ligand conformations extracted from the PDB. Differences in the performance of commercial algorithms are much smaller than those observed for free algorithms in our previous study (J. Chem. Inf. 2017, 57, 529-539). For commercial algorithms, the median minimum root-mean-square deviations measured between protein-bound ligand conformations and ensembles of a maximum of 250 conformers are between 0.46 and 0.61 Å. Commercial conformer ensemble generators are characterized by their high robustness, with at least 99% of all input molecules successfully processed and few or even no substantial geometrical errors detectable in their output conformations. The RDKit distance geometry algorithm (with minimization enabled) appears to be a good free alternative since its performance is comparable to that of the midranked commercial algorithms. Based on a statistical analysis, we elaborate on which algorithms to use and how to parametrize them for best performance in different application scenarios.

Accuracy of tree diameter estimation from terrestrial laser scanning by circle-fitting methods

NASA Astrophysics Data System (ADS)

Koreň, Milan; Mokroš, Martin; Bucha, Tomáš

2017-12-01

This study compares the accuracies of diameter at breast height (DBH) estimations by three initial (minimum bounding box, centroid, and maximum distance) and two refining (Monte Carlo and optimal circle) circle-fitting methods The circle-fitting algorithms were evaluated in multi-scan mode and a simulated single-scan mode on 157 European beech trees (Fagus sylvatica L.). DBH measured by a calliper was used as reference data. Most of the studied circle-fitting algorithms significantly underestimated the mean DBH in both scanning modes. Only the Monte Carlo method in the single-scan mode significantly overestimated the mean DBH. The centroid method proved to be the least suitable and showed significantly different results from the other circle-fitting methods in both scanning modes. In multi-scan mode, the accuracy of the minimum bounding box method was not significantly different from the accuracies of the refining methods The accuracy of the maximum distance method was significantly different from the accuracies of the refining methods in both scanning modes. The accuracy of the Monte Carlo method was significantly different from the accuracy of the optimal circle method in only single-scan mode. The optimal circle method proved to be the most accurate circle-fitting method for DBH estimation from point clouds in both scanning modes.

Survival of extrasolar giant planet moons in planet-planet scattering

NASA Astrophysics Data System (ADS)

CIAN HONG, YU; Lunine, Jonathan; Nicholson, Phillip; Raymond, Sean

2015-12-01

Planet-planet scattering is the best candidate mechanism for explaining the eccentricity distribution of exoplanets. Here we study the survival and dynamics of exomoons under strong perturbations during giant planet scattering. During close encounters, planets and moons exchange orbital angular momentum and energy. The most common outcomes are the destruction of moons by ejection from the system, collision with the planets and the star, and scattering of moons onto perturbed but still planet-bound orbits. A small percentage of interesting moons can remain bound to ejected (free-floating) planets or be captured by a different planet. Moons' survival rate is correlated with planet observables such as mass, semi-major axis, eccentricity and inclination, as well as the close encounter distance and the number of close encounters. In addition, moons' survival rate and dynamical outcomes are predetermined by the moons' initial semi-major axes. The survival rate drops quickly as moons' distances increase, but simulations predict a good chance of survival for the Galilean moons. Moons with different dynamical outcomes occupy different regions of orbital parameter space, which may enable the study of moons' past evolution. Potential effects of planet obliquity evolution caused by close encounters on the satellites’ stability and dynamics will be reported, as well as detailed and systematic studies of individual close encounter events.

Shape Complementarity of Protein-Protein Complexes at Multiple Resolutions

PubMed Central

Zhang, Qing; Sanner, Michel; Olson, Arthur J.

2010-01-01

Biological complexes typically exhibit intermolecular interfaces of high shape complementarity. Many computational docking approaches use this surface complementarity as a guide in the search for predicting the structures of protein-protein complexes. Proteins often undergo conformational changes in order to create a highly complementary interface when associating. These conformational changes are a major cause of failure for automated docking procedures when predicting binding modes between proteins using their unbound conformations. Low resolution surfaces in which high frequency geometric details are omitted have been used to address this problem. These smoothed, or blurred, surfaces are expected to minimize the differences between free and bound structures, especially those that are due to side chain conformations or small backbone deviations. In spite of the fact that this approach has been used in many docking protocols, there has yet to be a systematic study of the effects of such surface smoothing on the shape complementarity of the resulting interfaces. Here we investigate this question by computing shape complementarity of a set of 66 protein-protein complexes represented by multi-resolution blurred surfaces. Complexed and unbound structures are available for these protein-protein complexes. They are a subset of complexes from a non-redundant docking benchmark selected for rigidity (i.e. the proteins undergo limited conformational changes between their bound and unbound states). In this work we construct the surfaces by isocontouring a density map obtained by accumulating the densities of Gaussian functions placed at all atom centers of the molecule. The smoothness or resolution is specified by a Gaussian fall-off coefficient, termed “blobbyness”. Shape complementarity is quantified using a histogram of the shortest distances between two proteins' surface mesh vertices for both the crystallographic complexes and the complexes built using the protein structures in their unbound conformation. The histograms calculated for the bound complex structures demonstrate that medium resolution smoothing (blobbyness=−0.9) can reproduce about 88% of the shape complementarity of atomic resolution surfaces. Complexes formed from the free component structures show a partial loss of shape complementarity (more overlaps and gaps) with the atomic resolution surfaces. For surfaces smoothed to low resolution (blobbyness=−0.3), we find more consistency of shape complementarity between the complexed and free cases. To further reduce bad contacts without significantly impacting the good contacts we introduce another blurred surface, in which the Gaussian densities of flexible atoms are reduced. From these results we discuss the use of shape complementarity in protein-protein docking. PMID:18837463

RAMAN SPECTRAL CLASSIFICATION OF MINERAL- AND COLLAGEN-BOUND WATER’S ASSOCIATIONS TO ELASTIC AND POST-YIELD MECHANICAL PROPERTIES OF CORTICAL BONE

PubMed Central

Unal, Mustafa; Akkus, Ozan

2015-01-01

Water that is bound to bone’s matrix is implied as a predictor of fracture resistance; however, bound water is an elusive variable to be measured nondestructively. To date, the only nondestructive method used for studying bone hydration status is magnetic resonance variants (NMR or MRI). For the first time, bone hydration status was studied by short-wave infrared (SWIR) Raman spectroscopy to investigate associations of mineral-bound and collagen-bound water compartments with mechanical properties. Thirty cortical bone samples were used for quantitative Raman-based water analysis, gravimetric analysis, porosity measurement, and biomechanical testing. A sequential dehydration protocol was developed to replace unbound (heat drying) and bound (ethanol treatment) water in bone. Raman spectra were collected serially to track the OH-stretch band during dehydration. Four previously identified peaks were investigated: I3220/I2949, I3325/I2949 and I3453/I2949 reflect status of organic-matrix related water (mostly collagen-related water) compartments and collagen portion of bone while I3584/I2949 reflects status of mineral-related water compartments and mineral portion of bone. These spectroscopic biomarkers were correlated with elastic and post-yield mechanical properties of bone. Collagen-water related biomarkers (I3220/I2949 and I3325/I2949) correlated significantly and positively with toughness (R2=0.81 and R2=0.79; p<0.001) and post-yield toughness (R2=0.65 and R2=0.73; p<0.001). Mineral-water related biomarker correlated significantly and negatively with elastic modulus (R2=0.78; p<0.001) and positively with strength (R2=0.46; p < 0.001). While MR-based techniques have been useful in measuring unbound and bound water, this is the first study which probed bound-water compartments differentially for collagen and mineral-bound water. For the first time, we showed an evidence for contributions of different bound-water compartments to mechanical properties of wet bone and the reported correlations of Raman-based water measurements to mechanical properties underline the necessity for enabling approaches to assess these new biomarkers noninvasively in vivo to improve the current diagnosis of those who may be at risk of bone fracture due to aging and diseases. PMID:26211992

Decoherence estimation in quantum theory and beyond

NASA Astrophysics Data System (ADS)

Pfister, Corsin

The quantum physics literature provides many different characterizations of decoherence. Most of them have in common that they describe decoherence as a kind of influence on a quantum system upon interacting with an another system. In the spirit of quantum information theory, we adapt a particular viewpoint on decoherence which describes it as the loss of information into a system that is possibly controlled by an adversary. We use a quantitative framework for decoherence that builds on operational characterizations of the min-entropy that have been developed in the quantum information literature. It characterizes decoherence as an influence on quantum channels that reduces their suitability for a variety of quantifiable tasks such as the distribution of secret cryptographic keys of a certain length or the distribution of a certain number of maximally entangled qubit pairs. This allows for a quantitative and operational characterization of decoherence via operational characterizations of the min-entropy. In this thesis, we present a series of results about the estimation of the minentropy, subdivided into three parts. The first part concerns the estimation of a quantum adversary's uncertainty about classical information--expressed by the smooth min-entropy--as it is done in protocols for quantum key distribution (QKD). We analyze this form of min-entropy estimation in detail and find that some of the more recently suggested QKD protocols have previously unnoticed security loopholes. We show that the specifics of the sifting subroutine of a QKD protocol are crucial for security by pointing out mistakes in the security analysis in the literature and by presenting eavesdropping attacks on those problematic protocols. We provide solutions to the identified problems and present a formalized analysis of the min-entropy estimate that incorporates the sifting stage of QKD protocols. In the second part, we extend ideas from QKD to a protocol that allows to estimate an adversary's uncertainty about quantum information, expressed by the fully quantum smooth min-entropy. Roughly speaking, we show that a protocol that resembles the parallel execution of two QKD protocols can be used to lower bound the min-entropy of some unmeasured qubits. We explain how this result may influence the ongoing search for protocols for entanglement distribution. The third part is dedicated to the development of a framework that allows the estimation of decoherence even in experiments that cannot be correctly described by quantum theory. Inspired by an equivalent formulation of the min-entropy that relates it to the fidelity with a maximally entangled state, we define a decoherence quantity for a very general class of probabilistic theories that reduces to the min-entropy in the special case of quantum theory. This entails a definition of maximal entanglement for generalized probabilistic theories. Using techniques from semidefinite and linear programming, we show how bounds on this quantity can be estimated through Bell-type experiments. This allows to test models for decoherence that cannot be described by quantum theory. As an example application, we devise an experimental test of a model for gravitational decoherence that has been suggested in the literature.

Effects of Different Conditioning Activities on 100-m Dash Performance in High School Track and Field Athletes.

PubMed

Ferreira-Júnior, João B; Guttierres, Ana P M; Encarnação, Irismar G A; Lima, Jorge R P; Borba, Diego A; Freitas, Eduardo D S; Bemben, Michael G; Vieira, Carlos A; Bottaro, Martim

2018-06-01

This study compared the effects of different conditioning activities on the 100-m dash performance of 11 male, high school track and field athletes (mean age = 16.3; SD = 1.2 years). Participants performed a 100-m dash seven minutes after each of four randomized conditioning protocols, with each condition and 100-m dash separated by 3-10 days. The conditioning protocols were (a) control, no conditioning activity; (b) weighted plyometric, three sets of 10 repetitions of alternate leg bounding with additional load of 10% of the body mass; (c) free sprint, two 20-m sprints; and (d) resisted sprint (RS), two 20-m resisted sprints using an elastic tubing tool. We obtained session ratings of perceived exertion (SRPE) immediately after each conditioning protocol. There were no significant differences between any of the three experimental conditioning activities on 100-m sprint time, but the RS protocol improved 100-m sprint time compared with the control (no conditioning) protocol ( p < .001). The RS also led to greater sprint velocity and higher SRPE compared with the control condition ( p < .01). There was no significant association between SRPE and 100-m performance ( p = .77, r = .05). These results suggest a benefit for young male track and field athletes to the elastic tubing warm-up activities prior to the 100-m dash.

Target matching based on multi-view tracking

NASA Astrophysics Data System (ADS)

Liu, Yahui; Zhou, Changsheng

2011-01-01

A feature matching method is proposed based on Maximally Stable Extremal Regions (MSER) and Scale Invariant Feature Transform (SIFT) to solve the problem of the same target matching in multiple cameras. Target foreground is extracted by using frame difference twice and bounding box which is regarded as target regions is calculated. Extremal regions are got by MSER. After fitted into elliptical regions, those regions will be normalized into unity circles and represented with SIFT descriptors. Initial matching is obtained from the ratio of the closest distance to second distance less than some threshold and outlier points are eliminated in terms of RANSAC. Experimental results indicate the method can reduce computational complexity effectively and is also adapt to affine transformation, rotation, scale and illumination.

Quantum Strategies: Proposal to Experimentally Test a Quantum Economics Protocol

DTIC Science & Technology

2009-04-09

fact that this al- gorithm requires only bipartite entangled states what makes it feasible to implement, and a key focus of a larger program in quantum...passes through what is effectively a huge Mach-Zender fiber-interferometer bounded by the Sagnac loop and PPBS1- is affected by this time-varying...strategy, no matter what the other players do. As we noted above, this means that there is no (classical) correlated equilibrium other than the Nash

Circumferential fit assessment of CAD/CAM single crowns--a pilot investigation on a new virtual analytical protocol.

PubMed

Matta, Ragai E; Schmitt, Johannes; Wichmann, Manfred; Holst, Stefan

2012-10-01

Techniques currently applied to determine the marginal accuracy of dental crown restorations yield inadequate information. This investigation aimed to test a new virtual approach for determining the precision of fit of single-crown copings. Zirconia single crown copings were manufactured on 10 gypsum, single-tooth master casts with two different established computer-aided design/computer-assisted manufacture (CAD/CAM) systems (groups A and B). After cementation, the circumferential fit was assessed with an industrial noncontact scanner and virtual 3D analysis, following a triple-scan protocol. Marginal fit was determined by virtual sectioning; each abutment-coping complex was digitally sliced in 360 vertical sections (1 degree per section). Standardized measurement distances for analyzing the marginal fit (z, xy, xyz) were selected, and a crosshair alignment was utilized to determine whether crowns were horizontally and/or vertically too large or small. The Mann-Whitney test was applied to test for differences between groups. Significant differences in the xy direction (P = .008) were measured between groups. Group A showed a greater number of horizontally overextended margins and a higher frequency of xy distances greater than 150 Μm, in addition to a tendency for excessive z distances (P = .095). The mean marginal gap values were clinically acceptable in the present investigation; however, a full circumferential analysis revealed significant differences in marginal coping quality.

Cross-Link Guided Molecular Modeling with ROSETTA

PubMed Central

Leitner, Alexander; Rosenberger, George; Aebersold, Ruedi; Malmström, Lars

2013-01-01

Chemical cross-links identified by mass spectrometry generate distance restraints that reveal low-resolution structural information on proteins and protein complexes. The technology to reliably generate such data has become mature and robust enough to shift the focus to the question of how these distance restraints can be best integrated into molecular modeling calculations. Here, we introduce three workflows for incorporating distance restraints generated by chemical cross-linking and mass spectrometry into ROSETTA protocols for comparative and de novo modeling and protein-protein docking. We demonstrate that the cross-link validation and visualization software Xwalk facilitates successful cross-link data integration. Besides the protocols we introduce XLdb, a database of chemical cross-links from 14 different publications with 506 intra-protein and 62 inter-protein cross-links, where each cross-link can be mapped on an experimental structure from the Protein Data Bank. Finally, we demonstrate on a protein-protein docking reference data set the impact of virtual cross-links on protein docking calculations and show that an inter-protein cross-link can reduce on average the RMSD of a docking prediction by 5.0 Å. The methods and results presented here provide guidelines for the effective integration of chemical cross-link data in molecular modeling calculations and should advance the structural analysis of particularly large and transient protein complexes via hybrid structural biology methods. PMID:24069194

CABS-dock web server for the flexible docking of peptides to proteins without prior knowledge of the binding site.

PubMed

Kurcinski, Mateusz; Jamroz, Michal; Blaszczyk, Maciej; Kolinski, Andrzej; Kmiecik, Sebastian

2015-07-01

Protein-peptide interactions play a key role in cell functions. Their structural characterization, though challenging, is important for the discovery of new drugs. The CABS-dock web server provides an interface for modeling protein-peptide interactions using a highly efficient protocol for the flexible docking of peptides to proteins. While other docking algorithms require pre-defined localization of the binding site, CABS-dock does not require such knowledge. Given a protein receptor structure and a peptide sequence (and starting from random conformations and positions of the peptide), CABS-dock performs simulation search for the binding site allowing for full flexibility of the peptide and small fluctuations of the receptor backbone. This protocol was extensively tested over the largest dataset of non-redundant protein-peptide interactions available to date (including bound and unbound docking cases). For over 80% of bound and unbound dataset cases, we obtained models with high or medium accuracy (sufficient for practical applications). Additionally, as optional features, CABS-dock can exclude user-selected binding modes from docking search or to increase the level of flexibility for chosen receptor fragments. CABS-dock is freely available as a web server at http://biocomp.chem.uw.edu.pl/CABSdock. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Short-distance probes for protein backbone structure based on energy transfer between bimane and transition metal ions

PubMed Central

Taraska, Justin W.; Puljung, Michael C.; Zagotta, William N.

2009-01-01

The structure and dynamics of proteins underlies the workings of virtually every biological process. Existing biophysical methods are inadequate to measure protein structure at atomic resolution, on a rapid time scale, with limited amounts of protein, and in the context of a cell or membrane. FRET can measure distances between two probes, but depends on the orientation of the probes and typically works only over long distances comparable with the size of many proteins. Also, common probes used for FRET can be large and have long, flexible attachment linkers that position dyes far from the protein backbone. Here, we improve and extend a fluorescence method called transition metal ion FRET that uses energy transfer to transition metal ions as a reporter of short-range distances in proteins with little orientation dependence. This method uses a very small cysteine-reactive dye monobromobimane, with virtually no linker, and various transition metal ions bound close to the peptide backbone as the acceptor. We show that, unlike larger fluorophores and longer linkers, this donor–acceptor pair accurately reports short-range distances and changes in backbone distances. We further extend the method by using cysteine-reactive metal chelators, which allow the technique to be used in protein regions of unknown secondary structure or when native metal ion binding sites are present. This improved method overcomes several of the key limitations of classical FRET for intramolecular distance measurements. PMID:19805285

Morphometry and CT measurements of useful bony landmarks of skull base.

PubMed

Ray, Biswabina; Rajagopal, K V; Rajesh, T; Gayathri, B M V; D'Souza, A S; Swarnashri, J V; Saxena, Alok

2011-01-01

Aim of this study was to determine the distance between Henle's spine (HS) on the temporal bone to the clinically important bony landmarks on the dry skulls that will act as a guide in various surgical procedures on skull base. Distances from the head of malleus (HOM) to surgically relevant landmarks were also studied on CT images. Thirty-nine adult preserved dry skulls were studied bilaterally. The parapetrosal triangle bounded by spinopterygoidal, bispinal and the midsagittal lines was identified. The location of the HS and its distance from the various important anatomical structures were measured. In addition, five CT images, where distances from the HOM to various anatomical landmarks were measured. The mean and range of distances from the HS to various important anatomical landmarks on the spinopterygoidal line, bispinal line and in the parapetrosal triangle were tabulated. The mean and range of CT-based measurements of distances from HOM to other anatomical landmarks were also noted. The knowledge of unvarying relationship of the HS and the HOM to the various structures of the skull would assume significance while planning surgeries around the temporal bone by guiding the direction and degree of bone removal. Statistical differences between the two genders showed significant difference only in the distance between the HS to the medial margin of the external orifice of carotid canal. Therefore, these landmarks can also be applied as references for various surgeries of middle cranial fossa, as well as transpetrosal and transmastoid approaches.