Searcharxiv⌕ Search

arXiv subjects

Hui Liu

Publications and source records attributed to Hui Liu.

At least 613 records · Page 34Linked to original sources
arXiv2016

Delay Analysis and Optimization in Cache-enabled Multi-Cell Cooperative Networks

Caching at the base stations (BSs) has been widely adopted to reduce the delivery delay and alleviate the backhaul traffic between BSs and the core network. In this paper, we consider a collaborative content caching scheme among BSs in cache-enabled multi-cell cooperative networks, where the requested contents can be obtained from the associated BS, the other collaborative BSs or the core network. Novelly, we model the stochastic request traffic and derive a closed form expression for the average delay per request based on multi-class processor sharing queuing theory. We then formulate a cooperative caching optimization problem of minimizing the average delay under the finite cache size constraint at BSs and show it to be at least NP-complete. Furthermore, we prove it equivalent to the maximization of a monotone submodular function subject to matroid constraints, allowing us to adopt the common greedy algorithm with 1/2 performance guarantee. A heuristic greedy caching strategy is also developed, achieving a better performance than the conventional greedy solution. Simulation results verify the accuracy of the analytical results and demonstrate the performance gains obtained by our proposed caching scheme.

cs.IT↗
arXiv2016

The luminosity dependence of quasar UV continuum slope: dust extinction scenario

We investigate the UV continuum slope $α$ of a large quasar sample from SDSS DR7. By using specific continuum windows, we build two samples at lower ($0.71<z<1.19$) and higher ($1.90<z<3.15$) redshifts, which correspond to the continuum slopes at longer (NUV) and shorter (FUV) rest wavelength ranges respectively. Overall, the average continuum slopes are $-0.36$ and $-0.51$ for $α_{\rm NUV}$ and $α_{\rm FUV}$ with similar dispersions $σ_α \sim 0.5$. For both samples, we confirm the luminosity dependence of the continuum slope, i.e., fainter quasars have redder spectra. We further find that both $α_{\rm NUV}$ and $α_{\rm FUV}$ have a common upper limit ($\sim 1/3$) which is almost independent of the quasar luminosity $L_{\rm bol}$. This finding implies that the intrinsic quasar continuum (or the bluest quasar), at any luminosity, obey the standard thin disk model. We propose that the other quasars with redder $α$ are caused by the reddening from the dust {\it locally}. With this assumption, we employ the dust extinction scenario to model the observed $L_{\rm bol}-α$ relation. We find that, a typical value of $E(B-V)\sim0.1$ to $0.3$ mag (depending on the types of extinction curve) of the quasar {\it local} dust is enough to explain the discrepancy of $α$ between the observation ($\sim-0.5$) and the standard accretion disk model prediction ($\sim 1/3$).

astro-ph.GA↗
arXiv2016

The three primary colors of mobile systems

In this paper, we present the notion of "mobile 3C systems in which the "Communications", "Computing", and "Caching" (i.e., 3C) make up the three primary resources/funcationalties, akin to the three primary colors, for a mobile system. We argue that in future mobile networks, the roles of computing and caching are as intrinsic and essential as communications, and only the collective usage of these three primary resources can support the sustainable growth of mobile systems. By defining the 3C resources in their canonical forms, we reveal the important fact that "caching" affects the mobile system performance by introducing non-causality into the system, whereas "computing" achieves capacity gains by performing logical operations across mobile system entities. Many existing capacity-enhancing techniques such as coded multicast, collaborative transmissions, and proactive content pushing can be cast into the native 3C framework for analytical tractability. We further illustrate the mobile 3C concepts with practical examples, including a system on broadcast-unicast convergence for massive media content delivery. The mobile 3C design paradigm opens up new possibilities as well as key research problems bearing academic and practice significance.

cs.IT↗
arXiv2016

Measurement of the Zak phase of photonic bands through the interface states of metasurface/photonic crystal

Zak phase labels the topological property of one-dimensional Bloch Bands. Here we propose a scheme and experimentally measure the Zak phase in a photonic system. The Zak phase of a bulk band of is related to the topological properties of the two band gaps sandwiching this band, which in turn can be inferred from the existence or absence of an interface state. Using reflection spectrum measurement, we determined the existence of interface states in the gaps, and then obtained the Zak phases. The knowledge of Zak phases can also help us predict the existence of interface states between a metasurface and a photonic crystal. By manipulating the property of the metasurface, we can further tune the excitation frequency and the polarization of the interface state.

physics.optics↗
arXiv2016

Multiplicity and ellipticity of closed characteristics on compact star-shaped hypersurfaces in ${\bf R}^{2n}$

In this paper, we firstly generalize some theories developed by I. Ekeland and H. Hofer in [EkH] for closed characteristics on compact convex hypersurfaces in ${\bf R}^{2n}$ to star-shaped hypersurfaces. As applications, we use Ekeland-Hofer theory and index iteration theory to prove that if a compact star-shaped hypersuface in ${\bf R}^4$ satisfying some suitable pinching condition carries exactly two geometrically distinct closed characteristics, then both of them must be elliptic. We also conclude that the theory developed by Y. Long and C. Zhu in [LoZ] still holds for dynamically convex star-shaped hypersurfaces, and combining it with the results in [WHL], [LLW], [Wan3], we obtain that there exist at least $n$ closed characteristics on every dynamically convex star-shaped hypersurface in ${\bf R}^{2n}$ for $n=3, 4$.

math.SG↗
arXiv2016

Encoding and Decoding Algorithms for Arbitrary Dimensional Hilbert Order

Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms are proposed. Four algorithms are based on arithmetic operations and the other four algorithms are based on bit operations. For the algorithms complexities, four of them are linear and the other four are constant for given inputs. In the end of the paper, algorithms for two dimensional Hilbert order are presented to demonstrate the usage of the algorithms introduced.

cs.SC↗
arXiv2015

Non-hyperbolic closed characteristics on non-degenerate star-shaped hypersurfaces in ${\bf R}^{2n}$

In this paper, we prove that for every index perfect non-degenerate compact star-shaped hypersurface $Σ\subset{\bf R}^{2n}$, there exist at least $n$ non-hyperbolic closed characteristics with even Maslov-type indices on $Σ$ when $n$ is even. When $n$ is odd, there exist at least $n$ closed characteristics with odd Maslov-type indices on $Σ$ and at least $(n-1)$ of them are non-hyperbolic. Here we call a compact star-shaped hypersurface $Σ\subset {\bf R}^{2n}$ {\rm index perfect} if it carries only finitely many geometrically distinct prime closed characteristics, and every prime closed characteristic $(τ,y)$ on $Σ$ possesses positive mean index and whose Maslov-type index $i(y, m)$ of its $m$-th iterate satisfies $i(y, m)\not= -1$ when $n$ is even, and $i(y, m)\not\in \{-2,-1,0\}$ when $n$ is odd for all $m\in {\bf N}$.

math.SG↗
arXiv2015

Measurement-device-independent quantum key distribution over untrustful metropolitan network

Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200 square kilometers metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate ten times larger than previous result. Our results demonstrate that the MDIQKD network, combining the best of both worlds --- security and practicality, constitutes an appealing solution to secure metropolitan communications.

quant-ph↗
arXiv2015

Decentralized Voltage and Power Regulation Control of Excitation and Governor System with Global Asymptotic Stability

The Global Asymptotic Stability (GAS), Voltage Regulation (VR), and Power Regulation (PR) of the excitation and governor control system are of critical importance for power system security. However, simultaneously fulfilling GAS, VR, and PR has not yet been achieved. In order to solve this problem, in this paper, we propose a Lyapunov-based decentralized Control (LBC) for the excitation and governor system of multi-machine power system. A completely controllable linear system is actively constructed to design the time-derivative of the Lyapunov function and GAS is guaranteed by satisfying the condition of GAS in Lyapunov theorem. At the same time, VR and PR are performed by introducing both voltage and power to the feedback. The effectiveness of the proposed method is tested and validated on a six-machine power system.

math.OC↗
arXiv2015

Resonance identities and stability of symmetric closed characteristics on symmetric compact star-shaped hypersurfaces

So far, it is still unknown whether all the closed characteristics on a symmetric compact star-shaped hypersurface $Σ$ in ${\bf R}^{2n}$ are symmetric. In order to understand behaviors of such orbits, in this paper we establish first two new resonance identities for symmetric closed characteristics on symmetric compact star-shaped hypersurface $Σ$ in ${\bf R}^{2n}$ when there exist only finitely many geometrically distinct symmetric closed characteristics on $Σ$, which extend the identity established by Liu and Long in \cite{LLo1} of 2013 for symmetric strictly convex hypersurfaces. Then as an application of these identities and the identities established by Liu, Long and Wang recently in \cite{LLW1} for all closed characteristics on the same hypersurface, we prove that if there exist exactly two geometrically distinct closed characteristics on a symmetric compact star-shaped hypersuface in ${\bf R}^4$, then both of them must be elliptic.

math.DS↗
arXiv2015

Iterative detection and decoding for SCMA systems with LDPC codes

Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check (LDPC) decoding. In particular, we decompose the output of the message passing algorithm (MPA) based SCMA multiuser detection into intrinsic part and prior part. Then we design a joint detection and decoding scheme which iteratively exchanges the intrinsic information between the detector and the decoder, yielding a satisfied performance gain. Moreover, the proposed scheme has almost the same complexity compared to the traditional receiver for LDPC-coded SCMA systems. As numerical results demonstrate, the proposed scheme has a substantial gain over the traditional SCMA receiver on AWGN channels and Rayleigh fading channels.

cs.IT↗
arXiv2015

Long-Term Stability Analysis of Power Systems with Wind Power Based on Stochastic Differential Equations: Model Development and Foundations

In this paper, the variable wind power is incorporated into the dynamic model for long-term stability analysis. A theory-based method is proposed for power systems with wind power to conduct long-term stability analysis, which is able to provide accurate stability assessments with fast simulation speed. Particularly, the theoretical foundation for the proposed approximation approach is presented. The accuracy and efficiency of the method are illustrated by several numerical examples.

eess.SY↗
arXiv2015

Stable P-symmetric closed characteristics on partially symmetric compact convex hypersurfaces

In this paper, let $n\geq2$ be an integer, $P=diag(-I_{n-κ},I_κ,-I_{n-κ},I_κ)$ for some integer $κ\in[0, n-1)$, and $Σ\subset {\bf R}^{2n}$ be a partially symmetric compact convex hypersurface, i.e., $x\in Σ$ implies $Px\inΣ$. We prove that if $Σ$ is $(r,R)$-pinched with $\frac{R}{r}<\sqrt{\frac{5}{3}}$, then $Σ$ carries at least two geometrically distinct P-symmetric closed characteristics which possess at least $2n-4κ$ Floquet multipliers on the unit circle of the complex plane.

math.DS↗
arXiv2015

Wake Potential in Strong Coupling Plasma from AdS/CFT Correspondence

With the dielectric function computed from AdS/CFT correspondence, we studied the wake potential induced by a fast moving charge in strong coupling plasma, and compared it with the weak coupling wake potential for different particle velocities as $v=0.55c$ and $v=0.99c$. The most prominent difference between strong and weak wake potential is that when $v=0.99c$ the remarkable oscillation due to Cerenkov-like radiation and Mach cone in weak coupling disappears in strong coupling, which implies that the plasmon mode with phase velocity lower than the speed of light dose not exist in strong coupling plasma.

hep-th↗
arXiv2014

On Content-centric Wireless Delivery Networks

The flux of social media and the convenience of mobile connectivity has created a mobile data phenomenon that is expected to overwhelm the mobile cellular networks in the foreseeable future. Despite the advent of 4G/LTE, the growth rate of wireless data has far exceeded the capacity increase of the mobile networks. A fundamentally new design paradigm is required to tackle the ever-growing wireless data challenge. In this article, we investigate the problem of massive content delivery over wireless networks and present a systematic view on content-centric network design and its underlying challenges. Towards this end, we first review some of the recent advancements in Information Centric Networking (ICN) which provides the basis on how media contents can be labeled, distributed, and placed across the networks. We then formulate the content delivery task into a content rate maximization problem over a share wireless channel, which, contrasting the conventional wisdom that attempts to increase the bit-rate of a unicast system, maximizes the content delivery capability with a fixed amount of wireless resources. This conceptually simple change enables us to exploit the "content diversity" and the "network diversity" by leveraging the abundant computation sources (through application-layer encoding, pushing and caching, etc.) within the existing wireless networks. A network architecture that enables wireless network crowdsourcing for content delivery is then described, followed by an exemplary campus wireless network that encompasses the above concepts.

cs.NI↗