arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 1,783 records · Page 99Linked to original sources

arXiv2015

Modulation instability and controllable rogue waves with multiple compression points for periodically modulated coupled Hirota equations

Based on modulation instability analysis and generalized Darboux transformation, we derive a hierarchy of rogue wave solutions for a variable-coefficients coupled Hirota equations. The explicit first-order rogue wave solution is presented, and the dark-bright and composite rogue waves with multiple compression points are shown by choosing sufficiently large periodic modulation amplitudes in the coefficients of the coupled equations. Also, the dark-bright and composite Peregrine combs are generated from the multiple compression points. For the second-order case, the darkbright three sisters, rogue wave quartets and sextets structures with one or more rogue waves involving multiple compression points are put forward, respectively. Furthermore, some wave characteristics such as the difference between light intensity and continuous wave background, and pulse energy evolution of the dark rogue wave solution features multiple compression points are discussed.

nlin.SI↗

arXiv2015

Sampling Online Social Networks via Heterogeneous Statistics

Most sampling techniques for online social networks (OSNs) are based on a particular sampling method on a single graph, which is referred to as a statistics. However, various realizing methods on different graphs could possibly be used in the same OSN, and they may lead to different sampling efficiencies, i.e., asymptotic variances. To utilize multiple statistics for accurate measurements, we formulate a mixture sampling problem, through which we construct a mixture unbiased estimator which minimizes asymptotic variance. Given fixed sampling budgets for different statistics, we derive the optimal weights to combine the individual estimators; given fixed total budget, we show that a greedy allocation towards the most efficient statistics is optimal. In practice, the sampling efficiencies of statistics can be quite different for various targets and are unknown before sampling. To solve this problem, we design a two-stage framework which adaptively spends a partial budget to test different statistics and allocates the remaining budget to the inferred best statistics. We show that our two-stage framework is a generalization of 1) randomly choosing a statistics and 2) evenly allocating the total budget among all available statistics, and our adaptive algorithm achieves higher efficiency than these benchmark strategies in theory and experiment.

cs.SI↗

arXiv2015

On the Optimal Provider Selection for Repair in Distributed Storage System with Network Coding

In large-scale distributed storage systems (DSS), reliability is provided by redundancy spread over storage servers across the Internet. Network coding (NC) has been widely studied in DSS because it can improve the reliability with low repair time. To maintain reliability, an unavailable storage server should be firstly replaced by a new server, named new comer. Then, multiple storage servers, called providers, should be selected from surviving servers and send their coded data through the Internet to the new comer for regenerating the lost data. Therefore, in a large-scale DSS, provider selection and data routing during the regeneration phase have great impact on the performance of regeneration time. In this paper, we investigate a problem of optimal provider selection and data routing for minimizing the regeneration time in the DSS with NC. Specifically, we first define the problem in the DSS with NC. For the case that the providers are given, we model the problem as a mathematical programming. Based on the mathematical programming, we then formulate the optimal provider selection and data routing problem as an integer linear programming problem and develop an efficient near-optimal algorithm based on linear programming relaxation (BLP). Finally, extensive simulation experiments have been conducted, and the results show the effectiveness of the proposed algorithm.

cs.DC↗

arXiv2015

Particles Acceleration in Converged Two Shocks

Observations show that there is a proton spectral "break" with E$_{break}$ at 1-10MeV in some large CME-driven shocks. Theoretical model usually attribute this phenomenon to a diffusive shock acceleration. However, the underlying physics of the shock acceleration still remains uncertain. Although previous numerical models can hardly predict this "break" due to either high computational expense or shortcomings of current models, the present paper focuses on simulating this energy spectrum in converged two shocks by Monte Carlo numerical method. Considering the Dec 13 2006 CME-driven shock interaction with an Earth bow shock, we examine whether the energy spectral "break" could occur on an interaction between two shocks. As result, we indeed obtain the maximum proton energy up to 10MeV, which is the premise to investigate the existence of the energy spectral "break". Unexpectedly, we further find a proton spectral "break" appears distinctly at the energy $\sim$5MeV.

astro-ph.SR↗

arXiv2015

Spectral Anisotropy of Elsässer Variables in Two Dimensional Wave-vector Space as Observed in the Fast Solar Wind Turbulence

Intensive studies have been conducted to understand the anisotropy of solar wind turbulence. However, the anisotropy of Elsässer variables ($\textbf{Z}^\pm$) in 2D wave-vector space has yet to be investigated. Here we first verify the transformation based on the projection-slice theorem between the power spectral density PSD$_{2D}(k_\parallel,k_\perp )$ and the spatial correlation function CF$_{2D} (r_\parallel,r_\perp )$. Based on the application of the transformation to the magnetic field and the particle measurements from the WIND spacecraft, we investigate the spectral anisotropy of Elsässer variables ($\textbf{Z}^\pm$), and the distribution of residual energy E$_{R}$, Alfvén ratio R$_{A}$ and Elsässer ratio R$_{E}$ in the $(k_\parallel,k_\perp)$ space. The spectra PSD$_{2D}(k_\parallel,k_\perp )$ of $\textbf{B}$, $\textbf{V}$, and $\textbf{Z}_{major}$ (the larger of $\textbf{Z}^\pm$) show a similar pattern that PSD$_{2D}(k_\parallel,k_\perp )$ is mainly distributed along a ridge inclined toward the $k_\perp$ axis. This is probably the signature of the oblique Alfvénic fluctuations propagating outwardly. Unlike those of $\textbf{B}$, $\textbf{V}$, and $\textbf{Z}_{major}$, the spectrum PSD$_{2D}(k_\parallel,k_\perp )$ of $\textbf{Z}_{minor}$ is distributed mainly along the $k_\perp$ axis. Close to the $k_\perp$ axis, $\left| {E}_{R}\right|$ becomes larger while R$_{A}$ becomes smaller, suggesting that the dominance of magnetic energy over kinetic energy becomes more significant at small $k_\parallel$. R$_{E}$ is larger at small $k_\parallel$, implying that PSD$_{2D}(k_\parallel,k_\perp )$ of $\textbf{Z}_{minor}$ is more concentrated along the $k_\perp$ direction as compared to that of $\textbf{Z}_{major}$. The residual energy condensate at small $k_\parallel$ is consistent with simulation results in which E$_{R}$ is spontaneously generated by Alfvén wave interaction.

astro-ph.SR↗

arXiv2015

New Exact Quantization Condition for Toric Calabi-Yau Geometries

We propose a new exact quantization condition for a class of quantum mechanical systems derived from local toric Calabi-Yau three-folds. Our proposal includes all contributions to the energy spectrum which are non-perturbative in the Planck constant, and is much simpler than the available quantization condition in the literature. We check that our proposal is consistent with previous works and implies non-trivial relations among the topological Gopakumar-Vafa invariants of the toric Calabi-Yau geometries. Together with the recent developments, our proposal opens a new avenue in the long investigations at the interface of geometry, topology and quantum mechanics.

hep-th↗

arXiv2015

Energy Spectral Property in an Isolated CME-driven Shock

Observations from multiple spacecraft show that there are energy spectral "breaks" at 1-10MeV in some large CME-driven shocks. However, numerical models can hardly simulate this property due to high computational expense. The present paper focuses on analyzing these energy spectral "breaks" by Monte Carlo particle simulations of an isolated CME-driven shock. Taking the Dec 14 2006 CME-driven shock as an example, we investigate the formation of this energy spectral property. For this purpose, we apply different values for the scattering time in our isolated shock model to obtain the highest energy "tails", which can potentially exceed the "break" energy range. However, we have not found the highest energy "tails" beyond the "break" energy range, but instead find that the highest energy "tails" reach saturation near the range of energy at 5MeV. So, we believe that there exists an energy spectral "cut off" in an isolated shock. If there is no interaction with another shock, there would not be formation of the energy spectral "break" property.

astro-ph.SR↗

arXiv2015

Illuminating a Dark Lens : A Type Ia Supernova Magnified by the Frontier Fields Galaxy Cluster Abell 2744

SN HFF14Tom is a Type Ia Supernova (SN) discovered at z = 1.3457 +- 0.0001 behind the galaxy cluster Abell 2744 (z = 0.308). In a cosmology-independent analysis, we find that HFF14Tom is 0.77 +- 0.15 magnitudes brighter than unlensed Type Ia SNe at similar redshift, implying a lensing magnification of mu_obs = 2.03 +- 0.29. This observed magnification provides a rare opportunity for a direct empirical test of galaxy cluster lens models. Here we test 17 lens models, 13 of which were generated before the SN magnification was known, qualifying as pure "blind tests". The models are collectively fairly accurate: 8 of the models deliver median magnifications that are consistent with the measured mu to within 1-sigma. However, there is a subtle systematic bias: the significant disagreements all involve models overpredicting the magnification. We evaluate possible causes for this mild bias, and find no single physical or methodological explanation to account for it. We do find that model accuracy can be improved to some extent with stringent quality cuts on multiply-imaged systems, such as requiring that a large fraction have spectroscopic redshifts. In addition to testing model accuracies as we have done here, Type Ia SN magnifications could also be used as inputs for future lens models of Abell 2744 and other clusters, providing valuable constraints in regions where traditional strong- and weak-lensing information is unavailable.

astro-ph.CO↗

arXiv2015

SEARS: Space Efficient And Reliable Storage System in the Cloud

Today's cloud storage services must offer storage reliability and fast data retrieval for large amount of data without sacrificing storage cost. We present SEARS, a cloud-based storage system which integrates erasure coding and data deduplication to support efficient and reliable data storage with fast user response time. With proper association of data to storage server clusters, SEARS provides flexible mixing of different configurations, suitable for real-time and archival applications. Our prototype implementation of SEARS over Amazon EC2 shows that it outperforms existing storage systems in storage efficiency and file retrieval time. For 3 MB files, SEARS delivers retrieval time of $2.5$ s compared to $7$ s with existing systems.

cs.DC↗

arXiv2015

Pushing towards the Limit of Sampling Rate: Adaptive Chasing Sampling

Measurement samples are often taken in various monitoring applications. To reduce the sensing cost, it is desirable to achieve better sensing quality while using fewer samples. Compressive Sensing (CS) technique finds its role when the signal to be sampled meets certain sparsity requirements. In this paper we investigate the possibility and basic techniques that could further reduce the number of samples involved in conventional CS theory by exploiting learning-based non-uniform adaptive sampling. Based on a typical signal sensing application, we illustrate and evaluate the performance of two of our algorithms, Individual Chasing and Centroid Chasing, for signals of different distribution features. Our proposed learning-based adaptive sampling schemes complement existing efforts in CS fields and do not depend on any specific signal reconstruction technique. Compared to conventional sparse sampling methods, the simulation results demonstrate that our algorithms allow $46\%$ less number of samples for accurate signal reconstruction and achieve up to $57\%$ smaller signal reconstruction error under the same noise condition.

cs.IT↗

arXiv2015

Robust quantum control using smooth pulses and topological winding

The greatest challenge in achieving the high level of control needed for future technologies based on coherent quantum systems is the decoherence induced by the environment. Here, we present an analytical approach that yields explicit constraints on the driving field which are necessary and sufficient to ensure that the leading-order noise-induced errors in a qubit's evolution cancel exactly. We derive constraints for two of the most common types of noise that arise in qubits: slow fluctuations of the qubit energy splitting and fluctuations in the driving field itself. By theoretically recasting a phase in the qubit's wavefunction as a topological winding number, we can satisfy the noise-cancelation conditions by adjusting driving field parameters without altering the target state or quantum evolution. We demonstrate our method by constructing robust quantum gates for two types of spin qubit: phosphorous donors in silicon and nitrogen-vacancy centers in diamond.

quant-ph↗

arXiv2015

Utility of observational Hubble parameter data on dark energy evolution

Aiming at exploring the nature of dark energy, we use thirty-six observational Hubble parameter data (OHD) in the redshift range $0 \leqslant z \leqslant 2.36$ to make a cosmological model-independent test of the two-point $Omh^2(z_{2};z_{1})$ diagnostic. In $Λ$CDM, we have $Omh^2 \equiv Ω_{m}h^2$, where $Ω_{m}$ is the matter density parameter at present. We bin all the OHD into four data points to mitigate the observational contaminations. By comparing with the value of $Ω_{m}h^2$ which is constrained tightly by the Planck observations, our results show that in all six testing pairs of $Omh^2$ there are two testing pairs are consistent with $Λ$CDM at $1σ$ confidence level (CL), whereas for another two of them $Λ$CDM can only be accommodated at $2σ$ CL. Particularly, for remaining two pairs, $Λ$CDM is not compatible even at $2σ$ CL. Therefore it is reasonable that although deviations from $Λ$CDM exist for some pairs, cautiously, we cannot rule out the validity of $Λ$CDM. We further apply two methods to derive the value of Hubble constant $H_0$ utilizing the two-point $Omh^2(z_{2};z_{1})$ diagnostic. We obtain $H_0 = 71.23\pm1.54$ ${\mathrm{km \ s^{-1} \ Mpc^{-1}}}$ from inverse variance weighted $Omh^2$ value (method (I)) and $H_0 = 69.37\pm1.59$ ${\mathrm{km \ s^{-1} \ Mpc^{-1}}}$ that the $Omh^2$ value originates from Planck measurement (method (II)), both at $1σ$ CL. Finally, we explore how the error in OHD propagate into $w(z)$ at certain redshift during the reconstruction of $w(z)$. We argue that the current precision on OHD is not sufficient small to ensure the reconstruction of $w(z)$ in an acceptable error range, especially at the low redshift

astro-ph.CO↗

arXiv2015

Topology-Aware Node Selection for Data Regeneration in Heterogeneous Distributed Storage Systems

Distributed storage systems introduce redundancy to protect data from node failures. After a storage node fails, the lost data should be regenerated at a replacement storage node as soon as possible to maintain the same level of redundancy. Minimizing such a regeneration time is critical to the reliability of distributed storage systems. Existing work commits to reduce the regeneration time by either minimizing the regenerating traffic, or adjusting the regenerating traffic patterns, whereas nodes participating data regeneration are generally assumed to be given beforehand. However, such regeneration time also depends heavily on the selection of the participating nodes. Selecting different participating nodes actually involve different data links between the nodes. Real-world distributed storage systems usually exhibit heterogeneous link capacities. It is possible to further reduce the regeneration time via exploiting such link capacity differences and avoiding the link bottlenecks. In this paper, we consider the minimization of the regeneration time by selecting the participating nodes in heterogeneous networks. We analyze the regeneration time and propose node selection algorithms for overlay networks and real-world topologies. Considering that the flexible amount of data blocks from each provider may deeply influence the regeneration time, several techniques are designed to enhance our schemes in overlay networks. Experimental results show that our node selection schemes can significantly reduce the regeneration time for each topology, especially in practical networks with heterogeneous link capacities.

cs.DC↗

arXiv2015

Some Improvements on Locally Repairable Codes

The locally repairable codes (LRCs) were introduced to correct erasures efficiently in distributed storage systems. LRCs are extensively studied recently. In this paper, we first deal with the open case remained in \cite{q} and derive an improved upper bound for the minimum distances of LRCs. We also give an explicit construction for LRCs attaining this bound. Secondly, we consider the constructions of LRCs with any locality and availability which have high code rate and minimum distance as large as possible. We give a graphical model for LRCs. By using the deep results from graph theory, we construct a family of LRCs with any locality $r$ and availability $2$ with code rate $\frac{r-1}{r+1}$ and optimal minimum distance $O(\log n)$ where $n$ is the length of the code.

cs.IT↗

arXiv2015

Robust Smart-Grid Powered Cooperative Multipoint Systems

A framework is introduced to integrate renewable energy sources (RES) and dynamic pricing capabilities of the smart grid into beamforming designs for coordinated multi-point (CoMP) downlink communication systems. To this end, novel models are put forth to account for harvesting, storage of nondispatchable RES, time-varying energy pricing, as well as stochastic wireless channels. Building on these models, robust energy management and transmit-beamforming designs are developed to minimize the worst-case energy cost subject to the worst-case user QoS guarantees for the CoMP downlink. Leveraging pertinent tools, this task is formulated as a convex problem. A Lagrange dual based subgradient iteration is then employed to find the desired optimal energy-management strategy and transmit-beamforming vectors. Numerical results are provided to demonstrate the merits of the proposed robust designs.

math.OC↗

arXiv2015

Improving the gate fidelity of capacitively coupled spin qubits

Capacitively coupled semiconductor spin qubits hold promise as the building blocks of a scalable quantum computing architecture with long-range coupling between distant qubits. However, the two-qubit gate fidelities achieved in experiments to date have been severely limited by decoherence originating from charge noise and hyperfine interactions with nuclear spins, and are currently unacceptably low for any conceivable multi-qubit gate operations. Here, we present control protocols that implement two-qubit entangling gates while substantially suppressing errors due to both types of noise. These protocols are obtained by making simple modifications to control sequences already used in the laboratory and should thus be easy enough for immediate experimental realization. Together with existing control protocols for robust single-qubit gates, our results constitute an important step toward scalable quantum computation using spin qubits in semiconductor platforms.

cond-mat.mes-hall↗

arXiv2015

Formation of Rotational Discontinuities in Compressive three-dimensional MHD Turbulence

Measurements of solar wind turbulence reveal the ubiquity of discontinuities. In this study, we investigate how the discontinuities, especially rotational discontinuities (RDs), are formed in magnetohydrodynamic (MHD) turbulence. In a simulation of the decaying compressive three-dimensional (3-D) MHD turbulence with an imposed uniform background magnetic field, we detect RDs with sharp field rotations and little variations of magnetic field intensity as well as mass density. At the same time, in the de Hoffman-Teller (HT) frame, the plasma velocity is nearly in agreement with the Alfvén speed, and is field-aligned on both sides of the discontinuity. We take one of the identified RDs to analyze in details its 3-D structure and temporal evolution. By checking the magnetic field and plasma parameters, we find that the identified RD evolves from the steepening of the Alfvén wave with moderate amplitude, and that steepening is caused by the nonuniformity of the Alfvén speed in the ambient turbulence.

astro-ph.SR↗

arXiv2015

Energy-Efficient Transmission Schedule for Delay-Limited Bursty Data Arrivals under Non-Ideal Circuit Power Consumption

This paper develops a novel approach to obtaining energy-efficient transmission schedules for delay-limited bursty data arrivals under non-ideal circuit power consumption. Assuming a-prior knowledge of packet arrivals, deadlines and channel realizations, we show that the problem can be formulated as a convex program. For both time-invariant and time-varying fading channels, it is revealed that the optimal transmission between any two consecutive channel or data state changing instants, termed epoch, can only take one of the three strategies: (i) no transmission, (ii) transmission with an energy-efficiency (EE) maximizing rate over part of the epoch, or (iii) transmission with a rate greater than the EE-maximizing rate over the whole epoch. Based on this specific structure, efficient algorithms are then developed to find the optimal policies that minimize the total energy consumption with a low computational complexity. The proposed approach can provide the optimal benchmarks for practical schemes designed for transmissions of delay-limited data arrivals, and can be employed to develop efficient online scheduling schemes which require only causal knowledge of data arrivals and deadline requirements.

cs.IT↗