Searcharxiv⌕ Search

arXiv subjects

Chen Wang

Publications and source records attributed to Chen Wang.

At least 595 records · Page 33Linked to original sources

Spatial-temporal Conv-sequence Learning with Accident Encoding for Traffic Flow Prediction

In an intelligent transportation system, the key problem of traffic forecasting is how to extract periodic temporal dependencies and complex spatial correlations. Current state-of-the-art methods for predicting traffic flow are based on graph architectures and sequence learning models, but they do not fully exploit dynamic spatial-temporal information in the traffic system. Specifically, the temporal dependencies in the short-range are diluted by recurrent neural networks. Moreover, local spatial information is also ignored by existing sequence models, because their convolution operation uses global average pooling. Besides, accidents may occur during object transition, which will cause congestion in the real world and further decrease prediction accuracy. To overcome these challenges, we propose Spatial-Temporal Conv-sequence Learning (STCL), where a focused temporal block uses unidirectional convolution to capture short-term periodic temporal dependencies effectively, and a patial-temporal fusion module is responsible for extracting dependencies of interactions and decreasing the feature dimensions. Moreover, as the accidents features have an impact on local traffic congestion, we employ position encoding to detect anomalies in complex traffic situations. We have conducted a large number of experiments on real-world tasks and verified the effectiveness of our proposed method.

cs.LG↗

Identifying Oscillations Injected by Inverter-Based Solar Energy Sources

Inverter-based solar energy sources are becoming widely integrated into modern power systems. However, their impacts on the system in the frequency domain are rarely investigated at a higher frequency range than conventional electromechanical oscillations. This paper presents evidence of the emergence of an oscillation mode injected by inverter-based solar energy sources in Dominion Energy's service territory. This new mode was recognized from the analysis of real-world ambient synchrophasor and point-of-wave data. The analysis was performed by developing customized synchrophasor analysis tools deployed on the PredictiveGrid^{TM} platform implemented at Dominion Energy. Herein, we describe and illustrate the preliminary analysis results acquired from spectrogram observations, power spectral density plots, and mode shape estimation. The emergence and propagation of this new mode in Dominion Energy's footprint is illustrated using a heatmap based on a proposed frequency component energy metric, which helps to assess this oscillation's spread and impact.

eess.SP↗

SADN: Learned Light Field Image Compression with Spatial-Angular Decorrelation

Light field image becomes one of the most promising media types for immersive video applications. In this paper, we propose a novel end-to-end spatial-angular-decorrelated network (SADN) for high-efficiency light field image compression. Different from the existing methods that exploit either spatial or angular consistency in the light field image, SADN decouples the angular and spatial information by dilation convolution and stride convolution in spatial-angular interaction, and performs feature fusion to compress spatial and angular information jointly. To train a stable and robust algorithm, a large-scale dataset consisting of 7549 light field images is proposed and built. The proposed method provides 2.137 times and 2.849 times higher compression efficiency relative to H.266/VVC and H.265/HEVC inter coding, respectively. It also outperforms the end-to-end image compression networks by an average of 79.6% bitrate saving with much higher subjective quality and light field consistency.

eess.IV↗

Critical-layer instability of shallow water magnetohydrodynamic shear flows

In this paper, the instability of shallow water shear flow with a sheared parallel magnetic field is studied. Waves propagating in such magnetic shear flows encounter critical levels where the phase velocity relative to the basic flow $c-U(y)$ matches the Alfvén wave velocities $\pm B(y)/\sqrt{μρ}$, based on the local magnetic field $B(y)$, the magnetic permeability $μ$ and the mass density of the fluid $ρ$. It is shown that when the two critical levels are close to each other, the critical layer can generate an instability. The instability problem is solved, combining asymptotic solutions at large wavenumbers and numerical solutions, and the mechanism of instability explained using the conservation of momentum. For the shallow water MHD system, the paper gives the general form of the local differential equation governing such coalescing critical layers for any generic field and flow profiles, and determines precisely how the magnetic field modifies the purely hydrodynamic stability criterion based on the potential vorticity gradient in the critical layer. The curvature of the magnetic field profile, or equivalently the electric current gradient, $J' = - B''/μ$ in the critical layer is found to play a complementary role in the instability.

physics.flu-dyn↗

Stellar mergers as the origin of the blue main-sequence band in young star clusters

Recent high-quality Hubble Space Telescope (HST) photometry shows that the main sequences (MS) stars of young star clusters form two discrete components in the color-magnitude diagram (CMD). Based on their distribution in the CMD, we show that stars of the blue MS component can be understood as slow rotators originating from stellar mergers. We derive the masses of the blue MS stars, and find that they follow a nearly flat mass function, which supports their unusual formation path. Our results imply that the cluster stars gain their mass in two different ways, by disk accretion leading to rapid rotation, contributing to the red MS, or by binary merger leading to slow rotation and populating the blue MS. We also derive the approximate merger time of the individual stars of the blue MS component, and find a strong early peak in the merger rate, with a lower level merger activity prevailing for tens of Myr. This supports recent binary formation models, and explains new velocity dispersion measurements for members of young star clusters. Our findings shed new light on the origin of the bi-modal mass, spin, and magnetic field distributions of main-sequence stars.

astro-ph.SR↗

Large-scale Personalized Video Game Recommendation via Social-aware Contextualized Graph Neural Network

Because of the large number of online games available nowadays, online game recommender systems are necessary for users and online game platforms. The former can discover more potential online games of their interests, and the latter can attract users to dwell longer in the platform. This paper investigates the characteristics of user behaviors with respect to the online games on the Steam platform. Based on the observations, we argue that a satisfying recommender system for online games is able to characterize: personalization, game contextualization and social connection. However, simultaneously solving all is rather challenging for game recommendation. Firstly, personalization for game recommendation requires the incorporation of the dwelling time of engaged games, which are ignored in existing methods. Secondly, game contextualization should reflect the complex and high-order properties of those relations. Last but not least, it is problematic to use social connections directly for game recommendations due to the massive noise within social connections. To this end, we propose a Social-aware Contextualized Graph Neural Recommender System (SCGRec), which harnesses three perspectives to improve game recommendation. We conduct a comprehensive analysis of users' online game behaviors, which motivates the necessity of handling those three characteristics in the online game recommendation.

cs.IR↗

Deep Leaning-Based Ultra-Fast Stair Detection

Staircases are some of the most common building structures in urban environments. Stair detection is an important task for various applications, including the environmental perception of exoskeleton robots, humanoid robots, and rescue robots and the navigation of visually impaired people. Most existing stair detection algorithms have difficulty dealing with the diversity of stair structure materials, extreme light and serious occlusion. Inspired by human perception, we propose an end-to-end method based on deep learning. Specifically, we treat the process of stair line detection as a multitask involving coarse-grained semantic segmentation and object detection. The input images are divided into cells, and a simple neural network is used to judge whether each cell contains stair lines. For cells containing stair lines, the locations of the stair lines relative to each cell are regressed. Extensive experiments on our dataset show that our method can achieve high performance in terms of both speed and accuracy. A lightweight version can even achieve 300+ frames per second with the same resolution. Our code and dataset will be soon available at GitHub.

cs.CV↗

Coding schemes for locally balanced constraints

Motivated by applications in DNA-based storage, we study explicit encoding and decoding schemes of binary strings satisfying locally balanced constraints, where the $(\ell,δ)$-locally balanced constraint requires that the weight of any consecutive substring of length $\ell$ is between $\frac{\ell}{2}-δ$ and $\frac{\ell}{2}+δ$. In this paper we present coding schemes for the strongly locally balanced constraints and the locally balanced constraints, respectively. Moreover, we introduce an additional result on the linear recurrence formula of the number of binary strings which are $(6,1)$-locally balanced, as a further attempt to both capacity characterization and new coding strategies for locally balanced constraints.

cs.IT↗

An asymptotic approach to Borwein-type sign pattern theorems

The celebrated (First) Borwein Conjecture predicts that for all positive integers~$n$ the sign pattern of the coefficients of the ``Borwein polynomial'' $$(1-q)(1-q^2)(1-q^4)(1-q^5) \cdots(1-q^{3n-2})(1-q^{3n-1})$$ is $+--+--\cdots$. It was proved by the first author in [Adv. Math. 394 (2022), Paper No. 108028]. In the present paper, we extract the essentials from the former paper and enhance them to a conceptual approach for the proof of ``Borwein-like'' sign pattern statements. In particular, we provide a new proof of the original (First) Borwein Conjecture, a proof of the Second Borwein Conjecture (predicting that the sign pattern of the square of the ``Borwein polynomial'' is also $+--+--\cdots$), and a partial proof of a ``cubic'' Borwein Conjecture due to the first author (predicting the same sign pattern for the cube of the ``Borwein polynomial''). Many further applications are discussed.

math.CO↗

AirCode: A Robust Object Encoding Method

Object encoding and identification are crucial for many robotic tasks such as autonomous exploration and semantic relocalization. Existing works heavily rely on the tracking of detected objects but have difficulty recalling revisited objects precisely. In this paper, we propose a novel object encoding method, which is named as AirCode, based on a graph of key-points. To be robust to the number of key-points detected, we propose a feature sparse encoding and object dense encoding method to ensure that each key-point can only affect a small part of the object descriptors, leading it to be robust to viewpoint changes, scaling, occlusion, and even object deformation. In the experiments, we show that it achieves superior performance for object identification than the state-of-the-art algorithms and is able to provide reliable semantic relocalization. It is a plug-and-play module and we expect that it will play an important role in various applications.

cs.RO↗

Online Learning for Failure-aware Edge Backup of Service Function Chains with the Minimum Latency

Virtual network functions (VNFs) have been widely deployed in mobile edge computing (MEC) to flexibly and efficiently serve end users running resource-intensive applications, which can be further serialized to form service function chains (SFCs), providing customized networking services. To ensure the availability of SFCs, it turns out to be effective to place redundant SFC backups at the edge for quickly recovering from any failures. The existing research largely overlooks the influences of SFC popularity, backup completeness and failure rate on the optimal deployment of SFC backups on edge servers. In this paper, we comprehensively consider from the perspectives of both the end users and edge system to backup SFCs for providing popular services with the lowest latency. To overcome the challenges resulted from unknown SFC popularity and failure rate, as well as the known system parameter constraints, we take advantage of the online bandit learning technique to cope with the uncertainty issue. Combining the Prim-inspired method with the greedy strategy, we propose a Real-Time Selection and Deployment(RTSD) algorithm. Extensive simulation experiments are conducted to demonstrate the superiority of our proposed algorithms.

cs.NI↗

Nuclear mass table in deformed relativistic Hartree-Bogoliubov theory in continuum: I. even-even nuclei

Ground-state properties of even-even nuclei with $8\le Z\le120$ from the proton drip line to the neutron drip line have been investigated using the deformed relativistic Hartree-Bogoliubov theory in continuum (DRHBc) with the density functional PC-PK1. With the effects of deformation and continuum included simultaneously, 2583 even-even nuclei are predicted to be bound. The calculated binding energies, two-nucleon separation energies, root-mean-square (rms) radii of neutron, proton, matter, and charge distributions, quadrupole deformations, and neutron and proton Fermi surfaces are tabulated and compared with available experimental data. The rms deviation from the 637 mass data is 1.518 MeV, providing one of the best microscopic descriptions for nuclear masses. The drip lines obtained from DRHBc calculations are compared with other calculations, including the spherical relativistic continuum Hartree-Bogoliubov (RCHB) and triaxial relativistic Hartree-Bogoliubov (TRHB) calculations with PC-PK1. The deformation and continuum effects on the limits of the nuclear landscape are discussed. Possible peninsulas consisting of bound nuclei beyond the two-neutron drip line are predicted. The systematics of the two-nucleon separation energies, two-nucleon gaps, rms radii, quadrupole deformations, potential energy curves, neutron densities, neutron mean-field potentials, and pairing energies in the DRHBc calculations are also discussed. In addition, the $α$ decay energies extracted are in good agreement with available data.

nucl-th↗

Geometric thermodynamic uncertainty relation in periodically driven thermoelectric heat engine

Thermodynamic uncertainty relation, quantifying a trade-off among average current, the associated fluctuation (precision), and entropy production (cost), has been formulated in nonequilibrium steady state and various stochastic systems. Herein, we study the thermodynamic uncertainty relation in generic thermoelectric heat engines under a periodic control protocol, by uncovering the underlying Berry-phase-like contribution. We show that our thermodynamic uncertainty relation breaks the seminal steady-state results, originating from the non-vanishing geometric effect. Furthermore, by deriving the consequent trade-off relation binding efficiency, power, and constancy, we prove that the periodically driven thermoelectric heat engines can generally outperform the steady-state analogies. The general bounds are illustrated by an analytically solvable two-terminal single quantum dot heat engine under the periodic modulation. Our work provides a geometric framework in bounding and optimizing a wide range of periodically driven thermoelectric thermal machines.

cond-mat.mes-hall↗

Explodability fluctuations of massive stellar cores enable asymmetric compact object mergers such as GW190814

The first three observing runs with Advanced LIGO and Virgo have resulted in the detection of binary black hole mergers (BBH) with highly unequal mass components, which are difficult to reconcile with standard formation paradigms. The most representative of these is GW190814, a highly asymmetric merger between a 23 M$_{\odot}$ black hole and a 2.6 M$_{\odot}$ compact object. Here, we explore recent results suggesting that a sizeable fraction of stars with pre-collapse carbon-oxygen core masses above 10 M$_{\odot}$, and extending up to at least 30 M$_{\odot}$, may produce objects inside the so-called lower mass gap that bridges the division between massive pulsars and BHs in Galactic X-ray binaries. We demonstrate that such an explosion landscape would naturally cause a fraction of massive binaries to produce GW190814-like systems instead of symmetric-mass BBHs. We present examples of specific evolutionary channels leading to the formation of GW190814 and GW200210, a 24+2.8 M$_{\odot}$ merger discovered during the O3b observing run. We estimate the merger-rate density of these events in our scenario to be $\mathcal{O}$(5%) of the total BBH merger rate. Finally, we discuss the broader implications of this formation channel for compact object populations, and its possible relevance to less asymmetric merger events such as GW200105 and GW200115

astro-ph.HE↗

Robust Sensor Fusion Algorithms Against Voice Command Attacks in Autonomous Vehicles

With recent advances in autonomous driving, Voice Control Systems have become increasingly adopted as human-vehicle interaction methods. This technology enables drivers to use voice commands to control the vehicle and will be soon available in Advanced Driver Assistance Systems (ADAS). Prior work has shown that Siri, Alexa and Cortana, are highly vulnerable to inaudible command attacks. This could be extended to ADAS in real-world applications and such inaudible command threat is difficult to detect due to microphone nonlinearities. In this paper, we aim to develop a more practical solution by using camera views to defend against inaudible command attacks where ADAS are capable of detecting their environment via multi-sensors. To this end, we propose a novel multimodal deep learning classification system to defend against inaudible command attacks. Our experimental results confirm the feasibility of the proposed defense methods and the best classification accuracy reaches 89.2%. Code is available at https://github.com/ITSEG-MQ/Sensor-Fusion-Against-VoiceCommand-Attacks.

cs.LG↗

Quantum phase transition of light in the dissipative Rabi-Hubbard lattice: A dressed-master-equation perspective

In this work, we investigate the quantum phase transition of light in the dissipative Rabi-Hubbard lattice under the framework of the mean-field theory and quantum dressed master equation. The order parameter of photons in strong qubit-photon coupling regime is derived analytically both at zero and low temperatures. Interestingly, we can locate the localization and delocalization phase transition very well in a wide parameter region. {In particular for the zero-temperature limit, the critical tunneling strength approaches zero generally in the deep-strong qubit-photon coupling regime, regardless of the quantum dissipation. This is contrary to the previous results with the finite minimal critical tunneling strength based on the standard Lindblad master equation. Moreover, a significant improvement of the critical tunneling is also observed at finite temperature, compared with the counterpart under the Lindblad description. We hope these results may deepen the understanding of the phase transition of photons in the Rabi-Hubbard model.

quant-ph↗

Unsupervised Online Learning for Robotic Interestingness with Visual Memory

Autonomous robots frequently need to detect "interesting" scenes to decide on further exploration, or to decide which data to share for cooperation. These scenarios often require fast deployment with little or no training data. Prior work considers "interestingness" based on data from the same distribution. Instead, we propose to develop a method that automatically adapts online to the environment to report interesting scenes quickly. To address this problem, we develop a novel translation-invariant visual memory and design a three-stage architecture for long-term, short-term, and online learning, which enables the system to learn human-like experience, environmental knowledge, and online adaption, respectively. With this system, we achieve an average of 20% higher accuracy than the state-of-the-art unsupervised methods in a subterranean tunnel environment. We show comparable performance to supervised methods for robot exploration scenarios showing the efficacy of our approach. We expect that the presented method will play an important role in the robotic interestingness recognition exploration tasks.

cs.RO↗

Pre-training Graph Neural Network for Cross Domain Recommendation

A recommender system predicts users' potential interests in items, where the core is to learn user/item embeddings. Nevertheless, it suffers from the data-sparsity issue, which the cross-domain recommendation can alleviate. However, most prior works either jointly learn the source domain and target domain models, or require side-features. However, jointly training and side features would affect the prediction on the target domain as the learned embedding is dominated by the source domain containing bias information. Inspired by the contemporary arts in pre-training from graph representation learning, we propose a pre-training and fine-tuning diagram for cross-domain recommendation. We devise a novel Pre-training Graph Neural Network for Cross-Domain Recommendation (PCRec), which adopts the contrastive self-supervised pre-training of a graph encoder. Then, we transfer the pre-trained graph encoder to initialize the node embeddings on the target domain, which benefits the fine-tuning of the single domain recommender system on the target domain. The experimental results demonstrate the superiority of PCRec. Detailed analyses verify the superiority of PCRec in transferring information while avoiding biases from source domains.

cs.IR↗