arXiv subjects

Xu Chen

Publications and source records attributed to Xu Chen.

At least 433 records · Page 24Linked to original sources

arXiv2021

Gamma-ray Observation of the Cygnus Region in the 100 TeV Energy Region

We report observations of gamma-ray emissions with energies in the 100 TeV energy region from the Cygnus region in our Galaxy. Two sources are significantly detected in the directions of the Cygnus OB1 and OB2 associations. Based on their positional coincidences, we associate one with a pulsar PSR J2032+4127 and the other mainly with a pulsar wind nebula PWN G75.2+0.1 with the pulsar moving away from its original birthplace situated around the centroid of the observed gamma-ray emission. This work would stimulate further studies of particle acceleration mechanisms at these gamma-ray sources.

astro-ph.HE↗

arXiv2021

HifiFace: 3D Shape and Semantic Prior Guided High Fidelity Face Swapping

In this work, we propose a high fidelity face swapping method, called HifiFace, which can well preserve the face shape of the source face and generate photo-realistic results. Unlike other existing face swapping works that only use face recognition model to keep the identity similarity, we propose 3D shape-aware identity to control the face shape with the geometric supervision from 3DMM and 3D face reconstruction method. Meanwhile, we introduce the Semantic Facial Fusion module to optimize the combination of encoder and decoder features and make adaptive blending, which makes the results more photo-realistic. Extensive experiments on faces in the wild demonstrate that our method can preserve better identity, especially on the face shape, and can generate more photo-realistic results than previous state-of-the-art methods.

cs.CV↗

arXiv2021

TabularNet: A Neural Network Architecture for Understanding Semantic Structures of Tabular Data

Tabular data are ubiquitous for the widespread applications of tables and hence have attracted the attention of researchers to extract underlying information. One of the critical problems in mining tabular data is how to understand their inherent semantic structures automatically. Existing studies typically adopt Convolutional Neural Network (CNN) to model the spatial information of tabular structures yet ignore more diverse relational information between cells, such as the hierarchical and paratactic relationships. To simultaneously extract spatial and relational information from tables, we propose a novel neural network architecture, TabularNet. The spatial encoder of TabularNet utilizes the row/column-level Pooling and the Bidirectional Gated Recurrent Unit (Bi-GRU) to capture statistical information and local positional correlation, respectively. For relational information, we design a new graph construction method based on the WordNet tree and adopt a Graph Convolutional Network (GCN) based encoder that focuses on the hierarchical and paratactic relationships between cells. Our neural network architecture can be a unified neural backbone for different understanding tasks and utilized in a multitask scenario. We conduct extensive experiments on three classification tasks with two real-world spreadsheet data sets, and the results demonstrate the effectiveness of our proposed TabularNet over state-of-the-art baselines.

cs.LG↗

arXiv2021

Dynamic driving and routing games for autonomous vehicles on networks: A mean field game approach

This paper aims to answer the research question as to optimal design of decision-making processes for autonomous vehicles (AVs), including dynamical selection of driving velocity and route choices on a transportation network. Dynamic traffic assignment (DTA) has been widely used to model travelers's route choice or/and departure-time choice and predict dynamic traffic flow evolution in the short term. However, the existing DTA models do not explicitly describe one's selection of driving velocity on a road link. Driving velocity choice may not be crucial for modeling the movement of human drivers but it is a must-have control to maneuver AVs. In this paper, we aim to develop a game-theoretic model to solve for AVs's optimal driving strategies of velocity control in the interior of a road link and route choice at a junction node. To this end, we will first reinterpret the DTA problem as an N-car differential game and show that this game can be tackled with a general mean field game-theoretic framework. The developed mean field game is challenging to solve because of the forward and backward structure for velocity control and the complementarity conditions for route choice. An efficient algorithm is developed to address these challenges. The model and the algorithm are illustrated on the Braess network and the OW network with a single destination. On the Braess network, we first compare the LWR based DTA model with the proposed game and find that the driving and routing control navigates AVs with overall lower costs. We then compare the total travel cost without and with the middle link and find that the Braess paradox may still arise under certain conditions. We also test our proposed model and solution algorithm on the OW network.

math.OC↗

arXiv2021

A Game-Theoretic Approach to Multi-Agent Trust Region Optimization

Trust region methods are widely applied in single-agent reinforcement learning problems due to their monotonic performance-improvement guarantee at every iteration. Nonetheless, when applied in multi-agent settings, the guarantee of trust region methods no longer holds because an agent's payoff is also affected by other agents' adaptive behaviors. To tackle this problem, we conduct a game-theoretical analysis in the policy space, and propose a multi-agent trust region learning method (MATRL), which enables trust region optimization for multi-agent learning. Specifically, MATRL finds a stable improvement direction that is guided by the solution concept of Nash equilibrium at the meta-game level. We derive the monotonic improvement guarantee in multi-agent settings and empirically show the local convergence of MATRL to stable fixed points in the two-player rotational differential game. To test our method, we evaluate MATRL in both discrete and continuous multiplayer general-sum games including checker and switch grid worlds, multi-agent MuJoCo, and Atari games. Results suggest that MATRL significantly outperforms strong multi-agent reinforcement learning baselines.

cs.MA↗

arXiv2021

TrafficStream: A Streaming Traffic Flow Forecasting Framework Based on Graph Neural Networks and Continual Learning

With the rapid growth of traffic sensors deployed, a massive amount of traffic flow data are collected, revealing the long-term evolution of traffic flows and the gradual expansion of traffic networks. How to accurately forecasting these traffic flow attracts the attention of researchers as it is of great significance for improving the efficiency of transportation systems. However, existing methods mainly focus on the spatial-temporal correlation of static networks, leaving the problem of efficiently learning models on networks with expansion and evolving patterns less studied. To tackle this problem, we propose a Streaming Traffic Flow Forecasting Framework, TrafficStream, based on Graph Neural Networks (GNNs) and Continual Learning (CL), achieving accurate predictions and high efficiency. Firstly, we design a traffic pattern fusion method, cleverly integrating the new patterns that emerged during the long-term period into the model. A JS-divergence-based algorithm is proposed to mine new traffic patterns. Secondly, we introduce CL to consolidate the knowledge learned previously and transfer them to the current model. Specifically, we adopt two strategies: historical data replay and parameter smoothing. We construct a streaming traffic dataset to verify the efficiency and effectiveness of our model. Extensive experiments demonstrate its excellent potential to extract traffic patterns with high efficiency on long-term streaming network scene. The source code is available at https://github.com/AprLie/TrafficStream.

cs.LG↗

arXiv2021

Photometric study and absolute parameters estimation of six totally eclipsing contact binaries

High precision CCD observations of six totally eclipsing contact binaries were presented and analyzed. It is found that only one target is an A-type contact binary (V429 Cam), while the others are W-type contact ones. By analyzing the times of light minima, we discovered that two of them exhibit secular period increase while three manifest long-term period decrease. For V1033 Her, a cyclic variation superimposed on the long-term increase was discovered. By comparing the Gaia distances with those calculated by the absolute parameters of 173 contact binaries, we found that Gaia distance can be applied to estimate absolute parameters for most contact binaries. The absolute parameters of our six targets were estimated by using their Gaia distances. The evolutionary status of contact binaries was studied, we found that the A- and W- subtype contact binaries may have different formation channels. The relationship between the spectroscopic and photometric mass ratios for 101 contact binaries was presented. It is discovered that the photometric mass ratios are in good agreement with the spectroscopic ones for almost all the totally eclipsing systems, which is corresponding to the results derived by Pribulla et al. and Terrell & Wilson.

astro-ph.SR↗

arXiv2021

Simulating Photometric Images of Moving Targets with Photon-mapping

We present a novel, easy-to-use method based on the photon-mapping technique to simulate photometric images of moving targets. Realistic images can be created in two passes: photon tracing and image rendering. The nature of light sources, tracking mode of the telescope, point spread function (PSF), and specifications of the CCD are taken into account in the imaging process. Photometric images in a variety of observation scenarios can be generated flexibly. We compared the simulated images with the observed ones. The residuals between them are negligible, and the correlation coefficients between them are high, with a median of $0.9379_{-0.0201}^{+0.0125}$ for 1020 pairs of images, which means a high fidelity and similarity. The method is versatile and can be used to plan future photometry of moving targets, interpret existing observations, and provide test images for image processing algorithms.

astro-ph.IM↗

arXiv2021

First Detection of sub-PeV Diffuse Gamma Rays from the Galactic Disk: Evidence for Ubiquitous Galactic Cosmic Rays beyond PeV Energies

We report, for the first time, the long-awaited detection of diffuse gamma rays with energies between 100 TeV and 1 PeV in the Galactic disk. Particularly, all gamma rays above 398 TeV are observed apart from known TeV gamma-ray sources and compatible with expectations from the hadronic emission scenario in which gamma rays originate from the decay of $π^0$'s produced through the interaction of protons with the interstellar medium in the Galaxy. This is strong evidence that cosmic rays are accelerated beyond PeV energies in our Galaxy and spread over the Galactic disk.

astro-ph.HE↗

arXiv2021

Generating Multi-scale Maps from Remote Sensing Images via Series Generative Adversarial Networks

Considering the success of generative adversarial networks (GANs) for image-to-image translation, researchers have attempted to translate remote sensing images (RSIs) to maps (rs2map) through GAN for cartography. However, these studies involved limited scales, which hinders multi-scale map creation. By extending their method, multi-scale RSIs can be trivially translated to multi-scale maps (multi-scale rs2map translation) through scale-wise rs2map models trained for certain scales (parallel strategy). However, this strategy has two theoretical limitations. First, inconsistency between various spatial resolutions of multi-scale RSIs and object generalization on multi-scale maps (RS-m inconsistency) increasingly complicate the extraction of geographical information from RSIs for rs2map models with decreasing scale. Second, as rs2map translation is cross-domain, generators incur high computation costs to transform the RSI pixel distribution to that on maps. Thus, we designed a series strategy of generators for multi-scale rs2map translation to address these limitations. In this strategy, high-resolution RSIs are inputted to an rs2map model to output large-scale maps, which are translated to multi-scale maps through series multi-scale map translation models. The series strategy avoids RS-m inconsistency as inputs are high-resolution large-scale RSIs, and reduces the distribution gap in multi-scale map generation through similar pixel distributions among multi-scale maps. Our experimental results showed better quality multi-scale map generation with the series strategy, as shown by average increases of 11.69%, 53.78%, 55.42%, and 72.34% in the structural similarity index, edge structural similarity index, intersection over union (road), and intersection over union (water) for data from Mexico City and Tokyo at zoom level 17-13.

cs.CV↗

arXiv2021

A Game Generative Network Framework with its Application to Relationship Inference

A game process is a system where the decisions of one agent can influence the decisions of other agents. In the real world, social influences and relationships between agents may influence the decision makings of agents with game behaviors. And in turn, this also gives us the opportunity to mine such information from agents by the observed interactions of them in a game process. In this paper, we propose a Game Generative Network (GGN) framework that utilizes the deviation between the real game outcome and the ideal game model to generate networks for game processes, which opens a door for understanding agents with game behaviors by network mining approaches. We illustrate how to apply GGNs to infer the hidden relationships between agents with game behaviors and conduct experiments on team games as a concrete example. Experimental results demonstrate that our proposed framework can reveal the hidden relationships of agents in such games.

cs.SI↗

arXiv2021

Highly-robust reentrant superconductivity in CsV3Sb5 under pressure

Here we present the superconducting property and structural stability of kagome CsV3Sb5 under in-situ high pressures. For the initial SC-I phase, its Tc is quickly enhanced from 3.5 K to 7.6 K and then totally suppressed at P~10 GPa. Further increasing the applied pressures, an SC-II phase emerges at P~15 GPa and persists up to 100 GPa. The Tc rapidly increases to the maximal value of 5.2 K at P=53.6 GPa and rather slowly decreases to 4.7 K at P=100 GPa. A two-dome-like variation of Tc in CsV3Sb5 is concluded here. The Raman measurements demonstrate that weakening of E2g model and strengthening of A1g model occur without phase transition as entering the SC-II phase, which is supported by the results of phonon spectra calculations. Electronic structure calculations reveal that exertion of pressure may bridge the gap of topological surface nontrivial states near EF, i. e. Z2 invariant. Meanwhile, it enlarges Fermi surface significantly, consistent with the increased carrier density. The findings here point out the change of electronic structure and strengthened electron-phonon coupling should be responsible for the pressure-induced reentrant SC.

cond-mat.supr-con↗

arXiv2021

Point absorbers in Advanced LIGO

Small, highly absorbing points are randomly present on the surfaces of the main interferometer optics in Advanced LIGO. The resulting nano-meter scale thermo-elastic deformations and substrate lenses from these micron-scale absorbers significantly reduces the sensitivity of the interferometer directly though a reduction in the power-recycling gain and indirect interactions with the feedback control system. We review the expected surface deformation from point absorbers and provide a pedagogical description of the impact on power build-up in second generation gravitational wave detectors (dual-recycled Fabry-Perot Michelson interferometers). This analysis predicts that the power-dependent reduction in interferometer performance will significantly degrade maximum stored power by up to 50% and hence, limit GW sensitivity, but suggests system wide corrections that can be implemented in current and future GW detectors. This is particularly pressing given that future GW detectors call for an order of magnitude more stored power than currently used in Advanced LIGO in Observing Run 3. We briefly review strategies to mitigate the effects of point absorbers in current and future GW wave detectors to maximize the success of these enterprises.

physics.ins-det↗

arXiv2021

Joint Radar and Communication: A Survey

Joint radar and communication (JRC) technology has become important for civil and military applications for decades. This paper introduces the concepts, characteristics and advantages of JRC technology, presenting the typical applications that have benefited from JRC technology currently and in the future. This paper explores the state-of-the-art of JRC in the levels of coexistence, cooperation, co-design and collaboration. Compared to previous surveys, this paper reviews the entire trends that drive the development of radar sensing and wireless communication using JRC. Specifically, we explore an open research issue on radar and communication operating with mutual benefits based on collaboration, which represents the fourth stage of JRC evolution. This paper provides useful perspectives for future researches of JRC technology.

cs.IT↗

arXiv2021

Learning Post-Hoc Causal Explanations for Recommendation

State-of-the-art recommender systems have the ability to generate high-quality recommendations, but usually cannot provide intuitive explanations to humans due to the usage of black-box prediction models. The lack of transparency has highlighted the critical importance of improving the explainability of recommender systems. In this paper, we propose to extract causal rules from the user interaction history as post-hoc explanations for the black-box sequential recommendation mechanisms, whilst maintain the predictive accuracy of the recommendation model. Our approach firstly achieves counterfactual examples with the aid of a perturbation model, and then extracts personalized causal relationships for the recommendation model through a causal rule mining algorithm. Experiments are conducted on several state-of-the-art sequential recommendation models and real-world datasets to verify the performance of our model on generating causal explanations. Meanwhile, We evaluate the discovered causal explanations in terms of quality and fidelity, which show that compared with conventional association rules, causal rules can provide personalized and more effective explanations for the behavior of black-box recommendation models.

cs.IR↗

arXiv2021

Deep Reinforcement Learning with Spatio-temporal Traffic Forecasting for Data-Driven Base Station Sleep Control

To meet the ever increasing mobile traffic demand in 5G era, base stations (BSs) have been densely deployed in radio access networks (RANs) to increase the network coverage and capacity. However, as the high density of BSs is designed to accommodate peak traffic, it would consume an unnecessarily large amount of energy if BSs are on during off-peak time. To save the energy consumption of cellular networks, an effective way is to deactivate some idle base stations that do not serve any traffic demand. In this paper, we develop a traffic-aware dynamic BS sleep control framework, named DeepBSC, which presents a novel data-driven learning approach to determine the BS active/sleep modes while meeting lower energy consumption and satisfactory Quality of Service (QoS) requirements. Specifically, the traffic demands are predicted by the proposed GS-STN model, which leverages the geographical and semantic spatial-temporal correlations of mobile traffic. With accurate mobile traffic forecasting, the BS sleep control problem is cast as a Markov Decision Process that is solved by Actor-Critic reinforcement learning methods. To reduce the variance of cost estimation in the dynamic environment, we propose a benchmark transformation method that provides robust performance indicator for policy update. To expedite the training process, we adopt a Deep Deterministic Policy Gradient (DDPG) approach, together with an explorer network, which can strengthen the exploration further. Extensive experiments with a real-world dataset corroborate that our proposed framework significantly outperforms the existing methods.

cs.NI↗

arXiv2021

Visually-aware Recommendation with Aesthetic Features

Visual information plays a critical role in human decision-making process. While recent developments on visually-aware recommender systems have taken the product image into account, none of them has considered the aesthetic aspect. We argue that the aesthetic factor is very important in modeling and predicting users' preferences, especially for some fashion-related domains like clothing and jewelry. This work addresses the need of modeling aesthetic information in visually-aware recommender systems. Technically speaking, we make three key contributions in leveraging deep aesthetic features: (1) To describe the aesthetics of products, we introduce the aesthetic features extracted from product images by a deep aesthetic network. We incorporate these features into recommender system to model users' preferences in the aesthetic aspect. (2) Since in clothing recommendation, time is very important for users to make decision, we design a new tensor decomposition model for implicit feedback data. The aesthetic features are then injected to the basic tensor model to capture the temporal dynamics of aesthetic preferences (e.g., seasonal patterns). (3) We also use the aesthetic features to optimize the learning strategy on implicit feedback data. We enrich the pairwise training samples by considering the similarity among items in the visual space and graph space; the key idea is that a user may likely have similar perception on similar items. We perform extensive experiments on several real-world datasets and demonstrate the usefulness of aesthetic features and the effectiveness of our proposed methods.

cs.IR↗

arXiv2021

EC-SAGINs: Edge Computing-enhanced Space-Air-Ground Integrated Networks for Internet of Vehicles

Edge computing-enhanced Internet of Vehicles (EC-IoV) enables ubiquitous data processing and content sharing among vehicles and terrestrial edge computing (TEC) infrastructures (e.g., 5G base stations and roadside units) with little or no human intervention, plays a key role in the intelligent transportation systems. However, EC-IoV is heavily dependent on the connections and interactions between vehicles and TEC infrastructures, thus will break down in some remote areas where TEC infrastructures are unavailable (e.g., desert, isolated islands and disaster-stricken areas). Driven by the ubiquitous connections and global-area coverage, space-air-ground integrated networks (SAGINs) efficiently support seamless coverage and efficient resource management, represent the next frontier for edge computing. In light of this, we first review the state-of-the-art edge computing research for SAGINs in this article. After discussing several existing orbital and aerial edge computing architectures, we propose a framework of edge computing-enabled space-air-ground integrated networks (EC-SAGINs) to support various IoV services for the vehicles in remote areas. The main objective of the framework is to minimize the task completion time and satellite resource usage. To this end, a pre-classification scheme is presented to reduce the size of action space, and a deep imitation learning (DIL) driven offloading and caching algorithm is proposed to achieve real-time decision making. Simulation results show the effectiveness of our proposed scheme. At last, we also discuss some technology challenges and future directions.

cs.NI↗