arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 1,117 records · Page 62Linked to original sources

arXiv2016

Power-Delay Tradeoff in Multi-User Mobile-Edge Computing Systems

Mobile-edge computing (MEC) has recently emerged as a promising paradigm to liberate mobile devices from increasingly intensive computation workloads, as well as to improve the quality of computation experience. In this paper, we investigate the tradeoff between two critical but conflicting objectives in multi-user MEC systems, namely, the power consumption of mobile devices and the execution delay of computation tasks. A power consumption minimization problem with task buffer stability constraints is formulated to investigate the tradeoff, and an online algorithm that decides the local execution and computation offloading policy is developed based on Lyapunov optimization. Specifically, at each time slot, the optimal frequencies of the local CPUs are obtained in closed forms, while the optimal transmit power and bandwidth allocation for computation offloading are determined with the Gauss-Seidel method. Performance analysis is conducted for the proposed algorithm, which indicates that the power consumption and execution delay obeys an [O (1/V); O (V)] tradeoff with V as a control parameter. Simulation results are provided to validate the theoretical analysis and demonstrate the impacts of various parameters to the system performance.

cs.IT↗

arXiv2016

A solar flare disturbing a light wall above a sunspot light bridge

With the high-resolution data from the Interface Region Imaging Spectrograph, we detect a light wall above a sunspot light bridge in the NOAA active region (AR) 12403. In the 1330 A slit-jaw images, the light wall is brighter than the ambient areas while the wall top and base are much brighter than the wall body, and it keeps oscillating above the light bridge. A C8.0 flare caused by a filament activation occurred in this AR with the peak at 02:52 UT on 2015 August 28, and the flare's one ribbon overlapped the light bridge which was the observational base of the light wall. Consequently, the oscillation of the light wall was evidently disturbed. The mean projective oscillation amplitude of the light wall increased from 0.5 Mm to 1.6 Mm before the flare, and decreased to 0.6 Mm after the flare. We suggest that the light wall shares a group of magnetic field lines with the flare loops, which undergo a magnetic reconnection process, and they constitute a coupled system. When the magnetic field lines are pushed upwards at the pre-flare stage, the light wall turns to the vertical direction, resulting in the increase of the light wall's projective oscillation amplitude. After the magnetic reconnection takes place, a group of new field lines with smaller scales are formed underneath the reconnection site and the light wall inclines. Thus, the projective amplitude decreases remarkably at the post-flare stage.

astro-ph.SR↗

arXiv2016

Optimal QoS-Aware Channel Assignment in D2D Communications with Partial CSI

In this paper, we propose effective channel assignment algorithms for network utility maximization in a cellular network with underlaying device-to-device (D2D) communications. A major innovation is the consideration of partial channel state information (CSI), i.e., the base station (BS) is assumed to be able to acquire `partial' instantaneous CSI of the cellular and D2D links, as well as, the interference links. In contrast to existing works, multiple D2D links are allowed to share the same channel, and the quality of service (QoS) requirements for both the cellular and D2D links are enforced. We first develop an optimal channel assignment algorithm based on dynamic programming (DP), which enjoys a much lower complexity compared to exhaustive search and will serve as a performance benchmark. To further reduce complexity, we propose a cluster-based sub-optimal channel assignment algorithm. New closed-form expressions for the expected weighted sum-rate and the successful transmission probabilities are also derived. Simulation results verify the effectiveness of the proposed algorithms. Moreover, by comparing different partial CSI scenarios, we observe that the CSI of the D2D communication links and the interference links from the D2D transmitters to the BS significantly affects the network performance, while the CSI of the interference links from the BS to the D2D receivers only has a negligible impact.

cs.IT↗

arXiv2016

Joint Subcarrier and CPU Time Allocation for Mobile Edge Computing

In mobile edge computing systems, mobile devices can offload compute-intensive tasks to a nearby cloudlet,so as to save energy and extend battery life. Unlike a fully-fledged cloud, a cloudlet is a small-scale datacenter deployed at a wireless access point, and thus is highly constrained by both radio and compute resources. We show in this paper that separately optimizing the allocation of either compute or radio resource, as most existing works did, is highly suboptimal: the congestion of compute resource leads to the waste of radio resource, and vice versa. To address this problem, we propose a joint scheduling algorithm that allocates both radio and compute resources coordinately. Specifically, we consider a cloudlet in an Orthogonal Frequency-Division Multiplexing Access (OFDMA) system with multiple mobile devices, where we study subcarrier allocation for task offloading and CPU time allocation for task execution in the cloudlet. Simulation results show that the proposed algorithm significantly outperforms per-resource optimization, accommodating more offloading requests while achieving salient energy saving.

cs.IT↗

arXiv2016

Design considerations of high-performance InGaAs/InP single-photon avalanche diodes for quantum key distribution

InGaAs/InP single-photon avalanche diodes (SPADs) are widely used in practical applications requiring near-infrared photon counting such as quantum key distribution (QKD). Photon detection efficiency and dark count rate are the intrinsic parameters of InGaAs/InP SPADs, due to the fact that their performances cannot be improved using different quenching electronics given the same operation conditions. After modeling these parameters and developing a simulation platform for InGaAs/InP SPADs, we investigate the semiconductor structure design and optimization. The parameters of photon detection efficiency and dark count rate highly depend on the variables of absorption layer thickness, multiplication layer thickness, excess bias voltage and temperature. By evaluating the decoy-state QKD performance, the variables for SPAD design and operation can be globally optimized. Such optimization from the perspective of specific applications can provide an effective approach to design high-performance InGaAs/InP SPADs.

quant-ph↗

arXiv2016

Slipping Magnetic Reconnection of Flux Rope Structures as a Precursor to an Eruptive X-class Solar Flare

We present the quasi-periodic slipping motion of flux rope structures prior to the onset of an eruptive X-class flare on 2015 March 11, obtained by the \emph{Interface Region Imaging Spectrograph} (\emph{IRIS}) and the \emph{Solar Dynamics Observatory} (\emph{SDO}). The slipping motion occurred at the north part of the flux rope and seemed to successively peel off the flux rope. The speed of the slippage was 30$-$40 km s$^{-1}$, with an average period of 130$\pm$30 s. The Si {\sc iv} 1402.77 Å line showed a redshift of 10$-$30 km s$^{-1}$ and a line width of 50$-$120 km s$^{-1}$ at the west legs of slipping structures, indicative of reconnection downflow. The slipping motion lasted about 40 min and the flux rope started to rise up slowly at the late stage of the slippage. Then an X2.1 flare was initiated and the flux rope was impulsively accelerated. One of the flare ribbons swept across a negative-polarity sunspot and the penumbral segments of the sunspot decayed rapidly after the flare. We studied the magnetic topology at the flaring region and the results showed the existence of a twisted flux rope, together with quasi-separatrix layers (QSLs) structures binding the flux rope. Our observations imply that quasi-periodic slipping magnetic reconnection occurs along the flux-rope-related QSLs in the preflare stage, which drives the later eruption of the flux rope and the associated flare.

astro-ph.SR↗

arXiv2016

Cosmic Shear Measurement using Autoconvolved Images

We study the possibility of using quadrupole moments of auto-convolved galaxy images to measure cosmic shear. The autoconvolution of an image corresponds to the inverse Fourier transformation of its power spectrum. The new method has the following advantages: the smearing effect due to the Point Spread Function (PSF) can be corrected by subtracting the quadrupole moments of the auto-convolved PSF; the centroid of the auto-convolved image is trivially identified; the systematic error due to noise can be directly removed in Fourier space; the PSF image can also contain noise, the effect of which can be similarly removed. With a large ensemble of simulated galaxy images, we show that the new method can reach a sub-percent level accuracy in general conditions, albeit with increasingly large stamp size for galaxies of less compact profiles.

astro-ph.CO↗

arXiv2016

Slopes of eigencurves over boundary disks

Let $p$ be a prime number. We study the slopes of $U_p$-eigenvalues on the subspace of modular forms that can be transferred to a definite quaternion algebra. We give a sharp lower bound of the corresponding Newton polygon. The computation happens over a definite quaternion algebra by Jacquet-Langlands correspondence; it generalizes a prior work of Daniel Jacobs who treated the case of $p=3$ with a particular level. In case when the modular forms have a finite character of conductor highly divisible by $p$, we improve the lower bound to show that the slopes of $U_p$-eigenvalues grow roughly like arithmetic progressions as the weight $k$ increases. This is the first very positive evidence for Buzzard-Kilford's conjecture on the behavior of the eigencurve near the boundary of the weight space, that is proved for arbitrary $p$ and general level. We give the exact formula of a fraction of the slope sequence.

math.NT↗

arXiv2016

Galaxy-Galaxy Weak Lensing Measurements from SDSS: I. Image Processing and Lensing signals

As the first paper in a series on the study of the galaxy-galaxy lensing from Sloan Digital Sky Survey Data Release 7 (SDSS DR7), we present our image processing pipeline that corrects the systematics primarily introduced by the Point Spread Function (PSF). Using this pipeline, we processed SDSS DR7 imaging data in $r$ band and generated a background galaxy catalog containing the shape information of each galaxy. Based on our own shape measurements of the galaxy images from SDSS DR7, we extract the galaxy-galaxy (GG) lensing signals around foreground spectroscopic galaxies binned in different luminosity and stellar mass. The overall signals are in good agreement with those obtained by \citet{Mandelbaum2005, Mandelbaum2006} from the SDSS DR4. The results in this paper with higher signal to noise ratio is due to the larger survey area than SDSS DR4, confirm that more luminous/massive galaxies bear stronger GG lensing signal. We also divide the foreground galaxies into red/blue and star forming/quenched subsamples and measured their GG lensing signals, respectively. We find that, at a specific stellar mass/luminosity, the red/quenched galaxies have relatively stronger GG lensing signals than their counterparts especially at large radii. These GG lensing signals can be used to probe the galaxy-halo mass relations and their environmental dependences in the halo occupation or conditional luminosity function framework.

astro-ph.CO↗

arXiv2016

Pedestrian dynamics in single-file movement of crowd with different age compositions

An aging population is bringing new challenges to the management of escape routes and facility design in many countries. This paper investigates pedestrian movement properties of crowd with different age compositions. Three pedestrian groups are considered: young student group, old people group and mixed group. It is found that traffic jams occur more frequently in mixed group due to the great differences of mobilities and self-adaptive abilities among pedestrians. The jams propagate backward with a velocity 0.4 m/s for global density around 1.75 m-1 and 0.3 m/s for higher than 2.3 m-1. The fundamental diagrams of the three groups are obviously different from each other and cannot be unified into one diagram by direct non-dimensionalization. Unlike previous studies, three linear regimes in mixed group but only two regimes in young student group are observed in the headway-velocity relation, which is also verified in the fundamental diagram. Different ages and mobilities of pedestrians in a crowd cause the heterogeneity of system and influence the properties of pedestrian dynamics significantly. It indicates that the density is not the only factor leading to jams in pedestrian traffic. The composition of crowd has to be considered in understanding pedestrian dynamics and facility design.

physics.soc-ph↗

arXiv2016

Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

quant-ph↗

arXiv2016

Optomechanically induced transparency in multi-cavity optomechanical system with and without one two-level atom

We analytically study the optomechanically induced transparency (OMIT) in the $N$-cavity system with the \textit{N}th cavity driven by pump, probing laser fields and the \textit{1}st cavity coupled to mechanical oscillator. We also consider that one atom could be trapped in the \textit{i}th cavity. Instead of only illustrating the OMIT in such a system, we are interested in how the number of OMIT windows is influenced by the cavities and the atom and what roles the atom could play in different cavities. In the resolved sideband regime, we find that, the number of cavities precisely determines the maximal number of OMIT windows. It is interesting that, when the two-level atom is trapped in the even-labeled cavity, the central absorptive peak (odd $N$) or dip (even $N$) is split and forms an extra OMIT window, but if the atom is trapped in the odd-labeled cavity, the central absorptive peak (odd $N$) or dip (even $N$) is only broadened and thus changes the width of the OMIT windows rather than induces an extra window.

quant-ph↗

arXiv2016

New Constructions of MDS Symbol-Pair Codes

Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field $\mathbb{F}_{q}$. We show that a linear MDS symbol-pair code over $\mathbb{F}_{q}$ with pair-distance $5$ exists if and only if the length $n$ ranges from $5$ to $q^2+q+1$. As for codes with pair-distance $6$, length ranging from $6$ to $q^{2}+1$, we construct linear MDS symbol-pair codes by using a configuration called ovoid in projective geometry. With the help of elliptic curves, we present a construction of linear MDS symbol-pair codes for any pair-distance $d+2$ with length $n$ satisfying $7\le d+2\leq n\le q+\lfloor 2\sqrt{q}\rfloor+δ(q)-3$, where $δ(q)=0$ or $1$.

cs.IT↗

arXiv2016

Dynamic Computation Offloading for Mobile-Edge Computing with Energy Harvesting Devices

Mobile-edge computing (MEC) is an emerging paradigm to meet the ever-increasing computation demands from mobile applications. By offloading the computationally intensive workloads to the MEC server, the quality of computation experience, e.g., the execution latency, could be greatly improved. Nevertheless, as the on-device battery capacities are limited, computation would be interrupted when the battery energy runs out. To provide satisfactory computation performance as well as achieving green computing, it is of significant importance to seek renewable energy sources to power mobile devices via energy harvesting (EH) technologies. In this paper, we will investigate a green MEC system with EH devices and develop an effective computation offloading strategy. The execution cost, which addresses both the execution latency and task failure, is adopted as the performance metric. A low-complexity online algorithm, namely, the Lyapunov optimization-based dynamic computation offloading (LODCO) algorithm is proposed, which jointly decides the offloading decision, the CPU-cycle frequencies for mobile execution, and the transmit power for computation offloading. A unique advantage of this algorithm is that the decisions depend only on the instantaneous side information without requiring distribution information of the computation task request, the wireless channel, and EH processes. The implementation of the algorithm only requires to solve a deterministic problem in each time slot, for which the optimal solution can be obtained either in closed form or by bisection search. Moreover, the proposed algorithm is shown to be asymptotically optimal via rigorous analysis. Sample simulation results shall be presented to verify the theoretical analysis as well as validate the effectiveness of the proposed algorithm.

cs.IT↗

arXiv2016

Mobility-Aware Caching for Content-Centric Wireless Networks: Modeling and Methodology

As mobile services are shifting from "connection-centric" communications to "content-centric" communications, content-centric wireless networking emerges as a promising paradigm to evolve the current network architecture. Caching popular content at the wireless edge, including base stations (BSs) and user terminals (UTs), provides an effective approach to alleviate the heavy burden on backhaul links, as well as lowering delays and deployment costs. In contrast to wired networks, a unique characteristic of content-centric wireless networks (CCWNs) is the mobility of mobile users. While it has rarely been considered by existing works in caching design, user mobility contains various helpful side information that can be exploited to improve caching efficiency at both BSs and UTs. In this paper, we present a general framework on mobility-aware caching in CCWNs. Key properties of user mobility patterns that are useful for content caching will be firstly identified, and then different design methodologies for mobility-aware caching will be proposed. Moreover, two design examples will be provided to illustrate the proposed framework in details, and interesting future research directions will be identified.

cs.IT↗

arXiv2016

Magnetic reconnection between a solar filament and nearby coronal loops

Magnetic reconnection, the rearrangement of magnetic field topology, is a fundamental physical process in magnetized plasma systems all over the universe1,2. Its process is difficult to be directly observed. Coronal structures, such as coronal loops and filament spines, often sketch the magnetic field geometry and its changes in the solar corona3. Here we show a highly suggestive observation of magnetic reconnection between an erupting solar filament and its nearby coronal loops, resulting in changes in connection of the filament. X-type structures form when the erupting filament encounters the loops. The filament becomes straight, and bright current sheets form at the interfaces with the loops. Many plasmoids appear in these current sheets and propagate bi-directionally. The filament disconnects from the current sheets, which gradually disperse and disappear, reconnects to the loops, and becomes redirected to the loop footpoints. This evolution of the filament and the loops suggests successive magnetic reconnection predicted by theories1 but rarely detected with such clarity in observations. Our results on the formation, evolution, and disappearance of current sheets, confirm three-dimensional magnetic reconnection theory and have implications for the evolution of dissipation regions and the release of magnetic energy for reconnection in many magnetized plasma systems.

astro-ph.SR↗

arXiv2016

Magnetic field induced dynamical instabilities in an anti-ferromagnetic spin-1 Bose-Einstein condensate

We theoretically investigate four types of dynamical instability, in particular the periodic and oscillatory type $I_O$, in an anti-ferromagnetic spin-1 Bose-Einstein condensate in a nonzero magnetic field, by employing the coupled-mode theory and numerical method. This is in sharp contrast to the dynamical stability of the same system in zero field. Remarkably, a pattern transition from a periodic dynamical instability $I_O$ to a uniform one $III_O$ occurs at a critical magnetic field. All the four types of dynamical instability and the pattern transition are ready to be detected in $^{23}$Na condensates within the availability of the current experimental techniques.

cond-mat.quant-gas↗

arXiv2016

Delay-Optimal Computation Task Scheduling for Mobile-Edge Computing Systems

Mobile-edge computing (MEC) emerges as a promising paradigm to improve the quality of computation experience for mobile devices. Nevertheless, the design of computation task scheduling policies for MEC systems inevitably encounters a challenging two-timescale stochastic optimization problem. Specifically, in the larger timescale, whether to execute a task locally at the mobile device or to offload a task to the MEC server for cloud computing should be decided, while in the smaller timescale, the transmission policy for the task input data should adapt to the channel side information. In this paper, we adopt a Markov decision process approach to handle this problem, where the computation tasks are scheduled based on the queueing state of the task buffer, the execution state of the local processing unit, as well as the state of the transmission unit. By analyzing the average delay of each task and the average power consumption at the mobile device, we formulate a power-constrained delay minimization problem, and propose an efficient one-dimensional search algorithm to find the optimal task scheduling policy. Simulation results are provided to demonstrate the capability of the proposed optimal stochastic task scheduling policy in achieving a shorter average execution delay compared to the baseline policies.

cs.IT↗