Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
61works
0followers
42topics
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

61 published item(s)

preprint2026arXiv

Advancing multi-site emission control: A physics-informed transfer learning framework with mixture of experts for carbon-pollutant synergy

Municipal solid waste incineration is increasingly central to urban waste management, yet its sustainability benefit depends on controlling carbon emissions and multiple air pollutants under highly heterogeneous operating conditions. Current data-driven models are often accurate within individual plants but are difficult to transfer across facilities, limiting their value for scalable emission-control strategies. Here we show that multi-site emission behaviour can be represented through transferable system-level structures when physical constraints, operating-regime heterogeneity and carbon--pollutant coupling are jointly considered. We develop a physics-informed transfer learning framework built on a carbon--pollutant mixture-of-experts model, which combines regime-dependent expert routing with conservation-based regularization and a carbon--pollutant synergistic index for integrated risk evaluation. Across 13 municipal solid waste incineration plants, the model captured both pollutant-specific emissions and system-level risk, achieving source-domain average pollutant $R^2$ values of 0.668--0.904 and CPSI $R^2$ values of 0.666--0.970. After transfer from a reference facility to 12 target plants, average pollutant $R^2$ remained between 0.661 and 0.842, while CPSI retained comparable transferability ($R^2$ = 0.610--0.841). Expert-utilization patterns further indicate that adaptation occurs through structured re-weighting of operating regimes rather than complete model re-learning. By extending the learned representation into an interpretable digital twin, this framework provides a route from emission prediction to regime-aware operational navigation, supporting scalable carbon--pollutant synergistic control across heterogeneous waste-to-energy systems.

preprint2023arXiv

A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems

We consider the storage-retrieval rate tradeoff in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook generation and the binning technique is proposed. This coding scheme reveals a hidden connection between PIR and the classic multiple description source coding problem. We first show that when the retrieval rate is kept optimal, the proposed non-linear scheme can achieve better performance over any linear scheme. Moreover, a non-trivial storage-retrieval rate tradeoff can be achieved beyond space-sharing between this extreme point and the other optimal extreme point, achieved by the retrieve-everything strategy. We further show that with a method akin to the expurgation technique, one can extract a zero-error PIR code from the random code. Outer bounds are also studied and compared to establish the superiority of the non-linear codes over linear codes.

preprint2023arXiv

Breaking Through the Haze: An Advanced Non-Homogeneous Dehazing Method based on Fast Fourier Convolution and ConvNeXt

Haze usually leads to deteriorated images with low contrast, color shift and structural distortion. We observe that many deep learning based models exhibit exceptional performance on removing homogeneous haze, but they usually fail to address the challenge of non-homogeneous dehazing. Two main factors account for this situation. Firstly, due to the intricate and non uniform distribution of dense haze, the recovery of structural and chromatic features with high fidelity is challenging, particularly in regions with heavy haze. Secondly, the existing small scale datasets for non-homogeneous dehazing are inadequate to support reliable learning of feature mappings between hazy images and their corresponding haze-free counterparts by convolutional neural network (CNN)-based models. To tackle these two challenges, we propose a novel two branch network that leverages 2D discrete wavelete transform (DWT), fast Fourier convolution (FFC) residual block and a pretrained ConvNeXt model. Specifically, in the DWT-FFC frequency branch, our model exploits DWT to capture more high-frequency features. Moreover, by taking advantage of the large receptive field provided by FFC residual blocks, our model is able to effectively explore global contextual information and produce images with better perceptual quality. In the prior knowledge branch, an ImageNet pretrained ConvNeXt as opposed to Res2Net is adopted. This enables our model to learn more supplementary information and acquire a stronger generalization ability. The feasibility and effectiveness of the proposed method is demonstrated via extensive experiments and ablation studies. The code is available at https://github.com/zhouh115/DWT-FFC.

preprint2023arXiv

Progressive with Purpose: Guiding Progressive Inpainting DNNs through Context and Structure

The advent of deep learning in the past decade has significantly helped advance image inpainting. Although achieving promising performance, deep learning-based inpainting algorithms still struggle from the distortion caused by the fusion of structural and contextual features, which are commonly obtained from, respectively, deep and shallow layers of a convolutional encoder. Motivated by this observation, we propose a novel progressive inpainting network that maintains the structural and contextual integrity of a processed image. More specifically, inspired by the Gaussian and Laplacian pyramids, the core of the proposed network is a feature extraction module named GLE. Stacking GLE modules enables the network to extract image features from different image frequency components. This ability is important to maintain structural and contextual integrity, for high frequency components correspond to structural information while low frequency components correspond to contextual information. The proposed network utilizes the GLE features to progressively fill in missing regions in a corrupted image in an iterative manner. Our benchmarking experiments demonstrate that the proposed method achieves clear improvement in performance over many state-of-the-art inpainting algorithms.

preprint2022arXiv

A spherical harmonics method for processing anisotropic X-ray atomic pair distribution functions

A general spherical harmonics method is described for extracting anisotropic pair distribution functions (PDF) in this work. In the structural study of functional crystallized materials, the investigation of the local structures under the application of external stimuli, such as electric field and stress, is in urgent need. A well-established technique for local structure studies is PDF analysis, but the extraction of the X-ray PDF data is usually based on angular integrations of isotropic X-ray structure functions, which is no longer valid for the anisotropic responses of the materials under orientation-dependent stimuli. Therefore, we have developed an advanced spherical harmonics method to transform two-dimensional X-ray diffraction patterns into anisotropic PDF data, based on three-dimensional diffraction geometry and Fourier transform. The electrical-field-induced local structural change in the PbZr0.54Ti0.46O3 ceramics is then presented to demonstrate the method's effectiveness.

preprint2022arXiv

A Unified Framework for Campaign Performance Forecasting in Online Display Advertising

Advertisers usually enjoy the flexibility to choose criteria like target audience, geographic area and bid price when planning an campaign for online display advertising, while they lack forecast information on campaign performance to optimize delivery strategies in advance, resulting in a waste of labour and budget for feedback adjustments. In this paper, we aim to forecast key performance indicators for new campaigns given any certain criteria. Interpretable and accurate results could enable advertisers to manage and optimize their campaign criteria. There are several challenges for this very task. First, platforms usually offer advertisers various criteria when they plan an advertising campaign, it is difficult to estimate campaign performance unifiedly because of the great difference among bidding types. Furthermore, complex strategies applied in bidding system bring great fluctuation on campaign performance, making estimation accuracy an extremely tough problem. To address above challenges, we propose a novel Campaign Performance Forecasting framework, which firstly reproduces campaign performance on historical logs under various bidding types with a unified replay algorithm, in which essential auction processes like match and rank are replayed, ensuring the interpretability on forecast results. Then, we innovatively introduce a multi-task learning method to calibrate the deviation of estimation brought by hard-to-reproduce bidding strategies in replay. The method captures mixture calibration patterns among related forecast indicators to map the estimated results to the true ones, improving both accuracy and efficiency significantly. Experiment results on a dataset from Taobao.com demonstrate that the proposed framework significantly outperforms other baselines by a large margin, and an online A/B test verifies its effectiveness in the real world.

preprint2022arXiv

CommerceMM: Large-Scale Commerce MultiModal Representation Learning with Omni Retrieval

We introduce CommerceMM - a multimodal model capable of providing a diverse and granular understanding of commerce topics associated to the given piece of content (image, text, image+text), and having the capability to generalize to a wide range of tasks, including Multimodal Categorization, Image-Text Retrieval, Query-to-Product Retrieval, Image-to-Product Retrieval, etc. We follow the pre-training + fine-tuning training regime and present 5 effective pre-training tasks on image-text pairs. To embrace more common and diverse commerce data with text-to-multimodal, image-to-multimodal, and multimodal-to-multimodal mapping, we propose another 9 novel cross-modal and cross-pair retrieval tasks, called Omni-Retrieval pre-training. The pre-training is conducted in an efficient manner with only two forward/backward updates for the combined 14 tasks. Extensive experiments and analysis show the effectiveness of each task. When combining all pre-training tasks, our model achieves state-of-the-art performance on 7 commerce-related downstream tasks after fine-tuning. Additionally, we propose a novel approach of modality randomization to dynamically adjust our model under different efficiency constraints.

preprint2022arXiv

CuPBoP: CUDA for Parallelized and Broad-range Processors

CUDA is one of the most popular choices for GPU programming, but it can only be executed on NVIDIA GPUs. Executing CUDA on non-NVIDIA devices not only benefits the hardware community, but also allows data-parallel computation in heterogeneous systems. To make CUDA programs portable, some researchers have proposed using source-to-source translators to translate CUDA to portable programming languages that can be executed on non-NVIDIA devices. However, most CUDA translators require additional manual modifications on the translated code, which imposes a heavy workload on developers. In this paper, CuPBoP is proposed to execute CUDA on non-NVIDIA devices without relying on any portable programming languages. Compared with existing work that executes CUDA on non-NVIDIA devices, CuPBoP does not require manual modification of the CUDA source code, but it still achieves the highest coverage (69.6%), much higher than existing frameworks (56.6%) on the Rodinia benchmark. In particular, for CPU backends, CuPBoP supports several ISAs (e.g., X86, RISC-V, AArch64) and has close or even higher performance compared with other projects. We also compare and analyze the performance among CuPBoP, manually optimized OpenMP/MPI programs, and CUDA programs on the latest Ampere architecture GPU, and show future directions for supporting CUDA programs on non-NVIDIA devices with high performance

preprint2022arXiv

Dynamical analysis and statefinder of Barrow holographic dark energy

Based on the holographic principle and the Barrow entropy, Barrow holographic dark energy had been proposed. In order to analyze the stability and the evolution of Barrow holographic dark energy, we, in this paper, apply the dynamical analysis and statefinder methods to Barrow holographic dark energy with different IR cutoff and interacting terms. In the case of using Hubble horizon as IR cutoff with the interacting term $Q=\fracλ{H}ρ_{m}ρ_{D}$, we find this model is stable and can be used to describe the whole evolution of the universe when the energy transfers from the pressureless matter to the Barrow holographic dark energy. When the dynamical analysis method is applied to this stable model, an attractor corresponding to an accelerated expansion epoch exists and this attractor can behave as the cosmological constant. Furthermore, the coincidence problem can be solved in this case. Then, after using the statefinder analysis method to this model, we find this model can be discriminated from the standard $Λ$CDM model. Finally, we have discussed the turning point of Hubble diagram in Barrow holographic dark energy and find the turning point does not exist in this model.

preprint2022arXiv

Dynamically Stable Poincaré Embeddings for Neural Manifolds

In a Riemannian manifold, the Ricci flow is a partial differential equation for evolving the metric to become more regular. We hope that topological structures from such metrics may be used to assist in the tasks of machine learning. However, this part of the work is still missing. In this paper, we propose Ricci flow assisted Eucl2Hyp2Eucl neural networks that bridge this gap between the Ricci flow and deep neural networks by mapping neural manifolds from the Euclidean space to the dynamically stable Poincaré ball and then back to the Euclidean space. As a result, we prove that, if initial metrics have an $L^2$-norm perturbation which deviates from the Hyperbolic metric on the Poincaré ball, the scaled Ricci-DeTurck flow of such metrics smoothly and exponentially converges to the Hyperbolic metric. Specifically, the role of the Ricci flow is to serve as naturally evolving to the stable Poincaré ball. For such dynamically stable neural manifolds under the Ricci flow, the convergence of neural networks embedded with such manifolds is not susceptible to perturbations. And we show that Ricci flow assisted Eucl2Hyp2Eucl neural networks outperform with their all Euclidean counterparts on image classification tasks.

preprint2022arXiv

Event-Triggered Model Predictive Control with Deep Reinforcement Learning for Autonomous Driving

Event-triggered model predictive control (eMPC) is a popular optimal control method with an aim to alleviate the computation and/or communication burden of MPC. However, it generally requires priori knowledge of the closed-loop system behavior along with the communication characteristics for designing the event-trigger policy. This paper attempts to solve this challenge by proposing an efficient eMPC framework and demonstrate successful implementation of this framework on the autonomous vehicle path following. First of all, a model-free reinforcement learning (RL) agent is used to learn the optimal event-trigger policy without the need for a complete dynamical system and communication knowledge in this framework. Furthermore, techniques including prioritized experience replay (PER) buffer and long-short term memory (LSTM) are employed to foster exploration and improve training efficiency. In this paper, we use the proposed framework with three deep RL algorithms, i.e., Double Q-learning (DDQN), Proximal Policy Optimization (PPO), and Soft Actor-Critic (SAC), to solve this problem. Experimental results show that all three deep RL-based eMPC (deep-RL-eMPC) can achieve better evaluation performance than the conventional threshold-based and previous linear Q-based approach in the autonomous path following. In particular, PPO-eMPC with LSTM and DDQN-eMPC with PER and LSTM obtains a superior balance between the closed-loop control performance and event-trigger frequency. The associated code is open-sourced and available at: https://github.com/DangFengying/RL-based-event-triggered-MPC.

preprint2022arXiv

FullSubNet+: Channel Attention FullSubNet with Complex Spectrograms for Speech Enhancement

Previously proposed FullSubNet has achieved outstanding performance in Deep Noise Suppression (DNS) Challenge and attracted much attention. However, it still encounters issues such as input-output mismatch and coarse processing for frequency bands. In this paper, we propose an extended single-channel real-time speech enhancement framework called FullSubNet+ with following significant improvements. First, we design a lightweight multi-scale time sensitive channel attention (MulCA) module which adopts multi-scale convolution and channel attention mechanism to help the network focus on more discriminative frequency bands for noise reduction. Then, to make full use of the phase information in noisy speech, our model takes all the magnitude, real and imaginary spectrograms as inputs. Moreover, by replacing the long short-term memory (LSTM) layers in original full-band model with stacked temporal convolutional network (TCN) blocks, we design a more efficient full-band module called full-band extractor. The experimental results in DNS Challenge dataset show the superior performance of our FullSubNet+, which reaches the state-of-the-art (SOTA) performance and outperforms other existing speech enhancement approaches.

preprint2022arXiv

Gadolinium halide monolayers: a fertile family of two-dimensional 4f magnets

Two-dimensional (2D) magnets have great potentials for applications in next-generation information devices. Since the recent experimental discovery of intrinsic 2D magnetism in monolayer CrI$_3$ and few-layer Cr$_2$Ge$_2$Te$_6$, intensive studies have been stimulated in pursuing more 2D magnets and revealing their intriguing physical properties. In comparison to the magnetism based on $3d$ electrons, $4f$ electrons can provide larger magnetic moments and stronger spin-orbit coupling, but have been much less studied in the 2D forms. Only in very recent years, some exciting results have been obtained in this area. In this mini-review, we will introduce some recent progress in 2D Gd halides from a theoretical aspect. It is noteworthy that $4f$ and $5d$ orbitals of Gd both play key roles in these materials. For Gd$X_2$ ($X$=I, Br, Cl and F) monolayers and related Janus monolayers, robust ferromagnetism with large exchanges comes from the $4f^7$+$5d^1$ hybridization of Gd$^{2+}$. The spatially expanded $5d$ electrons act as a bridge to couple localized $4f$ spins. For Gd$X_3$ monolayers, the intercalation of metal atoms can dope electrons into Gd's $5d$ orbitals, which leads to numerous intriguing physical properties, such as ferroelasticity, ferromagnetism, and anisotropic conductance. In brief, Gd halides establish an effective strategy to take advantage of $f$-electron magnetism in 2D materials.

preprint2022arXiv

Indirect Domain Shift for Single Image Dehazing

Despite their remarkable expressibility, convolution neural networks (CNNs) still fall short of delivering satisfactory results on single image dehazing, especially in terms of faithful recovery of fine texture details. In this paper, we argue that the inadequacy of conventional CNN-based dehazing methods can be attributed to the fact that the domain of hazy images is too far away from that of clear images, rendering it difficult to train a CNN for learning direct domain shift through an end-to-end manner and recovering texture details simultaneously. To address this issue, we propose to add explicit constraints inside a deep CNN model to guide the restoration process. In contrast to direct learning, the proposed mechanism shifts and narrows the candidate region for the estimation output via multiple confident neighborhoods. Therefore, it is capable of consolidating the expressibility of different architectures, resulting in a more accurate indirect domain shift (IDS) from the hazy images to that of clear images. We also propose two different training schemes, including hard IDS and soft IDS, which further reveal the effectiveness of the proposed method. Our extensive experimental results indicate that the dehazing method based on this mechanism outperforms the state-of-the-arts.

preprint2022arXiv

LinDA: linear models for differential abundance analysis of microbiome compositional data

Differential abundance analysis is at the core of statistical analysis of microbiome data. The compositional nature of microbiome sequencing data makes false positive control challenging. Here, we show that the compositional effects can be addressed by a simple, yet highly flexible and scalable, approach. The proposed method, LinDA, only requires fitting linear regression models on the centered log-ratio transformed data, and correcting the bias due to compositional effects. We show that LinDA enjoys asymptotic FDR control and can be extended to mixed-effect models for correlated microbiome data. Using simulations and real examples, we demonstrate the effectiveness of LinDA.

preprint2022arXiv

NTIRE 2021 Challenge on Quality Enhancement of Compressed Video: Methods and Results

This paper reviews the first NTIRE challenge on quality enhancement of compressed video, with a focus on the proposed methods and results. In this challenge, the new Large-scale Diverse Video (LDV) dataset is employed. The challenge has three tracks. Tracks 1 and 2 aim at enhancing the videos compressed by HEVC at a fixed QP, while Track 3 is designed for enhancing the videos compressed by x265 at a fixed bit-rate. Besides, the quality enhancement of Tracks 1 and 3 targets at improving the fidelity (PSNR), and Track 2 targets at enhancing the perceptual quality. The three tracks totally attract 482 registrations. In the test phase, 12 teams, 8 teams and 11 teams submitted the final results of Tracks 1, 2 and 3, respectively. The proposed methods and solutions gauge the state-of-the-art of video quality enhancement. The homepage of the challenge: https://github.com/RenYang-home/NTIRE21_VEnh

preprint2022arXiv

NTIRE 2022 Challenge on Efficient Super-Resolution: Methods and Results

This paper reviews the NTIRE 2022 challenge on efficient single image super-resolution with focus on the proposed solutions and results. The task of the challenge was to super-resolve an input image with a magnification factor of $\times$4 based on pairs of low and corresponding high resolution images. The aim was to design a network for single image super-resolution that achieved improvement of efficiency measured according to several metrics including runtime, parameters, FLOPs, activations, and memory consumption while at least maintaining the PSNR of 29.00dB on DIV2K validation set. IMDN is set as the baseline for efficiency measurement. The challenge had 3 tracks including the main track (runtime), sub-track one (model complexity), and sub-track two (overall performance). In the main track, the practical runtime performance of the submissions was evaluated. The rank of the teams were determined directly by the absolute value of the average runtime on the validation set and test set. In sub-track one, the number of parameters and FLOPs were considered. And the individual rankings of the two metrics were summed up to determine a final ranking in this track. In sub-track two, all of the five metrics mentioned in the description of the challenge including runtime, parameter count, FLOPs, activations, and memory consumption were considered. Similar to sub-track one, the rankings of five metrics were summed up to determine a final ranking. The challenge had 303 registered participants, and 43 teams made valid submissions. They gauge the state-of-the-art in efficient single image super-resolution.

preprint2022arXiv

On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. The minimum compression rate of this network versus the distortion threshold is referred to as the rate-distortion function, for which an explicit lower bound is established by solving a minimization problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic gap between the upper and lower bounds is characterized in the large $L$ limit.

preprint2022arXiv

On Optimal Power Control for Energy Harvesting Communications with Lookahead

Consider the problem of power control for an energy harvesting communication system, where the transmitter is equipped with a finite-sized rechargeable battery and is able to look ahead to observe a fixed number of future energy arrivals. An implicit characterization of the maximum average throughput over an additive white Gaussian noise channel and the associated optimal power control policy is provided via the Bellman equation under the assumption that the energy arrival process is stationary and memoryless. A more explicit characterization is obtained for the case of Bernoulli energy arrivals by means of asymptotically tight upper and lower bounds on both the maximum average throughput and the optimal power control policy. Apart from their pivotal role in deriving the desired analytical results, such bounds are highly valuable from a numerical perspective as they can be efficiently computed using convex optimization solvers.

preprint2022arXiv

On the Rate-Distortion-Perception Function

Rate-distortion-perception theory generalizes Shannon's rate-distortion theory by introducing a constraint on the perceptual quality of the output. The perception constraint complements the conventional distortion constraint and aims to enforce distribution-level consistencies. In this new theory, the information-theoretic limit is characterized by the rate-distortion-perception function. Although a coding theorem for the rate-distortion-perception function has recently been established, the fundamental nature of the optimal coding schemes remains unclear, especially regarding the role of randomness in encoding and decoding. It is shown in the present work that except for certain extreme cases, the rate-distortion-perception function is achievable by deterministic codes. This paper also clarifies the subtle differences between two notions of perfect perceptual quality and explores some alternative formulations of the perception constraint.

preprint2022arXiv

Probabilistic Guaranteed Path Planning for Safe Urban Air Mobility Using Chance Constrained RRT

Safety is a critical concern for the success of urban air mobility, especially in dynamic and uncertain environments. This paper proposes a path planning algorithm based on RRT in conjunction with chance constraints in the presence of uncertain obstacles. The chance-constrained formulation for Gaussian distributed obstacles is developed by converting the probabilistic constraints to deterministic constraints in terms of distribution parameters. The probabilistic feasible region at every time step can be established through the simulation of the system state and the evaluation of convex constraints. Through establishing chance-constrained RRT, the algorithm not only enjoys the benefits of sampling-based algorithms but also incorporates uncertainty into the formulation. Simulation results demonstrate that the planning for a trajectory connecting the starting and goal point in accordance with the requirement of probabilistic obstacle avoidance can be achieved by the utilization of this algorithm.

preprint2022arXiv

PSCC-Net: Progressive Spatio-Channel Correlation Network for Image Manipulation Detection and Localization

To defend against manipulation of image content, such as splicing, copy-move, and removal, we develop a Progressive Spatio-Channel Correlation Network (PSCC-Net) to detect and localize image manipulations. PSCC-Net processes the image in a two-path procedure: a top-down path that extracts local and global features and a bottom-up path that detects whether the input image is manipulated, and estimates its manipulation masks at multiple scales, where each mask is conditioned on the previous one. Different from the conventional encoder-decoder and no-pooling structures, PSCC-Net leverages features at different scales with dense cross-connections to produce manipulation masks in a coarse-to-fine fashion. Moreover, a Spatio-Channel Correlation Module (SCCM) captures both spatial and channel-wise correlations in the bottom-up path, which endows features with holistic cues, enabling the network to cope with a wide range of manipulation attacks. Thanks to the light-weight backbone and progressive mechanism, PSCC-Net can process 1,080P images at 50+ FPS. Extensive experiments demonstrate the superiority of PSCC-Net over the state-of-the-art methods on both detection and localization.

preprint2022arXiv

RelTransformer: A Transformer-Based Long-Tail Visual Relationship Recognition

The visual relationship recognition (VRR) task aims at understanding the pairwise visual relationships between interacting objects in an image. These relationships typically have a long-tail distribution due to their compositional nature. This problem gets more severe when the vocabulary becomes large, rendering this task very challenging. This paper shows that modeling an effective message-passing flow through an attention mechanism can be critical to tackling the compositionality and long-tail challenges in VRR. The method, called RelTransformer, represents each image as a fully-connected scene graph and restructures the whole scene into the relation-triplet and global-scene contexts. It directly passes the message from each element in the relation-triplet and global-scene contexts to the target relation via self-attention. We also design a learnable memory to augment the long-tail relation representation learning. Through extensive experiments, we find that our model generalizes well on many VRR benchmarks. Our model outperforms the best-performing models on two large-scale long-tail VRR benchmarks, VG8K-LT (+2.0% overall acc) and GQA-LT (+26.0% overall acc), both having a highly skewed distribution towards the tail. It also achieves strong results on the VG200 relation detection task. Our code is available at https://github.com/Vision-CAIR/RelTransformer.

preprint2022arXiv

Stability analysis of the Tsallis holographic dark energy model

Using the generalized Tsallis entropy, the Tsallis holographic dark energy(THDE) was proposed recently. In this paper we analyze the cosmological consequences of the THDE model with an interaction between dark energy and dark matter $Q=H(αρ_{m}+βρ_{D})$. We find that the THDE model can explain the current accelerated cosmic expansion, and it is stable under certain conditions. Furthermore, through investigating the dynamical analysis, we find that there exists an attractor which represents an accelerated expansion phase of the universe. When $β=0$, this attractor corresponds to a dark energy dominated de Sitter solution and the universe can evolve into an era which is depicted by the $Λ$CDM model. The age of universe in this model is also explored.

preprint2022arXiv

Strain Effect on Air-Stability of Monolayer CrSe2

The discovery of two dimensional (2D) magnetic materials has brought great research value for spintronics and data storage devices. However, their air-stability as well as the oxidation mechanism has not been unveiled, which limits their further applications. Here, by first-principles calculations, we carried out a detailed study on the oxidation process of monolayer CrSe2 and biaxial tensile strain effect. We found dissociation process of O2 on pristine CrSe2 sheet is an endothermic reaction with a reaction energy barrier of 0.53 eV, indicating its thermodynamics stability. However, such a process becomes exothermic under a biaxial tensile strain reaching 1%, accompanying with a decreased reaction barrier, leading to reduced stability. These results manifest that in-plane strain plays a significant role in modifying air-stability in CrSe2 and shed considerable light on searching appropriate substrate to stabilize 2D magnetic materials.

preprint2022arXiv

Structural reconstruction and anisotropic conductance in $4f$-ferromagnetic monolayer

Two-dimensional magnets are promising for nanoscale spintronic applications. Currently, most available candidates are based on $3d$ transition metal compounds, with hexagonal or honeycomb lattice geometry. Here, a GdCl$_3$ monolayer with $4f$ moments is theoretically studied, which can be exfoliated from its existing bulk. Its orthorhombic structure and hendecahedral ion cages are unique in two-dimensional. Furthermore, a significant structural reconstruction is caused by the implantation of Li atoms into its interstitial position, which also lead to ferromagnetism via a double-exchange-like process. Its highly anisotropic conductance may be peculiarly useful for nanoelectronics.

preprint2022arXiv

SuperLine3D: Self-supervised Line Segmentation and Description for LiDAR Point Cloud

Poles and building edges are frequently observable objects on urban roads, conveying reliable hints for various computer vision tasks. To repetitively extract them as features and perform association between discrete LiDAR frames for registration, we propose the first learning-based feature segmentation and description model for 3D lines in LiDAR point cloud. To train our model without the time consuming and tedious data labeling process, we first generate synthetic primitives for the basic appearance of target lines, and build an iterative line auto-labeling process to gradually refine line labels on real LiDAR scans. Our segmentation model can extract lines under arbitrary scale perturbations, and we use shared EdgeConv encoder layers to train the two segmentation and descriptor heads jointly. Base on the model, we can build a highly-available global registration module for point cloud registration, in conditions without initial transformation hints. Experiments have demonstrated that our line-based registration method is highly competitive to state-of-the-art point-based approaches. Our code is available at https://github.com/zxrzju/SuperLine3D.git.

preprint2022arXiv

Thoughts on the Consistency between Ricci Flow and Neural Network Behavior

The Ricci flow is a partial differential equation for evolving the metric in a Riemannian manifold to make it more regular. On the other hand, neural networks seem to have similar geometric behavior for specific tasks. In this paper, we construct the linearly nearly Euclidean manifold as a background to observe the evolution of Ricci flow and the training of neural networks. Under the Ricci-DeTurck flow, we prove the dynamical stability and convergence of the linearly nearly Euclidean metric for an $L^2$-Norm perturbation. In practice, from the information geometry and mirror descent points of view, we give the steepest descent gradient flow for neural networks on the linearly nearly Euclidean manifold. During the training process of the neural network, we observe that its metric will also regularly converge to the linearly nearly Euclidean metric, which is consistent with the convergent behavior of linearly nearly Euclidean metrics under the Ricci-DeTurck flow.

preprint2022arXiv

Video Frame Interpolation Transformer

Existing methods for video interpolation heavily rely on deep convolution neural networks, and thus suffer from their intrinsic limitations, such as content-agnostic kernel weights and restricted receptive field. To address these issues, we propose a Transformer-based video interpolation framework that allows content-aware aggregation weights and considers long-range dependencies with the self-attention operations. To avoid the high computational cost of global self-attention, we introduce the concept of local attention into video interpolation and extend it to the spatial-temporal domain. Furthermore, we propose a space-time separation strategy to save memory usage, which also improves performance. In addition, we develop a multi-scale frame synthesis scheme to fully realize the potential of Transformers. Extensive experiments demonstrate the proposed model performs favorably against the state-of-the-art methods both quantitatively and qualitatively on a variety of benchmark datasets.

preprint2022arXiv

VisualGPT: Data-efficient Adaptation of Pretrained Language Models for Image Captioning

The ability to quickly learn from a small quantity oftraining data widens the range of machine learning applications. In this paper, we propose a data-efficient image captioning model, VisualGPT, which leverages the linguistic knowledge from a large pretrained language model(LM). A crucial challenge is to balance between the use of visual information in the image and prior linguistic knowledge acquired from pretraining. We designed a novel self-resurrecting encoder-decoder attention mechanism to quickly adapt the pretrained LM as the language decoder ona small amount of in-domain training data. The proposed self-resurrecting activation unit produces sparse activations but has reduced susceptibility to zero gradients. We train the proposed model, VisualGPT, on 0.1%, 0.5% and 1% of MSCOCO and Conceptual Captions training data. Under these conditions, we outperform the best baseline model by up to 10.8% CIDEr on MS COCO and upto 5.4% CIDEr on Conceptual Captions. Further, Visual-GPT achieves the state-of-the-art result on IU X-ray, a medical report generation dataset. To the best of our knowledge, this is the first work that improves data efficiency of image captioning by utilizing LM pretrained on unimodal data. Our code is available at: https://github.com/Vision-CAIR/VisualGPT.

preprint2022arXiv

whu-nercms at trecvid2021:instance search task

We will make a brief introduction of the experimental methods and results of the WHU-NERCMS in the TRECVID2021 in the paper. This year we participate in the automatic and interactive tasks of Instance Search (INS). For the automatic task, the retrieval target is divided into two parts, person retrieval, and action retrieval. We adopt a two-stage method including face detection and face recognition for person retrieval and two kinds of action detection methods consisting of three frame-based human-object interaction detection methods and two video-based general action detection methods for action retrieval. After that, the person retrieval results and action retrieval results are fused to initialize the result ranking lists. In addition, we make attempts to use complementary methods to further improve search performance. For interactive tasks, we test two different interaction strategies on the fusion results. We submit 4 runs for automatic and interactive tasks respectively. The introduction of each run is shown in Table 1. The official evaluations show that the proposed strategies rank 1st in both automatic and interactive tracks.

preprint2021arXiv

Edge-Featured Graph Attention Network

Lots of neural network architectures have been proposed to deal with learning tasks on graph-structured data. However, most of these models concentrate on only node features during the learning process. The edge features, which usually play a similarly important role as the nodes, are often ignored or simplified by these models. In this paper, we present edge-featured graph attention networks, namely EGATs, to extend the use of graph neural networks to those tasks learning on graphs with both node and edge features. These models can be regarded as extensions of graph attention networks (GATs). By reforming the model structure and the learning process, the new models can accept node and edge features as inputs, incorporate the edge information into feature representations, and iterate both node and edge features in a parallel but mutual way. The results demonstrate that our work is highly competitive against other node classification approaches, and can be well applied in edge-featured graph learning tasks.

preprint2021arXiv

Evidence of Andreev blockade in a double quantum dot coupled to a superconductor

We design and investigate an experimental system capable of entering an electron transport blockade regime in which a spin-triplet localized in the path of current is forbidden from entering a spin-singlet superconductor. To stabilize the triplet a double quantum dot is created electrostatically near a superconducting lead in an InAs nanowire. The dots are filled stochastically with electrons of either spin. The superconducting lead is a molecular beam epitaxy grown Al shell. The shell is etched away over a wire segment to make room for the double dot and the normal metal gold lead. The quantum dot closest to the normal lead exhibits Coulomb diamonds, the dot closest to the superconducting lead exhibits Andreev bound states and an induced gap. The experimental observations compare favorably to a theoretical model of Andreev blockade, named so because the triplet double dot configuration suppresses Andreev reflections. Observed leakage currents can be accounted for by finite temperature. We observe the predicted quadruple level degeneracy points of high current and a periodic conductance pattern controlled by the occupation of the normal dot. Even-odd transport asymmetry is lifted with increased temperature and magnetic field. This blockade phenomenon can be used to study spin structure of superconductors. It may also find utility in quantum computing devices that utilize Andreev or Majorana states.

preprint2021arXiv

Exploit Camera Raw Data for Video Super-Resolution via Hidden Markov Model Inference

To the best of our knowledge, the existing deep-learning-based Video Super-Resolution (VSR) methods exclusively make use of videos produced by the Image Signal Processor (ISP) of the camera system as inputs. Such methods are 1) inherently suboptimal due to information loss incurred by non-invertible operations in ISP, and 2) inconsistent with the real imaging pipeline where VSR in fact serves as a pre-processing unit of ISP. To address this issue, we propose a new VSR method that can directly exploit camera sensor data, accompanied by a carefully built Raw Video Dataset (RawVD) for training, validation, and testing. This method consists of a Successive Deep Inference (SDI) module and a reconstruction module, among others. The SDI module is designed according to the architectural principle suggested by a canonical decomposition result for Hidden Markov Model (HMM) inference; it estimates the target high-resolution frame by repeatedly performing pairwise feature fusion using deformable convolutions. The reconstruction module, built with elaborately designed Attention-based Residual Dense Blocks (ARDBs), serves the purpose of 1) refining the fused feature and 2) learning the color information needed to generate a spatial-specific transformation for accurate color correction. Extensive experiments demonstrate that owing to the informativeness of the camera raw data, the effectiveness of the network architecture, and the separation of super-resolution and color correction processes, the proposed method achieves superior VSR results compared to the state-of-the-art and can be adapted to any specific camera-ISP. Code and dataset are available at https://github.com/proteus1991/RawVSR.

preprint2021arXiv

Pre-eruption Splitting of the Double-Decker Structure in a Solar Filament

Solar filaments often erupt partially. Although how they split remains elusive, the splitting process has the potential of revealing the filament structure and eruption mechanism. Here we investigate the pre-eruption splitting of an apparently single filament and its subsequent partial eruption on 2012 September 27. The evolution is characterized by three stages with distinct dynamics. During the quasi-static stage, the splitting proceeds gradually for about 1.5 hrs, with the upper branch rising at a few kilometers per second and displaying swirling motions about its axis. During the precursor stage that lasts for about 10 min, the upper branch rises at tens of kilometers per second, with a pair of conjugated dimming regions starting to develop at its footpoints; with the swirling motions turning chaotic, the axis of the upper branch whips southward, which drives an arc-shaped EUV front propagating in the similar direction. During the eruption stage, the upper branch erupts with the onset of a C3.7-class two-ribbon flare, while the lower branch remains stable. Judging from the well separated footpoints of the upper branch from those of the lower one, we suggest that the pre-eruption filament processes a double-decker structure composed of two distinct flux bundles, whose formation is associated with gradual magnetic flux cancellations and converging photospheric flows around the polarity inversion line.

preprint2021arXiv

Twist-induced control of near-field heat radiation between magnetic Weyl semimetals

Due to the large anomalous Hall effect, magnetic Weyl semimetals can support nonreciprocal surface plasmon polariton modes in the absence of an external magnetic field. This implies that magnetic Weyl semimetals can find novel application in (thermal) photonics. In this work, we consider the near-field radiative heat transfer between two magnetic Weyl semimetal slabs and show that the heat transfer can be controlled with a relative rotation of the parallel slabs. Thanks to the intrinsic nonreciprocity of the surface modes, this so-called twisting method does not require surface structuring like periodic gratings. The twist-induced control of heat transfer is due to the mismatch of the surface modes from the two slabs with a relative rotation.

preprint2021arXiv

Unzipping chemical bond of non-layered bulk structures to form ultrathin nanocrystals

The rich electronic and band structures of monolayered crystals distinguished from their layered bulk counterparts offer versatile physical/chemical properties and applications.1-5 Their fabrications, particularly the top-down "exfoliations", are successful promised by the weak Van der Waals force between monolayers.6-9 Differentially, un-zipping ultra-thin crystals (e.g. with only one layer of crystal plane) from non-layered structures is highly challenging due to the strong chemical bond between planes and atoms. Alterative finely controlled growth of these ultra-thin materials is not really successful. This work demonstrates how a technique can be used to unzip and disintegrate ultra-thin crystal plane (e.g. monolayered nanocrystals and nanosheets) from bulk non-layered structures (ZnO, alpha/belta-MnO2, TiO2, alpha-TiB2), and present how the basic optical properties changed to distinguish from their bulk phases. The work here gives a strong tool kit to various novel 2D non-layered nanomaterials, providing significant contributions to the family of two-dimensional materials, potentially paving the way for various practical applications.

preprint2020arXiv

A Learning Framework for n-bit Quantized Neural Networks toward FPGAs

The quantized neural network (QNN) is an efficient approach for network compression and can be widely used in the implementation of FPGAs. This paper proposes a novel learning framework for n-bit QNNs, whose weights are constrained to the power of two. To solve the gradient vanishing problem, we propose a reconstructed gradient function for QNNs in back-propagation algorithm that can directly get the real gradient rather than estimating an approximate gradient of the expected loss. We also propose a novel QNN structure named n-BQ-NN, which uses shift operation to replace the multiply operation and is more suitable for the inference on FPGAs. Furthermore, we also design a shift vector processing element (SVPE) array to replace all 16-bit multiplications with SHIFT operations in convolution operation on FPGAs. We also carry out comparable experiments to evaluate our framework. The experimental results show that the quantized models of ResNet, DenseNet and AlexNet through our learning framework can achieve almost the same accuracies with the original full-precision models. Moreover, when using our learning framework to train our n-BQ-NN from scratch, it can achieve state-of-the-art results compared with typical low-precision QNNs. Experiments on Xilinx ZCU102 platform show that our n-BQ-NN with our SVPE can execute 2.9 times faster than with the vector processing element (VPE) in inference. As the SHIFT operation in our SVPE array will not consume Digital Signal Processings (DSPs) resources on FPGAs, the experiments have shown that the use of SVPE array also reduces average energy consumption to 68.7% of the VPE array with 16-bit.

preprint2020arXiv

Anharmonicity and scissoring modes in the negative thermal expansion materials ScF$_3$ and CaZrF$_6$

We use a symmetry-motivated approach to analysing X-ray pair distribution functions to study the mechanism of negative thermal expansion in two ReO$_3$-like compounds; ScF$_3$ and CaZrF$_6$. Both average and local structure suggest that it is the flexibility of M-F-M linkages (M = Ca, Zr, Sc) due to dynamic rigid and semi-rigid "scissoring" modes that facilitates the observed NTE behaviour. The amplitudes of these dynamic distortions are greater for CaZrF$_6$ than for ScF$_3$, which corresponds well with the larger magnitude of the thermal expansion reported in the literature for the former. We show that this flexbility is enhanced in CaZrF$_6$ due to the rock-salt ordering mixing the characters of two of these scissoring modes. Additionally, we show that in ScF$_3$ anharmonic coupling between the modes responsible for the structural flexibility and the rigid unit modes contributes to the unusually high NTE behaviour in this material.

preprint2020arXiv

AWNet: Attentive Wavelet Network for Image ISP

As the revolutionary improvement being made on the performance of smartphones over the last decade, mobile photography becomes one of the most common practices among the majority of smartphone users. However, due to the limited size of camera sensors on phone, the photographed image is still visually distinct to the one taken by the digital single-lens reflex (DSLR) camera. To narrow this performance gap, one is to redesign the camera image signal processor (ISP) to improve the image quality. Owing to the rapid rise of deep learning, recent works resort to the deep convolutional neural network (CNN) to develop a sophisticated data-driven ISP that directly maps the phone-captured image to the DSLR-captured one. In this paper, we introduce a novel network that utilizes the attention mechanism and wavelet transform, dubbed AWNet, to tackle this learnable image ISP problem. By adding the wavelet transform, our proposed method enables us to restore favorable image details from RAW information and achieve a larger receptive field while remaining high efficiency in terms of computational cost. The global context block is adopted in our method to learn the non-local color mapping for the generation of appealing RGB images. More importantly, this block alleviates the influence of image misalignment occurred on the provided dataset. Experimental results indicate the advances of our design in both qualitative and quantitative measurements. The code is available publically.

preprint2020arXiv

Controlling the helicity of magnetic skyrmions by electrical field in frustrated magnets

The skyrmions generated by frustration in centrosymmetric structures host extra internal degrees of freedom: vorticity and helicity, resulting in distinctive properties and potential functionality, which are not shared by the skyrmions stemming from the Dzyaloshinskii-Moriya interaction in noncentrosymmetric structures. The present work indicates that the magnetism-driven electric polarization carried by skyrmions provides a direct handle for tuning helicity. Especially for the in-plane magnetized skyrmions, the helicity can be continuously rotated and exactly picked by applying an external electric field for both skyrmions and antiskyrmions. The in-plane uniaxial anisotropy is beneficial to this manipulation.

preprint2020arXiv

Covariate Adaptive False Discovery Rate Control with Applications to Omics-Wide Multiple Testing

Conventional multiple testing procedures often assume hypotheses for different features are exchangeable. However, in many scientific applications, additional covariate information regarding the patterns of signals and nulls are available. In this paper, we introduce an FDR control procedure in large-scale inference problem that can incorporate covariate information. We develop a fast algorithm to implement the proposed procedure and prove its asymptotic validity even when the underlying model is misspecified and the p-values are weakly dependent (e.g., strong mixing). Extensive simulations are conducted to study the finite sample performance of the proposed method and we demonstrate that the new approach improves over the state-of-the-art approaches by being flexible, robust, powerful and computationally efficient. We finally apply the method to several omics datasets arising from genomics studies with the aim to identify omics features associated with some clinical and biological phenotypes. We show that the method is overall the most powerful among competing methods, especially when the signal is sparse. The proposed Covariate Adaptive Multiple Testing procedure is implemented in the R package CAMT.

preprint2020arXiv

Efficient long-distance relation extraction with DG-SpanBERT

In natural language processing, relation extraction seeks to rationally understand unstructured text. Here, we propose a novel SpanBERT-based graph convolutional network (DG-SpanBERT) that extracts semantic features from a raw sentence using the pre-trained language model SpanBERT and a graph convolutional network to pool latent features. Our DG-SpanBERT model inherits the advantage of SpanBERT on learning rich lexical features from large-scale corpus. It also has the ability to capture long-range relations between entities due to the usage of GCN on dependency tree. The experimental results show that our model outperforms other existing dependency-based and sequence-based models and achieves a state-of-the-art performance on the TACRED dataset.

preprint2020arXiv

End-To-End Trainable Video Super-Resolution Based on a New Mechanism for Implicit Motion Estimation and Compensation

Video super-resolution aims at generating a high-resolution video from its low-resolution counterpart. With the rapid rise of deep learning, many recently proposed video super-resolution methods use convolutional neural networks in conjunction with explicit motion compensation to capitalize on statistical dependencies within and across low-resolution frames. Two common issues of such methods are noteworthy. Firstly, the quality of the final reconstructed HR video is often very sensitive to the accuracy of motion estimation. Secondly, the warp grid needed for motion compensation, which is specified by the two flow maps delineating pixel displacements in horizontal and vertical directions, tends to introduce additional errors and jeopardize the temporal consistency across video frames. To address these issues, we propose a novel dynamic local filter network to perform implicit motion estimation and compensation by employing, via locally connected layers, sample-specific and position-specific dynamic local filters that are tailored to the target pixels. We also propose a global refinement network based on ResBlock and autoencoder structures to exploit non-local correlations and enhance the spatial consistency of super-resolved frames. The experimental results demonstrate that the proposed method outperforms the state-of-the-art, and validate its strength in terms of local transformation handling, temporal consistency as well as edge sharpness.

preprint2020arXiv

How to model honeybee population dynamics: stage structure and seasonality

Western honeybees (Apis Mellifera) serve extremely important roles in our ecosystem and economics as they are responsible for pollinating $ 215 billion dollars annually over the world. Unfortunately, honeybee population and their colonies have been declined dramatically. The purpose of this article is to explore how we should model honeybee population with age structure and validate the model using empirical data so that we can identify different factors that lead to the survival and healthy of the honeybee colony. Our theoretical study combined with simulations and data validation suggests that the proper age structure incorporated in the model and seasonality are important for modeling honeybee population. Specifically, our work implies that the model assuming that (1) the adult bees are survived from the {egg population} rather than the brood population; and (2) seasonality in the queen egg laying rate, give the better fit than other honeybee models. The related theoretical and numerical analysis of the most fit model indicate that (a) the survival of honeybee colonies requires a large queen egg-laying rate and smaller values of the other life history parameter values in addition to proper initial condition; (b) both brood and adult bee populations are increasing with respect to the increase in the {egg-laying rate} and the decreasing in other parameter values; and (c) seasonality may promote/suppress the survival of the honeybee colony.

preprint2020arXiv

Joint Optimization of Transfer Location and Capacity in a Multimodal Transport Network: Bilevel Modeling and Paradoxes

With the growing attention towards developing the multimodal transport system to enhance urban mobility, there is an increasing need to construct new, rebuild or expand existing infrastructure to facilitate existing and accommodate newly generated travel demand. Therefore, this paper develops a bilevel model to simultaneously determine the location and capacity of the transfer infrastructure to be built considering elastic demand in a multimodal transport network. The upper level problem is formulated as a mixed integer linear programming problem, while the lower level problem is the capacitated combined trip distribution assignment model that depicts both destination and route choices of travelers via the multinomial logit formula. To solve the model, the paper develops a matheuristics algorithm that integrates a Genetic Algorithm and a successive linear programming solution approach. Numerical studies are conducted to demonstrate the existence and examine two Braess like paradox phenomena in a multimodal transport network. The first one states that under fixed demand constructing parking spaces to stimulate the usage of Park and Ride service could deteriorate the system performance, measured by the total passengers travel time, while the second one reveals that under variable demand increasing the parking capacity for the Park and Ride services to promote the usages may fail, represented by the decline in its modal share. Meanwhile, the last experiment suggests that constructing transfer infrastructures at distributed stations outperforms building a large transfer center in terms of attracting travelers using sustainable transit modes.

preprint2020arXiv

NTIRE 2020 Challenge on Image Demoireing: Methods and Results

This paper reviews the Challenge on Image Demoireing that was part of the New Trends in Image Restoration and Enhancement (NTIRE) workshop, held in conjunction with CVPR 2020. Demoireing is a difficult task of removing moire patterns from an image to reveal an underlying clean image. The challenge was divided into two tracks. Track 1 targeted the single image demoireing problem, which seeks to remove moire patterns from a single image. Track 2 focused on the burst demoireing problem, where a set of degraded moire images of the same scene were provided as input, with the goal of producing a single demoired image as output. The methods were ranked in terms of their fidelity, measured using the peak signal-to-noise ratio (PSNR) between the ground truth clean images and the restored images produced by the participants' methods. The tracks had 142 and 99 registered participants, respectively, with a total of 14 and 6 submissions in the final testing stage. The entries span the current state-of-the-art in image and burst image demoireing problems.

preprint2020arXiv

Population dynamics of Varroa mite and honeybee: Effects of parasitism with age structure and seasonality

Honeybees play an important role in the production of many agricultural crops and in sustaining plant diversity in undisturbed ecosystems. The rapid decline of honeybee populations have sparked great concern worldwide. Previous studies have shown that the parasitic Varroa mite could be the main reason for colony losses. In order to understand how mites affect population dynamics of honeybees and a colony health, we propose a brood-adult bee-mite model in which the time lag from brood to adult is taken into account. Noting that the dynamics of a honeybee colony varies with respect to season, we validate the model and perform parameter estimations under both constant and fluctuating seasonality scenarios. Our analytical and numerical studies reveal the following: (a) In the presence of parasite mites, the large time lag from brood to adult could destabilize population dynamics and drive the colony to collapse; but the small natural mortality of the adult population can promote a mite-free colony when time lag is small or at an intermediate level; (b) Small brood' infestation rates could stabilize all populations at the unique interior equilibrium under constant seasonality while may drive the mite population to die out when seasonality is taken into account; (c) High brood' infestation rates can destabilize the colony dynamics leading to population collapse depending on initial population size under constant and seasonal conditions; (d) Results from sensitivity analysis indicate the queen's egg-laying may have the greatest effect on colony population size. The brood death rate and the colony size at which brood survivability is the half maximal were also shown to be highly sensitive with an inverse correlation to the colony population size. Our results provide insights on the effects of seasonality on the dynamics.

preprint2020arXiv

Potential Energy Landscape of CO Adsorbates on NaCl(100) and Implications in Isomerization of Vibrationally Excited CO

Several full-dimensional potential energy surfaces (PESs) are reported for vibrating CO adsorbates at two coverages on a rigid NaCl(100) surface based on first principles calculations. These PESs reveal a rather flat energy landscape for physisorption of vibrationless CO on NaCl(100), evidenced by various C-down adsorption patterns within a small energy range. Agreement with available experimental results is satisfactory, although quantitative differences exist. These PESs are used to explore isomerization pathways between the C-down and higher energy O-down configurations, which reveal a significant isomerization barrier. As CO vibration is excited, however, the energy order of the two isomer changes, which helps to explain the experimental observed flipping of vibrationally excited CO adsorbates.

preprint2020arXiv

Propagating Asymptotic-Estimated Gradients for Low Bitwidth Quantized Neural Networks

The quantized neural networks (QNNs) can be useful for neural network acceleration and compression, but during the training process they pose a challenge: how to propagate the gradient of loss function through the graph flow with a derivative of 0 almost everywhere. In response to this non-differentiable situation, we propose a novel Asymptotic-Quantized Estimator (AQE) to estimate the gradient. In particular, during back-propagation, the graph that relates inputs to output remains smoothness and differentiability. At the end of training, the weights and activations have been quantized to low-precision because of the asymptotic behaviour of AQE. Meanwhile, we propose a M-bit Inputs and N-bit Weights Network (MINW-Net) trained by AQE, a quantized neural network with 1-3 bits weights and activations. In the inference phase, we can use XNOR or SHIFT operations instead of convolution operations to accelerate the MINW-Net. Our experiments on CIFAR datasets demonstrate that our AQE is well defined, and the QNNs with AQE perform better than that with Straight-Through Estimator (STE). For example, in the case of the same ConvNet that has 1-bit weights and activations, our MINW-Net with AQE can achieve a prediction accuracy 1.5\% higher than the Binarized Neural Network (BNN) with STE. The MINW-Net, which is trained from scratch by AQE, can achieve comparable classification accuracy as 32-bit counterparts on CIFAR test sets. Extensive experimental results on ImageNet dataset show great superiority of the proposed AQE and our MINW-Net achieves comparable results with other state-of-the-art QNNs.

preprint2020arXiv

Simultaneous Left Atrium Anatomy and Scar Segmentations via Deep Learning in Multiview Information with Attention

Three-dimensional late gadolinium enhanced (LGE) cardiac MR (CMR) of left atrial scar in patients with atrial fibrillation (AF) has recently emerged as a promising technique to stratify patients, to guide ablation therapy and to predict treatment success. This requires a segmentation of the high intensity scar tissue and also a segmentation of the left atrium (LA) anatomy, the latter usually being derived from a separate bright-blood acquisition. Performing both segmentations automatically from a single 3D LGE CMR acquisition would eliminate the need for an additional acquisition and avoid subsequent registration issues. In this paper, we propose a joint segmentation method based on multiview two-task (MVTT) recursive attention model working directly on 3D LGE CMR images to segment the LA (and proximal pulmonary veins) and to delineate the scar on the same dataset. Using our MVTT recursive attention model, both the LA anatomy and scar can be segmented accurately (mean Dice score of 93% for the LA anatomy and 87% for the scar segmentations) and efficiently (~0.27 seconds to simultaneously segment the LA anatomy and scars directly from the 3D LGE CMR dataset with 60-68 2D slices). Compared to conventional unsupervised learning and other state-of-the-art deep learning based methods, the proposed MVTT model achieved excellent results, leading to an automatic generation of a patient-specific anatomical model combined with scar segmentation for patients in AF.

preprint2020arXiv

Single-atom catalysts boost nitrogen electroreduction reaction

Ammonia (NH3) is mainly produced through the traditional Haber-Bosch process under harsh conditions with huge energy consumption and massive carbon dioxide (CO2) emission. The nitrogen electroreduction reaction (NERR), as an energy-efficient and environment-friendly process of converting nitrogen (N2) to NH3 under ambient conditions, has been regarded as a promising alternative to the Haber-Bosch process and has received enormous interest in recent years. Although some exciting progress has been made, considerable scientific and technical challenges still exist in improving the NH3 yield rate and Faradic efficiency, understanding the mechanism of the reaction and promoting the wide commercialization of NERR. Single-atom catalysts (SACs) have emerged as promising catalysts because of its atomically dispersed activity sites and maximized atom efficiency, unsaturated coordination environment, and its unique electronic structure, which could significantly improve the rate of reaction and yield rate of NH3. In this review we briefly introduce the unique structural and electronic features of SACs, which contributes to comprehensively understand the reaction mechanism owing to their structural simplicity and diversity, and in turn expedite the rational design of fantastic catalysts at the atomic scale. Then, we summarize the most recent experimental and computational efforts on developing novel SACs with excellent NERR performance, including precious metal-, nonprecious metal- and nonmetal-based SACs. Finally, we present challenges and perspectives of SACs on NERR, as well as some potential means for advanced NERR catalyst.

preprint2020arXiv

Subsonic flows past a profile with a vortex line at the trailing edge

We established the existence, uniqueness and stability of subsonic flows past an airfoil with a vortex line at the trailing edge. Such a flow pattern is governed by the two dimensional steady compressible Euler equations. The vortex line attached to the trailing edge is a contact discontinuity for the Euler system and is treated as a free boundary. The problem is formulated and solved by using the implicit function theorem. The main difficulties are due to the fitting of the vortex line with the profile at the trailing edge and the possible subtle instability of the vortex line at the far field. Suitable choices of the weights and elaborate barrier functions are found to deal with such difficulties.

preprint2020arXiv

Trivial Entropy of Matter in Gravitation

Expanding the black hole thermodynamics from the horizon to achronal Cauchy hypersurface, the general relation between the Einstein equation and thermodynamics is established. Starting from trivial entropy that is generalized by Bekenstein-Hawking entropy, the entropic mass of matter emerges naturally together with Unruh temperature. The key idea is that the cause of mass formation comes down to trivial entropy, and mass density is just the external manifestation of mass. The full Einstein equation with the cosmological constant is derived from the requirement that entropic mass and proper mass are equivalent. This perspective suggests that trivial entropy that causes mass in gravitation may be the best choice for the origin of space-time geometry.

preprint2020arXiv

Vector Gaussian Successive Refinement With Degraded Side Information

We investigate the problem of the successive refinement for Wyner-Ziv coding with degraded side information and obtain a complete characterization of the rate region for the quadratic vector Gaussian case. The achievability part is based on the evaluation of the Tian-Diggavi inner bound that involves Gaussian auxiliary random vectors. For the converse part, a matching outer bound is obtained with the aid of a new extremal inequality. Herein, the proof of this extremal inequality depends on the integration of the monotone path argument and the doubling trick as well as information-estimation relations.

preprint2019arXiv

Dynamics of Social Interactions and Agent Spreading in Social Insects Colonies: Effects of Environmental Events and Spatial Heterogeneity

The relationship between division of labor and individuals' spatial behavior in social insect colonies provides a useful context to study how social interactions influence the spreading of agent (which could be information or virus) across distributed agent systems. In social insect colonies, spatial heterogeneity associated with variations of individual task roles, affects social contacts, and thus the way in which agent moves through social contact networks. We used an Agent Based Model (ABM) to mimic three realistic scenarios of agent spreading in social insect colonies. Our model suggests that individuals within a specific task interact more with consequences that agent could potentially spread rapidly within that group, while agent spreads slower between task groups. Our simulations show a strong linear relationship between the degree of spatial heterogeneity and social contact rates, and that the spreading dynamics of agents follow a modified nonlinear logistic growth model with varied transmission rates for different scenarios. Our work provides an important insights on the dual-functionality of physical contacts. This dual-functionality is often driven via variations of individual spatial behavior, and can have both inhibiting and facilitating effects on agent transmission rates depending on environment. The results from our proposed model not only provide important insights on mechanisms that generate spatial heterogeneity, but also deepen our understanding of how social insect colonies balance the benefit and cost of physical contacts on the agents' transmission under varied environmental conditions.

preprint2019arXiv

Highly fluorescent copper nanoclusters for sensing and bioimaging

Metal nanoclusters (NCs), typically consisting of a few to tens of metal atoms, bridge the gap between organometallic compounds and crystalline metal nanoparticles. As their size approaches the Fermi wavelength of electrons, metal NCs exhibit discrete energy levels, which in turn results in the emergence of intriguing physical and chemical (or physicochemical) properties, especially strong fluorescence. In the past few decades, dramatic growth has been witnessed in the development of different types of noble metal NCs (mainly AuNCs and AgNCs). However, compared with noble metals, copper is a relatively earth-abundant and cost-effective metal. Theoretical and experimental studies have shown that copper NCs (CuNCs) possess unique catalytic and photoluminescent properties. In this context, CuNCs are emerging as a new class of nontoxic, economic, and effective phosphors and catalysts, drawing significant interest across the life and medical sciences. To highlight these achievements, this review begins by providing an overview of a multitude of factors that play central roles in the fluorescence of CuNCs. Additionally, a critical perspective of how the aggregation of CuNCs can efficiently improve the florescent stability, tunability, and intensity is also discussed. Following, we present representative applications of CuNCs in detection and bioimaging. Finally, we outline current challenges and our perspective on the development of CuNCs.

preprint2019arXiv

Probing the cosmic opacity from Future Gravitational Wave Standard Sirens

In this work, using the Gaussian Process, we explore the potentiality of future gravitational wave (GW) measurement to probe cosmic opacity through comparing its opacity-free luminosity distance (LD) with the opacity-dependent one from type Ia supernovae (SNIa). GW data points are simulated from the third generation Einstein Telescope, and SNIa data are taken from the Joint Light Analysis (JLA) or Pantheon compilation. The advantages of using Gaussian Process are that one may match SNIa data with GW data at the same redshift and use all available data to probe cosmic opacity. We obtain that the error bar of the constraint on cosmic opacity can be reduced to $σ_ε\sim 0.011$ and $0.006$ at $1σ$ confidence level (CL) for JLA and Pantheon respectively in a cosmological-independent way. Thus, the future GW measurements can give competitive results on the cosmic opacity test. Furthermore, we propose a method to probe the spatial homogeneity of the cosmic transparency through comparing the reconstructed LD from the mock GW with the reconstructed one from SNIa data in a flat $Λ$CDM with the Gaussian Process. The result shows that a transparent universe is favored at $1σ$ CL, although the best-fit value of cosmic opacity is redshift-dependent.

preprint2017arXiv

Intrinsic Capacity

Every channel can be expressed as a convex combination of deterministic channels with each deterministic channel corresponding to one particular intrinsic state. Such convex combinations are in general not unique, each giving rise to a specific intrinsic-state distribution. In this paper we study the maximum and the minimum capacities of a channel when the realization of its intrinsic state is causally available at the encoder and/or the decoder. Several conclusive results are obtained for binary-input channels and binary-output channels. Byproducts of our investigation include a generalization of the Birkhoff-von Neumann theorem and a condition on the uselessness of causal state information at the encoder.

preprint2014arXiv

An Empirical Study on Software Defect Prediction with a Simplified Metric Set

Software defect prediction plays a crucial role in estimating the most defect-prone components of software, and a large number of studies have pursued improving prediction accuracy within a project or across projects. However, the rules for making an appropriate decision between within- and cross-project defect prediction when available historical data are insufficient remain unclear. The objective of this work is to validate the feasibility of the predictor built with a simplified metric set for software defect prediction in different scenarios, and to investigate practical guidelines for the choice of training data, classifier and metric subset of a given project. First, based on six typical classifiers, we constructed three types of predictors using the size of software metric set in three scenarios. Then, we validated the acceptable performance of the predictor based on Top-k metrics in terms of statistical methods. Finally, we attempted to minimize the Top-k metric subset by removing redundant metrics, and we tested the stability of such a minimum metric subset with one-way ANOVA tests. The experimental results indicate that (1) the choice of training data should depend on the specific requirement of prediction accuracy; (2) the predictor built with a simplified metric set works well and is very useful in case limited resources are supplied; (3) simple classifiers (e.g., Naive Bayes) also tend to perform well when using a simplified metric set for defect prediction; and (4) in several cases, the minimum metric subset can be identified to facilitate the procedure of general defect prediction with acceptable loss of prediction precision in practice. The guideline for choosing a suitable simplified metric set in different scenarios is presented in Table 12.

preprint2013arXiv

A generalized Polya's urn with graph based interactions

Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability proportional to its current number of balls raised by some fixed power a>0. We characterize the limiting behavior of the proportion of balls in the bins. The proof uses a dynamical approach to relate the proportion of balls to a vector field. Our main result is that the limit set of the proportion of balls is contained in the equilibria set of the vector field. We also prove that if a<1 then there is a single point v=v(G,a) with nonzero entries such that the proportion converges to v almost surely. A special case is when G is regular and a is at most 1. We show e.g. that if G is non-bipartite then the proportion of balls in the bins converges to the uniform measure almost surely.