12,105 research outputs found

    Spanning Properties of Theta-Theta Graphs

    Full text link
    We study the spanning properties of Theta-Theta graphs. Similar in spirit with the Yao-Yao graphs, Theta-Theta graphs partition the space around each vertex into a set of k cones, for some fixed integer k > 1, and select at most one edge per cone. The difference is in the way edges are selected. Yao-Yao graphs select an edge of minimum length, whereas Theta-Theta graphs select an edge of minimum orthogonal projection onto the cone bisector. It has been established that the Yao-Yao graphs with parameter k = 6k' have spanning ratio 11.67, for k' >= 6. In this paper we establish a first spanning ratio of 7.827.82 for Theta-Theta graphs, for the same values of kk. We also extend the class of Theta-Theta spanners with parameter 6k', and establish a spanning ratio of 16.7616.76 for k' >= 5. We surmise that these stronger results are mainly due to a tighter analysis in this paper, rather than Theta-Theta being superior to Yao-Yao as a spanner. We also show that the spanning ratio of Theta-Theta graphs decreases to 4.64 as k' increases to 8. These are the first results on the spanning properties of Theta-Theta graphs.Comment: 20 pages, 6 figures, 3 table

    Quantum Walk on a Line with Two Entangled Particles

    Full text link
    We introduce the concept of a quantum walk with two particles and study it for the case of a discrete time walk on a line. A quantum walk with more than one particle may contain entanglement, thus offering a resource unavailable in the classical scenario and which can present interesting advantages. In this work, we show how the entanglement and the relative phase between the states describing the coin degree of freedom of each particle will influence the evolution of the quantum walk. In particular, the probability to find at least one particle in a certain position after NN steps of the walk, as well as the average distance between the two particles, can be larger or smaller than the case of two unentangled particles, depending on the initial conditions we choose. This resource can then be tuned according to our needs, in particular to enhance a given application (algorithmic or other) based on a quantum walk. Experimental implementations are briefly discussed

    Insurance for autonomous underwater vehicles

    Get PDF
    The background and practice of insurance for autonomous underwater vehicles (AUVs) are examined. Key topics include: relationships between clients, brokers and underwriters; contract wording to provide appropriate coverage; and actions to take when an incident occurs. Factors that affect cost of insurance are discussed, including level of autonomy, team experience and operating environment. Four case studies from industry and academia illustrate how AUV insurance has worked in practice. The paper concludes by stressing the importance of effective dialogue between client, broker and underwriter to review, assess and reduce risk to the benefit of all parties

    Spin-Space Entanglement Transfer and Quantum Statistics

    Get PDF
    Both the topics of entanglement and particle statistics have aroused enormous research interest since the advent of quantum mechanics. Using two pairs of entangled particles we show that indistinguishability enforces a transfer of entanglement from the internal to the spatial degrees of freedom without any interaction between these degrees of freedom. Moreover, sub-ensembles selected by local measurements of the path will in general have different amounts of entanglement in the internal degrees of freedom depending on the statistics (either fermionic or bosonic) of the particles involved.Comment: 5 figures. Various changes for clarification and references adde

    Optimal State Discrimination Using Particle Statistics

    Full text link
    We present an application of particle statistics to the problem of optimal ambiguous discrimination of quantum states. The states to be discriminated are encoded in the internal degrees of freedom of identical particles, and we use the bunching and antibunching of the external degrees of freedom to discriminate between various internal states. We show that we can achieve the optimal single-shot discrimination probability using only the effects of particle statistics. We discuss interesting applications of our method to detecting entanglement and purifying mixed states. Our scheme can easily be implemented with the current technology

    Retrograde trafficking of Argonaute 2 acts as a rate-limiting step for de novo miRNP formation on endoplasmic reticulum–attached polysomes in mammalian cells

    Get PDF
    microRNAs are short regulatory RNAs in metazoan cells. Regulation of miRNA activity and abundance is evident in human cells where availability of target messages can influence miRNA biogenesis by augmenting the Dicer1-dependent processing of precursors to mature microRNAs. Requirement of subcellular compartmentalization of Ago2, the key component of miRNA repression machineries, for the controlled biogenesis of miRNPs is reported here. The process predominantly happens on the polysomes attached with the endoplasmic reticulum for which the subcellular Ago2 trafficking is found to be essential. Mitochondrial tethering of endoplasmic reticulum and its interaction with endosomes controls Ago2 availability. In cells with depolarized mitochondria, miRNA biogenesis gets impaired, which results in lowering of de novo–formed mature miRNA levels and accumulation of miRNA-free Ago2 on endosomes that fails to interact with Dicer1 and to traffic back to endoplasmic reticulum for de novo miRNA loading. Thus, mitochondria by sensing the cellular context regulates Ago2 trafficking at the subcellular level, which acts as a rate-limiting step in miRNA biogenesis process in mammalian cells

    Luminescence of Some Organic Compounds Under X-Ray Excitation

    Get PDF

    Lower bounds on the dilation of plane spanners

    Full text link
    (I) We exhibit a set of 23 points in the plane that has dilation at least 1.43081.4308, improving the previously best lower bound of 1.41611.4161 for the worst-case dilation of plane spanners. (II) For every integer n13n\geq13, there exists an nn-element point set SS such that the degree 3 dilation of SS denoted by δ0(S,3) equals 1+3=2.7321\delta_0(S,3) \text{ equals } 1+\sqrt{3}=2.7321\ldots in the domain of plane geometric spanners. In the same domain, we show that for every integer n6n\geq6, there exists a an nn-element point set SS such that the degree 4 dilation of SS denoted by δ0(S,4) equals 1+(55)/2=2.1755\delta_0(S,4) \text{ equals } 1 + \sqrt{(5-\sqrt{5})/2}=2.1755\ldots The previous best lower bound of 1.41611.4161 holds for any degree. (III) For every integer n6n\geq6 , there exists an nn-element point set SS such that the stretch factor of the greedy triangulation of SS is at least 2.02682.0268.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2 table
    corecore