Searcharxiv⌕ Search

arXiv subjects

Li Li

Publications and source records attributed to Li Li.

At least 775 records · Page 43Linked to original sources
arXiv2015

Entanglement entropy in a holographic p-wave superconductor model

In a recent paper, arXiv:1309.4877, a holographic p-wave model has been proposed in an Einstein-Maxwell-complex vector field theory with a negative cosmological constant. The model exhibits rich phase structure depending on the mass and the charge of the vector field. We investigate the behavior of the entanglement entropy of dual field theory in this model. When the above two model parameters change, we observe the second order, first order and zeroth order phase transitions from the behavior of the entanglement entropy at some intermediate temperatures. These imply that the entanglement entropy can indicate not only the occurrence of the phase transition, but also the order of the phase transition. The entanglement entropy is indeed a good probe to phase transition. Furthermore, the "retrograde condensation" which is a sub-dominated phase is also reflected on the entanglement entropy.

hep-th↗
arXiv2015

NFCU: A New Friendship-based Routing with Buffer Management in Opportunistic Networks

Routing in opportunistic networks is a very important and challenging problem because opportunistic network utilizes the contact opportunities of mobile nodes to achieve data communication.Social-based routing uses behavior of human beings which can form a community with the same interests to deliver the message.In this paper,we analyze the drawbacks of the original friendship-based algorithm, which defined social pressure metric to determine nodes'friendship community, but the metric couldn't distinguish the distribution characterization of the connection length which has an important impact on the selection of links with better quality. Further, the existing friendship-based routing doesn't consider the buffer management, which is vital for routing design in opportunistic networks. We propose a New Friendship-based routing with buffer management based on Copy Utility, named NFCU. NFCU algorithm, which not only considers the contact periods in constructing social pressure metric to solve the drawbacks of the original friendship-based routing scheme efficiently, but also considers the buffer management, that can efficiently determine which copy of the message should be deleted timely according to the copy utility function. Our proposed strategy can reduce the network overhead significantly, and increase the message delivery ratio. The extensive simulation results demonstrate that NFCU performs better than the original friendship-based routing. Moreover, we compare NFCU with other four classicalrouting schemes in opportunistic networks in terms of message delivery ratio, average delay, and comprehensive metric- message delivery ratio*(1/average delay). The simulation results show that our scheme NFCU can achieve better performance.

cs.NI↗
arXiv2015

CROR: Coding-Aware Opportunistic Routing in Multi-Channel Cognitive Radio Networks

Cognitive radio (CR) is a promising technology to improve spectrum utilization. However, spectrum availability is uncertain which mainly depends on primary user's (PU's) behaviors. This makes it more difficult for most existing CR routing protocols to achieve high throughput in multi-channel cognitive radio networks (CRNs). Inter-session network coding and opportunistic routing can leverage the broadcast nature of the wireless channel to improve the performance for CRNs. In this paper we present a coding aware opportunistic routing protocol for multi-channel CRNs, cognitive radio opportunistic routing (CROR) protocol, which jointly considers the probability of successful spectrum utilization, packet loss rate, and coding opportunities. We evaluate and compare the proposed scheme against three other opportunistic routing protocols with multichannel. It is shown that the CROR, by integrating opportunistic routing with network coding, can obtain much better results, with respect to throughput, the probability of PU-SU packet collision and spectrum utilization efficiency.

cs.NI↗
arXiv2015

Understanding Kernel Ridge Regression: Common behaviors from simple functions to density functionals

Accurate approximations to density functionals have recently been obtained via machine learning (ML). By applying ML to a simple function of one variable without any random sampling, we extract the qualitative dependence of errors on hyperparameters. We find universal features of the behavior in extreme limits, including both very small and very large length scales, and the noise-free limit. We show how such features arise in ML models of density functionals.

physics.comp-ph↗
arXiv2015

Capacity Analysis in Multi-Radio Multi-Channel Cognitive Radio Networks: A Small World Perspective

Cognitive radio (CR) has emerged as a promising technology to improve spectrum utilization. Capacity analysis is very useful in investigating the ultimate performance limits for wireless networks. Meanwhile, with increasing potential future applications for the CR systems, it is necessary to explore the limitations on their capacity in a dynamic spectrum access environment. However, due to spectrum sharing in cognitive radio networks (CRNs), the capacity of the secondary network (SRN) is much more difficult to analyze than that of traditional wireless networks. To overcome this difficulty, in this paper we introduce a novel solution based on small world model to analyze the capacity of SRN. First, we propose a new method of shortcut creation for CRNs, which is based on connectivity ratio. Also, a new channel assignment algorithm is proposed, which jointly considers the available time and transmission time of the channels. And then, we derive the capacity of SRN based on the small world model over multi-radio multi-channel (MRMC) environment. The simulation results show that our proposed scheme can obtain a higher capacity and smaller latency compared with traditional schemes in MRMC CRNs.

cs.NI↗
arXiv2015

Transport Protocols in Cognitive Radio Networks: A Survey

Cognitive radio networks (CRNs) have emerged as a promising solution to enhance spectrum utilization by using unused or less used spectrum in radio environments. The basic idea of CRNs is to allow secondary users (SUs) access to licensed spectrum, under the condition that the interference perceived by the primary users (PUs) is minimal. In CRNs, the channel availability is uncertainty due to the existence of PUs, resulting in intermittent communication. Transmission control protocol (TCP) performance may significantly degrade in such conditions. To address the challenges, some transport protocols have been proposed for reliable transmission in CRNs. In this paper we survey the state-of-the-art transport protocols for CRNs. We firstly highlight the unique aspects of CRNs, and describe the challenges of transport protocols in terms of PU behavior, spectrum sensing, spectrum changing and TCP mechanism itself over CRNs. Then, we provide a summary and comparison of existing transport protocols for CRNs. Finally, we discuss several open issues and research challenges. To the best of our knowledge, our work is the first survey on transport protocols for CRNs.

cs.NI↗
arXiv2014

Quantum teleportation of multiple properties of a single quantum particle

Quantum teleportation provides a "disembodied" way to transfer quantum states from one object to another at a distant location, assisted by priorly shared entangled states and a classical communication channel. In addition to its fundamental interest, teleportation has been recognized as an important element in long-distance quantum communication, distributed quantum networks and measurement-based quantum computation. There have been numerous demonstrations of teleportation in different physical systems such as photons, atoms, ions, electrons, and superconducting circuits. Yet, all the previous experiments were limited to teleportation of one degree of freedom (DoF) only. However, a single quantum particle can naturally possess various DoFs -- internal and external -- and with coherent coupling among them. A fundamental open challenge is to simultaneously teleport multiple DoFs, which is necessary to fully describe a quantum particle, thereby truly teleporting it intactly. Here, we demonstrate the first teleportation of the composite quantum states of a single photon encoded in both the spin and orbital angular momentum. We develop a method to project and discriminate hyper-entangled Bell states exploiting probabilistic quantum non-demolition measurement, which can be extended to more DoFs. We verify the teleportation for both spin-orbit product states and hybrid entangled state, and achieve a teleportation fidelity ranging from 0.57 to 0.68, above the classical limit. Our work moves a step toward teleportation of more complex quantum systems, and demonstrates an enhanced capability for scalable quantum technologies.

quant-ph↗
arXiv2014

Non-relativistic Josephson Junction from Holography

We construct a Josephson junction in non-relativistic case with a Lifshitz geometry as the dual gravity. We investigate the effect of the Lifshitz scaling in comparison with its relativistic counterpart. The standard sinusoidal relation between the current and the phase difference is found for various Lifshitz scalings characterised by the dynamical critical exponent. We also find the exponential decreasing relation between the condensate of the scalar operator within the barrier at zero current and the width of the weak link, as well as the relation between the critical current and the width. Nevertheless, the coherence lengths obtained from two exponential decreasing relations generically have discrepancies for non-relativistic dual.

hep-th↗
arXiv2014

Competition between s-wave order and d-wave order in holographic superconductors

We study competition between s-wave order and d-wave order through two holographic superconductor models. We find that once the coexisting phase appears, it is always thermodynamically favored, and that the coexistence phase is narrow and one condensate tends to kill the other. The phase diagram is constructed for each model in terms of temperature and the ratio of charges of two orders. We further compare the behaviors of some thermodynamic quantities, and discuss the different aspects and identical ones between two models.

hep-th↗
arXiv2014

Quantization Errors of Modulo Sigma-Delta Modulated ARMA Processes

In this paper, we study the quantization errors of modulo sigma-delta modulated finite, asymptotically-infinite, infinite causal stable ARMA processes. We prove that the normalized quantization error can be taken as a uniformly distributed white noise for all the cases. Moreover, we find that this nice property is guaranteed by two different mechanisms: the high-enough quantization resolution \cite{Bennett1948}-\cite{WidrowKollar2008} and the asymptotic convergence of quantization errors for some quasi-stationary processes \cite{ChouGray1991}-\cite{LiChenLiZhang2009}, for different cases. But the assumption of the smooth density of the sampled random processes is needed in all the cases.

cs.IT↗
arXiv2014

Understanding Machine-learned Density Functionals

Kernel ridge regression is used to approximate the kinetic energy of non-interacting fermions in a one-dimensional box as a functional of their density. The properties of different kernels and methods of cross-validation are explored, and highly accurate energies are achieved. Accurate {\em constrained optimal densities} are found via a modified Euler-Lagrange constrained minimization of the total energy. A projected gradient descent algorithm is derived using local principal component analysis. Additionally, a sparse grid representation of the density can be used without degrading the performance of the methods. The implications for machine-learned density functional approximations are discussed.

physics.chem-ph↗
arXiv2014

Greedy bases in rank 2 quantum cluster algebras

We identify a quantum lift of the greedy basis for rank 2 coefficient-free cluster algebras. Our main result is that our construction does not depend on the choice of initial cluster, that it builds all cluster monomials, and that it produces bar-invariant elements. We also present several conjectures related to this quantum greedy basis and the triangular basis of Berenstein and Zelevinsky.

math.QA↗
arXiv2014

Canonical form of master equations and characterization of non-Markovianity

Master equations govern the time evolution of a quantum system interacting with an environment, and may be written in a variety of forms. Time-independent or memoryless master equations, in particular, can be cast in the well-known Lindblad form. Any time-local master equation, Markovian or non-Markovian, may in fact also be written in a Lindblad-like form. A diagonalisation procedure results in a unique, and in this sense canonical, representation of the equation, which may be used to fully characterize the non-Markovianity of the time evolution. Recently, several different measures of non-Markovianity have been presented which reflect, to varying degrees, the appearance of negative decoherence rates in the Lindblad-like form of the master equation. We therefore propose using the negative decoherence rates themselves, as they appear in the canonical form of the master equation, to completely characterize non-Markovianity. The advantages of this are especially apparent when more than one decoherence channel is present. We show that a measure proposed by Rivas et al. is a surprisingly simple function of the canonical decoherence rates, and give an example of a master equation that is non-Markovian for all times t>0, but to which nearly all proposed measures are blind. We also give necessary and sufficient conditions for trace distance and volume measures to witness non-Markovianity, in terms of the Bloch damping matrix.

quant-ph↗
arXiv2014

Attenuation Correction of L-shell X-ray Fluorescence Computed Tomography Imaging

X-ray Fluorescence Computed Tomography(XFCT) is a prevalent experimental technique which is utilized to investigate the spatial distribution of elements in sample. The sensitivity of L-shell XFCT of some elements is lower than that of K-shell XFCT. However, the image reconstruction for this technique has much more problems than that of transmission tomography, one of which is self-absorption. In the present work, a novel strategy was developed to deal with such problems. But few researches are concerned on attenuation correction of L-shell XFCT that are essential to get accurate reconstructed image. We make use of the known quantities and the unknown elemental concentration of interest to express the unknown attenuation maps. And then the attenuation maps are added in the contribution value of the pixel in MLEM reconstruction method. Results indicate that the relative error is less than 14.1%, which is proved this method can correct L-shell XFCT very well.

physics.ins-det↗
arXiv2014

I know what leaked in your pocket: uncovering privacy leaks on Android Apps with Static Taint Analysis

Android applications may leak privacy data carelessly or maliciously. In this work we perform inter-component data-flow analysis to detect privacy leaks between components of Android applications. Unlike all current approaches, our tool, called IccTA, propagates the context between the components, which improves the precision of the analysis. IccTA outperforms all other available tools by reaching a precision of 95.0% and a recall of 82.6% on DroidBench. Our approach detects 147 inter-component based privacy leaks in 14 applications in a set of 3000 real-world applications with a precision of 88.4%. With the help of ApkCombiner, our approach is able to detect inter-app based privacy leaks.

cs.SE↗
arXiv2014

Petrov type I Condition and Dual Fluid Dynamics

Recently Lysov and Strominger [arXiv:1104.5502] showed that imposing Petrov type I condition on a $(p+1)$-dimensional timelike hypersurface embedded in a $(p+2)$-dimensional vacuum Einstein gravity reduces the degrees of freedom in the extrinsic curvature of the hypersurface to that of a fluid on the hypersurface, and that the leading-order Einstein constraint equations in terms of the mean curvature of the embedding give the incompressible Navier-Stokes equations of the dual fluid. In this paper we show that the non-relativistic fluid dual to vacuum Einstein gravity does not satisfy the Petrov type I condition at next order, unless additional constraint such as the irrotational condition is added. In addition, we show that this procedure can be inversed to derive the non-relativistic hydrodynamics with higher order corrections through imposing the Petrov type I condition, and that some second order transport coefficients can be extracted, but the dual "Petrov type I fluid" does not match the dual fluid constructed from the geometry of vacuum Einstein gravity in the non-relativistic limit. We discuss the procedure both on the finite cutoff surface via the non-relativistic hydrodynamic expansion and on the highly accelerated surface via the near horizon expansion.

hep-th↗
arXiv2014

Stateful Security Protocol Verification

A long-standing research problem in security protocol design is how to efficiently verify security protocols with tamper-resistant global states. In this paper, we address this problem by first proposing a protocol specification framework, which explicitly represents protocol execution states and state transformations. Secondly, we develop an algorithm for verifying security properties by utilizing the key ingredients of the first-order reasoning for reachability analysis, while tracking state transformation and checking the validity of newly generated states. Our verification algorithm is proven to be (partially) correct, if it terminates. We have implemented the proposed framework and verification algorithms in a tool named SSPA, and evaluate it using a number of stateful security protocols. The experimental results show that our approach is not only feasible but also practically efficient. In particular, we have found a security flaw on the digital envelope protocol, which could not be detected by existing security protocol verifiers.

cs.CR↗