Searcharxiv⌕ Search

arXiv subjects

Ming Xiao

Publications and source records attributed to Ming Xiao.

At least 145 records · Page 8Linked to original sources

Design and Analysis of Online Fountain Codes for Intermediate Performance

For the benefit of improved intermediate performance, recently online fountain codes attract much research attention. However, there is a trade-off between the intermediate performance and the full recovery overhead for online fountain codes, which prevents them to be improved simultaneously. We analyze this trade-off, and propose to improve both of these two performance. We first propose a method called Online Fountain Codes without Build-up phase (OFCNB) where the degree-1 coded symbols are transmitted at first and the build-up phase is removed to improve the intermediate performance. Then we analyze the performance of OFCNB theoretically. Motivated by the analysis results, we propose Systematic Online Fountain Codes (SOFC) to further reduce the full recovery overhead. Theoretical analysis shows that SOFC has better intermediate performance, and it also requires lower full recovery overhead when the channel erasure rate is lower than a constant. Simulation results verify the analyses and demonstrate the superior performance of OFCNB and SOFC in comparison to other online fountain codes.

cs.IT↗

Kinematic signatures of reverberation mapping of close binaries of supermassive black holes in active galactic nuclei. II. Atlas of two-dimensional transfer functions

Most large galaxies harbor supermassive black holes (SMBHs) in their centers, and galaxies merge. Consequently, binary SMBHs should be common in galactic nuclei. However, close binaries of SMBH (CB-SMBHs) with sub-parsec separation cannot be imaged directly using current facilities. Some indirect signatures, such as periodic signals in light curves and double peaks in emission-line profile, have been used to find CB-SMBH candidates, but ambiguities still exist and no definitive conclusions can be made. We have recently proposed a new method focusing on kinematic signatures that can be derived from reverberation mapping of CB-SMBHs, one that offers a promising avenue to address this important problem. In this paper, we calculated models for a wide range of parameters, but BLRs of two BHs are close but still not merged. The purpose of this supplementary paper is to provide an atlas of two-dimensional transfer functions of CB-SMBHs with a wide range of orbital and geometrical parameters to aid more efficient identification of CB-SMBH candidates in reverberation mapping data.

astro-ph.GA↗

Decentralized Consensus Optimization Based on Parallel Random Walk

The alternating direction method of multipliers (ADMM) has recently been recognized as a promising approach for large-scale machine learning models. However, very few results study ADMM from the aspect of communication costs, especially jointly with running time. In this letter, we investigate the communication efficiency and running time of ADMM in solving the consensus optimization problem over decentralized networks. We first review the effort of random walk ADMM (W-ADMM), which reduces communication costs at the expense of running time. To accelerate the convergence speed of W-ADMM, we propose the parallel random walk ADMM (PW-ADMM) algorithm, where multiple random walks are active at the same time. Moreover, to further reduce the running time of PW-ADMM, the intelligent parallel random walk ADMM (IPW-ADMM) algorithm is proposed through integrating the \textit{Random Walk with Choice} with PW-ADMM. By numerical results from simulations, we demonstrate that the proposed algorithms can be both communication efficient and fast in running speed compared with state-of-the-art methods.

cs.DC↗

Active Galactic Nuclei with Ultra-fast Outflows Monitoring Project: The Broad-line Region of Mrk 79 as a Disk Wind

We developed a spectroscopic monitoring project to investigate the kinematics of the broad-line region (BLR) in active galactic nuclei (AGN) with ultra-fast outflows (UFOs). Mrk~79 is a radio-quiet AGN with UFOs and warm absorbers, had been monitored by three reverberation mapping (RM) campaigns, but its BLR kinematics is not understood yet. In this paper, we report the results from a new RM-campaign of Mrk~79, which was undertaken by Lijiang 2.4-m telescope. Mrk~79 is seeming to come out the faint state, the mean flux approximates a magnitude fainter than historical record. We successfully measured the lags of the broad emission lines including H$β~\lambda4861$, H$γ~\lambda4340$, He II $\lambda4686$ and He I $\lambda5876$ with respect to the varying AGN continuum. Based on the broad H$β~\lambda4861$ line, we measured black hole (BH) mass of $M_{\bullet}=5.13^{+1.57}_{-1.55}\times10^{7}M_{\odot}$, estimated accretion rates of ${\dot{M}_{\bullet}}=(0.05\pm0.02)~L_{\rm Edd}~c^{-2}$, indicating that Mrk~79 is a sub-Eddington accretor. We found that Mrk~79 deviates from the canonical Radius$-$Luminosity relationship. The marginal blueshift of the broad He II $\lambda4686$ line detected from rms spectrum indicates outflow of high-ionization gas. The velocity-resolved lag profiles of the broad H$γ~\lambda4340$, H$β~\lambda4861$, and He I $\lambda5876$ lines show similar signatures that the largest lag occurs in the red wing of the lines then the lag decreases to both sides. These signatures should suggest that the BLR of Keplerian motion probably exists the outflow gas motion. All findings including UFOs, warm absorbers, and the kinematics of high- and low-ionization BLR, may provide an indirect evidence that the BLR of Mrk~79 probably originates from disk wind.

astro-ph.GA↗

Mobility-aware Content Preference Learning in Decentralized Caching Networks

Due to the drastic increase of mobile traffic, wireless caching is proposed to serve repeated requests for content download. To determine the caching scheme for decentralized caching networks, the content preference learning problem based on mobility prediction is studied. We first formulate preference prediction as a decentralized regularized multi-task learning (DRMTL) problem without considering the mobility of mobile terminals (MTs). The problem is solved by a hybrid Jacobian and Gauss-Seidel proximal multi-block alternating direction method (ADMM) based algorithm, which is proven to conditionally converge to the optimal solution with a rate $O(1/k)$. Then we use the tool of \textit{Markov renewal process} to predict the moving path and sojourn time for MTs, and integrate the mobility pattern with the DRMTL model by reweighting the training samples and introducing a transfer penalty in the objective. We solve the problem and prove that the developed algorithm has the same convergence property but with different conditions. Through simulation we show the convergence analysis on proposed algorithms. Our real trace driven experiments illustrate that the mobility-aware DRMTL model can provide a more accurate prediction on geography preference than DRMTL model. Besides, the hit ratio achieved by most popular proactive caching (MPC) policy with preference predicted by mobility-aware DRMTL outperforms the MPC with preference from DRMTL and random caching (RC) schemes.

cs.LG↗

Bergman-Einstein metrics, hyperbolic metrics and Stein spaces with spherical boundaries

In this new version, we give an affirmative solution to a conjecture of Cheng proposed in 1979 which asserts that the Bergman metric of a smoothly bounded strongly pseudoconvex domain in $\mathbb{C}^n, n\geq 2,$ is Kähler-Einstein if and only if the domain is biholomorphic to the ball. We establish versions of various classical theorems that are used in the solution for Stein spaces. Among other things, we construct a hyperbolic metric over a Stein space with spherical boundary. We also prove the Q. K. Lu type uniformization theorem for Stein spaces with isolated normal singularities.

math.CV↗

Supermassive black holes with high accretion rates in active galactic nuclei: X. Optical variability characteristics

We compiled a sample of 73 active galactic nuclei (AGNs) with reverberation mapping (RM) observations from RM campaigns including our ongoing campaign of monitoring super-Eddington accreting massive black holes (SEAMBHs). This sample covers a large range of black hole (BH) mass $(M_{\bullet}=10^{6-9}~M_\odot)$, dimensionless accretion rates $(\dot{\mathscr{M}}=10^{-2.7}-10^{2.7})$ and 5100~Å~luminosity $(L_{5100}=10^{42-46}~\rm erg~s^{-1})$, allowing us to systematically study the AGN variability and their relations with BH mass, accretion rates, and optical luminosity. We employed the damped random walk (DRW) model to delineate the optical variability of continuum at 5100~Å~and obtained damped variability timescale ($τ_{\rm d}$) and amplitude ($σ_{\rm d}$) using a Markov Chain Monte Carlo (MCMC) method. We also estimated the traditional variability amplitudes ($F_{\rm var}$), which provide a model-independent measure and therefore are used to test the DRW results. We found that AGN variability characteristics are generally correlated with $(M_{\bullet},\dot{\mathscr{M}},L_{5100})$. These correlations are smooth from sub-Eddington to super-Eddington accretion AGNs, probably implying that the AGN variability may be caused by the same physical mechanism.

astro-ph.GA↗

Semiconductor Quantum Computation

Semiconductors, a significant type of material in the information era, are becoming more and more powerful in the field of quantum information. In the last decades, semiconductor quantum computation was investigated thoroughly across the world and developed with a dramatically fast speed. The researches vary from initialization, control and readout of qubits, to the architecture of fault tolerant quantum computing. Here, we first introduce the basic ideas for quantum computing, and then discuss the developments of single- and two- qubit gate control in semiconductor. Till now, the qubit initialization, control and readout can be realized with relatively high fidelity and a programmable two-qubit quantum processor was even demonstrated. However, to further improve the qubit quality and scale it up, there are still some challenges to resolve such as the improvement of readout method, material development and scalable designs. We discuss these issues and introduce the forefronts of progress. Finally, considering the positive trend of the research on semiconductor quantum devices and recent theoretical work on the applications of quantum computation, we anticipate that semiconductor quantum computation may develop fast and will have a huge impact on our lives in the near future.

cond-mat.mes-hall↗

Decentralized Multi-Task Learning Based on Extreme Learning Machines

In multi-task learning (MTL), related tasks learn jointly to improve generalization performance. To exploit the high learning speed of extreme learning machines (ELMs), we apply the ELM framework to the MTL problem, where the output weights of ELMs for all the tasks are learned collaboratively. We first present the ELM based MTL problem in the centralized setting, which is solved by the proposed MTL-ELM algorithm. Due to the fact that many data sets of different tasks are geo-distributed, decentralized machine learning is studied. We formulate the decentralized MTL problem based on ELM as majorized multi-block optimization with coupled bi-convex objective functions. To solve the problem, we propose the DMTL-ELM algorithm, which is a hybrid Jacobian and Gauss-Seidel Proximal multi-block alternating direction method of multipliers (ADMM). Further, to reduce the computation load of DMTL-ELM, DMTL-ELM with first-order approximation (FO-DMTL-ELM) is presented. Theoretical analysis shows that the convergence to the stationary point of DMTL-ELM and FO-DMTL-ELM can be guaranteed conditionally. Through simulations, we demonstrate the convergence of proposed MTL-ELM, DMTL-ELM, and FO-DMTL-ELM algorithms, and also show that they can outperform existing MTL methods. Moreover, by adjusting the dimension of hidden feature space, there exists a trade-off between communication load and learning accuracy for DMTL-ELM.

cs.LG↗

Kinematics of the Broad-line Region of 3C 273 from a Ten-year Reverberation Mapping Campaign

Despite many decades of study, the kinematics of the broad-line region of 3C~273 are still poorly understood. We report a new, high signal-to-noise, reverberation mapping campaign carried out from November 2008 to March 2018 that allows the determination of time lags between emission lines and the variable continuum with high precision. The time lag of variations in H$β$ relative to those of the 5100 Angstrom continuum is $146.8_{-12.1}^{+8.3}$ days in the rest frame, which agrees very well with the Paschen-$α$ region measured by the GRAVITY at The Very Large Telescope Interferometer. The time lag of the H$γ$ emission line is found to be nearly the same as for H$β$. The lag of the Fe II emission is $322.0_{-57.9}^{+55.5}$ days, longer by a factor of $\sim$2 than that of the Balmer lines. The velocity-resolved lag measurements of the H$β$ line show a complex structure which can be possibly explained by a rotation-dominated disk with some inflowing radial velocity in the H$β$-emitting region. Taking the virial factor of $f_{\rm BLR} = 1.3$, we derive a BH mass of $M_{\bullet} = 4.1_{-0.4}^{+0.3} \times 10^8 M_{\odot}$ and an accretion rate of $9.3\,L_{\rm Edd}\,c^{-2}$ from the H$β$ line. The decomposition of its $HST$ images yields a host stellar mass of $M_* = 10^{11.3 \pm 0.7} M_\odot$, and a ratio of $M_{\bullet}/M_*\approx 2.0\times 10^{-3}$ in agreement with the Magorrian relation. In the near future, it is expected to compare the geometrically-thick BLR discovered by the GRAVITY in 3C 273 with its spatially-resolved torus in order to understand the potential connection between the BLR and the torus.

astro-ph.GA↗

Decentralized Caching Schemes and Performance Limits in Two-layer Networks

We study the decentralized caching scheme in a two-layer network, which includes a sever, multiple helpers, and multiple users. Basically, the proposed caching scheme consists of two phases, i.e, placement phase and delivery phase. In the placement phase, each helper/user randomly and independently selects contents from the server and stores them into its memory. In the delivery phase, the users request contents from the server, and the server satisfies each user through a helper. Different from the existing caching scheme, the proposed caching scheme takes into account the pre-stored contents at both helpers and users in the placement phase to design the delivery phase. Meanwhile, the proposed caching scheme exploits index coding in the delivery phase and leverages multicast opportunities, even when different users request distinct contents. Besides, we analytically characterize the performance limit of the proposed caching scheme, and show that the achievable rate region of the proposed caching scheme lies within constant margins to the information-theoretic optimum. In particular, the multiplicative and additive factors are carefully sharpened to be $\frac{1}{48}$ and $4$ respectively, both of which are better than the state of arts. Finally, simulation results demonstrate the advantage of the proposed caching scheme compared with the state of arts.

cs.IT↗

Spectrum Sharing for Internet of Things: A Survey

The Internet of Things (IoT) is a promising paradigm to accommodate massive device connections in 5G and beyond. To pave the way for future IoT, the spectrum should be planed in advance. Spectrum sharing is a preferable solution for IoT due to the scarcity of available spectrum resource. In particular, mobile operators are inclined to exploit the existing standards and infrastructures of current cellular networks and deploy IoT within licensed cellular spectrum. Yet, proprietary companies prefer to deploy IoT within unlicensed spectrum to avoid any licence fee. In this paper, we provide a survey on prevalent IoT technologies deployed within licensed cellular spectrum and unlicensed spectrum. Notably, emphasis will be on the spectrum sharing solutions including the shared spectrum, interference model, and interference management. To this end, we discuss both advantages and disadvantages of different IoT technologies. Finally, we identify challenges for future IoT and suggest potential research directions.

cs.IT↗

Beam Management for Millimeter Wave Beamspace MU-MIMO Systems

Millimeter wave (mmWave) communication has attracted increasing attention as a promising technology for 5G networks. One of the key architectural features of mmWave is the use of massive antenna arrays at both the transmitter and the receiver sides. Therefore, by employing directional beamforming (BF), both mmWave base stations (MBSs) and mmWave users (MUEs) are capable of supporting multi-beam simultaneous transmissions. However, most researches have only considered a single beam, which means that they do not make full potential of mmWave. In this context, in order to improve the performance of short-range indoor mmWave networks with multiple reflections, we investigate the challenges and potential solutions of downlink multi-user multi-beam transmission, which can be described as a high-dimensional (i.e., beamspace) multi-user multiple-input multiple-output (MU-MIMO) technique, including multi-user BF training, simultaneous users' grouping, and multi-user multibeam power allocation. Furthermore, we present the theoretical and numerical results to demonstrate that beamspace MU-MIMO compared with single beam transmission can largely improve the rate performance of mmWave systems.

cs.NI↗

A High-Quality velocity-delay map of the broad-line region in NGC 5548

NGC 5548 has been well spectroscopically monitored for reverberation mapping of the central kinematics by 19 campaigns. Using the maximum entropy method in this Letter, we build up a high-quality velocity-delay map of the H$β$ emission line in the light curves of the continuum and the line variations observed between 2015-2016. The map shows the response strength and lags of the velocity fields of the H$β$ emitting regions. The velocity-delay structure of the map is generally symmetric, with strong red and blue wings at time lag $τ\leq 15$ days, a narrower velocity distribution at $τ\geq 15$ days, and a deficit of response in the core. This is suggestive of a disk geometry of the broad-line region (BLR). The relatively weaker H$β$ response at the longer lags in the red side indicates anisotropic emission from the outer part of the BLR. We also recover the velocity-delay maps of NGC 5548 from the historical data of 13 years to investigate the long-term variability of its BLR. In general, the BLR of NGC 5548 was switching between the inflow and virialized phases in the past years. The resultant maps of seven years reveal inflow signatures and show decreasing lags, indicating that the changes in the BLR size are related to the infalling BLR gas. The other four maps show potential disk signatures which are similar to our map.

astro-ph.GA↗

Supermassive black holes with high accretion rates in active galactic nuclei. VII. Reconstruction of velocity-delay maps by maximum entropy method

As one of the series of papers reporting on a large reverberation mapping campaign, we apply the maximum entropy method (MEM) to 9 narrow-line Seyfert 1 galaxies with super-Eddington accretion rates observed during 2012-2013 for the velocity-delay maps of their Hβ and Hγ emission lines. The maps of 6 objects are reliably reconstructed using MEM. The maps of Hβ and Hγ emission lines of Mrk 335 indicate that the gas of its broad-line region (BLR) is infalling. For Mrk 142, its Hβ and Hγ lines show signatures of outflow. The Hβ and Hγ maps of Mrk 1044 demonstrate complex kinematics -- a virialized motion accompanied by an outflow signature, and the Hβ map of IRAS F12397+3333 is consistent with a disk or a spherical shell. The Hβ maps of Mrk 486 and MCG +06-26-012 suggest the presence of an inflow and outflow, respectively. These super-Eddington accretors show diverse geometry and kinematics. Brief discussions of their BLRs are provided for each individual object.

astro-ph.GA↗

Traffic Allocation for Low-Latency Multi-Hop Networks with Buffers

For millimeter-wave (mm-wave) buffer-aided tandem networks consisting of relay nodes and multiple channels per hop, we consider two traffic allocation schemes, namely local allocation and global allocation, and investigate the end-to-end latency of a file transfer. We formulate the problem for generic multi-hop queuing systems and subsequently derive closed-form expressions of the end-to-end latency. We quantify the advantages of the global allocation scheme relative to its local allocation counterpart, and we conduct an asymptotic analysis on the performance gain when the number of channels in each hop increases to infinity. The traffic allocations and the analytical delay performance are validated through simulations. Furthermore, taking a specific two-hop mm-wave network as an example, we derive lower bounds on the average end-to-end latency, where Nakagami-$m$ fading is considered. Numerical results demonstrate that, compared to the local allocation scheme, the advantage of global allocation grows as the number of relay nodes increases, at the expense of higher complexity that linearly increases with the number of relay nodes. It is also demonstrated that a proper deployment of relay nodes in a linear mm-wave network plays an important role in reducing the average end-to-end latency, and the average latency decays as the mm-wave channels become more deterministic. These findings provide insights for designing multi-hop mm-wave networks with low end-to-end latency.

cs.NI↗

Low-Latency Millimeter-Wave Communications: Traffic Dispersion or Network Densification?

This paper investigates two strategies to reduce the communication delay in future wireless networks: traffic dispersion and network densification. A hybrid scheme that combines these two strategies is also considered. The probabilistic delay and effective capacity are used to evaluate performance. For probabilistic delay, the violation probability of delay, i.e., the probability that the delay exceeds a given tolerance level, is characterized in terms of upper bounds, which are derived by applying stochastic network calculus theory. In addition, to characterize the maximum affordable arrival traffic for mmWave systems, the effective capacity, i.e., the service capability with a given quality-of-service (QoS) requirement, is studied. The derived bounds on the probabilistic delay and effective capacity are validated through simulations. These numerical results show that, for a given average system gain, traffic dispersion, network densification, and the hybrid scheme exhibit different potentials to reduce the end-to-end communication delay. For instance, traffic dispersion outperforms network densification, given high average system gain and arrival rate, while it could be the worst option, otherwise. Furthermore, it is revealed that, increasing the number of independent paths and/or relay density is always beneficial, while the performance gain is related to the arrival rate and average system gain, jointly. Therefore, a proper transmission scheme should be selected to optimize the delay performance, according to the given conditions on arrival traffic and system service capability.

cs.NI↗