Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
137works
0followers
50topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

137 published item(s)

preprint2026arXiv

Revisiting Uncertainty: On Evidential Learning for Partially Relevant Video Retrieval

Partially relevant video retrieval aims to retrieve untrimmed videos using text queries that describe only partial content. However, the inherent asymmetry between brief queries and rich video content inevitably introduces uncertainty into the retrieval process. In this setting, vague queries often induce semantic ambiguity across videos, a challenge that is further exacerbated by the sparse temporal supervision within videos, which fails to provide sufficient matching evidence. To address this, we propose Holmes, a hierarchical evidential learning framework that aggregates multi-granular cross-modal evidence to quantify and model uncertainty explicitly. At the inter-video level, similarity scores are interpreted as evidential support and modeled via a Dirichlet distribution. Based on the proposed three-fold principle, we perform fine-grained query identification, which then guides query-adaptive calibrated learning. At the intra-video level, to accumulate denser evidence, we formulate a soft query-clip alignment via flexible optimal transport with an adaptive dustbin, which alleviates sparse temporal supervision while suppressing spurious local responses. Extensive experiments demonstrate that Holmes outperforms state-of-the-art methods. Code is released at https://github.com/lijun2005/ICML26-Holmes.

preprint2024arXiv

Constraints on Axion-like Particles from the Observation of Galactic Sources by LHAASO

High-energy photons may oscillate with axion-like particles (ALPs) when they propagate through the Milky Way's magnetic field, resulting in an alteration in the observed photon energy spectrum. The ultra-high energy gamma-ray spectra, measured by the Large High Altitude Air Shower Observatory (LHAASO) up to $\mathcal{O}(1)~\mathrm{PeV}$, provide a promising opportunity to investigate the ALP-photon oscillation effect. In this study, we utilize the gamma-ray spectra of four Galactic sources measured by LHAASO, including the Crab Nebula, LHAASO J2226+6057, LHAASO J1908+0621, and LHAASO J1825-1326, to explore this effect. We employ the $\rm CL_s$ method to set constraints on the ALP parameters. Combing the observations of the four sources, our analysis reveals that the ALP-photon coupling $g_{aγ}$ is constrained to be smaller than $1.4\times10^{-10}$ ${\rm GeV}^{-1}$ for the ALP mass of $\sim 4\times10^{-7} ~\mathrm{eV}$ at the 95\% C.L. By combing the observations of the Crab Nebula from LHAASO and other experiments, we find that the ALP-photon coupling could be set to be about $7.2\times10^{-11}$ ${\rm GeV}^{-1}$ for the ALP mass $\sim 4 \times10^{-7}~\mathrm{eV}$ , which is in close proximity to the CAST constraint.

preprint2024arXiv

Non-aligned supervision for Real Image Dehazing

Removing haze from real-world images is challenging due to unpredictable weather conditions, resulting in the misalignment of hazy and clear image pairs. In this paper, we propose an innovative dehazing framework that operates under non-aligned supervision. This framework is grounded in the atmospheric scattering model, and consists of three interconnected networks: dehazing, airlight, and transmission networks. In particular, we explore a non-alignment scenario that a clear reference image, unaligned with the input hazy image, is utilized to supervise the dehazing network. To implement this, we present a multi-scale reference loss that compares the feature representations between the referred image and the dehazed output. Our scenario makes it easier to collect hazy/clear image pairs in real-world environments, even under conditions of misalignment and shift views. To showcase the effectiveness of our scenario, we have collected a new hazy dataset including 415 image pairs captured by mobile Phone in both rural and urban areas, called "Phone-Hazy". Furthermore, we introduce a self-attention network based on mean and variance for modeling real infinite airlight, using the dark channel prior as positional guidance. Additionally, a channel attention network is employed to estimate the three-channel transmission. Experimental results demonstrate the superior performance of our framework over existing state-of-the-art techniques in the real-world image dehazing task. Phone-Hazy and code will be available at https://fanjunkai1.github.io/projectpage/NSDNet/index.html.

preprint2023arXiv

How Does Traffic Environment Quantitatively Affect the Autonomous Driving Prediction?

An accurate trajectory prediction is crucial for safe and efficient autonomous driving in complex traffic environments. In recent years, artificial intelligence has shown strong capabilities in improving prediction accuracy. However, its characteristics of inexplicability and uncertainty make it challenging to determine the traffic environmental effect on prediction explicitly, posing significant challenges to safety-critical decision-making. To address these challenges, this study proposes a trajectory prediction framework with the epistemic uncertainty estimation ability that outputs high uncertainty when confronting unforeseeable or unknown scenarios. The proposed framework is used to analyze the environmental effect on the prediction algorithm performance. In the analysis, the traffic environment is considered in terms of scenario features and shifts, respectively, where features are divided into kinematic features of a target agent, features of its surrounding traffic participants, and other features. In addition, feature correlation and importance analyses are performed to study the above features' influence on the prediction error and epistemic uncertainty. Further, a cross-dataset case study is conducted using multiple intersection datasets to investigate the impact of unavoidable distributional shifts in the real world on trajectory prediction. The results indicate that the deep ensemble-based method has advantages in improving prediction robustness and estimating epistemic uncertainty. The consistent conclusions are obtained by the feature correlation and importance analyses, including the conclusion that kinematic features of the target agent have relatively strong effects on the prediction error and epistemic uncertainty. Furthermore, the prediction failure caused by distributional shifts and the potential of the deep ensemble-based method are analyzed.

preprint2023arXiv

Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically

In this paper, we utilize a concatenation scheme to construct new families of quantum error correction codes achieving the quantum Gilbert-Varshamov (GV) bound asymptotically. We concatenate alternant codes with any linear code achieving the classical GV bound to construct Calderbank-Shor-Steane (CSS) codes. We show that the concatenated code can achieve the quantum GV bound asymptotically and can approach the Hashing bound for asymmetric Pauli channels. By combing Steane's enlargement construction of CSS codes, we derive a family of enlarged stabilizer codes achieving the quantum GV bound for enlarged CSS codes asymptotically. As applications, we derive two families of fast encodable and decodable CSS codes with parameters $\mathscr{Q}_1=[[N,Ω(\sqrt{N}),Ω( \sqrt{N})]],$ and $\mathscr{Q}_2=[[N,Ω(N/\log N),Ω(N/\log N)/Ω(\log N)]].$ We show that $\mathscr{Q}_1$ can be encoded very efficiently by circuits of size $O(N)$ and depth $O(\sqrt{N})$. For an input error syndrome, $\mathscr{Q}_1$ can correct any adversarial error of weight up to half the minimum distance bound in $O(N)$ time. $\mathscr{Q}_1$ can also be decoded in parallel in $O(\sqrt{N})$ time by using $O(\sqrt{N})$ classical processors. For an input error syndrome, we proved that $\mathscr{Q}_2$ can correct a linear number of ${X}$-errors with high probability and an almost linear number of ${Z}$-errors in $O(N )$ time. Moreover, $\mathscr{Q}_2$ can be decoded in parallel in $O(\log(N))$ time by using $O(N)$ classical processors.

preprint2022arXiv

A Deep Learning Approach to Predicting Ventilator Parameters for Mechanically Ventilated Septic Patients

We develop a deep learning approach to predicting a set of ventilator parameters for a mechanically ventilated septic patient using a long and short term memory (LSTM) recurrent neural network (RNN) model. We focus on short-term predictions of a set of ventilator parameters for the septic patient in emergency intensive care unit (EICU). The short-term predictability of the model provides attending physicians with early warnings to make timely adjustment to the treatment of the patient in the EICU. The patient specific deep learning model can be trained on any given critically ill patient, making it an intelligent aide for physicians to use in emergent medical situations.

preprint2022arXiv

A Method for Self-Service Rehabilitation Training of Human Lower Limbs

In recent years, the research of rehabilitation robot technology has become a hotspot in the field of rehabilitation medicine engineering and robotics. To assist active rehabilitation in patients with unilateral lower extremity injury, we propose a new self-service rehabilitation training method to control the injured lower extremity through its contralateral healthy upper limbs. Firstly, the movement data of upper limbs and lower limbs of healthy people in normal walking state are obtained by gait measurement experiment. Secondly, the eigenvectors of upper limb and lower limb movements in a single movement cycle are extracted respectively. Thirdly, the linear mapping relationship between the upper limbs movement and the lower limbs movement is identified using the least squares method. Finally, the simulation experiment of self-service rehabilitation training is implemented on MATLAB/Simulink. The results indicate that the identified linear mapping model can achieve good accuracy and adaptability. The self-service rehabilitation training method is effective for helping patients with unilateral limb injury to make rehabilitation training on themselves.

preprint2022arXiv

A Self-Guided Framework for Radiology Report Generation

Automatic radiology report generation is essential to computer-aided diagnosis. Through the success of image captioning, medical report generation has been achievable. However, the lack of annotated disease labels is still the bottleneck of this area. In addition, the image-text data bias problem and complex sentences make it more difficult to generate accurate reports. To address these gaps, we pre-sent a self-guided framework (SGF), a suite of unsupervised and supervised deep learning methods to mimic the process of human learning and writing. In detail, our framework obtains the domain knowledge from medical reports with-out extra disease labels and guides itself to extract fined-grain visual features as-sociated with the text. Moreover, SGF successfully improves the accuracy and length of medical report generation by incorporating a similarity comparison mechanism that imitates the process of human self-improvement through compar-ative practice. Extensive experiments demonstrate the utility of our SGF in the majority of cases, showing its superior performance over state-of-the-art meth-ods. Our results highlight the capacity of the proposed framework to distinguish fined-grained visual details between words and verify its advantage in generating medical reports.

preprint2022arXiv

A Tale of Two Flows: Cooperative Learning of Langevin Flow and Normalizing Flow Toward Energy-Based Model

This paper studies the cooperative learning of two generative flow models, in which the two models are iteratively updated based on the jointly synthesized examples. The first flow model is a normalizing flow that transforms an initial simple density to a target density by applying a sequence of invertible transformations. The second flow model is a Langevin flow that runs finite steps of gradient-based MCMC toward an energy-based model. We start from proposing a generative framework that trains an energy-based model with a normalizing flow as an amortized sampler to initialize the MCMC chains of the energy-based model. In each learning iteration, we generate synthesized examples by using a normalizing flow initialization followed by a short-run Langevin flow revision toward the current energy-based model. Then we treat the synthesized examples as fair samples from the energy-based model and update the model parameters with the maximum likelihood learning gradient, while the normalizing flow directly learns from the synthesized examples by maximizing the tractable likelihood. Under the short-run non-mixing MCMC scenario, the estimation of the energy-based model is shown to follow the perturbation of maximum likelihood, and the short-run Langevin flow and the normalizing flow form a two-flow generator that we call CoopFlow. We provide an understating of the CoopFlow algorithm by information geometry and show that it is a valid generator as it converges to a moment matching estimator. We demonstrate that the trained CoopFlow is capable of synthesizing realistic images, reconstructing images, and interpolating between images.

preprint2022arXiv

A3CLNN: Spatial, Spectral and Multiscale Attention ConvLSTM Neural Network for Multisource Remote Sensing Data Classification

The problem of effectively exploiting the information multiple data sources has become a relevant but challenging research topic in remote sensing. In this paper, we propose a new approach to exploit the complementarity of two data sources: hyperspectral images (HSIs) and light detection and ranging (LiDAR) data. Specifically, we develop a new dual-channel spatial, spectral and multiscale attention convolutional long short-term memory neural network (called dual-channel A3CLNN) for feature extraction and classification of multisource remote sensing data. Spatial, spectral and multiscale attention mechanisms are first designed for HSI and LiDAR data in order to learn spectral- and spatial-enhanced feature representations, and to represent multiscale information for different classes. In the designed fusion network, a novel composite attention learning mechanism (combined with a three-level fusion strategy) is used to fully integrate the features in these two data sources. Finally, inspired by the idea of transfer learning, a novel stepwise training strategy is designed to yield a final classification result. Our experimental results, conducted on several multisource remote sensing data sets, demonstrate that the newly proposed dual-channel A3CLNN exhibits better feature representation ability (leading to more competitive classification performance) than other state-of-the-art methods.

preprint2022arXiv

Accelerating Grasp Learning via Pretraining with Coarse Affordance Maps of Objects

Self-supervised grasp learning, i.e., learning to grasp by trial and error, has made great progress. However, it is still time-consuming to train such a model and also a challenge to apply it in practice. This work presents an accelerating method of robotic grasp learning via pretraining with coarse affordance maps of objects to be grasped based on a quite small dataset. A model generated through pre-training is harnessed as an initialization policy to warmly start grasp learning so as to guide a robot to capture more effective rewards at the beginning of training. An object in its coarse affordance map is annotated with a single key point and thereby, the burden of labeling is greatly alleviated. Extensive experiments in simulation and on a real robot are conducted to evaluate the proposed method. The simulation results show that it can significantly accelerate grasp learning by nearly three times over a vanilla Deep Q-Network -based method. Its test on a real UR3 robot shows that it reaches a grasp success rate of 89.5% via only 500 times of grasp tries within about two hours, which is four times faster than its competitor. In addition, it enjoys an outstanding generalization ability to grasp prior-unseen novel objects. It outperforms some existing methods and has the potential to directly apply to a robot for real-world grasp learning tasks.

preprint2022arXiv

Almost global smooth solutions of the 3D quasilinear Klein-Gordon equations on the product space $\mathbb{R}^{2}\times \mathbb{T}$

In the paper, for the 3D quasilinear Klein-Gordon equation with the small initial data posed on the product space $\mathbb{R}^{2}\times \mathbb{T}$, we focus on the lower bound of the lifespan of the smooth solution. When the size of initial data is bounded by $\varepsilon_0>0$, by the space-time resonance method, it is shown that smooth solution exists up to the time $e^{c_{0}/\varepsilon_{0}^2}$ with $\varepsilon_0$ being sufficiently small and $c_0>0$ being some suitable constant.

preprint2022arXiv

Beamforming Design for IRS-Aided Decode-and-Forward Relay Wireless Network

As a low-cost and low-power-consumption passive reflector, intelligent reflecting surface (IRS) can make a significant rate improvement by building a programmable wireless environment. To improve the rate performance and coverage range of wireless networks, an IRS-aided decode-and-forward (DF) relay network is proposed with multiple antennas at relay station (RS). To achieve a high rate, an alternately iterative structure (AIS) of maximizing receive power (Max-RP) at RS is proposed to jointly optimize the beamforming vectors at RS and phase shifts at IRS. Considering its high-complexity, two low-complexity Max-RP schemes of null-space projection (NSP) plus maximum ratio combining (MRC) and IRS element selection (IRSES) plus MRC are presented to reduce this complexity, respectively. For the former, NSP is used to separate the reflected signal from IRS and the direct transmitted signal from source and MRC is adopted to combine the two signals at RS. For the latter, the basic concept of IRSES is as follows: IRS is partitioned into M subsets of elements and adjusting the phases of all elements per subset make all reflected signals and the direct signal from source phase alignment (PA) at the corresponding antenna of relay. Simulation results show that the proposed three methods perform much better than the existing network with single-antenna relay in terms of rate performance. In particular, a 85% rate gain over existing scheme is achieved in the high signal-to-noise ratio region. Moreover, it is verified that the positions of RS and IRS have a substantial impact on rate performance, and there exists an optimal positions of RS and IRS.

preprint2022arXiv

Bulk and edge dynamics of a 2D Affleck-Kennedy-Lieb-Tasaki model

We study the dynamical properties of both bulk and edge spins of a two-dimensional Affleck-Kennedy-Lieb-Tasaki (AKLT) model mainly by using the stochastic series expansion quantum Monte Carlo method with stochastic analytic continuation. In the deep AKLT phase, we obtain a spin spectrum with flat band, which is a strong evidence for a localized state. Through the spectrum analysis, we see a clear continuous phase transition from the AKLT phase to the Néel phase in the model, and the energy gap becomes closed at the corresponding momentum point. In comparison with linear spin-wave theory, the differences show that there are strong interactions among magnons at high energies. With open boundary condition, the gap of edge spins in the AKLT phase closes at both the $Γ$ point and the $π$ point interestingly to emerge into a flat-band-like Luttinger liquid phase, which can be explained by symmetry and perturbation approximation. This paper helps us to better understand the completely different dynamical behaviors of bulk and edge spins in the symmetry protected topological phase.

preprint2022arXiv

CAMO-MOT: Combined Appearance-Motion Optimization for 3D Multi-Object Tracking with Camera-LiDAR Fusion

3D Multi-object tracking (MOT) ensures consistency during continuous dynamic detection, conducive to subsequent motion planning and navigation tasks in autonomous driving. However, camera-based methods suffer in the case of occlusions and it can be challenging to accurately track the irregular motion of objects for LiDAR-based methods. Some fusion methods work well but do not consider the untrustworthy issue of appearance features under occlusion. At the same time, the false detection problem also significantly affects tracking. As such, we propose a novel camera-LiDAR fusion 3D MOT framework based on the Combined Appearance-Motion Optimization (CAMO-MOT), which uses both camera and LiDAR data and significantly reduces tracking failures caused by occlusion and false detection. For occlusion problems, we are the first to propose an occlusion head to select the best object appearance features multiple times effectively, reducing the influence of occlusions. To decrease the impact of false detection in tracking, we design a motion cost matrix based on confidence scores which improve the positioning and object prediction accuracy in 3D space. As existing multi-object tracking methods only consider a single category, we also propose to build a multi-category loss to implement multi-object tracking in multi-category scenes. A series of validation experiments are conducted on the KITTI and nuScenes tracking benchmarks. Our proposed method achieves state-of-the-art performance and the lowest identity switches (IDS) value (23 for Car and 137 for Pedestrian) among all multi-modal MOT methods on the KITTI test dataset. And our proposed method achieves state-of-the-art performance among all algorithms on the nuScenes test dataset with 75.3% AMOTA.

preprint2022arXiv

Chambers in the symplectic cone and stability of symplectomorphism group for ruled surface

We continue our previous work to prove that for any non-minimal ruled surface $(M,ω)$, the stability under symplectic deformations of $π_0, π_1$ of $Symp(M,ω)$ is guided by embedded $J$-holomorphic curves. Further, we prove that for any fixed sizes blowups, when the area ratio $μ$ between the section and fiber goes to infinity, there is a topological colimit of $Symp(M,ω_μ).$ Moreover, when the blowup sizes are all equal to half the area of the fiber class, we give a topological model of the colimit which induces non-trivial symplectic mapping classes in $Symp(M,ω) \cap \rm Diff_0(M),$ where $\rm Diff_0(M)$ is the identity component of the diffeomorphism group. These mapping classes are not Dehn twists along Lagrangian spheres.

preprint2022arXiv

CoDo: Contrastive Learning with Downstream Background Invariance for Detection

The prior self-supervised learning researches mainly select image-level instance discrimination as pretext task. It achieves a fantastic classification performance that is comparable to supervised learning methods. However, with degraded transfer performance on downstream tasks such as object detection. To bridge the performance gap, we propose a novel object-level self-supervised learning method, called Contrastive learning with Downstream background invariance (CoDo). The pretext task is converted to focus on instance location modeling for various backgrounds, especially for downstream datasets. The ability of background invariance is considered vital for object detection. Firstly, a data augmentation strategy is proposed to paste the instances onto background images, and then jitter the bounding box to involve background information. Secondly, we implement architecture alignment between our pretraining network and the mainstream detection pipelines. Thirdly, hierarchical and multi views contrastive learning is designed to improve performance of visual representation learning. Experiments on MSCOCO demonstrate that the proposed CoDo with common backbones, ResNet50-FPN, yields strong transfer learning results for object detection.

preprint2022arXiv

Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning

Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting. Aiming to maximize the long-term average achievable system rate, an optimization problem is formulated by jointly designing the transmit beamforming at the base station (BS) and discrete phase shift beamforming at the IRSs, with the constraints on transmit power, user data rate requirement and IRS energy buffer size. Considering time-varying channels and stochastic arrivals of energy harvested by the IRSs, we first formulate the problem as a Markov decision process (MDP) and then develop a novel multi-agent Q-mix (MAQ) framework with two layers to decouple the optimization parameters. The higher layer is for optimizing phase shift resolutions, and the lower one is for phase shift beamforming and power allocation. Since the phase shift optimization is an integer programming problem with a large-scale action space, we improve MAQ by incorporating the Wolpertinger method, namely, MAQ-WP algorithm to achieve a sub-optimality with reduced dimensions of action space. In addition, as MAQ-WP is still of high complexity to achieve good performance, we propose a policy gradient-based MAQ algorithm, namely, MAQ-PG, by mapping the discrete phase shift actions into a continuous space at the cost of a slight performance loss. Simulation results demonstrate that the proposed MAQ-WP and MAQ-PG algorithms can converge faster and achieve data rate improvements of 10.7% and 8.8% over the conventional multi-agent DDPG, respectively.

preprint2022arXiv

CompleteDT: Point Cloud Completion with Dense Augment Inference Transformers

Point cloud completion task aims to predict the missing part of incomplete point clouds and generate complete point clouds with details. In this paper, we propose a novel point cloud completion network, namely CompleteDT. Specifically, features are learned from point clouds with different resolutions, which is sampled from the incomplete input, and are converted to a series of \textit{spots} based on the geometrical structure. Then, the Dense Relation Augment Module (DRA) based on the transformer is proposed to learn features within \textit{spots} and consider the correlation among these \textit{spots}. The DRA consists of Point Local-Attention Module (PLA) and Point Dense Multi-Scale Attention Module (PDMA), where the PLA captures the local information within the local \textit{spots} by adaptively measuring weights of neighbors and the PDMA exploits the global relationship between these \textit{spots} in a multi-scale densely connected manner. Lastly, the complete shape is predicted from \textit{spots} by the Multi-resolution Point Fusion Module (MPF), which gradually generates complete point clouds from \textit{spots}, and updates \textit{spots} based on these generated point clouds. Experimental results show that, because the DRA based on the transformer can learn the expressive features from the incomplete input and the MPF can fully explore these feature to predict the complete input, our method largely outperforms the state-of-the-art methods.

preprint2022arXiv

Correlation of the dynamic contact angle with the capillary number and its hysteresis

The moving contact-line problem is of both theoretical and practical interest. The dynamic contact angle changes with the capillary number defined by the contact-line speed, and the correlation also depends on the equilibrium contact angle measured at the static state. This correlation is usually required as an input to the traditional solvers based on the Navier-Stokes-like equations, but it is simulated as an output in the current study using the lattice Boltzmann method (LBM) in a displacement process of two-immiscible fluids. The macroscopic theory and the molecular dynamics (MD) simulation had shown a linear scaling law for the cosine of dynamic contact angle, which is also observed in the previous LBM study in a short range of small capillary numbers and for two neutral wetting conditions. However, our study shows that this linear scaling law holds in the whole range of capillary numbers and is universal for all wetting conditions. In a special case of complete wetting (spreading) with a zero equilibrium contact angle, a thin film of the wetting fluid occurs when the wettability is very strong, which leads to a hysteresis that substantial capillary number is required to initiate the deviation of the dynamic contact angle from its equilibrium state. This observation is consistent with the previous report on a new mechanism for the static contact angle hysteresis due to the presence of free liquid films. With an increasing capillary number, the fluid-fluid interface starts oscillating before fingering. Different fingering patterns are observed for cases with different equilibrium contact angles.

preprint2022arXiv

Design of optical voltage sensor based on electric field regulation and rotating isomerism electrode

Temperature drift, stress birefringence and low frequency vibration lead to the randomness and fluctuation of the output of optical voltage sensor(OVS). In order to solve the problem, this study adopts the lock-in amplifier technology with the aid of a high-speed rotating electrode to realize electric field modulation. This technology could shift the measured signal frequency band from near 50 Hz moved to several kilometer Hz, so as to make the output signal avoid the interference from low-frequency temperature drift, stress birefringence and vibration, leading to higher stability and reliability. The electro-optic coupling wave theory and static electric field finite element method are utilized to investigate the shape of modulation wave. The simulation results proves that lock-in technology is able to prevent the measured voltage signal from the large step signal interference and restore the perfect original signal. While the sample rate is decreased to the value of the modulation frequency.

preprint2022arXiv

Dust Mass Associated with the Supernova Remnant IC 443 when Emission Meets Extinction

The dust mass of the well-known supernova remnant (SNR) IC 443 is estimated from both the infrared emission and the visual extinction. With photometry to the images taken by \emph{Spitzer}, \emph{WISE}, \emph{IRAS}, \emph{AKARI} and \emph{Planck}, the spectral energy distribution (SED) of the dust is obtained after subtracting the synchrotron radiation and considering the spectral line emission. The dust mass is derived from fitting the SED by a two-component model, which results in a warm component of the temperature of $\sim$ 53 K and the mass of 0.1 $M_\odot$, and a cold component of the temperature of $\sim 17$ K and the mass of 46 $M_\odot$. On the other hand, the dust mass is derived to be $\sim$ 66 $M_\odot$ from the visual extinction of IC 443 which is identified from the 3D Bayestar extinction map and its coincidence with the infrared emission morphology. Roughly the dust mass derived from the infrared emission and the extinction agree mutually. However, the dust mass derived from the infrared emission can be adjusted to be more consistent with that from the extinction by using different dust opacity property or considering optically thick radiation. In addition, the distribution of dust temperature and mass is analyzed by fitting the SED pixel by pixel.

preprint2022arXiv

Dust Models for the Extinction of Type IIn Supernova SN 2010jl

The unusual extinction curves of SN 2010jl provide an excellent opportunity to investigate the properties of dust formed by core-collapse supernovae. By using a series of dust models with different compositions and grain size distributions, we fit the extinction curves of SN 2010jl and find that a silicate-graphite mixture dust model characterized by exponentially cutoff power-law size distributions can well reproduce its unusual extinction curves. The best-fit results show that the extinctions derived from the dust models are consistent with the observed values at all epochs. However, the total-to-selective extinction ratio $R_V$ is about 2.8 - 3.1, which is significantly smaller than the value of $R_V \approx 6.4$ derived by Gall et al. The best-fit models indicate that the dust grains around SN 2010jl are possibly composed of small-size astronomical silicate grains and micron-size graphite grains. In addition, by fitting the optical to mid-infrared spectral energy distribution, we find that the dust mass around SN 2010jl increases with time, up to $0.005\,M_{\odot}$ around 1300 days after peak brightness, which is consistent with previous estimates.

preprint2022arXiv

Dynamic Registration: Joint Ego Motion Estimation and 3D Moving Object Detection in Dynamic Environment

Localization in a dynamic environment suffers from moving objects. Removing dynamic object is crucial in this situation but become tricky when ego-motion is coupled. In this paper, instead of proposing a new slam framework, we aim at a more general strategy for a localization scenario. In that case, Dynamic Registration is available for integrating with any lidar slam system. We utilize 3D object detection to obtain potential moving objects and remove them temporarily. Then we proposed Dynamic Registration, to iteratively estimate ego-motion and segment moving objects until no static object generates. Static objects are merged with the environment. Finally, we successfully segment dynamic objects, static environments with static objects, and ego-motion estimation in a dynamic environment. We evaluate the performance of our proposed method on KITTI Tracking datasets. Results show stable and consistent improvements based on other classical registration algorithms.

preprint2022arXiv

Elevation Angle-Dependent 3D Trajectory Design for Aerial RIS-aided Communication

This paper investigates an aerial reconfigurable intelligent surface (RIS)-aided communication system under the probabilistic line-of-sight (LoS) channel, where an unmanned aerial vehicle (UAV) equipped with an RIS is deployed to assist two ground nodes in their information exchange. An optimization problem with the objective of maximizing the minimum average achievable rate is formulated to jointly design the communication scheduling, the RIS's phase shift, and the three-dimensional (3D) UAV trajectory. To solve such a non-convex problem, we propose an efficient iterative algorithm to obtain its suboptimal solution. Simulation results show that our proposed design significantly outperforms the existing schemes and provides new insights into the elevation angle and distance trade-off for the UAV-borne RIS communication system.

preprint2022arXiv

Energy-Efficient IRS-Aided NOMA Beamforming for 6G Wireless Communications

This manuscript presents an energy-efficient alternating optimization framework based on intelligent reflective surfaces (IRS) aided non-orthogonal multiple access beamforming (NOMA-BF) system for 6G wireless communications. Specifically, this work proposes a centralized IRS-enabled design for the NOMA-BF system to optimize the active beamforming and power allocation coefficient (PAC) of users at the transmitter in the first stage and passive beamforming at IRS in the 2nd stage to maximize the energy efficiency (EE) of the network. However, an increment in the number of supportable users with the NOMA-BF system will lead to NOMA user interference and inter-cluster interference (ICI). To mitigate the effect of ICI, first zero-forcing beamforming along with efficient user clustering algorithm is exploited and then NOMA user interference is tackled efficiently through a proposed iterative algorithm that computes PAC of NOMA user through simplified closed-form expression under the required system constraints. In the 2nd stage, the problem of passive beamforming is solved through a technique based on difference-of-convex (DC) programming and successive convex approximation (SCA). Simulation results demonstrate that the proposed alternating framework for energy-efficient IRS-assisted NOMA-BF system can achieve convergence within a few iterations and provide efficient performance in terms of EE of the system with low complexity.

preprint2022arXiv

Enhanced low-energy magnetic excitations evidencing the Cu-induced localization in an Fe-based superconductor Fe$_{0.98}$Te$_{0.5}$Se$_{0.5}$

We have performed inelastic neutron scattering measurements on optimally-doped Fe$_{0.98}$Te$_{0.5}$Se$_{0.5}$ and 10% Cu-doped Fe$_{0.88}$Cu$_{0.1}$Te$_{0.5}$Se$_{0.5}$ to investigate the substitution effects on the spin excitations in the whole energy range up to 300 meV. It is found that substitution of Cu for Fe enhances the low-energy spin excitations ($\le$ 100 meV), especially around the (0.5, 0.5) point, and leaves the high-energy magnetic excitations intact. In contrast to the expectation that Cu with spin 1/2 will dilute the magnetic moments contributed by Fe with a larger spin, we find that the 10% Cu doping enlarges the effective fluctuating moment from 2.85 to 3.13 $μ_{\rm B}$/Fe, although there is no long- or short-range magnetic order around (0.5, 0.5) and (0.5, 0). The presence of enhanced magnetic excitations in the 10% Cu doped sample which is in the insulating state indicates that the magnetic excitations must have some contributions from the local moments, reflecting the dual nature of the magnetism in iron-based superconductors. We attribute the substitution effects to the localization of the itinerant electrons induced by Cu dopants. These results also indicate that the Cu doping does not act as electron donor as in a rigid-band shift model, but more as scattering centers that localize the system.

preprint2022arXiv

Entanglement-Enhanced Quantum Metrology in Colored Noise by Quantum Zeno Effect

In open quantum systems, the precision of metrology inevitably suffers from the noise. {In Markovian open quantum dynamics, the precision can not be improved by using entangled probes although the measurement time is effectively shortened.} However, it was predicted over one decade ago that in a non-Markovian one, the error can be significantly reduced by the quantum Zeno effect (QZE) [Chin, Huelga, and Plenio, Phys. Rev. Lett. \textbf{109}, 233601 (2012)]. In this work, we apply a recently-developed quantum simulation approach to experimentally verify that entangled probes can improve the precision of metrology by the QZE. Up to $n=7$ qubits, we demonstrate that the precision has been improved by a factor of $n^{1/4}$, which is consistent with the theoretical prediction. Our quantum simulation approach may provide an intriguing platform for experimental verification of various quantum metrology schemes.

preprint2022arXiv

Experimental quantum simulation of non-Hermitian dynamical topological states using stochastic Schrödinger equation

Noise is ubiquitous in real quantum systems, leading to non-Hermitian quantum dynamics, and may affect the fundamental states of matter. Here we report in experiment a quantum simulation of the two-dimensional non-Hermitian quantum anomalous Hall (QAH) model using the nuclear magnetic resonance processor. Unlike the usual experiments using auxiliary qubits, we develop a stochastic average approach based on the stochastic Schrödinger equation to realize the non-Hermitian dissipative quantum dynamics, which has advantages in saving the quantum simulation sources and simplifies implementation of quantum gates. We demonstrate the stability of dynamical topology against weak noise, and observe two types of dynamical topological transitions driven by strong noise. Moreover, a region that the emergent topology is always robust regardless of the noise strength is observed. Our work shows a feasible quantum simulation approach for dissipative quantum dynamics with stochastic Schrödinger equation and opens a route to investigate non-Hermitian dynamical topological physics.

preprint2022arXiv

Experimental Realization of a Quantum Refrigerator Driven by Indefinite Causal Orders

Indefinite causal order (ICO) is playing a key role in recent quantum technologies. Here, we experimentally study quantum thermodynamics driven by ICO on nuclear spins using the nuclear magnetic resonance system. We realize the ICO of two thermalizing channels to exhibit how the mechanism works, and show that the working substance can be cooled or heated albeit it undergoes thermal contacts with reservoirs of the same temperature. Moreover, we construct a single cycle of the ICO refrigerator based on the Maxwell's demon mechanism, and evaluate its performance by measuring the work consumption and the heat energy extracted from the low-temperature reservoir. Unlike classical refrigerators in which the coefficient of performance (COP) is perversely higher the closer the temperature of the high-temperature and low-temperature reservoirs are to each other, the ICO refrigerator's COP is always bounded to small values due to the non-unit success probability in projecting the ancillary qubit to the preferable subspace. To enhance the COP, we propose and experimentally demonstrate a general framework based on the density matrix exponentiation (DME) approach, as an extension to the ICO refrigeration. The COP is observed to be enhanced by more than three times with the DME approach. Our work demonstrates a new way for non-classical heat exchange, and paves the way towards construction of quantum refrigerators on a quantum system.

preprint2022arXiv

Federated Learning-Based Localization with Heterogeneous Fingerprint Database

Fingerprint-based localization plays an important role in indoor location-based services, where the position information is usually collected in distributed clients and gathered in a centralized server. However, the overloaded transmission as well as the potential risk of divulging private information burdens the application.Owning the ability to address these challenges, federated learning (FL)-based fingerprinting localization comes into people's sights, which aims to train a global model while keeping raw data locally. However, in distributed machine learning (ML) scenarios, the unavoidable database heterogeneity usually degrades the performance of existing FL-based localization algorithm (FedLoc). In this paper, we first characterize the database heterogeneity with a computable metric, i.e., the area of convex hull, and verify it by experimental results. Then, a novel heterogeneous FL-based localization algorithm with the area of convex hull-based aggregation (FedLoc-AC) is proposed. Extensive experimental results, including real-word cases are conducted. We can conclude that the proposed FedLoc-AC can achieve an obvious prediction gain compared to FedLoc in heterogeneous scenarios and has almost the same prediction error with it in homogeneous scenarios. Moreover, the extension of FedLoc-AC in multi-floor cases is proposed and verified.

preprint2022arXiv

Finite Sample t-Tests for High-Dimensional Means

Size distortion can occur if an asymptotic testing procedure requiring diverging sample sizes, is implemented to data with very small sample sizes. In this paper, we consider one-sample and two-sample tests for mean vectors when data are high-dimensional but sample sizes are very small. We establish asymptotic t-distributions of one-sample and two-sample U-statistics, which only require data dimensionality to diverge but sample sizes to be fixed and no less than 3. Simulation studies confirm the theoretical results that the proposed tests maintain accurate empirical sizes for a wide range of sample sizes and data dimensionalities. We apply the proposed tests to an fMRI dataset to demonstrate the practical implementation of the methods.

preprint2022arXiv

Fractional and composite excitations of antiferromagnetic quantum spin trimer chains

Using quantum Monte Carlo, exact diagonalization and perturbation theory, we study the spectrum of the $S=1/2$ antiferromagnetic Heisenberg trimer chain by varying the ratio $g=J_2/J_1$ of the intertrimer and intratrimer coupling strengths. The doublet ground states of trimers form effective interacting $S=1/2$ degrees of freedom described by a Heisenberg chain. Therefore, the conventional two-spinon continuum of width $\propto J_1$ when $g=1$ evolves into to a similar continuum of width $\propto J_2$ when $g\to 0$. The intermediate-energy and high-energy modes are termed \emph{doublons} and \emph{quartons} which fractionalize with increasing $g$ to form the conventional spinon continuum. In particular, at $g \approx 0.716$, the gap between the low-energy spinon branch and the high-energy band with mixed doublons, quartons, and spinons closes. These features should be observable in inelastic neutron scattering experiments if a quasi-one-dimensional quantum magnet with the linear trimer structure and $J_2<J_1$ can be identified. Our results may open a window for exploring the high-energy fractional excitations.

preprint2022arXiv

Generalized Donaldson-Thomas Invariants via Kirwan Blowups

We develop a virtual cycle approach towards generalized Donaldson-Thomas theory of Calabi-Yau threefolds. Let $\mathcal{M}$ be the moduli stack of Gieseker semistable sheaves of fixed topological type on a Calabi-Yau threefold $W$. We construct an associated Deligne-Mumford stack $\widetilde{\mathcal{M}}$ with an induced semi-perfect obstruction theory of virtual dimension zero and define the generalized Donaldson-Thomas invariant of $W$ via Kirwan blowups to be the degree of the virtual cycle $[\widetilde{\mathcal{M}}]^{\mathrm{vir}}$. We show that it is invariant under deformations of the complex structure of $W$.

preprint2022arXiv

Global Attention-based Encoder-Decoder LSTM Model for Temperature Prediction of Permanent Magnet Synchronous Motors

Temperature monitoring is critical for electrical motors to determine if device protection measures should be executed. However, the complexity of the internal structure of Permanent Magnet Synchronous Motors (PMSM) makes the direct temperature measurement of the internal components difficult. This work pragmatically develops three deep learning models to estimate the PMSMs&#39; internal temperature based on readily measurable external quantities. The proposed supervised learning models exploit Long Short-Term Memory (LSTM) modules, bidirectional LSTM, and attention mechanism to form encoder-decoder structures to predict simultaneously the temperatures of the stator winding, tooth, yoke, and permanent magnet. Experiments were conducted in an exhaustive manner on a benchmark dataset to verify the proposed models&#39; performances. The comparative analysis shows that the proposed global attention-based encoder-decoder (EnDec) model provides a competitive overall performance of 1.72 Mean Squared Error (MSE) and 5.34 Mean Absolute Error (MAE).

preprint2022arXiv

Industrial Style Transfer with Large-scale Geometric Warping and Content Preservation

We propose a novel style transfer method to quickly create a new visual product with a nice appearance for industrial designers&#39; reference. Given a source product, a target product, and an art style image, our method produces a neural warping field that warps the source shape to imitate the geometric style of the target and a neural texture transformation network that transfers the artistic style to the warped source product. Our model, Industrial Style Transfer (InST), consists of large-scale geometric warping (LGW) and interest-consistency texture transfer (ICTT). LGW aims to explore an unsupervised transformation between the shape masks of the source and target products for fitting large-scale shape warping. Furthermore, we introduce a mask smoothness regularization term to prevent the abrupt changes of the details of the source product. ICTT introduces an interest regularization term to maintain important contents of the warped product when it is stylized by using the art style image. Extensive experimental results demonstrate that InST achieves state-of-the-art performance on multiple visual product design tasks, e.g., companies&#39; snail logos and classical bottles (please see Fig. 1). To the best of our knowledge, we are the first to extend the neural style transfer method to create industrial product appearances. Project page: \ulr{https://jcyang98.github.io/InST/home.html}. Code available at: \url{https://github.com/jcyang98/InST}.

preprint2022arXiv

Kernel Attention Transformer (KAT) for Histopathology Whole Slide Image Classification

Transformer has been widely used in histopathology whole slide image (WSI) classification for the purpose of tumor grading, prognosis analysis, etc. However, the design of token-wise self-attention and positional embedding strategy in the common Transformer limits the effectiveness and efficiency in the application to gigapixel histopathology images. In this paper, we propose a kernel attention Transformer (KAT) for histopathology WSI classification. The information transmission of the tokens is achieved by cross-attention between the tokens and a set of kernels related to a set of positional anchors on the WSI. Compared to the common Transformer structure, the proposed KAT can better describe the hierarchical context information of the local regions of the WSI and meanwhile maintains a lower computational complexity. The proposed method was evaluated on a gastric dataset with 2040 WSIs and an endometrial dataset with 2560 WSIs, and was compared with 6 state-of-the-art methods. The experimental results have demonstrated the proposed KAT is effective and efficient in the task of histopathology WSI classification and is superior to the state-of-the-art methods. The code is available at https://github.com/zhengyushan/kat.

preprint2022arXiv

Lesion-Aware Contrastive Representation Learning for Histopathology Whole Slide Images Analysis

Local representation learning has been a key challenge to promote the performance of the histopathological whole slide images analysis. The previous representation learning methods followed the supervised learning paradigm. However, manual annotation for large-scale WSIs is time-consuming and labor-intensive. Hence, the self-supervised contrastive learning has recently attracted intensive attention. The present contrastive learning methods treat each sample as a single class, which suffers from class collision problems, especially in the domain of histopathology image analysis. In this paper, we proposed a novel contrastive representation learning framework named Lesion-Aware Contrastive Learning (LACL) for histopathology whole slide image analysis. We built a lesion queue based on the memory bank structure to store the representations of different classes of WSIs, which allowed the contrastive model to selectively define the negative pairs during the training. Moreover, We designed a queue refinement strategy to purify the representations stored in the lesion queue. The experimental results demonstrate that LACL achieves the best performance in histopathology image representation learning on different datasets, and outperforms state-of-the-art methods under different WSI classification benchmarks. The code is available at https://github.com/junl21/lacl.

preprint2022arXiv

Lightweight Projective Derivative Codes for Compressed Asynchronous Gradient Descent

Coded distributed computation has become common practice for performing gradient descent on large datasets to mitigate stragglers and other faults. This paper proposes a novel algorithm that encodes the partial derivatives themselves and furthermore optimizes the codes by performing lossy compression on the derivative codewords by maximizing the information contained in the codewords while minimizing the information between the codewords. The utility of this application of coding theory is a geometrical consequence of the observed fact in optimization research that noise is tolerable, sometimes even helpful, in gradient descent based learning algorithms since it helps avoid overfitting and local minima. This stands in contrast with much current conventional work on distributed coded computation which focuses on recovering all of the data from the workers. A second further contribution is that the low-weight nature of the coding scheme allows for asynchronous gradient updates since the code can be iteratively decoded; i.e., a worker&#39;s task can immediately be updated into the larger gradient. The directional derivative is always a linear function of the direction vectors; thus, our framework is robust since it can apply linear coding techniques to general machine learning frameworks such as deep neural networks.

preprint2022arXiv

MC-UNet Multi-module Concatenation based on U-shape Network for Retinal Blood Vessels Segmentation

Accurate segmentation of the blood vessels of the retina is an important step in clinical diagnosis of ophthalmic diseases. Many deep learning frameworks have come up for retinal blood vessels segmentation tasks. However, the complex vascular structure and uncertain pathological features make the blood vessel segmentation still very challenging. A novel U-shaped network named Multi-module Concatenation which is based on Atrous convolution and multi-kernel pooling is put forward to retinal vessels segmentation in this paper. The proposed network structure retains three layers the essential structure of U-Net, in which the atrous convolution combining the multi-kernel pooling blocks are designed to obtain more contextual information. The spatial attention module is concatenated with dense atrous convolution module and multi-kernel pooling module to form a multi-module concatenation. And different dilation rates are selected by cascading to acquire a larger receptive field in atrous convolution. Adequate comparative experiments are conducted on these public retinal datasets: DRIVE, STARE and CHASE_DB1. The results show that the proposed method is effective, especially for microvessels. The code will be put out at https://github.com/Rebeccala/MC-UNet

preprint2022arXiv

Measuring Changes in Regional Network Traffic Due to COVID-19 Stay-at-Home Measures

During the 2020 pandemic caused by the COVID-19 virus, many countries implemented stay-at-home measures, which led to many businesses and schools moving from in-person to online mode of operation. We analyze sampled Netflow records at a medium-sized US Regional Optical Network to quantify the changes in the network traffic due to stay-at-home measures in that region. We find that human-driven traffic in the network decreases to around 70%, and mostly shifts to local ISPs, while VPN and online meeting traffic increases up to 5 times. We also find that networks adopt a variety of online meeting solutions and favor one but continue using a few others. We find that educational and government institutions experience large traffic changes, but aim to keep their productivity via increased online meetings. Some scientific traffic also reduces possibly leading to loss of research productivity. Businesses mostly lose their traffic and few show VPN or online meeting activity. Most network prefixes experience large loss of live addresses but a handful increase their liveness. We also find increased incidence of network attacks. Our findings can help plan network provisioning and management to prepare for future possible infection outbreaks and natural disasters.

preprint2022arXiv

Measuring the modified gravitational waves propagation beyond general relativity from CMB observations

In modified gravity theories, the gravitational waves propagation are presented in nonstandard ways. We consider a friction term different from GR and constrain the modified gravitational waves propagation from observations. The modified gravitational waves produce anisotropies and polarization which generate measurable tensor power spectra. We explore the impact of the friction term on the power spectrum of B-modes and the impact on the constraints on the other parameters (e.g., $r$ or $A_t$) when $ν_0$ is allowed to vary in the Monte Carlo analyses from Planck+BK18 datasets. If we assume the result of the scalar perturbations is unchanged, the inflation consistency relation alters with the friction term. In the $Λ$CDM+$r$+$ν_0$ model, the tensor-to-scalar ratio and the amplitude of tensor spectrum are influenced obviously.

preprint2022arXiv

Measuring the primordial gravitational waves from cosmic microwave background and stochastic gravitational wave background observations

We constrain the primordial gravitational waves from cosmic microwave background (CMB) and stochastic gravitational wave background (SGWB) observations. SGWB provides the latest way to explore the early universe and the cosmological evolution which can be reflected by primordial gravitational waves. We not only combine LIGO observations with CMB to measure primordial gravitational waves, but also forecast the potential abilities of the LISA detector and PTA projects. In the $Λ$CDM+$r$+$n_t$ model, the standard six parameters change slightly from SGWB observations. While the constraints on tensor-to-scalar ratio and tensor spectral index are improved obviously from SGWB observations. FAST projects have a significant impact on tensor-to-scalar ratio and tensor spectral index, namely $r<0.028$ and $n_t=-0.41^{+0.64}_{-0.96}$ at $95\%$ confidence level.

preprint2022arXiv

Mix-Teaching: A Simple, Unified and Effective Semi-Supervised Learning Framework for Monocular 3D Object Detection

Monocular 3D object detection is an essential perception task for autonomous driving. However, the high reliance on large-scale labeled data make it costly and time-consuming during model optimization. To reduce such over-reliance on human annotations, we propose Mix-Teaching, an effective semi-supervised learning framework applicable to employ both labeled and unlabeled images in training stage. Mix-Teaching first generates pseudo-labels for unlabeled images by self-training. The student model is then trained on the mixed images possessing much more intensive and precise labeling by merging instance-level image patches into empty backgrounds or labeled images. This is the first to break the image-level limitation and put high-quality pseudo labels from multi frames into one image for semi-supervised training. Besides, as a result of the misalignment between confidence score and localization quality, it&#39;s hard to discriminate high-quality pseudo-labels from noisy predictions using only confidence-based criterion. To that end, we further introduce an uncertainty-based filter to help select reliable pseudo boxes for the above mixing operation. To the best of our knowledge, this is the first unified SSL framework for monocular 3D object detection. Mix-Teaching consistently improves MonoFlex and GUPNet by significant margins under various labeling ratios on KITTI dataset. For example, our method achieves around +6.34% AP@0.7 improvement against the GUPNet baseline on validation set when using only 10% labeled data. Besides, by leveraging full training set and the additional 48K raw images of KITTI, it can further improve the MonoFlex by +4.65% improvement on AP@0.7 for car detection, reaching 18.54% AP@0.7, which ranks the 1st place among all monocular based methods on KITTI test leaderboard. The code and pretrained models will be released at https://github.com/yanglei18/Mix-Teaching.

preprint2022arXiv

MixCL: Pixel label matters to contrastive learning

Contrastive learning and self-supervised techniques have gained prevalence in computer vision for the past few years. It is essential for medical image analysis, which is often notorious for its lack of annotations. Most existing self-supervised methods applied in natural imaging tasks focus on designing proxy tasks for unlabeled data. For example, contrastive learning is often based on the fact that an image and its transformed version share the same identity. However, pixel annotations contain much valuable information for medical image segmentation, which is largely ignored in contrastive learning. In this work, we propose a novel pre-training framework called Mixed Contrastive Learning (MixCL) that leverages both image identities and pixel labels for better modeling by maintaining identity consistency, label consistency, and reconstruction consistency together. Consequently, thus pre-trained model has more robust representations that characterize medical images. Extensive experiments demonstrate the effectiveness of the proposed method, improving the baseline by 5.28% and 14.12% in Dice coefficient when 5% labeled data of Spleen and 15% of BTVC are used in fine-tuning, respectively.

preprint2022arXiv

Multi-Modal Masked Pre-Training for Monocular Panoramic Depth Completion

In this paper, we formulate a potentially valuable panoramic depth completion (PDC) task as panoramic 3D cameras often produce 360° depth with missing data in complex scenes. Its goal is to recover dense panoramic depths from raw sparse ones and panoramic RGB images. To deal with the PDC task, we train a deep network that takes both depth and image as inputs for the dense panoramic depth recovery. However, it needs to face a challenging optimization problem of the network parameters due to its non-convex objective function. To address this problem, we propose a simple yet effective approach termed M{^3}PT: multi-modal masked pre-training. Specifically, during pre-training, we simultaneously cover up patches of the panoramic RGB image and sparse depth by shared random mask, then reconstruct the sparse depth in the masked regions. To our best knowledge, it is the first time that we show the effectiveness of masked pre-training in a multi-modal vision task, instead of the single-modal task resolved by masked autoencoders (MAE). Different from MAE where fine-tuning completely discards the decoder part of pre-training, there is no architectural difference between the pre-training and fine-tuning stages in our M$^{3}$PT as they only differ in the prediction density, which potentially makes the transfer learning more convenient and effective. Extensive experiments verify the effectiveness of M{^3}PT on three panoramic datasets. Notably, we improve the state-of-the-art baselines by averagely 26.2% in RMSE, 51.7% in MRE, 49.7% in MAE, and 37.5% in RMSElog on three benchmark datasets.

preprint2022arXiv

Nested Collaborative Learning for Long-Tailed Visual Recognition

The networks trained on the long-tailed dataset vary remarkably, despite the same training settings, which shows the great uncertainty in long-tailed learning. To alleviate the uncertainty, we propose a Nested Collaborative Learning (NCL), which tackles the problem by collaboratively learning multiple experts together. NCL consists of two core components, namely Nested Individual Learning (NIL) and Nested Balanced Online Distillation (NBOD), which focus on the individual supervised learning for each single expert and the knowledge transferring among multiple experts, respectively. To learn representations more thoroughly, both NIL and NBOD are formulated in a nested way, in which the learning is conducted on not just all categories from a full perspective but some hard categories from a partial perspective. Regarding the learning in the partial perspective, we specifically select the negative categories with high predicted scores as the hard categories by using a proposed Hard Category Mining (HCM). In the NCL, the learning from two perspectives is nested, highly related and complementary, and helps the network to capture not only global and robust features but also meticulous distinguishing ability. Moreover, self-supervision is further utilized for feature enhancement. Extensive experiments manifest the superiority of our method with outperforming the state-of-the-art whether by using a single model or an ensemble.

preprint2022arXiv

Nonlinear Optimal Guidance for Fixed-Time Impact on a Stationary Target

This paper is concerned with devising the nonlinear optimal guidance for intercepting a stationary target with a fixed impact time. According to Pontryagin&#39;s Maximum Principle (PMP), some optimality conditions for the solutions of the nonlinear optimal interception problem are established, and the structure of the corresponding optimal control is presented. By employing the optimality conditions, we formulate a parameterized system so that its solution space is the same as that of the nonlinear optimal interception problem. As a consequence, a simple propagation of the parameterized system, without using any optimization method, is sufficient to generate enough sampled data for the mapping from current state and time-to-go to the optimal guidance command. By virtue of the universal approximation theorem, a feedforward neural network, trained by the generated data, is able to represent the mapping from current state and time-to-go to the optimal guidance command. Therefore, the trained network eventually can generate fixed-impact-time nonlinear optimal guidance within a constant time. Finally, the developed nonlinear optimal guidance is exemplified and studied through simulations, showing that the nonlinear optimal guidance law performs better than existing interception guidance laws.

preprint2022arXiv

Novel Valence Transition in Elemental Metal Europium around 80 GPa

Valence transition could induce structural, insulator-metal, nonmagnetic-magnetic and superconducting transitions in rare-earth metals and compounds, while the underlying physics remains unclear due to the complex interaction of localized 4f electrons as well as their coupling with itinerant electrons. The valence transition in the elemental metal europium (Eu) still has remained as a matter of debate. Using resonant x-ray emission scattering and x-ray diffraction, we pressurize the states of 4f electrons in Eu and study its valence and structure transitions up to 160 GPa. We provide compelling evidence for a valence transition around 80 GPa, which coincides with a structural transition from a monoclinic (C2/c) to an orthorhombic phase (Pnma). We show that the valence transition occurs when the pressure-dependent energy gap between 4f and 5d electrons approaches the Coulomb interaction. Our discovery is critical for understanding the electrodynamics of Eu, including magnetism and high-pressure superconductivity.

preprint2022arXiv

On Nonlocal Cohesive Continuum Mechanics and Cohesive Peridynamic Modeling (CPDM) of Inelastic Fracture

In this work, we developed a bond-based cohesive peridynamics model (CPDM) and apply it to simulate inelastic fracture by using the meso-scale Xu-Needleman cohesive potential . By doing so, we have successfully developed a bond-based cohesive continuum mechanics model with intrinsic stress/strain measures as well as consistent and built-in macro-scale constitutive relations. The main novelties of this work are: (1) We have shown that the cohesive stress of the proposed nonlocal cohesive continuum mechanics model is exactly the same as the nonlocal peridynamic stress; (2) For the first time, we have applied an irreversible built-in cohesive stress-strain relation in a bond-based cohesive peridynamics to model inelastic material behaviors without prescribing phenomenological plasticity stress-strain relations; (3) The cohesive bond force possesses both axial and tangential components, and they contribute a nonlinear constitutive relation with variable Poisson&#39;s ratios; (4) The bond-based cohesive constitutive model is consistent with the cohesive fracture criterion, and (5) We have shown that the proposed method is able to model inelastic fracture and simulate ductile fracture of small scale yielding in the nonlocal cohesive continua. Several numerical examples have been presented to be compared with the finite element based continuum cohesive zone model, which shows that the proposed approach is a simple, efficient and effective method to model inelastic fracture in the nonlocal cohesive media.

preprint2022arXiv

On the blowup mechanism of smooth solutions to 1D quasilinear strictly hyperbolic systems with large initial data

For the first order 1D $n\times n$ quasilinear strictly hyperbolic system $\partial_tu+F(u)\partial_xu=0$ with $u(x, 0)=\varepsilon u_0(x)$, where $\varepsilon>0$ is small, $u_0(x)\not\equiv 0$ and $u_0(x)\in C_0^2(\mathbb R)$, when at least one eigenvalue of $F(u)$ is genuinely nonlinear, it is well-known that on the finite blowup time $T_{\varepsilon}$, the derivatives $\partial_{t,x}u$ blow up while the solution $u$ keeps to be small. For the 1D scalar equation or $2\times 2$ strictly hyperbolic system (corresponding to $n=1, 2$), if the smooth solution $u$ blows up in finite time, then the blowup mechanism can be well understood (i.e., only the blowup of $\partial_{t,x}u$ happens). In the present paper, for the $n\times n$ ($n\geq 3$) strictly hyperbolic system with a class of large initial data, we are concerned with the blowup mechanism of smooth solution $u$ on the finite blowup time and the detailed singularity behaviours of $\partial_{t,x}u$ near the blowup point. Our results are based on the efficient decomposition of $u$ along the different characteristic directions, the suitable introduction of the modulated coordinates and the global weighted energy estimates.

preprint2022arXiv

Optical Remote Sensing Image Understanding with Weak Supervision: Concepts, Methods, and Perspectives

In recent years, supervised learning has been widely used in various tasks of optical remote sensing image understanding, including remote sensing image classification, pixel-wise segmentation, change detection, and object detection. The methods based on supervised learning need a large amount of high-quality training data and their performance highly depends on the quality of the labels. However, in practical remote sensing applications, it is often expensive and time-consuming to obtain large-scale data sets with high-quality labels, which leads to a lack of sufficient supervised information. In some cases, only coarse-grained labels can be obtained, resulting in the lack of exact supervision. In addition, the supervised information obtained manually may be wrong, resulting in a lack of accurate supervision. Therefore, remote sensing image understanding often faces the problems of incomplete, inexact, and inaccurate supervised information, which will affect the breadth and depth of remote sensing applications. In order to solve the above-mentioned problems, researchers have explored various tasks in remote sensing image understanding under weak supervision. This paper summarizes the research progress of weakly supervised learning in the field of remote sensing, including three typical weakly supervised paradigms: 1) Incomplete supervision, where only a subset of training data is labeled; 2) Inexact supervision, where only coarse-grained labels of training data are given; 3) Inaccurate supervision, where the labels given are not always true on the ground.

preprint2022arXiv

Pancreas segmentation with probabilistic map guided bi-directional recurrent UNet

Pancreas segmentation in medical imaging data is of great significance for clinical pancreas diagnostics and treatment. However, the large population variations in the pancreas shape and volume cause enormous segmentation difficulties, even for state-of-the-art algorithms utilizing fully-convolutional neural networks (FCNs). Specifically, pancreas segmentation suffers from the loss of spatial information in 2D methods, and the high computational cost of 3D methods. To alleviate these problems, we propose a probabilistic-map-guided bi-directional recurrent UNet (PBR-UNet) architecture, which fuses intra-slice information and inter-slice probabilistic maps into a local 3D hybrid regularization scheme, which is followed by bi-directional recurrent network optimization. The PBR-UNet method consists of an initial estimation module for efficiently extracting pixel-level probabilistic maps and a primary segmentation module for propagating hybrid information through a 2.5D U-Net architecture. Specifically, local 3D information is inferred by combining an input image with the probabilistic maps of the adjacent slices into multichannel hybrid data, and then hierarchically aggregating the hybrid information of the entire segmentation network. Besides, a bi-directional recurrent optimization mechanism is developed to update the hybrid information in both the forward and the backward directions. This allows the proposed network to make full and optimal use of the local context information. Quantitative and qualitative evaluation was performed on the NIH Pancreas-CT dataset, and our proposed PBR-UNet method achieved better segmentation results with less computational cost compared to other state-of-the-art methods.

preprint2022arXiv

Path Planning for the Dynamic UAV-Aided Wireless Systems using Monte Carlo Tree Search

For UAV-aided wireless systems, online path planning attracts much attention recently. To better adapt to the real-time dynamic environment, we, for the first time, propose a Monte Carlo Tree Search (MCTS)-based path planning scheme. In details, we consider a single UAV acts as a mobile server to provide computation tasks offloading services for a set of mobile users on the ground, where the movement of ground users follows a Random Way Point model. Our model aims at maximizing the average throughput under energy consumption and user fairness constraints, and the proposed timesaving MCTS algorithm can further improve the performance. Simulation results show that the proposed algorithm achieves a larger average throughput and a faster convergence performance compared with the baseline algorithms of Q-learning and Deep Q-Network.

preprint2022arXiv

Performance Analysis of Wireless Network Aided by Discrete-Phase-Shifter IRS

Discrete phase shifters of intelligent reflecting surface (IRS) generates phase quantization error (QE) and degrades the receive performance at the receiver. To make an analysis of the performance loss caused by IRS with phase QE, based on the law of large numbers, the closed-form expressions of signal-to-noise ratio (SNR) performance loss (PL), achievable rate (AR), and bit error rate (BER) are successively derived under line-of-sight (LoS) channels and Rayleigh channels. Moreover, based on the Taylor series expansion, the approximate simple closed form of PL of IRS with approximate QE is also given. The simulation results show that the performance losses of SNR and AR decrease as the number of quantization bits increase, while they gradually increase with the number of IRS phase shifter elements increase. Regardless of LoS channels or Rayleigh channels, when the number of quantization bits is larger than or equal to 3, the performance losses of SNR and AR are less than 0.23dB and 0.08bits/s/Hz, respectively, and the BER performance degradation is trivial. In particular, the performance loss difference between IRS with QE and IRS with approximate QE is negligible when the number of quantization bits is not less than 2.

preprint2022arXiv

Peridynamic stress is the static first Piola-Kirchhoff Virial stress

The peridynamic stress formula proposed by Lehoucq and Silling [1, 2] is cumbersome to be implemented in numerical computations. Here, we show that the peridynamic stress tensor has the exact mathematical expression as that of the first Piola-Kirchhoff static Virial stress originated from Irving-Kirkwood-Noll formalism [3, 4] through the Hardy-Murdoch procedure [5, 6], which offers a simple and clear expression for numerical calculations of peridynamic stress. Several numerical verifications have been carried out to validate the accuracy of proposed peridynamic stress formula in predicting the stress states in the vicinity of the crack tip and other sources of stress concentration. The peridynamic stress is evaluated within the bond-based peridynamics with prototype microelastic brittle (PMB) material model. It is found that the PMB material model may exhibit nonlinear constitutive behaviors at large deformations. The stress fields calculated through the proposed peridynamic stress formula show good agreements with finite element analysis results, analytical solutions, and experimental data, demonstrating the promising potential of derived peridynamic stress formula in simulating the stress states of problems with discontinuities, especially in the bond-based peridynamics.

preprint2022arXiv

Providing Location Information at Edge Networks: A Federated Learning-Based Approach

Recently, the development of mobile edge computing has enabled exhilarating edge artificial intelligence (AI) with fast response and low communication cost. The location information of edge devices is essential to support the edge AI in many scenarios, like smart home, intelligent transportation systems and integrated health care. Taking advantages of deep learning intelligence, the centralized machine learning (ML)-based positioning technique has received heated attention from both academia and industry. However, some potential issues, such as location information leakage and huge data traffic, limit its application. Fortunately, a newly emerging privacy-preserving distributed ML mechanism, named federated learning (FL), is expected to alleviate these concerns. In this article, we illustrate a framework of FL-based localization system as well as the involved entities at edge networks. Moreover, the advantages of such system are elaborated. On practical implementation of it, we investigate the field-specific issues associated with system-level solutions, which are further demonstrated over a real-word database. Moreover, future challenging open problems in this field are outlined.

preprint2022arXiv

Quantum Control for Time-dependent Noise by Inverse Geometric Optimization

Quantum systems are exceedingly difficult to engineer because they are sensitive to various types of noises. In particular, time-dependent noises are frequently encountered in experiments but how to overcome them remains a challenging problem. In this work, we extend and apply the recently proposed robust control technique of inverse geometric optimization to time-dependent noises by working it in the filter-function formalism. The basic idea is to parameterize the control filter function geometrically and minimize its overlap with the noise spectral density. This then effectively reduces the noise susceptibility of the controlled system evolution. We show that the proposed method can produce high-quality robust pulses for realizing desired quantum evolutions under realistic noise models, and thus will find practical applications for current physical platforms.

preprint2022arXiv

Regularized Covariance Estimation for Polarization Radar Detection in Compound Gaussian Sea Clutter

This paper investigates regularized estimation of Kronecker-structured covariance matrices (CM) for polarization radar in sea clutter scenarios where the data are assumed to follow the complex, elliptically symmetric (CES) distributions with a Kronecker-structured CM. To obtain a well-conditioned estimate of the CM, we add penalty terms of Kullback-Leibler divergence to the negative log-likelihood function of the associated complex angular Gaussian (CAG) distribution. This is shown to be equivalent to regularizing Tyler&#39;s fixed-point equations by shrinkage. A sufficient condition that the solution exists is discussed. An iterative algorithm is applied to solve the resulting fixed-point iterations and its convergence is proved. In order to solve the critical problem of tuning the shrinkage factors, we then introduce two methods by exploiting oracle approximating shrinkage (OAS) and cross-validation (CV). The proposed estimator, referred to as the robust shrinkage Kronecker estimator (RSKE), is shown to achieve better performance compared with several existing methods when the training samples are limited. Simulations are conducted for validating the RSKE and demonstrating its high performance by using the IPIX 1998 real sea data.

preprint2022arXiv

RigNet: Repetitive Image Guided Network for Depth Completion

Depth completion deals with the problem of recovering dense depth maps from sparse ones, where color images are often used to facilitate this task. Recent approaches mainly focus on image guided learning frameworks to predict dense depth. However, blurry guidance in the image and unclear structure in the depth still impede the performance of the image guided frameworks. To tackle these problems, we explore a repetitive design in our image guided network to gradually and sufficiently recover depth values. Specifically, the repetition is embodied in both the image guidance branch and depth generation branch. In the former branch, we design a repetitive hourglass network to extract discriminative image features of complex environments, which can provide powerful contextual instruction for depth prediction. In the latter branch, we introduce a repetitive guidance module based on dynamic convolution, in which an efficient convolution factorization is proposed to simultaneously reduce its complexity and progressively model high-frequency structures. Extensive experiments show that our method achieves superior or competitive results on KITTI benchmark and NYUv2 dataset.

preprint2022arXiv

Robust quantum control for the manipulation of solid-state spins

Robust and high-fidelity control of electron spins in solids is the cornerstone for facilitating applications of solid-state spins in quantum information processing and quantum sensing. However, precise control of spin systems is always challenging due to the presence of a variety of noises originating from the environment and control fields. Herein, noise-resilient quantum gates, designed with robust optimal control (ROC) algorithms, are demonstrated experimentally with nitrogen-vacancy (NV) centers in diamond to realize tailored robustness against detunings and Rabi errors simultaneously. In the presence of both 10% off-resonant detuning and deviation of a Rabi frequency, we achieve an average single-qubit gate fidelity of up to 99.97%. Our experiments also show that, ROCbased multipulse quantum sensing sequences can suppress spurious responses resulting from finite widths and imperfections of microwave pulses, which provides an efficient strategy for enhancing the performance of existing multipulse quantum sensing sequences.

preprint2022arXiv

RRNet: Relational Reasoning Network with Parallel Multi-scale Attention for Salient Object Detection in Optical Remote Sensing Images

Salient object detection (SOD) for optical remote sensing images (RSIs) aims at locating and extracting visually distinctive objects/regions from the optical RSIs. Despite some saliency models were proposed to solve the intrinsic problem of optical RSIs (such as complex background and scale-variant objects), the accuracy and completeness are still unsatisfactory. To this end, we propose a relational reasoning network with parallel multi-scale attention for SOD in optical RSIs in this paper. The relational reasoning module that integrates the spatial and the channel dimensions is designed to infer the semantic relationship by utilizing high-level encoder features, thereby promoting the generation of more complete detection results. The parallel multi-scale attention module is proposed to effectively restore the detail information and address the scale variation of salient objects by using the low-level features refined by multi-scale attention. Extensive experiments on two datasets demonstrate that our proposed RRNet outperforms the existing state-of-the-art SOD competitors both qualitatively and quantitatively.

preprint2022arXiv

Semi-Data-Aided Channel Estimation for MIMO Systems via Reinforcement Learning

Data-aided channel estimation is a promising solution to improve channel estimation accuracy by exploiting data symbols as pilot signals for updating an initial channel estimate. In this paper, we propose a semi-data-aided channel estimator for multiple-input multiple-output communication systems. Our strategy is to leverage reinforcement learning (RL) for selecting reliable detected symbols among the symbols in the first part of transmitted data block. This strategy facilitates an update of the channel estimate before the end of data block transmission and therefore achieves a significant reduction in communication latency compared to conventional data-aided channel estimation approaches. Towards this end, we first define a Markov decision process (MDP) which sequentially decides whether to use each detected symbol as an additional pilot signal. We then develop an RL algorithm to efficiently find the best policy of the MDP based on a Monte Carlo tree search approach. In this algorithm, we exploit the a-posteriori probability for approximating both the optimal future actions and the corresponding state transitions of the MDP and derive a closed-form expression for the best policy. Simulation results demonstrate that the proposed channel estimator effectively mitigates both channel estimation error and detection performance loss caused by insufficient pilot signals.

preprint2022arXiv

SIND: A Drone Dataset at Signalized Intersection in China

Intersection is one of the most challenging scenarios for autonomous driving tasks. Due to the complexity and stochasticity, essential applications (e.g., behavior modeling, motion prediction, safety validation, etc.) at intersections rely heavily on data-driven techniques. Thus, there is an intense demand for trajectory datasets of traffic participants (TPs) in intersections. Currently, most intersections in urban areas are equipped with traffic lights. However, there is not yet a large-scale, high-quality, publicly available trajectory dataset for signalized intersections. Therefore, in this paper, a typical two-phase signalized intersection is selected in Tianjin, China. Besides, a pipeline is designed to construct a Signalized INtersection Dataset (SIND), which contains 7 hours of recording including over 13,000 TPs with 7 types. Then, the behaviors of traffic light violations in SIND are recorded. Furthermore, the SIND is also compared with other similar works. The features of the SIND can be summarized as follows: 1) SIND provides more comprehensive information, including traffic light states, motion parameters, High Definition (HD) map, etc. 2) The category of TPs is diverse and characteristic, where the proportion of vulnerable road users (VRUs) is up to 62.6% 3) Multiple traffic light violations of non-motor vehicles are shown. We believe that SIND would be an effective supplement to existing datasets and can promote related research on autonomous driving.The dataset is available online via: https://github.com/SOTIF-AVLab/SinD

preprint2022arXiv

Squeezed light generated with hyperradiance without nonlinearity

We propose that the squeezed light accompanied by hyperradiance is induced by quantum interference in a linear system consisting of a high quality optical cavity and two coherently driven two-level qubits. When two qubits are placed at the crest and trough of the standing wave in the cavity respectively (i.e., they have the opposite coupling coefficient to the cavity), we show that squeezed light is generated in the hyperradiance regime under the conditions of strong coupling and weak driving. Simultaneously, the Klyshko&#39;s criterion alternates up and down at unity when the photon number is even or odd. Moreover, the orthogonal angles of the squeezed light can be controlled by adjusting the frequency detuning pressure between the driving field and the qubits. It can be implemented in a variety of quantum systems, including but not limited to two-level systems such as atoms, quantum dots in single-mode cavities.

preprint2022arXiv

Stacked conductive metal organic framework nanorods for high performance vacuum electronic devices

Metal-organic frameworks (MOFs) possessing many unique features have been utilized in several fields in recent years. However, their application in field emission (FE) vacuum electronic device is hindered by their poor electrical conductivity. Herein, a novel conductive MOF of Cu-catecholate (Cu-CAT) with the nanorod length of 200 nm and conductivity of 0.01 S/cm is grown on the graphite paper (GP). Under an applied electric field, a large number of electrons can be emitted from the nanoscale emitter tips of MOF surface to the anode. The great field emission performance of Cu-CAT@GP cold cathode film including a low turn-on field of 0.59e6 V/m and ultra-high field enhancement factor of 29622, even comparable to most carbon-based materials that have been widely investigated in FE studies, is achieved in this work. Meanwhile, Cu-CAT@GP film has a good electrical stability with a current attenuation of 9.4% in two hours. The findings reveal the cathode film fabricated by conductive MOF can be a promising candidate of cold electron source for vacuum electronic applications.

preprint2022arXiv

Temporal and Spatial Online Integrated Calibration for Camera and LiDAR

While camera and LiDAR are widely used in most of the assisted and autonomous driving systems, only a few works have been proposed to associate the temporal synchronization and extrinsic calibration for camera and LiDAR which are dedicated to online sensors data fusion. The temporal and spatial calibration technologies are facing the challenges of lack of relevance and real-time. In this paper, we introduce the pose estimation model and environmental robust line features extraction to improve the relevance of data fusion and instant online ability of correction. Dynamic targets eliminating aims to seek optimal policy considering the correspondence of point cloud matching between adjacent moments. The searching optimization process aims to provide accurate parameters with both computation accuracy and efficiency. To demonstrate the benefits of this method, we evaluate it on the KITTI benchmark with ground truth value. In online experiments, our approach improves the accuracy by 38.5\% than the soft synchronization method in temporal calibration. While in spatial calibration, our approach automatically corrects disturbance errors within 0.4 second and achieves an accuracy of 0.3-degree. This work can promote the research and application of sensor fusion.

preprint2022arXiv

Universal Segmentation of 33 Anatomies

In the paper, we present an approach for learning a single model that universally segments 33 anatomical structures, including vertebrae, pelvic bones, and abdominal organs. Our model building has to address the following challenges. Firstly, while it is ideal to learn such a model from a large-scale, fully-annotated dataset, it is practically hard to curate such a dataset. Thus, we resort to learn from a union of multiple datasets, with each dataset containing the images that are partially labeled. Secondly, along the line of partial labelling, we contribute an open-source, large-scale vertebra segmentation dataset for the benefit of spine analysis community, CTSpine1K, boasting over 1,000 3D volumes and over 11K annotated vertebrae. Thirdly, in a 3D medical image segmentation task, due to the limitation of GPU memory, we always train a model using cropped patches as inputs instead a whole 3D volume, which limits the amount of contextual information to be learned. To this, we propose a cross-patch transformer module to fuse more information in adjacent patches, which enlarges the aggregated receptive field for improved segmentation performance. This is especially important for segmenting, say, the elongated spine. Based on 7 partially labeled datasets that collectively contain about 2,800 3D volumes, we successfully learn such a universal model. Finally, we evaluate the universal model on multiple open-source datasets, proving that our model has a good generalization performance and can potentially serve as a solid foundation for downstream tasks.

preprint2021arXiv

A lightweight deep learning based cloud detection method for Sentinel-2A imagery fusing multi-scale spectral and spatial features

Clouds are a very important factor in the availability of optical remote sensing images. Recently, deep learning-based cloud detection methods have surpassed classical methods based on rules and physical models of clouds. However, most of these deep models are very large which limits their applicability and explainability, while other models do not make use of the full spectral information in multi-spectral images such as Sentinel-2. In this paper, we propose a lightweight network for cloud detection, fusing multi-scale spectral and spatial features (CDFM3SF) and tailored for processing all spectral bands in Sentinel- 2A images. The proposed method consists of an encoder and a decoder. In the encoder, three input branches are designed to handle spectral bands at their native resolution and extract multiscale spectral features. Three novel components are designed: a mixed depth-wise separable convolution (MDSC) and a shared and dilated residual block (SDRB) to extract multi-scale spatial features, and a concatenation and sum (CS) operation to fuse multi-scale spectral and spatial features with little calculation and no additional parameters. The decoder of CD-FM3SF outputs three cloud masks at the same resolution as input bands to enhance the supervision information of small, middle and large clouds. To validate the performance of the proposed method, we manually labeled 36 Sentinel-2A scenes evenly distributed over mainland China. The experiment results demonstrate that CD-FM3SF outperforms traditional cloud detection methods and state-of-theart deep learning-based methods in both accuracy and speed.

preprint2021arXiv

Cavity-Enhanced Atom-Photon Entanglement with Subsecond Lifetime

A cold atomic ensemble suits well for optical quantum memories, and its entanglement with a single photon forms the building block for quantum networks that give promise for many revolutionary applications. Efficiency and lifetime are among the most important figures of merit for a memory. In this paper, we report the realization of entanglement between an atomic ensemble and a single-photon with subsecond lifetime and high efficiency. We engineer dual control modes in a ring cavity to create entanglement and make use of 3-dimensional optical lattice to prolong memory lifetime. The memory efficiency is 38% for 0.1 second storage. We verify the atom-photon entanglement after 1 second storage by testing the Bell inequality with a result of $S=2.36\pm0.14$.

preprint2021arXiv

Covert Model Poisoning Against Federated Learning: Algorithm Design and Optimization

Federated learning (FL), as a type of distributed machine learning frameworks, is vulnerable to external attacks on FL models during parameters transmissions. An attacker in FL may control a number of participant clients, and purposely craft the uploaded model parameters to manipulate system outputs, namely, model poisoning (MP). In this paper, we aim to propose effective MP algorithms to combat state-of-the-art defensive aggregation mechanisms (e.g., Krum and Trimmed mean) implemented at the server without being noticed, i.e., covert MP (CMP). Specifically, we first formulate the MP as an optimization problem by minimizing the Euclidean distance between the manipulated model and designated one, constrained by a defensive aggregation rule. Then, we develop CMP algorithms against different defensive mechanisms based on the solutions of their corresponding optimization problems. Furthermore, to reduce the optimization complexity, we propose low complexity CMP algorithms with a slight performance degradation. In the case that the attacker does not know the defensive aggregation mechanism, we design a blind CMP algorithm, in which the manipulated model will be adjusted properly according to the aggregated model generated by the unknown defensive aggregation. Our experimental results demonstrate that the proposed CMP algorithms are effective and substantially outperform existing attack mechanisms.

preprint2021arXiv

Detection of genuine multipartite entanglement based on local sum uncertainty relations

Genuine multipartite entanglement (GME) offers more significant advantages in quantum information compared with entanglement. We propose a sufficient criterion for the detection of GME based on local sum uncertainty relations for chosen observables of subsystems. We apply the criterion to detect the GME properties of noisy $n$-partite W state when $n = 3, 4, 5$ and $6$, and find that the criterion can detect more noisy W states when $n$ ranges from 4 to 6. Moreover, the criterion is also used to detect the genuine entanglement of $3$-qutrit state. The result is stronger than that based on GME concurrence and fisher information.

preprint2021arXiv

Deterministic Time-Bin Entanglement between a Single Photon and an Atomic Ensemble

Hybrid matter-photon entanglement is the building block for quantum networks. It is very favorable if the entanglement can be prepared with a high probability. In this paper, we report the deterministic creation of entanglement between an atomic ensemble and a single photon by harnessing Rydberg blockade. We design a scheme that creates entanglement between a single photon&#39;s temporal modes and the Rydberg levels that host a collective excitation, using a process of cyclical retrieving and patching. The hybrid entanglement is tested via retrieving the atomic excitation as a second photon and performing correlation measurements, which suggest an entanglement fidelity of 87.8%. Our source of matter-photon entanglement will enable the entangling of remote quantum memories with much higher efficiency.

preprint2021arXiv

Effects of Number of Filters of Convolutional Layers on Speech Recognition Model Accuracy

Inspired by the progress of the End-to-End approach [1], this paper systematically studies the effects of Number of Filters of convolutional layers on the model prediction accuracy of CNN+RNN (Convolutional Neural Networks adding to Recurrent Neural Networks) for ASR Models (Automatic Speech Recognition). Experimental results show that only when the CNN Number of Filters exceeds a certain threshold value is adding CNN to RNN able to improve the performance of the CNN+RNN speech recognition model, otherwise some parameter ranges of CNN can render it useless to add the CNN to the RNN model. Our results show a strong dependency of word accuracy on the Number of Filters of convolutional layers. Based on the experimental results, the paper suggests a possible hypothesis of Sound-2-Vector Embedding (Convolutional Embedding) to explain the above observations. Based on this Embedding hypothesis and the optimization of parameters, the paper develops an End-to-End speech recognition system which has a high word accuracy but also has a light model-weight. The developed LVCSR (Large Vocabulary Continuous Speech Recognition) model has achieved quite a high word accuracy of 90.2% only by its Acoustic Model alone, without any assistance from intermediate phonetic representation and any Language Model. Its acoustic model contains only 4.4 million weight parameters, compared to the 35~68 million acoustic-model weight parameters in DeepSpeech2 [2] (one of the top state-of-the-art LVCSR models) which can achieve a word accuracy of 91.5%. The light-weighted model is good for improving the transcribing computing efficiency and also useful for mobile devices, Driverless Vehicles, etc. Our model weight is reduced to ~10% the size of DeepSpeech2, but our model accuracy remains close to that of DeepSpeech2. If combined with a Language Model, our LVCSR system is able to achieve 91.5% word accuracy.

preprint2021arXiv

Experimental Creation of Single Rydberg Excitations via Adiabatic Passage

In an atomic ensemble, quantum information is typically carried as single collective excitations. It is very advantageous if the creation of single excitations is efficient and robust. Rydberg blockade enables deterministic creation of single excitations via collective Rabi oscillation by precisely controlling the pulse area, being sensitive to many experimental parameters. In this paper, we implement the adiabatic rapid passage technique to the Rydberg excitation process in a mesoscopic atomic ensemble. We make use of a two-photon excitation scheme with an intermediate state off-resonant and sweep the laser frequency of one excitation laser. We find the chirped scheme preserves internal phases of the collective Rydberg excitation and be more robust against variance of laser intensity and frequency detuning.

preprint2021arXiv

HiVision: Rapid Visualization of Large-Scale Spatial Vector Data

Rapid visualization of large-scale spatial vector data is a long-standing challenge in Geographic Information Science. In existing methods, the computation overheads grow rapidly with data volumes, leading to the incapability of providing real-time visualization for large-scale spatial vector data, even with parallel acceleration technologies. To fill the gap, we present HiVision, a display-driven visualization model for large-scale spatial vector data. Different from traditional data-driven methods, the computing units in HiVision are pixels rather than spatial objects to achieve real-time performance, and efficient spatial-index-based strategies are introduced to estimate the topological relationships between pixels and spatial objects. HiVision can maintain exceedingly good performance regardless of the data volume due to the stable pixel number for display. In addition, an optimized parallel computing architecture is proposed in HiVision to ensure the ability of real-time visualization. Experiments show that our approach outperforms traditional methods in rendering speed and visual effects while dealing with large-scale spatial vector data, and can provide interactive visualization of datasets with billion-scale points/segments/edges in real-time with flexible rendering styles. The HiVision code is open-sourced at https://github.com/MemoryMmy/HiVision with an online demonstration.

preprint2021arXiv

Hybrid quantum-classical approach to enhanced quantum metrology

Quantum metrology plays a fundamental role in many scientific areas. However, the complexity of engineering entangled probes and the external noise raise technological barriers for realizing the expected precision of the to-be-estimated parameter with given resources. Here, we address this problem by introducing adjustable controls into the encoding process and then utilizing a hybrid quantum-classical approach to automatically optimize the controls online. Our scheme does not require any complex or intractable off-line design, and it can inherently correct certain unitary errors during the learning procedure. We also report the first experimental demonstration of this promising scheme for the task of finding optimal probes for frequency estimation on a nuclear magnetic resonance (NMR) processor. The proposed scheme paves the way to experimentally auto-search optimal protocol for improving the metrology precision.

preprint2021arXiv

Quantum oscillations in Noncentrosymmetric Weyl semimetals RAlSi (R = Sm and Ce)

Weyl semimetal (WSM) as a new type of quantum state of matter hosting low energy relativistic quasiparticles, has attracted significant attention for both scientific community and potential quantum device applications. Here, we report a comprehensive investigation of the structural, magnetic and transport properties of noncentrosymmetric RAlSi (R = Sm, Ce), which have been predicted to be new magnetic WSM candidates. Both samples exhibit non-saturated magnetoresistance (MR), with ~ 900% for SmAlSi and 80% for CeAlSi at 1.8 K, 9 T. The carrier densities of SmAlSi and CeAlSi display remarkable change around magnetic transition temperatures, signifying that the electronic states are sensitive to magnetic ordering of rare earth elements. At low temperatures, SmAlSi reveals prominent Shubnikov-de Haas (SdH) oscillations associated with the nontrivial Berry phase. High pressure experiments demonstrate that the magnetic order is robust and survival under high pressure. Our results would yield valuable insights of WSM physics and potentials in application to the next-generation spintronic devices in RAX family.

preprint2021arXiv

Reconstruction of Quantitative Susceptibility Maps from Phase of Susceptibility Weighted Imaging with Cross-Connected $Ψ$-Net

Quantitative Susceptibility Mapping (QSM) is a new phase-based technique for quantifying magnetic susceptibility. The existing QSM reconstruction methods generally require complicated pre-processing on high-quality phase data. In this work, we propose to explore a new value of the high-pass filtered phase data generated in susceptibility weighted imaging (SWI), and develop an end-to-end Cross-connected $Ψ$-Net (C$Ψ$-Net) to reconstruct QSM directly from these phase data in SWI without additional pre-processing. C$Ψ$-Net adds an intermediate branch in the classical U-Net to form a $Ψ$-like structure. The specially designed dilated interaction block is embedded in each level of this branch to enlarge the receptive fields for capturing more susceptibility information from a wider spatial range of phase images. Moreover, the crossed connections are utilized between branches to implement a multi-resolution feature fusion scheme, which helps C$Ψ$-Net capture rich contextual information for accurate reconstruction. The experimental results on a human dataset show that C$Ψ$-Net achieves superior performance in our task over other QSM reconstruction algorithms.

preprint2021arXiv

Robust Dynamical Decoupling for the Manipulation of a Spin Network via a Single Spin

High-fidelity control of quantum systems is crucial for quantum information processing, but is often limited by perturbations from the environment and imperfections in the applied control fields. Here, we investigate the combination of dynamical decoupling (DD) and robust optimal control (ROC) to address this problem. In this combination, ROC is employed to find robust shaped pulses, wherein the directional derivatives of the controlled dynamics with respect to control errors are reduced to a desired order. Then, we incorporate ROC pulses into DD sequences, achieving a remarkable improvement of robustness against multiple error channels. We demonstrate this method in the example of manipulating nuclear spin bath via an electron spin in the NV center system. Simulation results indicate that ROC based DD sequences outperform the state-of-the-art robust DD sequences. Our work has implications for robust quantum control on near-term noisy quantum devices.

preprint2021arXiv

Solving localized wave solutions of the derivative nonlinear Schrodinger equation using an improved PINN method

The solving of the derivative nonlinear Schrodinger equation (DNLS) has attracted considerable attention in theoretical analysis and physical applications. Based on the physics-informed neural network (PINN) which has been put forward to uncover dynamical behaviors of nonlinear partial different equation from spatiotemporal data directly, an improved PINN method with neuron-wise locally adaptive activation function is presented to derive localized wave solutions of the DNLS in complex space. In order to compare the performance of above two methods, we reveal the dynamical behaviors and error analysis for localized wave solutions which include one-rational soliton solution, genuine rational soliton solutions and rogue wave solution of the DNLS by employing two methods, also exhibit vivid diagrams and detailed analysis. The numerical results demonstrate the improved method has faster convergence and better simulation effect. On the bases of the improved method, the effects for different numbers of initial points sampled, residual collocation points sampled, network layers, neurons per hidden layer on the second order genuine rational soliton solution dynamics of the DNLS are considered, and the relevant analysis when the locally adaptive activation function chooses different initial values of scalable parameters are also exhibited in the simulation of the two-order rogue wave solution.

preprint2021arXiv

The Dust Mass of Supernova Remnants in M31

The dust temperature and mass of the supernova remnants (SNRs) in M31 are estimated by fitting the infrared spectral energy distribution calculated from the images in the Spitzer/IRAC4 and MIPS24, Herschel/PACS70, 100, 160, and Herschel/SPIRE250, 350$μ$m band. Twenty SNRs with relatively reliable photometry exhibit an average dust temperature of $20.1^{+1.8}_{-1.5}$K, which is higher than the surrounding and indicating the heating effect of supernova explosion. The dust mass of these SNRs ranges from about 100 to 800$ M_{\odot}$, much bigger than the SNRs in the Milky Way. On the other hand, this yields the dust surface density of $0.10^{+0.07}_{-0.04}{ M_{\odot} \rm pc^{-2}}$, about half of the surrounding area, which implies that about half dust in the SNRs is destroyed by the supernova explosion. The dust temperature, the radius, and thus the dust mass all demonstrate that the studied SNRs are old and very likely in the snowplow or even fade away phase because of the limitation by the far distance and observation resolution of M31, and the results can serve as a reference to the final effect of supernova explosion on the surrounding dust.

preprint2021arXiv

User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization

Federated learning (FL), as a type of collaborative machine learning framework, is capable of preserving private data from mobile terminals (MTs) while training the data into useful models. Nevertheless, from a viewpoint of information theory, it is still possible for a curious server to infer private information from the shared models uploaded by MTs. To address this problem, we first make use of the concept of local differential privacy (LDP), and propose a user-level differential privacy (UDP) algorithm by adding artificial noise to the shared models before uploading them to servers. According to our analysis, the UDP framework can realize $(ε_{i}, δ_{i})$-LDP for the $i$-th MT with adjustable privacy protection levels by varying the variances of the artificial noise processes. We then derive a theoretical convergence upper-bound for the UDP algorithm. It reveals that there exists an optimal number of communication rounds to achieve the best learning performance. More importantly, we propose a communication rounds discounting (CRD) method. Compared with the heuristic search method, the proposed CRD method can achieve a much better trade-off between the computational complexity of searching and the convergence performance. Extensive experiments indicate that our UDP algorithm using the proposed CRD method can effectively improve both the training efficiency and model quality for the given privacy protection levels.

preprint2020arXiv

A Compressive Sensing Approach for Federated Learning over Massive MIMO Communication Systems

Federated learning is a privacy-preserving approach to train a global model at a central server by collaborating with wireless devices, each with its own local training data set. In this paper, we present a compressive sensing approach for federated learning over massive multiple-input multiple-output communication systems in which the central server equipped with a massive antenna array communicates with the wireless devices. One major challenge in system design is to reconstruct local gradient vectors accurately at the central server, which are computed-and-sent from the wireless devices. To overcome this challenge, we first establish a transmission strategy to construct sparse transmitted signals from the local gradient vectors at the devices. We then propose a compressive sensing algorithm enabling the server to iteratively find the linear minimum-mean-square-error (LMMSE) estimate of the transmitted signal by exploiting its sparsity. We also derive an analytical threshold for the residual error at each iteration, to design the stopping criterion of the proposed algorithm. We show that for a sparse transmitted signal, the proposed algorithm requires less computationally complexity than LMMSE. Simulation results demonstrate that the presented approach outperforms conventional linear beamforming approaches and reduces the performance gap between federated learning and centralized learning with perfect reconstruction.

preprint2020arXiv

A Robust Stochastic Method of Estimating the Transmission Potential of 2019-nCoV

The recent outbreak of a novel coronavirus (2019-nCoV) has quickly evolved into a global health crisis. The transmission potential of 2019-nCoV has been modelled and studied in several recent research works. The key factors such as the basic reproductive number, $R_{0}$, of the virus have been identified by fitting contagious disease spreading models to aggregated data. The data include the reported cases both within China and in closely connected cities over the world. In this paper, we study the transmission potential of 2019-nCoV from the perspective of the robustness of the statistical estimation, in light of varying data quality and timeliness in the initial stage of the outbreak. Sample consensus algorithm has been adopted to improve model fitting when outliers are present. The robust estimation enables us to identify two clusters of transmission models, both are of substantial concern, one with $R_0:8\sim14$, comparable to that of measles and the other dictates a large initial infected group.

preprint2020arXiv

A Short Review on Data Modelling for Vector Fields

Machine learning methods based on statistical principles have proven highly successful in dealing with a wide variety of data analysis and analytics tasks. Traditional data models are mostly concerned with independent identically distributed data. The recent success of end-to-end modelling scheme using deep neural networks equipped with effective structures such as convolutional layers or skip connections allows the extension to more sophisticated and structured practical data, such as natural language, images, videos, etc. On the application side, vector fields are an extremely useful type of data in empirical sciences, as well as signal processing, e.g. non-parametric transformations of 3D point clouds using 3D vector fields, the modelling of the fluid flow in earth science, and the modelling of physical fields. This review article is dedicated to recent computational tools of vector fields, including vector data representations, predictive model of spatial data, as well as applications in computer vision, signal processing, and empirical sciences.

preprint2020arXiv

A Systematic Study of the dust of Galactic Supernova Remnants I. The Distance and the Extinction

By combining the photometric, spectroscopic, and astrometric information of the stars in the sightline of SNRs, the distances to and the extinctions of 32 Galactic supernova remnants (SNRs) are investigated. The stellar atmospheric parameters are from the SDSS$-$DR14$/$APOGEE and LAMOST$-$DR5$/$LEGUE spectroscopic surveys. The multi-band photometry, from optical to infrared, are collected from the {\it Gaia}, APASS, Pan--STARRS1, 2MASS, and {\it WISE} surveys. With the calibrated {\it Gaia} distances of individual stars, the distances to 15 of 32 SNRs are well determined from their produced extinction and association with molecular clouds. The upper limits of distance are derived for 3 SNRs. The color excess ratios $E(g_{\rm P1}-λ) / E(g_{\rm P1}-r_{\rm P1})$ of 32 SNRs are calculated, and their variation with wavebands is fitted by a simple dust model. The inferred dust grain size distribution bifurcates: while the graphite grains have comparable size to the average ISM dust, the silicate grains are generally larger. Along the way, the average extinction law from optical to near-infrared of the Milky Way is derived from the 1.3 million star sample and found to agree with the CCM89 law with $R_{\rm V}=3.15$.

preprint2020arXiv

Achieving Global Optimality for Joint Source and Relay Beamforming Design in Two-Hop Relay Channels

This paper deals with joint source and relay beamforming (BF) design for an amplify-and-forward (AF) multi-antenna multirelay network. Considering that the channel state information (CSI) from relays to destination is imperfect, we aim to maximize the worst case received signal-to-noise ratio (SNR). The associated optimization problem is then solved in two steps. In the first step, by fixing the source BF vector, a semi-closed form solution of the relay BF matrices is obtained, up to a power allocation factor. In the second step, the global optimal source BF vector is obtained based on the Polyblock outer Approximation (PA) algorithm. We also propose two low-complexity methods for obtaining the source BF vector, which are different in their complexities and performances. The optimal joint source-relay BF solution obtained by the proposed algorithms serves as the benchmark for evaluating the existing schemes and the proposed low-complexity methods. Simulation results show that the proposed robust design can significantly reduce the sensitivity of the channel uncertainty to the system performance.

preprint2020arXiv

Achieving Optimality in Robust Joint Optimization of Linear Transceiver Design

This paper presents new results on linear transceiver designs in a multiple-input-multiple-output (MIMO) link. By considering the minimal total mean-square error (MSE) criterion, we prove that the robust optimal linear transceiver design has a channel-diagonalizing structure, which verifies the conjecture in the previous work \cite{JW_2011}. Based on this property, the original design problem can be transformed into a scalar problem, whose global optimal solution is first obtained in this work. Simulation results show the performance advantages of our solution over the existing schemes.

preprint2020arXiv

Binary Representaion for Non-binary LDPC Code with Decoder Design

The equivalent binary parity check matrices for the binary images of the cycle-free non-binary LDPC codes have numerous bit-level cycles. In this paper, we show how to transform these binary parity check matrices into their cycle-free forms. It is shown that the proposed methodology can be adopted not only for the binary images of non-binary LDPC codes but also for a large class of binary LDPC codes. Specifically, we present an extended $p$-reducible (EPR) LDPC code structure to eliminate the bit-level cycles. For the non-binary LDPC codes with short length symbol-level cycles, the EPR-LDPC codes can largely avoid the corresponding short length bit-level cycles. As to the decoding of the EPR-LDPC codes, we propose a hybrid hard-decision decoder and a hybrid parallel decoder for binary symmetric channel and binary input Gaussian channel, respectively. A simple code optimization algorithm for these binary decoders is also provided. Simulations show the comparative results and justify the advantages, i.e., better performance and lower decoding complexity, of the proposed binary constructions.

preprint2020arXiv

Caching Transient Content for IoT Sensing: Multi-Agent Soft Actor-Critic

Edge nodes (ENs) in Internet of Things commonly serve as gateways to cache sensing data while providing accessing services for data consumers. This paper considers multiple ENs that cache sensing data under the coordination of the cloud. Particularly, each EN can fetch content generated by sensors within its coverage, which can be uploaded to the cloud via fronthaul and then be delivered to other ENs beyond the communication range. However, sensing data are usually transient with time whereas frequent cache updates could lead to considerable energy consumption at sensors and fronthaul traffic loads. Therefore, we adopt age of information to evaluate data freshness and investigate intelligent caching policies to preserve data freshness while reducing cache update costs. Specifically, we model the cache update problem as a cooperative multi-agent Markov decision process with the goal of minimizing the long-term average weighted cost. To efficiently handle the exponentially large number of actions, we devise a novel reinforcement learning approach, which is a discrete multi-agent variant of soft actor-critic (SAC). Furthermore, we generalize the proposed approach into a decentralized control, where each EN can make decisions based on local observations only. Simulation results demonstrate the superior performance of the proposed SAC-based caching schemes.

preprint2020arXiv

Capacity Performance of Relay Beamformings for MIMO Multi-Relay Networks with Imperfect R-D CSI at Relays

In this paper, we consider a dual-hop Multiple Input Multiple Output (MIMO) wireless relay network in the presence of imperfect channel state information (CSI), in which a source-destination pair both equipped with multiple antennas communicates through a large number of half-duplex amplify-and-forward (AF) relay terminals. We investigate the performance of three linear beamforming schemes when the CSI of relay-to-destination (R-D) link is not perfect at the relay nodes. The three efficient linear beamforming schemes are based on the matched-filter (MF), zero-forcing (ZF) precoding and regularized zero-forcing (RZF) precoding techniques, which utilize the CSI of both S-D channel and R-D channel at the relay nodes. By modeling the R-D CSI error at the relay nodes as independent complex Gaussian random variables, we derive the ergodic capacities of the three beamformers in terms of instantaneous SNR. Using Law of Large Number, we obtain the asymptotic capacities, upon which the optimized MF-RZF is derived. Simulation results show that the asymptotic capacities match with the respective ergodic capacities very well. Analysis and simulation results demonstrate that the optimized MF-RZF outperforms MF and MF-ZF for any power of R-D CSI error.

preprint2020arXiv

Concurrent probing of electron-lattice dephasing induced by photoexcitation in 1T-TaSeTe using ultrafast electron diffraction

It has been technically challenging to concurrently probe the electrons and the lattices in materials during non-equilibrium processes, allowing their correlations to be determined. Here, in a single set of ultrafast electron diffraction patterns taken on the charge-density-wave (CDW) material 1T-TaSeTe, we discover a temporal shift in the diffraction intensity measurements as a function of scattering angle. With the help of dynamic models and theoretical calculations, we show that the ultrafast electrons probe both the valence-electron and lattice dynamic processes, resulting in the temporal shift measurements. Our results demonstrate unambiguously that the CDW is not merely a result of the periodic lattice deformation ever-present in 1T-TaSeTe but has significant electronic origin. This method demonstrates a novel approach for studying many quantum effects that arise from electron-lattice dephasing in molecules and crystals for next-generation devices.

preprint2020arXiv

Data-Aided Channel Estimator for MIMO Systems via Reinforcement Learning

This paper presents a data-aided channel estimator that reduces the channel estimation error of the conventional linear minimum-mean-squared-error (LMMSE) method for multiple-input multiple-output communication systems. The basic idea is to selectively exploit detected symbol vectors obtained from data detection as additional pilot signals. To optimize the selection of the detected symbol vectors, a Markov decision process (MDP) is defined which finds the best selection to minimize the mean-squared-error (MSE) of the channel estimate. Then a reinforcement learning algorithm is developed to solve this MDP in a computationally efficient manner. Simulation results demonstrate that the presented channel estimator significantly reduces the MSE of the channel estimate and therefore improves the block error rate of the system, compared to the conventional LMMSE method.

preprint2020arXiv

Deep-learning-based optical image hiding

A novel framework of optical image hiding based on deep learning (DL) is proposed in this paper, and hidden information can be reconstructed from an interferogram by using an end to end network with high-quality. By using the prior data between the hidden image and the object image, a generative adversarial network was trained so that it can learn the hiding model, which resulting in only an interferogram needs to be transmitted and recorded to reconstruct image. Moreover, reconstruction process can be obtained without the parameters in optical inverse diffraction and the reconstruction result will not be affected by the phase shifts deviation and noise, which is convenient for practical application. The feasibility and security of the proposed method are demonstrated by the optical experiment results.

preprint2020arXiv

Distributed Caching for Data Dissemination in the Downlink of Heterogeneous Networks

Heterogeneous cellular networks (HCN) with embedded small cells are considered, where multiple mobile users wish to download network content of different popularity. By caching data into the small-cell base stations (SBS), we will design distributed caching optimization algorithms via belief propagation (BP) for minimizing the downloading latency. First, we derive the delay-minimization objective function (OF) and formulate an optimization problem. Then we develop a framework for modeling the underlying HCN topology with the aid of a factor graph. Furthermore, distributed BP algorithm is proposed based on the network&#39;s factor graph. Next, we prove that a fixed point of convergence exists for our distributed BP algorithm. In order to reduce the complexity of the BP, we propose a heuristic BP algorithm. Furthermore, we evaluate the average downloading performance of our HCN for different numbers and locations of the base stations (BS) and mobile users (MU), with the aid of stochastic geometry theory. By modeling the nodes distributions using a Poisson point process, we develop the expressions of the average factor graph degree distribution, as well as an upper bound of the outage probability for random caching schemes. We also improve the performance of random caching. Our simulations show that (1) the proposed distributed BP algorithm has a near-optimal delay performance, approaching that of the high-complexity exhaustive search method, (2) the modified BP offers a good delay performance at a low communication complexity, (3) both the average degree distribution and the outage upper bound analysis relying on stochastic geometry match well with our Monte-Carlo simulations, and (4) the optimization based on the upper bound provides both a better outage and a better delay performance than the benchmarks.

preprint2020arXiv

DNN-aided Read-voltage Threshold Optimization for MLC Flash Memory with Finite Block Length

The error correcting performance of multi-level-cell (MLC) NAND flash memory is closely related to the block length of error correcting codes (ECCs) and log-likelihood-ratios (LLRs) of the read-voltage thresholds. Driven by this issue, this paper optimizes the read-voltage thresholds for MLC flash memory to improve the decoding performance of ECCs with finite block length. First, through the analysis of channel coding rate (CCR) and decoding error probability under finite block length, we formulate the optimization problem of read-voltage thresholds to minimize the maximum decoding error probability. Second, we develop a cross iterative search (CIS) algorithm to optimize read-voltage thresholds under the perfect knowledge of flash memory channel. However, it is challenging to analytically characterize the voltage distribution under the effect of data retention noise (DRN), since the data retention time (DRT) is hard to be recorded for flash memory in reality. To address this problem, we develop a deep neural network (DNN) aided optimization strategy to optimize the read-voltage thresholds, where a multi-layer perception (MLP) network is employed to learn the relationship between voltage distribution and read-voltage thresholds. Simulation results show that, compared with the existing schemes, the proposed DNN-aided read-voltage threshold optimization strategy with a well-designed LDPC code can not only improve the program-and-erase (PE) endurance but also reduce the read latency.

preprint2020arXiv

Dynamic Virtual Resource Allocation for 5G and Beyond Network Slicing

The fifth generation and beyond wireless communication will support vastly heterogeneous services and use demands such as massive connection, low latency and high transmission rate. Network slicing has been envisaged as an efficient technology to meet these diverse demands. In this paper, we propose a dynamic virtual resources allocation scheme based on the radio access network (RAN) slicing for uplink communications to ensure the quality-of-service (QoS). To maximum the weighted-sum transmission rate performance under delay constraint, formulate a joint optimization problem of subchannel allocation and power control as an infinite-horizon average-reward constrained Markov decision process (CMDP) problem. Based on the equivalent Bellman equation, the optimal control policy is first derived by the value iteration algorithm. However, the optimal policy suffers from the widely known curse-of-dimensionality problem. To address this problem, the linear value function approximation (approximate dynamic programming) is adopted. Then, the subchannel allocation Q-factor is decomposed into the per-slice Q-factor. Furthermore, the Q-factor and Lagrangian multipliers are updated by the use of an online stochastic learning algorithm. Finally, simulation results reveal that the proposed algorithm can meet the delay requirements and improve the user transmission rate compared with baseline schemes.

preprint2020arXiv

Dynamical-Invariant-based Holonomic Quantum Gates: Theory and Experiment

Among existing approaches to holonomic quantum computing, the adiabatic holonomic quantum gates (HQGs) suffer errors due to decoherence, while the non-adiabatic HQGs either require additional Hilbert spaces or are difficult to scale. Here, we report a systematic, scalable approach based on dynamical invariants to realize HQGs without using additional Hilbert spaces. While presenting the theoretical framework of our approach, we design and experimentally evaluate single-qubit and two-qubits HQGs for the nuclear magnetic resonance system. The single-qubit gates acquire average fidelity 0.9972 by randomized benchmarking, and the controlled-NOT gate acquires fidelity 0.9782 by quantum process tomography. Our approach is also platform-independent, and thus may open a way to large-scale holonomic quantum computation.

preprint2020arXiv

Efficient Beamforming for MIMO Relaying Broadcast Channel with Imperfect Channel Estimation

We consider a multiple-input multiple-output (MIMO) relaying boardcast channel in downlink cellular networks, where the base station and the relay stations are both equipped with multiple antennas, and each user terminal has only a single antenna. In practical scenarios, channel estimation is imperfect at the receivers. Aiming at maximizing the SINR at each user, we develop two robust linear beamforming schemes respectively for the single relay case and the multi-relay case. The two proposed schemes are based on sigular value decomposition (SVD), minimum mean square error (MMSE) and regularized zero-forcing (RZF). Simulation results show that the proposed scheme outperforms the conventional schemes with imperfect channel estimation.

preprint2020arXiv

Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transform

Strictly enforcing orthonormality constraints on parameter matrices has been shown advantageous in deep learning. This amounts to Riemannian optimization on the Stiefel manifold, which, however, is computationally expensive. To address this challenge, we present two main contributions: (1) A new efficient retraction map based on an iterative Cayley transform for optimization updates, and (2) An implicit vector transport mechanism based on the combination of a projection of the momentum and the Cayley transform on the Stiefel manifold. We specify two new optimization algorithms: Cayley SGD with momentum, and Cayley ADAM on the Stiefel manifold. Convergence of Cayley SGD is theoretically analyzed. Our experiments for CNN training demonstrate that both algorithms: (a) Use less running time per iteration relative to existing approaches that enforce orthonormality of CNN parameters; and (b) Achieve faster convergence rates than the baseline SGD and ADAM algorithms without compromising the performance of the CNN. Cayley SGD and Cayley ADAM are also shown to reduce the training time for optimizing the unitary transition matrices in RNNs.

preprint2020arXiv

Enhanced Secrecy Rate Maximization for Directional Modulation Networks via IRS

Intelligent reflecting surface (IRS) is of low-cost and energy-efficiency and will be a promising technology for the future wireless communications like sixth generation. To address the problem of conventional directional modulation (DM) that Alice only transmits single confidential bit stream (CBS) to Bob with multiple antennas in a line-of-sight channel, IRS is proposed to create friendly multipaths for DM such that two CBSs can be transmitted from Alice to Bob. This will significantly enhance the secrecy rate (SR) of DM. To maximize the SR (Max-SR), a general non-convex optimization problem is formulated with the unit-modulus constraint of IRS phase-shift matrix (PSM), and the general alternating iterative (GAI) algorithm is proposed to jointly obtain the transmit beamforming vectors (TBVs) and PSM by alternately optimizing one and fixing another. To reduce its high complexity, a low-complexity iterative algorithm for Max-SR is proposed by placing the constraint of null-space (NS) on the TBVs, called NS projection (NSP). Here, each CBS is transmitted separately in the NSs of other CBS and AN channels. Simulation results show that the SRs of the proposed GAI and NSP can approximately double that of IRS-based DM with single CBS for massive IRS in the high signal-to-noise ratio region.

preprint2020arXiv

Experimental Detection of the Quantum Phases of a Three-Dimensional Topological Insulator on a Spin Quantum Simulator

The detection of topological phases of matter becomes a central issue in recent years. Conventionally, the realization of a specific topological phase in condensed matter physics relies on probing the underlying surface band dispersion or quantum transport signature of a real material, which may be imperfect or even absent. On the other hand, quantum simulation offers an alternative approach to directly measure the topological invariant on a universal quantum computer. However, experimentally demonstrating high-dimensional topological phases remains a challenge due to the technical limitations of current experimental platforms. Here, we investigate the three-dimensional topological insulators in the AIII (chiral unitary) symmetry class which yet lack experimental realization. Using the nuclear magnetic resonance system, we experimentally demonstrate their topological properties, where a dynamical quenching approach is adopted and the dynamical bulk-boundary correspondence in the momentum space is observed. As a result, the topological invariants are measured with high precision on the band-inversion surface, exhibiting robustness to the decoherence effect. Our work paves the way towards the quantum simulation of topological phases of matter in higher dimensions and more complex systems through controllable quantum phases transitions.

preprint2020arXiv

Face Hallucination with Finishing Touches

Obtaining a high-quality frontal face image from a low-resolution (LR) non-frontal face image is primarily important for many facial analysis applications. However, mainstreams either focus on super-resolving near-frontal LR faces or frontalizing non-frontal high-resolution (HR) faces. It is desirable to perform both tasks seamlessly for daily-life unconstrained face images. In this paper, we present a novel Vivid Face Hallucination Generative Adversarial Network (VividGAN) for simultaneously super-resolving and frontalizing tiny non-frontal face images. VividGAN consists of coarse-level and fine-level Face Hallucination Networks (FHnet) and two discriminators, i.e., Coarse-D and Fine-D. The coarse-level FHnet generates a frontal coarse HR face and then the fine-level FHnet makes use of the facial component appearance prior, i.e., fine-grained facial components, to attain a frontal HR face image with authentic details. In the fine-level FHnet, we also design a facial component-aware module that adopts the facial geometry guidance as clues to accurately align and merge the frontal coarse HR face and prior information. Meanwhile, two-level discriminators are designed to capture both the global outline of a face image as well as detailed facial characteristics. The Coarse-D enforces the coarsely hallucinated faces to be upright and complete while the Fine-D focuses on the fine hallucinated ones for sharper details. Extensive experiments demonstrate that our VividGAN achieves photo-realistic frontal HR faces, reaching superior performance in downstream tasks, i.e., face recognition and expression classification, compared with other state-of-the-art methods.

preprint2020arXiv

G-Net: A Deep Learning Approach to G-computation for Counterfactual Outcome Prediction Under Dynamic Treatment Regimes

Counterfactual prediction is a fundamental task in decision-making. G-computation is a method for estimating expected counterfactual outcomes under dynamic time-varying treatment strategies. Existing G-computation implementations have mostly employed classical regression models with limited capacity to capture complex temporal and nonlinear dependence structures. This paper introduces G-Net, a novel sequential deep learning framework for G-computation that can handle complex time series data while imposing minimal modeling assumptions and provide estimates of individual or population-level time varying treatment effects. We evaluate alternative G-Net implementations using realistically complex temporal simulated data obtained from CVSim, a mechanistic model of the cardiovascular system.

preprint2020arXiv

Generalized Focal Loss: Learning Qualified and Distributed Bounding Boxes for Dense Object Detection

One-stage detector basically formulates object detection as dense classification and localization. The classification is usually optimized by Focal Loss and the box location is commonly learned under Dirac delta distribution. A recent trend for one-stage detectors is to introduce an individual prediction branch to estimate the quality of localization, where the predicted quality facilitates the classification to improve detection performance. This paper delves into the representations of the above three fundamental elements: quality estimation, classification and localization. Two problems are discovered in existing practices, including (1) the inconsistent usage of the quality estimation and classification between training and inference and (2) the inflexible Dirac delta distribution for localization when there is ambiguity and uncertainty in complex scenes. To address the problems, we design new representations for these elements. Specifically, we merge the quality estimation into the class prediction vector to form a joint representation of localization quality and classification, and use a vector to represent arbitrary distribution of box locations. The improved representations eliminate the inconsistency risk and accurately depict the flexible distribution in real data, but contain continuous labels, which is beyond the scope of Focal Loss. We then propose Generalized Focal Loss (GFL) that generalizes Focal Loss from its discrete form to the continuous version for successful optimization. On COCO test-dev, GFL achieves 45.0\% AP using ResNet-101 backbone, surpassing state-of-the-art SAPD (43.5\%) and ATSS (43.6\%) with higher or comparable inference speed, under the same backbone and training settings. Notably, our best model can achieve a single-model single-scale AP of 48.2\%, at 10 FPS on a single 2080Ti GPU. Code and models are available at https://github.com/implus/GFocal.

preprint2020arXiv

Green MU-MIMO/SIMO Switching for Heterogeneous Delay-aware Services with Constellation Optimization

In this paper, we propose adaptive techniques for multi-user multiple input and multiple output~(MU-MIMO) cellular communication systems, to solve the problem of energy efficient communications with heterogeneous delay-aware traffic. In order to minimize the total transmission power of the MU-MIMO, we investigate the relationship between the transmission power and the M-ary quadrature amplitude modulation~(MQAM) constellation size and get the energy efficient modulation for each transmission stream based on the minimum mean square error~(MMSE) receiver.Since the total power consumption is different for MU-MIMO and multi-user single input and multiple output~(MU-SIMO), by exploiting the intrinsic relationship among the total power consumption model, and heterogeneous delay-aware services, we propose an adaptive transmission strategy, which is a switching between MU-MIMO and MU-SIMO. Simulations show that in order to maximize the energy efficiency and consider different Quality of Service (QoS) of delay for the users simultaneously, the users should adaptively choose the constellation size for each stream as well as the transmission mode.

preprint2020arXiv

Highly dilute gas flows over an ellipse

This paper presents recent investigation results on free molecular flows over a diffusely or specularly reflective ellipse, by using the gaskinetic theory. A virtual density distribution along the a diffusely reflective surface is introduced to aid the investigations. Many local surface properties are obtained, including surface slip velocity, coefficients for pressure, friction, and heat flux. Global coefficients for aerodynamic forces and moments, mass center-force center distances, are also obtained by integrating the local surface distributions. In the end, analytical expressions for the flowfields around a diffusely or a specularly reflective ellipse are also obtained. Special non-parameters, such as temperature and speed ratios, are explicitly embedded in these expressions. Particle simulations with the direct simulation Monte Carlo (DSMC) method are performed to validate the above results. Those expressions need computers for evaluations, however, the cost is very minor when compared with DSMC simulations. The approaches are heuristic to investigate other external collisionless flows, and the load coefficients can be considered as baseline references at the high Knudsen number limit. It is feasible to further study less rarefied gas flows over an ellipse. Swift parameter studies based on these solutions are feasible to study their influences.

preprint2020arXiv

Highly Dilute Gas Flows Through A Non-Isothermal Planar Micro-Channel

This paper reports theoretical and numerical investigations on free molecular gas flows through micro-channels. Both diffusely and specularly reflective channel surfaces are considered. Gaskinetic methods are adopted to develop the analytical solutions for surface and flowfield properties. The crucial steps include constructing the velocity distribution functions (VDFs) for points at the plate surfaces and inside flowfield, and then completing the integration over the related velocity phases. For diffusely reflective surfaces, the VDFs are related to the densities and temperatures at the two exits and the plate temperatures. For surfaces with specular reflections, the VDFs at the plate surface and inside the flowfield are identical, and independent of the surface temperature ratio and the geometric aspect ratio. Based on the VDFs and velocity phases, surface property coefficients (e.g., C_p, C_f, and C_q) and flowfield properties (e.g., density, velocity components, and temperature) are obtained. For the diffusely reflective surface scenario, the mass flow rate can be approximated and the results include four non-dimensional parameters: the aspect ratio, the density ratio, and two temperature ratios. For specularly reflective surface scenario, the surface and flowfield properties are uniform everywhere, the channel aspect ratio and plate temperatures do not have any influence. Particle simulations with the direct simulation Monte Carlo (DSMC) method are performed, and essentially identical results validate the theoretical work. This work is heuristic and can be used to investigate less rarefied micro-channel gaseous flows, for example, aid experimental measurement design for thermal transpiration flows.

preprint2020arXiv

Impurity-pinned incommensurate charge density wave and local phonon excitations in 2H-NbS2

Here we report a scanning tunneling microscopy (STM) and spectroscopy (STS) study in the superconducting state of 2H-NbS2. We directly visualize the existence of incommensurate charge density wave (CDW) that is pinned by atomic impurities. In strong tunneling conditions, the incommensurate CDW is de-pinned from impurities by the electric field from STM tip. We perform STM-based inelastic tunneling spectroscopy (IETS) to detect phonon excitations in 2H-NbS2 and measure the influence of atomic impurities on local phonon excitations. In comparison with the calculated vibrational density of states in 2H-NbS2, we find two branches of phonon excitations which correspond to the vibrations of Nb ions and S ions, and the strength of the local phonon excitations is insensitive to the atomic impurities. Our results demonstrate the coexistence of incommensurate CDW and superconductivity in 2H-NbS2, and open the way of detecting atomic-scale phonon excitations in transition metal dichalcogenides with STM-based IETS.

preprint2020arXiv

Joint Power Allocation and Precoding for Network Coding based Cooperative Multicast Systems

In this letter, we propose two power allocation schemes based on the statistical channel state information (CSI) and instantaneous s->r CSI at transmitters respectively for a 2-N-2 cooperative multicast system with non-regenerative network coding.Then the isolated precoder and the distributed precoder are respectively applied to the schemes to further improve the system performance by achieving the full diversity gain. Finally, we demonstrate that joint instantaneous s->r CSI based power allocation and distributed precoder design achieve the best performance.

preprint2020arXiv

Learnable Subspace Clustering

This paper studies the large-scale subspace clustering (LSSC) problem with million data points. Many popular subspace clustering methods cannot directly handle the LSSC problem although they have been considered as state-of-the-art methods for small-scale data points. A basic reason is that these methods often choose all data points as a big dictionary to build huge coding models, which results in a high time and space complexity. In this paper, we develop a learnable subspace clustering paradigm to efficiently solve the LSSC problem. The key idea is to learn a parametric function to partition the high-dimensional subspaces into their underlying low-dimensional subspaces instead of the expensive costs of the classical coding models. Moreover, we propose a unified robust predictive coding machine (RPCM) to learn the parametric function, which can be solved by an alternating minimization algorithm. In addition, we provide a bounded contraction analysis of the parametric function. To the best of our knowledge, this paper is the first work to efficiently cluster millions of data points among the subspace clustering methods. Experiments on million-scale datasets verify that our paradigm outperforms the related state-of-the-art methods in both efficiency and effectiveness.

preprint2020arXiv

Learning Part Generation and Assembly for Structure-aware Shape Synthesis

Learning powerful deep generative models for 3D shape synthesis is largely hindered by the difficulty in ensuring plausibility encompassing correct topology and reasonable geometry. Indeed, learning the distribution of plausible 3D shapes seems a daunting task for the holistic approaches, given the significant topological variations of 3D objects even within the same category. Enlightened by the fact that 3D shape structure is characterized as part composition and placement, we propose to model 3D shape variations with a part-aware deep generative network, coined as PAGENet. The network is composed of an array of per-part VAE-GANs, generating semantic parts composing a complete shape, followed by a part assembly module that estimates a transformation for each part to correlate and assemble them into a plausible structure. Through delegating the learning of part composition and part placement into separate networks, the difficulty of modeling structural variations of 3D shapes is greatly reduced. We demonstrate through both qualitative and quantitative evaluations that PAGENet generates 3D shapes with plausible, diverse and detailed structure, and show two applications, i.e., semantic shape segmentation and part-based shape editing.

preprint2020arXiv

LSOTB-TIR:A Large-Scale High-Diversity Thermal Infrared Object Tracking Benchmark

In this paper, we present a Large-Scale and high-diversity general Thermal InfraRed (TIR) Object Tracking Benchmark, called LSOTBTIR, which consists of an evaluation dataset and a training dataset with a total of 1,400 TIR sequences and more than 600K frames. We annotate the bounding box of objects in every frame of all sequences and generate over 730K bounding boxes in total. To the best of our knowledge, LSOTB-TIR is the largest and most diverse TIR object tracking benchmark to date. To evaluate a tracker on different attributes, we define 4 scenario attributes and 12 challenge attributes in the evaluation dataset. By releasing LSOTB-TIR, we encourage the community to develop deep learning based TIR trackers and evaluate them fairly and comprehensively. We evaluate and analyze more than 30 trackers on LSOTB-TIR to provide a series of baselines, and the results show that deep trackers achieve promising performance. Furthermore, we re-train several representative deep trackers on LSOTB-TIR, and their results demonstrate that the proposed training dataset significantly improves the performance of deep TIR trackers. Codes and dataset are available at https://github.com/QiaoLiuHit/LSOTB-TIR.

preprint2020arXiv

Multi-Agent Reinforcement Learning for Cooperative Coded Caching via Homotopy Optimization

Introducing cooperative coded caching into small cell networks is a promising approach to reducing traffic loads. By encoding content via maximum distance separable (MDS) codes, coded fragments can be collectively cached at small-cell base stations (SBSs) to enhance caching efficiency. However, content popularity is usually time-varying and unknown in practice. As a result, cache contents are anticipated to be intelligently updated by taking into account limited caching storage and interactive impacts among SBSs. In response to these challenges, we propose a multi-agent deep reinforcement learning (DRL) framework to intelligently update cache contents in dynamic environments. With the goal of minimizing long-term expected fronthaul traffic loads, we first model dynamic coded caching as a cooperative multi-agent Markov decision process. Owing to MDS coding, the resulting decision-making falls into a class of constrained reinforcement learning problems with continuous decision variables. To deal with this difficulty, we custom-build a novel DRL algorithm by embedding homotopy optimization into a deep deterministic policy gradient formalism. Next, to empower the caching framework with an effective trade-off between complexity and performance, we propose centralized, partially and fully decentralized caching controls by applying the derived DRL approach. Simulation results demonstrate the superior performance of the proposed multi-agent framework.

preprint2020arXiv

Naive Gabor Networks for Hyperspectral Image Classification

Recently, many convolutional neural network (CNN) methods have been designed for hyperspectral image (HSI) classification since CNNs are able to produce good representations of data, which greatly benefits from a huge number of parameters. However, solving such a high-dimensional optimization problem often requires a large amount of training samples in order to avoid overfitting. Additionally, it is a typical non-convex problem affected by many local minima and flat regions. To address these problems, in this paper, we introduce naive Gabor Networks or Gabor-Nets which, for the first time in the literature, design and learn CNN kernels strictly in the form of Gabor filters, aiming to reduce the number of involved parameters and constrain the solution space, and hence improve the performances of CNNs. Specifically, we develop an innovative phase-induced Gabor kernel, which is trickily designed to perform the Gabor feature learning via a linear combination of local low-frequency and high-frequency components of data controlled by the kernel phase. With the phase-induced Gabor kernel, the proposed Gabor-Nets gains the ability to automatically adapt to the local harmonic characteristics of the HSI data and thus yields more representative harmonic features. Also, this kernel can fulfill the traditional complex-valued Gabor filtering in a real-valued manner, hence making Gabor-Nets easily perform in a usual CNN thread. We evaluated our newly developed Gabor-Nets on three well-known HSIs, suggesting that our proposed Gabor-Nets can significantly improve the performance of CNNs, particularly with a small training set.

preprint2020arXiv

Numerical study on thermal transpiration flows through a rectangular channel

Gaseous thermal transpiration flows through a rectangular micro-channel are simulated by the direct simulation BGK (DSBGK) method. These flows are rarefied, within the slip and transitional flow regimes, which are beyond many traditional computational fluid dynamic simulation schemes, such as those based on the continuum flow assumption. The flows are very slow and thus many traditional particle simulation methods suffer large statistical noises. The adopted method is a combination of particle and gas kinetic methods and it can simulate micro-flows properly. The simulation results of mass flow rates have excellent agreement with experimental measurements. In another case of 2D channel, the DSBGK comparisons with the DSMC result and the solution of Shakhov equation are also in very good agreement. Another finding from this study is that numerical simulations by including two reservoirs at the channel ends lead to appreciable differences in simulation results of velocity and pressure distributions within the micro-channel. This is due to the inhaling and exhaling effects of reservoirs at the channel ends. Even though excluding those reservoirs may accelerate the simulations significantly by using a single channel in simulations, special attentions are needed because this treatment may over-simplify the problem, and some procedures and results may be questionable. One example is to determine the surface momentum accommodation coefficient by using analytical solution of the mass flow rate obtained in a single-channel problem without the confinement effect of reservoirs at the two ends.

preprint2020arXiv

On Learning and Learned Data Representation by Capsule Networks

In this work, we investigate the following: 1) how the routing affects the CapsNet model fitting; 2) how the representation using capsules helps discover global structures in data distribution, and; 3) how the learned data representation adapts and generalizes to new tasks. Our investigation yielded the results some of which have been mentioned in the original paper of CapsNet, they are: 1) the routing operation determines the certainty with which a layer of capsules pass information to the layer above and the appropriate level of certainty is related to the model fitness; 2) in a designed experiment using data with a known 2D structure, capsule representations enable a more meaningful 2D manifold embedding than neurons do in a standard convolutional neural network (CNN), and; 3) compared with neurons of the standard CNN, capsules of successive layers are less coupled and more adaptive to new data distribution.

preprint2020arXiv

On Safeguarding Privacy and Security in the Framework of Federated Learning

Motivated by the advancing computational capacity of wireless end-user equipment (UE), as well as the increasing concerns about sharing private data, a new machine learning (ML) paradigm has emerged, namely federated learning (FL). Specifically, FL allows a decoupling of data provision at UEs and ML model aggregation at a central unit. By training model locally, FL is capable of avoiding data leakage from the UEs, thereby preserving privacy and security to some extend. However, even if raw data are not disclosed from UEs, individual&#39;s private information can still be extracted by some recently discovered attacks in the FL architecture. In this work, we analyze the privacy and security issues in FL, and raise several challenges on preserving privacy and security when designing FL systems. In addition, we provide extensive simulation results to illustrate the discussed issues and possible solutions.

preprint2020arXiv

Online Change-Point Detection in High-Dimensional Covariance Structure with Application to Dynamic Networks

In this paper, we develop an online change-point detection procedure in the covariance structure of high-dimensional data. A new stopping rule is proposed to terminate the process as early as possible when a change in covariance structure occurs. The stopping rule allows temporal dependence and can be applied to non-Gaussian data. An explicit expression for the average run length (ARL) is derived, so that the level of threshold in the stopping rule can be easily obtained with no need to run time-consuming Monte Carlo simulations. We also establish an upper bound for the expected detection delay (EDD), the expression of which demonstrates the impact of data dependence and magnitude of change in the covariance structure. Simulation studies are provided to confirm accuracy of the theoretical results. The practical usefulness of the proposed procedure is illustrated by detecting the change of brain&#39;s covariance network in a resting-state fMRI dataset.

preprint2020arXiv

Optimizing adiabatic quantum pathways via a learning algorithm

Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search Hamiltonian. Numerical comparisons with a linear schedule, local adiabatic theorem induced schedule, and gradient-based algorithm searched schedule reveal that the proposed method can achieve significant performance improvements in terms of the adiabatic time and the instantaneous ground-state population maintenance. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.

preprint2020arXiv

Power Adaptive Network Coding for a Non-Orthogonal Multiple-Access Relay Channel

In this paper we propose a novel power adapted network coding (PANC) for a non-orthogonal multiple-access relay channel (MARC), where two sources transmit their information simultaneously to the destination with the help of a relay. Different from the conventional XOR-based network coding (CXNC), the relay in our PANC generates network coded bits by considering the coefficients of the source-to-relay channels, and forwards each bit with a pre-optimized power level. Specifically, by defining a symbol pair as two symbols from the two sources, we first derive the exact symbol pair error rate (SPER) of the system. Noting that the generations of the exact SPER are complicated due to the irregularity of the decision regions caused by random channel coefficients, we propose a coordinate transform (CT) method to simplify the derivations of the SPER. Next, we prove that with a power scaling factor at relay, our PANC scheme can achieve full diversity gain, i.e., two-order diversity gain, of the system, while the CXNC can only achieve one-order diversity gain due to multi-user interference. In addition, we optimize the power levels at the relay to equivalently minimize the SPER at the destination concerning the relationship between SPER and minimum Euclidean distance of the received constellation. Simulation results show that (1) the SPER derived based on our CT method can well approximate the exact SPER with a much lower complexity; (2) the PANC scheme with power level optimizations and power scaling factor design can achieve full diversity, and obtain a much higher coding gain than the PANC scheme with randomly chosen power levels.

preprint2020arXiv

Power Allocation in the High SNR Regime for A Multicast Cell with Regenerative Network Coding

This letter focuses on power allocation schemes for a basic multicast cell with wireless regenerative network coding (RNC). In RNC, mixed signals received from the two sources are jointly decoded by the relay where decoded symbols are superposed in either the complex field (RCNC) or Galois field (RGNC) before being retransmitted. We deduce the optimal statistical channels state information (CSI) based power allocation and give a comparison between the two RNCs. When instantaneous CSI is available at each transmitter, we propose a suboptimal power allocation for RCNC, which achieves better performance.

preprint2020arXiv

Probabilistic Caching for Small-Cell Networks with Terrestrial and Aerial Users

The support for aerial users has become the focus of recent 3GPP standardizations of 5G, due to their high maneuverability and flexibility for on-demand deployment. In this paper, probabilistic caching is studied for ultra-dense small-cell networks with terrestrial and aerial users, where a dynamic on-off architecture is adopted under a sophisticated path loss model incorporating both line-of-sight and non-line-of-sight transmissions. Generally, this paper focuses on the successful download probability (SDP) of user equipments (UEs) from small-cell base stations (SBSs) that cache the requested files under various caching strategies. To be more specific, the SDP is first analyzed using stochastic geometry theory, by considering the distribution of such two-tier UEs and SBSs as Homogeneous Poisson Point Processes. Second, an optimized caching strategy (OCS) is proposed to maximize the average SDP. Third, the performance limits of the average SDP are developed for the popular caching strategy (PCS) and the uniform caching strategy (UCS). Finally, the impacts of the key parameters, such as the SBS density, the cache size, the exponent of Zipf distribution and the height of aerial user, are investigated on the average SDP. The analytical results indicate that the UCS outperforms the PCS if the SBSs are sufficiently dense, while the PCS is better than the UCS if the exponent of Zipf distribution is large enough. Furthermore, the proposed OCS is superior to both the UCS and PCS.

preprint2020arXiv

Quantum Pure State Tomography via Variational Hybrid Quantum-Classical Method

To obtain a complete description of a quantum system, one usually employs standard quantum state tomography, which however requires exponential number of measurements to perform and hence is impractical when the system&#39;s size grows large. In this work, we introduce a self-learning tomographic scheme based on the variational hybrid quantum-classical method. The key part of the scheme is a learning procedure, in which we learn a control sequence capable of driving the unknown target state coherently to a simple fiducial state, so that the target state can be directly reconstructed by applying the control sequence reversely. In this manner, the state tomography problem is converted to a state-to-state transfer problem. To solve the latter problem, we use the closed-loop learning control approach. Our scheme is further experimentally tested using techniques of a 4-qubit nuclear magnetic resonance. {Experimental results indicate that the proposed tomographic scheme can handle a broad class of states including entangled states in quantum information, as well as dynamical states of quantum many-body systems common to condensed matter physics.

preprint2020arXiv

RDP-GAN: A Rényi-Differential Privacy based Generative Adversarial Network

Generative adversarial network (GAN) has attracted increasing attention recently owing to its impressive ability to generate realistic samples with high privacy protection. Without directly interactive with training examples, the generative model can be fully used to estimate the underlying distribution of an original dataset while the discriminative model can examine the quality of the generated samples by comparing the label values with the training examples. However, when GANs are applied on sensitive or private training examples, such as medical or financial records, it is still probable to divulge individuals&#39; sensitive and private information. To mitigate this information leakage and construct a private GAN, in this work we propose a Rényi-differentially private-GAN (RDP-GAN), which achieves differential privacy (DP) in a GAN by carefully adding random noises on the value of the loss function during training. Moreover, we derive the analytical results of the total privacy loss under the subsampling method and cumulated iterations, which show its effectiveness on the privacy budget allocation. In addition, in order to mitigate the negative impact brought by the injecting noise, we enhance the proposed algorithm by adding an adaptive noise tuning step, which will change the volume of added noise according to the testing accuracy. Through extensive experimental results, we verify that the proposed algorithm can achieve a better privacy level while producing high-quality samples compared with a benchmark DP-GAN scheme based on noise perturbation on training gradients.

preprint2020arXiv

Recommendations to enhance rigor and reproducibility in biomedical research

Computational methods have reshaped the landscape of modern biology. While the biomedical community is increasingly dependent on computational tools, the mechanisms ensuring open data, open software, and reproducibility are variably enforced by academic institutions, funders, and publishers. Publications may present academic software for which essential materials are or become unavailable, such as source code and documentation. Publications that lack such information compromise the role of peer review in evaluating technical strength and scientific contribution. Incomplete ancillary information for an academic software package may bias or limit any subsequent work produced with the tool. We provide eight recommendations across four different domains to improve reproducibility, transparency, and rigor in computational biology - precisely on the main values which should be emphasized in life science curricula. Our recommendations for improving software availability, usability, and archival stability aim to foster a sustainable data science ecosystem in biomedicine and life science research.

preprint2020arXiv

Reconfigurable Intelligent Surface (RIS)-Enhanced Two-Way OFDM Communications

In this paper, we focus on the reconfigurable intelligent surface (RIS)-enhanced two-way device-to-device (D2D) multi-pair orthogonal-frequency-division-multiplexing (OFDM) communication systems. Specifically, we maximize the minimum bidirectional weighted sum-rate by jointly optimizing the sub-band allocation, the power allocation and the discrete phase shift (PS) design at the RIS. To tackle the main difficulty of the non-convex PS design at the RIS, we firstly formulate a semi-definite relaxation problem and further devise a low-complexity solution for the PS design by leveraging the projected sub-gradient method. We demonstrate the desirable performance gain for the proposed designs through numerical results.

preprint2020arXiv

Robust Joint Source-Relay-Destination Design Under Per-antenna Power Constraints

This paper deals with joint source-relay-destination beamforming (BF) design for an amplify-and-forward (AF) relay network. Considering the channel state information (CSI) from the relay to the destination is imperfect, we first aim to maximize the worst case received SNR under per-antenna power constraints. The associated optimization problem is then solved in two steps. In the first step, by revealing the rank-one property of the optimal relay BF matrix, we establish the semi-closed form solution of the joint optimal BF design that only depends on a vector variable. Based on this result, in the second step, we propose a low-complexity iterative algorithm to obtain the remaining unknown variable. We also study the problem for minimizing the maximum per-antenna power at the relay while ensuring a received signal-to-noise ratio (SNR) target, and show that it reduces to the SNR maximization problem. Thus the same methods can be applied to solve it. The differences between our result and the existing related work are also discussed in details. In particular, we show that in the perfect CSI case, our algorithm has the same performance but with much lower cost of computational complexity than the existing method. Finally, in the simulation part, we investigate the impact of imperfect CSI on the system performance to verify our analysis.

preprint2020arXiv

Set-Constrained Viterbi for Set-Supervised Action Segmentation

This paper is about weakly supervised action segmentation, where the ground truth specifies only a set of actions present in a training video, but not their true temporal ordering. Prior work typically uses a classifier that independently labels video frames for generating the pseudo ground truth, and multiple instance learning for training the classifier. We extend this framework by specifying an HMM, which accounts for co-occurrences of action classes and their temporal lengths, and by explicitly training the HMM on a Viterbi-based loss. Our first contribution is the formulation of a new set-constrained Viterbi algorithm (SCV). Given a video, the SCV generates the MAP action segmentation that satisfies the ground truth. This prediction is used as a framewise pseudo ground truth in our HMM training. Our second contribution in training is a new regularization of feature affinities between training videos that share the same action classes. Evaluation on action segmentation and alignment on the Breakfast, MPII Cooking2, Hollywood Extended datasets demonstrates our significant performance improvement for the two tasks over prior work.

preprint2020arXiv

Subcarrier Assignment and Power Allocation for SCMA Energy Efficiency

In this paper we propose resource allocation algorithm for uplink sparse code multiple access (SCMA) networks to maximize the energy efficiency (EE). Due to the joint optimization of factor graph matrix and power allocation matrix, the EE maximization is a non-convex mixed-integer non-linear program (MINLP) problem. After transforming the non-convex form of the uplink sum rate to a convex one and separating subcarrier assignment and power allocation, we propose an energy efficient subcarrier assignment algorithm. By applying the fractional programming theory based on Dinkelbach method, we then propose power allocation algorithm to maximize EE. Finally, the simulation results show that the proposed resource allocation algorithm can significantly increase the EE of the uplink SCMA network.

preprint2020arXiv

Towrad 5G Air Interface Technology: Sparse Code Muliple Access

The fifth generation wireless networks focus on the design of low latency, high data rate, high reliability, and massive connectivity communications. Non-orthogonal multiple access (NOMA) is an essential enabling technology to accommodate the wide range of communication requirements. By coordinating the massive devices within the same resource block on power domain, frequency domain or code domain, NOMA is superior to conventional orthogonal multiple access in terms of the network connectivity, the throughputs of system and etc. Sparse code multiple access (SCMA) is a kind of multi-carrier code domain NOMA and has been studied extensively. The challenges for designing a high quality SCMA system is to seek the feasible encoding and decoding schemes to meet the desired requirements. In this article, we present some recent progresses towards the design of multi-dimensional codebooks, the practical low complexity decoder, as well as the Grant-Free multiple access for SCMA system. In particular, we show how the SCMA codebooks construction are motived by the combined design of multi-dimensional constellation and factor graphs. In addition, various low complexity SCMA decoders are also reviewed with a special focus on sphere decoding. Moreover, based on the framework of belief propagation, the SCMA Grant-Free transmission is introduced and the problem of collision resolution is also discussed.

preprint2020arXiv

UAV-Enabled Confidential Data Collection in Wireless Networks

This work, for the first time, considers confidential data collection in the context of unmanned aerial vehicle (UAV) wireless networks, where the scheduled ground sensor node (SN) intends to transmit confidential information to the UAV without being intercepted by other unscheduled ground SNs. Specifically, a full-duplex (FD) UAV collects data from each scheduled SN on the ground and generates artificial noise (AN) to prevent the scheduled SN&#39;s confidential information from being wiretapped by other unscheduled SNs. We first derive the reliability outage probability (ROP) and secrecy outage probability (SOP) of a considered fixed-rate transmission, based on which we formulate an optimization problem that maximizes the minimum average secrecy rate (ASR) subject to some specific constraints. We then transform the formulated optimization problem into a convex problem with the aid of first-order restrictive approximation technique and penalty method. The resultant problem is a generalized nonlinear convex programming (GNCP) and solving it directly still leads to a high complexity, which motivates us to further approximate this problem as a second-order cone program (SOCP) in order to reduce the computational complexity. Finally, we develop an iteration procedure based on penalty successive convex approximation (P-SCA) algorithm to pursue the solution to the formulated optimization problem. Our examination shows that the developed joint design achieves a significant performance gain compared to a benchmark scheme.

preprint2020arXiv

Vehicle Tracking in Wireless Sensor Networks via Deep Reinforcement Learning

Vehicle tracking has become one of the key applications of wireless sensor networks (WSNs) in the fields of rescue, surveillance, traffic monitoring, etc. However, the increased tracking accuracy requires more energy consumption. In this letter, a decentralized vehicle tracking strategy is conceived for improving both tracking accuracy and energy saving, which is based on adjusting the intersection area between the fixed sensing area and the dynamic activation area. Then, two deep reinforcement learning (DRL) aided solutions are proposed relying on the dynamic selection of the activation area radius. Finally, simulation results show the superiority of our DRL aided design.

preprint2019arXiv

Colliding Winds in and around the Stellar Group IRS 13E at the Galactic Center

IRS~13E is an enigmatic compact group of massive stars located in projection only 3.6 arcseconds away from Sgr A*. This group has been suggested to be bounded by an intermediate-mass black hole (IMBH). We present a multi-wavelength study of the group and its interplay with the environment. Based on Chandra observations, we find the X-ray spectrum of IRS~13E can be well characterized by an optically thin thermal plasma. The emission peaks between two strongly mass-losing Wolf-Rayet stars of the group. These properties can be reasonably well reproduced by simulated colliding winds of these two stars. However, this scenario under-predicts the X-ray intensity in outer regions. The residual emission likely results from the ram-pressure confinement of the IRS~13E group wind by the ambient medium and is apparently associated with a shell-like warm gas structure seen in Pa-alpha and in ALMA observations. These latter observations also show strongly peaked thermal emission with unusually large velocity spread between the two stars. These results indicate that the group is colliding with the bar of the dense cool gas mini-spiral around Sgr A*. The extended X-ray morphology of IRS~13E and its association with the bar further suggest that the group is physically much farther away than the projected distance from Sgr A*. The presence of an IMBH, while favorable to keep the stars bound together, is not necessary to explain the observed stellar and gas properties of IRS~13E.

preprint2019arXiv

Experimental Observation of Equilibrium and Dynamical Quantum Phase Transitions via Out-of-Time-Ordered Correlators

The out-of-time-ordered correlators (OTOC) have been established as a fundamental concept for quantifying quantum information scrambling and diagnosing quantum chaotic behavior. Recently, it was theoretically proposed that the OTOC can be used as an order parameter to dynamically detect both equilibrium quantum phase transitions (EQPTs) and dynamical quantum phase transitions (DQPTs) in one-dimensional many-body systems. Here we report the first experimental observation of EQPTs and DQPTs in a quantum spin chain via quench dynamics of OTOC on a nuclear magnetic resonance quantum simulator. We observe that the quench dynamics of both the order parameter and the two-body correlation function cannot detect the DQPTs, but the OTOC can unambiguously detect the DQPTs. Moreover, we demonstrate that the long-time average value of the OTOC in quantum quench signals the equilibrium quantum critical point and ordered quantum phases, thus one can measure the EQPTs from the non-equilibrium quantum quench dynamics. Our experiment paves a way for experimentally investigating DQPTs through OTOCs and for studying the EQPTs through the non-equilibrium quantum quench dynamics with quantum simulators.

preprint2018arXiv

Electronic nature of coverage-dependent nanosurface effect by cooperative orbital redistribution

Nanomaterial surface states can effectively modify or even dominate their physical and chemical properties due to large surface-to-volume ratios. Such surface effects are highly dependent on particle size and ligand coverage, yet the underlying electronic-level mechanism still remains unknown. Using TiO2 nanosheet as a model system, we reveal the electronic nature of coverage-dependent nanosurface effects through varying ligand coverage and probing the modified surface bonding and electronic band structures with near-edge X-ray absorption fine structure. We discover experimentally that surface ligands can competitively polarize the 3d orbitals of surface Ti atoms into chemisorption states, which is cooperative with increased ligand coverages. Such coverage-dependent cooperative orbital redistribution accounts for various nanosurface effects on regulating the electronic structure, surface reactivity, optical property, and chemisorption of nanomaterials.