Trust snapshot

Quick read

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

53 published item(s)

preprint2026arXiv

Unified Map Prior Encoder for Mapping and Planning

Online mapping and end-to-end (E2E) planning in autonomous driving remain largely sensor-centric, leaving rich map priors, including HD/SD vector maps, rasterized SD maps, and satellite imagery, underused because of heterogeneity, pose drift, and inconsistent availability at test time. We present UMPE, a Unified Map Prior Encoder that can ingest any subset of four priors and fuse them with BEV features for both mapping and planning. UMPE has two branches. The vector encoder pre-aligns HD/SD polylines with a frame-wise SE(2) correction, encodes points via multi-frequency sinusoidal features, and produces polyline tokens with confidence scores. BEV queries then apply cross-attention with confidence bias, followed by normalized channel-wise gating to avoid length imbalance and softly down-weight uncertain sources. The raster encoder shares a ResNet-18 backbone conditioned by FiLM with scaling and shift at every stage, performs SE(2) micro-alignment, and injects priors through zero-initialized residual fusion, so the network starts from a do-no-harm baseline and learns to add only useful prior evidence. A vector-then-raster fusion order reflects the inductive bias of geometry first, appearance second. On nuScenes mapping, UMPE lifts MapTRv2 from 61.5 to 67.4 mAP (+5.9) and MapQR from 66.4 to 71.7 mAP (+5.3). On Argoverse2, UMPE adds +4.1 mAP over strong baselines. UMPE is compositional: when trained with all priors, it outperforms single-prior models even when only one prior is available at test time, demonstrating powerset robustness. For E2E planning with the VAD backbone on nuScenes, UMPE reduces trajectory error from 0.72 to 0.42 m L2 on average (-0.30 m) and collision rate from 0.22% to 0.12% (-0.10%), surpassing recent prior-injection methods. These results show that a unified, alignment-aware treatment of heterogeneous map priors yields better mapping and better planning.

preprint2024arXiv

Attribute Fusion-based Evidential Classifier on Quantum Circuits

Dempster-Shafer Theory (DST) as an effective and robust framework for handling uncertain information is applied in decision-making and pattern classification. Unfortunately, its real-time application is limited by the exponential computational complexity. People attempt to address the issue by taking advantage of its mathematical consistency with quantum computing to implement DST operations on quantum circuits and realize speedup. However, the progress so far is still impractical for supporting large-scale DST applications. In this paper, we find that Boolean algebra as an essential mathematical tool bridges the definition of DST and quantum computing. Based on the discovery, we establish a flexible framework mapping any set-theoretically defined DST operations to corresponding quantum circuits for implementation. More critically, this new framework is not only uniform but also enables exponential acceleration for computation and is capable of handling complex applications. Focusing on tasks of classification, we based on a classical attribute fusion algorithm putting forward a quantum evidential classifier, where quantum mass functions for attributes are generated with a simple method and the proposed framework is applied for fusing the attribute evidence. Compared to previous methods, the proposed quantum classifier exponentially reduces the computational complexity to linear. Tests on real datasets validate the feasibility.

preprint2024arXiv

Benchmarking the Robustness of LiDAR Semantic Segmentation Models

When using LiDAR semantic segmentation models for safety-critical applications such as autonomous driving, it is essential to understand and improve their robustness with respect to a large range of LiDAR corruptions. In this paper, we aim to comprehensively analyze the robustness of LiDAR semantic segmentation models under various corruptions. To rigorously evaluate the robustness and generalizability of current approaches, we propose a new benchmark called SemanticKITTI-C, which features 16 out-of-domain LiDAR corruptions in three groups, namely adverse weather, measurement noise and cross-device discrepancy. Then, we systematically investigate 11 LiDAR semantic segmentation models, especially spanning different input representations (e.g., point clouds, voxels, projected images, and etc.), network architectures and training schemes. Through this study, we obtain two insights: 1) We find out that the input representation plays a crucial role in robustness. Specifically, under specific corruptions, different representations perform variously. 2) Although state-of-the-art methods on LiDAR semantic segmentation achieve promising results on clean data, they are less robust when dealing with noisy data. Finally, based on the above observations, we design a robust LiDAR segmentation model (RLSeg) which greatly boosts the robustness with simple but effective modifications. It is promising that our benchmark, comprehensive analysis, and observations can boost future research in robust LiDAR semantic segmentation for safety-critical applications.

preprint2023arXiv

Adaptive Context Selection for Polyp Segmentation

Accurate polyp segmentation is of great significance for the diagnosis and treatment of colorectal cancer. However, it has always been very challenging due to the diverse shape and size of polyp. In recent years, state-of-the-art methods have achieved significant breakthroughs in this task with the help of deep convolutional neural networks. However, few algorithms explicitly consider the impact of the size and shape of the polyp and the complex spatial context on the segmentation performance, which results in the algorithms still being powerless for complex samples. In fact, segmentation of polyps of different sizes relies on different local and global contextual information for regional contrast reasoning. To tackle these issues, we propose an adaptive context selection based encoder-decoder framework which is composed of Local Context Attention (LCA) module, Global Context Module (GCM) and Adaptive Selection Module (ASM). Specifically, LCA modules deliver local context features from encoder layers to decoder layers, enhancing the attention to the hard region which is determined by the prediction map of previous layer. GCM aims to further explore the global context features and send to the decoder layers. ASM is used for adaptive selection and aggregation of context features through channel-wise attention. Our proposed approach is evaluated on the EndoScene and Kvasir-SEG Datasets, and shows outstanding performance compared with other state-of-the-art methods. The code is available at https://github.com/ReaFly/ACSNet.

preprint2022arXiv

6GAN: IPv6 Multi-Pattern Target Generation via Generative Adversarial Nets with Reinforcement Learning

Global IPv6 scanning has always been a challenge for researchers because of the limited network speed and computational power. Target generation algorithms are recently proposed to overcome the problem for Internet assessments by predicting a candidate set to scan. However, IPv6 custom address configuration emerges diverse addressing patterns discouraging algorithmic inference. Widespread IPv6 alias could also mislead the algorithm to discover aliased regions rather than valid host targets. In this paper, we introduce 6GAN, a novel architecture built with Generative Adversarial Net (GAN) and reinforcement learning for multi-pattern target generation. 6GAN forces multiple generators to train with a multi-class discriminator and an alias detector to generate non-aliased active targets with different addressing pattern types. The rewards from the discriminator and the alias detector help supervise the address sequence decision-making process. After adversarial training, 6GAN's generators could keep a strong imitating ability for each pattern and 6GAN's discriminator obtains outstanding pattern discrimination ability with a 0.966 accuracy. Experiments indicate that our work outperformed the state-of-the-art target generation algorithms by reaching a higher-quality candidate set.

preprint2022arXiv

A Unified Understanding of Deep NLP Models for Text Classification

The rapid development of deep natural language processing (NLP) models for text classification has led to an urgent need for a unified understanding of these models proposed individually. Existing methods cannot meet the need for understanding different models in one framework due to the lack of a unified measure for explaining both low-level (e.g., words) and high-level (e.g., phrases) features. We have developed a visual analysis tool, DeepNLPVis, to enable a unified understanding of NLP models for text classification. The key idea is a mutual information-based measure, which provides quantitative explanations on how each layer of a model maintains the information of input words in a sample. We model the intra- and inter-word information at each layer measuring the importance of a word to the final prediction as well as the relationships between words, such as the formation of phrases. A multi-level visualization, which consists of a corpus-level, a sample-level, and a word-level visualization, supports the analysis from the overall training set to individual samples. Two case studies on classification tasks and comparison between models demonstrate that DeepNLPVis can help users effectively identify potential problems caused by samples and model architectures and then make informed improvements.

preprint2022arXiv

AMOS: A Large-Scale Abdominal Multi-Organ Benchmark for Versatile Medical Image Segmentation

Despite the considerable progress in automatic abdominal multi-organ segmentation from CT/MRI scans in recent years, a comprehensive evaluation of the models' capabilities is hampered by the lack of a large-scale benchmark from diverse clinical scenarios. Constraint by the high cost of collecting and labeling 3D medical data, most of the deep learning models to date are driven by datasets with a limited number of organs of interest or samples, which still limits the power of modern deep models and makes it difficult to provide a fully comprehensive and fair estimate of various methods. To mitigate the limitations, we present AMOS, a large-scale, diverse, clinical dataset for abdominal organ segmentation. AMOS provides 500 CT and 100 MRI scans collected from multi-center, multi-vendor, multi-modality, multi-phase, multi-disease patients, each with voxel-level annotations of 15 abdominal organs, providing challenging examples and test-bed for studying robust segmentation algorithms under diverse targets and scenarios. We further benchmark several state-of-the-art medical segmentation models to evaluate the status of the existing methods on this new challenging dataset. We have made our datasets, benchmark servers, and baselines publicly available, and hope to inspire future research. Information can be found at https://amos22.grand-challenge.org.

preprint2022arXiv

An error analysis of generative adversarial networks for learning distributions

This paper studies how well generative adversarial networks (GANs) learn probability distributions from finite samples. Our main results establish the convergence rates of GANs under a collection of integral probability metrics defined through Hölder classes, including the Wasserstein distance as a special case. We also show that GANs are able to adaptively learn data distributions with low-dimensional structures or have Hölder densities, when the network architectures are chosen properly. In particular, for distributions concentrated around a low-dimensional set, we show that the learning rates of GANs do not depend on the high ambient dimension, but on the lower intrinsic dimension. Our analysis is based on a new oracle inequality decomposing the estimation error into the generator and discriminator approximation error and the statistical error, which may be of independent interest.

preprint2022arXiv

Beyond 3D Siamese Tracking: A Motion-Centric Paradigm for 3D Single Object Tracking in Point Clouds

3D single object tracking (3D SOT) in LiDAR point clouds plays a crucial role in autonomous driving. Current approaches all follow the Siamese paradigm based on appearance matching. However, LiDAR point clouds are usually textureless and incomplete, which hinders effective appearance matching. Besides, previous methods greatly overlook the critical motion clues among targets. In this work, beyond 3D Siamese tracking, we introduce a motion-centric paradigm to handle 3D SOT from a new perspective. Following this paradigm, we propose a matching-free two-stage tracker M^2-Track. At the 1^st-stage, M^2-Track localizes the target within successive frames via motion transformation. Then it refines the target box through motion-assisted shape completion at the 2^nd-stage. Extensive experiments confirm that M^2-Track significantly outperforms previous state-of-the-arts on three large-scale datasets while running at 57FPS (~8%, ~17%, and ~22%) precision gains on KITTI, NuScenes, and Waymo Open Dataset respectively). Further analysis verifies each component's effectiveness and shows the motion-centric paradigm's promising potential when combined with appearance matching.

preprint2022arXiv

Bipolar conduction asymmetries lead to ultra-high thermoelectric power factor

Low band gap thermoelectric materials suffer from bipolar effects at high temperatures, with increased electronic thermal conductivity and reduced Seebeck coefficient, leading to reduced power factor and low ZT figure of merit. In this work we show that the presence of strong transport asymmetries between the conduction and valence bands can allow high phonon-limited electronic conductivity at finite Seebeck coefficient values, leading to largely enhanced power factors. The power factors that can be achieved can be significantly larger compared to their maximum unipolar counterparts, allowing for doubling of the ZT figure of merit. We identify this behavior in low band gap cases from the half-Heusler materials family. Using both, advanced electronic Boltzmann transport calculations for realistic material bandstructures, as well as model parabolic electronic bands, we elaborate on the parameters that determine this effect. We then develop a series of descriptors which can guide machine learning studies in identifying such classes of materials with extraordinary power factors at nearly pristine conditions. For this we test more than 3000 analytical bandstructures and their features, and more than 120 possible descriptors, to identify the most promising ones that contain: i) only band structure features for easy identification from material databases, and ii) band structure and transport parameters that provide much higher correlations, but for which parameter availability can be somewhat scarce.

preprint2022arXiv

Boomerang Spectra of Two Classes of Power Functions via Their Differential Spectra

In EUROCRYPT 2018, Cid $et\;al.$ introduced a new concept on the cryptographic property of S-boxes to evaluate the subtleties of boomerang-style attacks. This concept was named as boomerang connectivity table (BCT for short) . For a power function, the distribution of BCT can be directly determined by its boomerang spectrum. In this paper, we investigate the boomerang spectra of two classes power functions over even characteristic finite fields via their differential spectra. The boomerang spectrum of the power function $ {x^{2^{m+1} - 1}} $ over $ {\mathbb{F}_{2^{2m}}} $ is determined, where $2^{m+1}-1$ is a kind of Niho exponent. The boomerang spectrum of the Gold function $G(x)=x^{2^t+1}$ over $ {\mathbb{F}_{2^n}} $ is also determined. It is shown that the Gold function has two-valued boomerang spectrum.

preprint2022arXiv

Calibration procedures for the CHASE/HIS science data

The Hα line is an important optical line in solar observations containing the information from the photosphere to the chromosphere. To study the mechanisms of solar eruptions and the plasma dynamics in the lower atmosphere, the Chinese Hα Solar Explorer (CHASE) was launched into a Sun-synchronous orbit on October 14, 2021. The scientific payload of the CHASE satellite is the Hα Imaging Spectrograph (HIS). The CHASE/HIS acquires, for the first time, seeing-free Hα spectroscopic observations with high spectral and temporal resolutions. It consists of two observational modes. The raster scanning mode provides full-Sun or region-of-interest spectra at Hα (6559.7-6565.9 Å) and Fe I (6567.8-6570.6 Å) wavebands. The continuum imaging mode obtains full-Sun photospheric images at around 6689 Å. In this paper, we present detailed calibration procedures for the CHASE/HIS science data, including the dark-field and flat-field correction, slit image curvature correction, wavelength and intensity calibration, and coordinate transformation. The higher-level data products can be directly used for scientific research.

preprint2022arXiv

CO2Sum:Contrastive Learning for Factual-Consistent Abstractive Summarization

Generating factual-consistent summaries is a challenging task for abstractive summarization. Previous works mainly encode factual information or perform post-correct/rank after decoding. In this paper, we provide a factual-consistent solution from the perspective of contrastive learning, which is a natural extension of previous works. We propose CO2Sum (Contrastive for Consistency), a contrastive learning scheme that can be easily applied on sequence-to-sequence models for factual-consistent abstractive summarization, proving that the model can be fact-aware without modifying the architecture. CO2Sum applies contrastive learning on the encoder, which can help the model be aware of the factual information contained in the input article, or performs contrastive learning on the decoder, which makes the model to generate factual-correct output summary. What's more, these two schemes are orthogonal and can be combined to further improve faithfulness. Comprehensive experiments on public benchmarks demonstrate that CO2Sum improves the faithfulness on large pre-trained language models and reaches competitive results compared to other strong factual-consistent summarization baselines.

preprint2022arXiv

Designing An Illumination-Aware Network for Deep Image Relighting

Lighting is a determining factor in photography that affects the style, expression of emotion, and even quality of images. Creating or finding satisfying lighting conditions, in reality, is laborious and time-consuming, so it is of great value to develop a technology to manipulate illumination in an image as post-processing. Although previous works have explored techniques based on the physical viewpoint for relighting images, extensive supervisions and prior knowledge are necessary to generate reasonable images, restricting the generalization ability of these works. In contrast, we take the viewpoint of image-to-image translation and implicitly merge ideas of the conventional physical viewpoint. In this paper, we present an Illumination-Aware Network (IAN) which follows the guidance from hierarchical sampling to progressively relight a scene from a single image with high efficiency. In addition, an Illumination-Aware Residual Block (IARB) is designed to approximate the physical rendering process and to extract precise descriptors of light sources for further manipulations. We also introduce a depth-guided geometry encoder for acquiring valuable geometry- and structure-related representations once the depth information is available. Experimental results show that our proposed method produces better quantitative and qualitative relighting results than previous state-of-the-art methods. The code and models are publicly available on https://github.com/NK-CS-ZZL/IAN.

preprint2022arXiv

Don't Take It Literally: An Edit-Invariant Sequence Loss for Text Generation

Neural text generation models are typically trained by maximizing log-likelihood with the sequence cross entropy (CE) loss, which encourages an exact token-by-token match between a target sequence with a generated sequence. Such training objective is sub-optimal when the target sequence is not perfect, e.g., when the target sequence is corrupted with noises, or when only weak sequence supervision is available. To address the challenge, we propose a novel Edit-Invariant Sequence Loss (EISL), which computes the matching loss of a target n-gram with all n-grams in the generated sequence. EISL is designed to be robust to various noises and edits in the target sequences. Moreover, the EISL computation is essentially an approximate convolution operation with target n-grams as kernels, which is easy to implement and efficient to compute with existing libraries. To demonstrate the effectiveness of EISL, we conduct experiments on a wide range of tasks, including machine translation with noisy target sequences, unsupervised text style transfer with only weak training signals, and non-autoregressive generation with non-predefined generation order. Experimental results show our method significantly outperforms the common CE loss and other strong baselines on all the tasks. EISL has a simple API that can be used as a drop-in replacement of the CE loss: https://github.com/guangyliu/EISL.

preprint2022arXiv

Effective operators for valence space calculations from the {\itshape ab initio} No-Core Shell Mode

In recent years, remarkable progress has been achieved in developing novel non-perturbative techniques for constructing valence space shell model Hamiltonians from realistic internucleon interactions. One of these methods is based on the Okubo--Lee--Suzuki (OLS) unitary transformation applied to no-core shell model (NCSM) solutions. In the present work, we implement the corresponding approach to solve for valence space effective electromagnetic operators. To this end, we use the NCSM results for $A=16-18$, obtained at $N_{\rm max}=4$, to derive a charge-dependent version of the effective interaction for the $sd$ shell, which allows us to exactly reproduce selected NCSM spectra of $^{18}$O, $^{18}$F and $^{18}$Ne within the two valence nucleon space. We then deduce effective single-particle matrix elements of electric quadrupole ($E2$) and magnetic dipole ($M1$) operators by matching them to the electromagnetic transitions and moments for $^{17}$O and $^{17}$F from the NCSM at $N_{\rm max}=4$. Thus, effective $E2$ and $M1$ operators are obtained as sets of single-particle matrix elements for the valence space ($sd$ shell) which allow us to reproduce the NCSM results for $A=17$ exactly. Systematic comparison of a large set of $sd$ shell results on quadrupole and magnetic dipole moments and transitions for $A=18$ using effective $E2$ and $M1$ operators that we derive from the full NCSM calculations demonstrates a remarkable agreement.

preprint2022arXiv

Graph Enhanced Contrastive Learning for Radiology Findings Summarization

The impression section of a radiology report summarizes the most prominent observation from the findings section and is the most important section for radiologists to communicate to physicians. Summarizing findings is time-consuming and can be prone to error for inexperienced radiologists, and thus automatic impression generation has attracted substantial attention. With the encoder-decoder framework, most previous studies explore incorporating extra knowledge (e.g., static pre-defined clinical ontologies or extra background information). Yet, they encode such knowledge by a separate encoder to treat it as an extra input to their models, which is limited in leveraging their relations with the original findings. To address the limitation, we propose a unified framework for exploiting both extra knowledge and the original findings in an integrated way so that the critical information (i.e., key words and their relations) can be extracted in an appropriate way to facilitate impression generation. In detail, for each input findings, it is encoded by a text encoder, and a graph is constructed through its entities and dependency tree. Then, a graph encoder (e.g., graph neural networks (GNNs)) is adopted to model relation information in the constructed graph. Finally, to emphasize the key words in the findings, contrastive learning is introduced to map positive samples (constructed by masking non-key words) closer and push apart negative ones (constructed by masking key words). The experimental results on OpenI and MIMIC-CXR confirm the effectiveness of our proposed method.

preprint2022arXiv

Heuristic Search for Rank Aggregation with Application to Label Ranking

Rank aggregation aims to combine the preference rankings of a number of alternatives from different voters into a single consensus ranking. As a useful model for a variety of practical applications, however, it is a computationally challenging problem. In this paper, we propose an effective hybrid evolutionary ranking algorithm to solve the rank aggregation problem with both complete and partial rankings. The algorithm features a semantic crossover based on concordant pairs and a late acceptance local search reinforced by an efficient incremental evaluation technique. Experiments are conducted to assess the algorithm, indicating a highly competitive performance on benchmark instances compared with state-of-the-art algorithms. To demonstrate its practical usefulness, the algorithm is applied to label ranking, which is an important machine learning task.

preprint2022arXiv

RoPGen: Towards Robust Code Authorship Attribution via Automatic Coding Style Transformation

Source code authorship attribution is an important problem often encountered in applications such as software forensics, bug fixing, and software quality analysis. Recent studies show that current source code authorship attribution methods can be compromised by attackers exploiting adversarial examples and coding style manipulation. This calls for robust solutions to the problem of code authorship attribution. In this paper, we initiate the study on making Deep Learning (DL)-based code authorship attribution robust. We propose an innovative framework called Robust coding style Patterns Generation (RoPGen), which essentially learns authors' unique coding style patterns that are hard for attackers to manipulate or imitate. The key idea is to combine data augmentation and gradient augmentation at the adversarial training phase. This effectively increases the diversity of training examples, generates meaningful perturbations to gradients of deep neural networks, and learns diversified representations of coding styles. We evaluate the effectiveness of RoPGen using four datasets of programs written in C, C++, and Java. Experimental results show that RoPGen can significantly improve the robustness of DL-based code authorship attribution, by respectively reducing 22.8% and 41.0% of the success rate of targeted and untargeted attacks on average.

preprint2022arXiv

SiamHAN: IPv6 Address Correlation Attacks on TLS Encrypted Traffic via Siamese Heterogeneous Graph Attention Network

Unlike IPv4 addresses, which are typically masked by a NAT, IPv6 addresses could easily be correlated with user activity, endangering their privacy. Mitigations to address this privacy concern have been deployed, making existing approaches for address-to-user correlation unreliable. This work demonstrates that an adversary could still correlate IPv6 addresses with users accurately, even with these protection mechanisms. To do this, we propose an IPv6 address correlation model - SiamHAN. The model uses a Siamese Heterogeneous Graph Attention Network to measure whether two IPv6 client addresses belong to the same user even if the user's traffic is protected by TLS encryption. Using a large real-world dataset, we show that, for the tasks of tracking target users and discovering unique users, the state-of-the-art techniques could achieve only 85% and 60% accuracy, respectively. However, SiamHAN exhibits 99% and 88% accuracy.

preprint2022arXiv

The Chinese Hα Solar Explorer (CHASE) mission: An overview

The Chinese Hα Solar Explorer (CHASE), dubbed "Xihe" - Goddess of the Sun, was launched on October 14, 2021 as the first solar space mission of China National Space Administration (CNSA). The CHASE mission is designed to test a newly developed satellite platform and to acquire the spectroscopic observations in the Hα waveband. The Hα Imaging Spectrograph (HIS) is the scientific payload of the CHASE satellite. It consists of two observational modes: raster scanning mode and continuum imaging mode. The raster scanning mode obtains full-Sun or region-of-interest spectral images from 6559.7 to 6565.9 Å and from 6567.8 to 6570.6 Å with 0.024 Å pixel spectral resolution and 1 minute temporal resolution. The continuum imaging mode obtains photospheric images in continuum around 6689 Å with the full width at half maximum of 13.4 Å. The CHASE mission will advance our understanding of the dynamics of solar activity in the photosphere and chromosphere. In this paper, we present an overview of the CHASE mission including the scientific objectives, HIS instrument overview, data calibration flow, and first results of on-orbit observations.

preprint2022arXiv

Toward Clinically Assisted Colorectal Polyp Recognition via Structured Cross-modal Representation Consistency

The colorectal polyps classification is a critical clinical examination. To improve the classification accuracy, most computer-aided diagnosis algorithms recognize colorectal polyps by adopting Narrow-Band Imaging (NBI). However, the NBI usually suffers from missing utilization in real clinic scenarios since the acquisition of this specific image requires manual switching of the light mode when polyps have been detected by using White-Light (WL) images. To avoid the above situation, we propose a novel method to directly achieve accurate white-light colonoscopy image classification by conducting structured cross-modal representation consistency. In practice, a pair of multi-modal images, i.e. NBI and WL, are fed into a shared Transformer to extract hierarchical feature representations. Then a novel designed Spatial Attention Module (SAM) is adopted to calculate the similarities between the class token and patch tokens %from multi-levels for a specific modality image. By aligning the class tokens and spatial attention maps of paired NBI and WL images at different levels, the Transformer achieves the ability to keep both global and local representation consistency for the above two modalities. Extensive experimental results illustrate the proposed method outperforms the recent studies with a margin, realizing multi-modal prediction with a single Transformer while greatly improving the classification accuracy when only with WL images.

preprint2022arXiv

Towards An End-to-End Framework for Flow-Guided Video Inpainting

Optical flow, which captures motion information across frames, is exploited in recent video inpainting methods through propagating pixels along its trajectories. However, the hand-crafted flow-based processes in these methods are applied separately to form the whole inpainting pipeline. Thus, these methods are less efficient and rely heavily on the intermediate results from earlier stages. In this paper, we propose an End-to-End framework for Flow-Guided Video Inpainting (E$^2$FGVI) through elaborately designed three trainable modules, namely, flow completion, feature propagation, and content hallucination modules. The three modules correspond with the three stages of previous flow-based methods but can be jointly optimized, leading to a more efficient and effective inpainting process. Experimental results demonstrate that the proposed method outperforms state-of-the-art methods both qualitatively and quantitatively and shows promising efficiency. The code is available at https://github.com/MCG-NKU/E2FGVI.

preprint2022arXiv

Two Classes of Power Mappings with Boomerang Uniformity 2

Let $q$ be an odd prime power. Let $F_1(x)=x^{d_1}$ and $F_2(x)=x^{d_2}$ be power mappings over $\mathrm{GF}(q^2)$, where $d_1=q-1$ and $d_2=d_1+\frac{q^2-1}{2}=\frac{(q-1)(q+3)}{2}$. In this paper, we study the the boomerang uniformity of $F_1$ and $F_2$ via their differential properties. It is shown that, the boomerang uniformity of $F_i$ ($i=1,2$) is 2 with some conditions on $q$.

preprint2022arXiv

X-Trans2Cap: Cross-Modal Knowledge Transfer using Transformer for 3D Dense Captioning

3D dense captioning aims to describe individual objects by natural language in 3D scenes, where 3D scenes are usually represented as RGB-D scans or point clouds. However, only exploiting single modal information, e.g., point cloud, previous approaches fail to produce faithful descriptions. Though aggregating 2D features into point clouds may be beneficial, it introduces an extra computational burden, especially in inference phases. In this study, we investigate a cross-modal knowledge transfer using Transformer for 3D dense captioning, X-Trans2Cap, to effectively boost the performance of single-modal 3D caption through knowledge distillation using a teacher-student framework. In practice, during the training phase, the teacher network exploits auxiliary 2D modality and guides the student network that only takes point clouds as input through the feature consistency constraints. Owing to the well-designed cross-modal feature fusion module and the feature alignment in the training phase, X-Trans2Cap acquires rich appearance information embedded in 2D images with ease. Thus, a more faithful caption can be generated only using point clouds during the inference. Qualitative and quantitative results confirm that X-Trans2Cap outperforms previous state-of-the-art by a large margin, i.e., about +21 and about +16 absolute CIDEr score on ScanRefer and Nr3D datasets, respectively.

preprint2021arXiv

Multiscale Parareal Algorithm for Long-Time Mesoscopic Simulations of Microvascular Blood Flow in Zebrafish

Various biological processes such as transport of oxygen and nutrients, thrombus formation, vascular angiogenesis and remodeling are related to cellular/subcellular level biological processes, where mesoscopic simulations resolving detailed cell dynamics provide a key to understanding and identifying the cellular basis of disease. To break this bottleneck and achieve a biologically meaningful timescale, we propose a multiscale parareal algorithm in which a continuum-based solver supervises a mesoscopic simulation in the time-domain. Using an iterative prediction-correction strategy, the parallel-in-time mesoscopic simulation supervised by its continuum-based counterpart can converge fast. The effectiveness of the proposed method is first verified in a time-dependent flow with a sinusoidal flowrate through a Y-shaped bifurcation channel. Physical quantities of interest including velocity, wall shear stress and flowrate are computed to compare against those of reference solutions, showing a less than 1% relative error on flowrate in the Newtonian flow and a less than 3\% relative error in the non-Newtonian blood flow. The proposed method is then applied to a large-scale mesoscopic simulation of microvessel blood flow in a zebrafish hindbrain for temporal acceleration. The time-dependent blood flow from heartbeats in this realistic vascular network of zebrafish hindbrain is simulated using dissipative particle dynamics as the mesoscopic model, which is supervised by a one-dimensional blood flow model (continuum-based model) in multiple temporal sub-domains. The computational analysis shows that the resulting microvessel blood flow converges to the reference solution after only two iterations. The proposed method is suitable for long-time mesoscopic simulations with complex fluids and geometries.

preprint2021arXiv

SySeVR: A Framework for Using Deep Learning to Detect Software Vulnerabilities

The detection of software vulnerabilities (or vulnerabilities for short) is an important problem that has yet to be tackled, as manifested by the many vulnerabilities reported on a daily basis. This calls for machine learning methods for vulnerability detection. Deep learning is attractive for this purpose because it alleviates the requirement to manually define features. Despite the tremendous success of deep learning in other application domains, its applicability to vulnerability detection is not systematically understood. In order to fill this void, we propose the first systematic framework for using deep learning to detect vulnerabilities in C/C++ programs with source code. The framework, dubbed Syntax-based, Semantics-based, and Vector Representations (SySeVR), focuses on obtaining program representations that can accommodate syntax and semantic information pertinent to vulnerabilities. Our experiments with 4 software products demonstrate the usefulness of the framework: we detect 15 vulnerabilities that are not reported in the National Vulnerability Database. Among these 15 vulnerabilities, 7 are unknown and have been reported to the vendors, and the other 8 have been "silently" patched by the vendors when releasing newer versions of the pertinent software products.

preprint2021arXiv

Theory and simulation of electrokinetic fluctuations in electrolyte solutions at the mesoscale

Electrolyte solutions play an important role in energy storage devices, whose performance highly relies on the electrokinetic processes at sub-micron scales.\ Although fluctuations and stochastic features become more critical at small scales, the long-range Coulomb interactions pose a particular challenge for both theoretical analysis and simulation of fluid systems with fluctuating hydrodynamic and electrostatic interactions. Here, we present a theoretical framework based on the Landau-Lifshitz theory to derive closed-form expressions of fluctuation correlations in electrolyte solutions, indicating significantly different decorrelation processes of ionic concentration fluctuations from hydrodynamic fluctuations, which provides insights for understanding transport phenomena of coupled fluctuating hydrodynamics and electrokinetics. Furthermore, we simulate fluctuating electrokinetic systems using both molecular dynamics (MD) with explicit ions and mesoscopic charged dissipative particle dynamics (cDPD) with semi-implicit ions, from which we identify that the spatial probability density functions of local charge density follow Gamma distribution at sub-nanometer scale (i.e., 0.3 nm) and converge to Gaussian distribution above nanometer scales (i.e., 1.55 nm), indicating the existence of a lower limit of length scale for mesoscale models using Gaussian fluctuations. The temporal correlation functions of both hydrodynamic and electrokinetic fluctuations are computed from all-atom MD and mesoscale cDPD simulations, showing a good agreement with the theoretical predictions based on the linearized fluctuating hydrodynamics theory.

preprint2020arXiv

$μ$VulDeePecker: A Deep Learning-Based System for Multiclass Vulnerability Detection

Fine-grained software vulnerability detection is an important and challenging problem. Ideally, a detection system (or detector) not only should be able to detect whether or not a program contains vulnerabilities, but also should be able to pinpoint the type of a vulnerability in question. Existing vulnerability detection methods based on deep learning can detect the presence of vulnerabilities (i.e., addressing the binary classification or detection problem), but cannot pinpoint types of vulnerabilities (i.e., incapable of addressing multiclass classification). In this paper, we propose the first deep learning-based system for multiclass vulnerability detection, dubbed $μ$VulDeePecker. The key insight underlying $μ$VulDeePecker is the concept of code attention, which can capture information that can help pinpoint types of vulnerabilities, even when the samples are small. For this purpose, we create a dataset from scratch and use it to evaluate the effectiveness of $μ$VulDeePecker. Experimental results show that $μ$VulDeePecker is effective for multiclass vulnerability detection and that accommodating control-dependence (other than data-dependence) can lead to higher detection capabilities.

preprint2020arXiv

A Redistribution Tool for Long-Term Archive of Astronomical Observation Data

Astronomical observation data require long-term preservation, and the rapid accumulation of observation data makes it necessary to consider the cost of long-term archive storage. In addition to low-speed disk-based online storage, optical disk or tape-based offline storage can be used to save costs. However, for astronomical research that requires historical data (particularly time-domain astronomy), the performance and energy consumption of data-accessing techniques cause problems because the requested data (which are organized according to observation time) may be located across multiple storage devices. In this study, we design and develop a tool referred to as AstroLayout to redistribute the observation data using spatial aggregation. The core algorithm uses graph partitioning to generate an optimized data placement according to the original observation data statistics and the target storage system. For the given observation data, AstroLayout can copy the long-term archive in the target storage system in accordance with this placement. An efficiency evaluation shows that AstroLayout can reduce the number of devices activated when responding to data-access requests in time-domain astronomy research. In addition to improving the performance of data-accessing techniques, AstroLayout can also reduce the storage systems power consumption. For enhanced adaptability, it supports storage systems of any media, including optical disks, tapes, and hard disks.

preprint2020arXiv

A Robust Attentional Framework for License Plate Recognition in the Wild

Recognizing car license plates in natural scene images is an important yet still challenging task in realistic applications. Many existing approaches perform well for license plates collected under constrained conditions, eg, shooting in frontal and horizontal view-angles and under good lighting conditions. However, their performance drops significantly in an unconstrained environment that features rotation, distortion, occlusion, blurring, shading or extreme dark or bright conditions. In this work, we propose a robust framework for license plate recognition in the wild. It is composed of a tailored CycleGAN model for license plate image generation and an elaborate designed image-to-sequence network for plate recognition. On one hand, the CycleGAN based plate generation engine alleviates the exhausting human annotation work. Massive amount of training data can be obtained with a more balanced character distribution and various shooting conditions, which helps to boost the recognition accuracy to a large extent. On the other hand, the 2D attentional based license plate recognizer with an Xception-based CNN encoder is capable of recognizing license plates with different patterns under various scenarios accurately and robustly. Without using any heuristics rule or post-processing, our method achieves the state-of-the-art performance on four public datasets, which demonstrates the generality and robustness of our framework. Moreover, we released a new license plate dataset, named "CLPD", with 1200 images from all 31 provinces in mainland China. The dataset can be available from: https://github.com/wangpengnorman/CLPD_dataset.

preprint2020arXiv

Active- and transfer-learning applied to microscale-macroscale coupling to simulate viscoelastic flows

Active- and transfer-learning are applied to polymer flows for the multiscale discovery of effective constitutive approximations required in viscoelastic flow simulation. The result is macroscopic rheology directly connected to a microstructural model. Micro and macroscale simulations are adaptively coupled by means of Gaussian process regression to run the expensive microscale computations only as necessary. This active-learning guided multiscale method can automatically detect the inaccuracy of the learned constitutive closure and initiate simulations at new sampling points informed by proper acquisition functions, leading to an autonomic microscale-macroscale coupled system. Also, we develop a new dissipative particle dynamics model with the range of interaction cutoff between particles allowed to vary with the local strain-rate invariant, which is able to capture both the shear-thinning viscosity and the normal stress difference functions consistent with rheological experiments for aqueous polyacrylamide solutions. Our numerical experiments demonstrate the effectiveness of using active- and transfer-learning schemes to on-the-fly couple a spectral element solver and a mesoscopic particle-based simulator, and verify that the microscale-macroscale coupled model with effective constitutive closure learned from microscopic dynamics can outperform empirical constitutive models compared to experimental observations. The effective closure learned in a channel simulation is then transferred directly to the flow past a circular cylinder, where the results show that only two additional microscopic simulations are required to achieve a satisfactory constitutive model to once again close the continuum equations. This new paradigm of active- and transfer-learning for multiscale modeling is readily applicable to other microscale-macroscale coupled simulations of complex fluids and other materials.

preprint2020arXiv

Attention-Guided Lightweight Network for Real-Time Segmentation of Robotic Surgical Instruments

The real-time segmentation of surgical instruments plays a crucial role in robot-assisted surgery. However, it is still a challenging task to implement deep learning models to do real-time segmentation for surgical instruments due to their high computational costs and slow inference speed. In this paper, we propose an attention-guided lightweight network (LWANet), which can segment surgical instruments in real-time. LWANet adopts encoder-decoder architecture, where the encoder is the lightweight network MobileNetV2, and the decoder consists of depthwise separable convolution, attention fusion block, and transposed convolution. Depthwise separable convolution is used as the basic unit to construct the decoder, which can reduce the model size and computational costs. Attention fusion block captures global contexts and encodes semantic dependencies between channels to emphasize target regions, contributing to locating the surgical instrument. Transposed convolution is performed to upsample feature maps for acquiring refined edges. LWANet can segment surgical instruments in real-time while takes little computational costs. Based on 960*544 inputs, its inference speed can reach 39 fps with only 3.39 GFLOPs. Also, it has a small model size and the number of parameters is only 2.06 M. The proposed network is evaluated on two datasets. It achieves state-of-the-art performance 94.10% mean IOU on Cata7 and obtains a new record on EndoVis 2017 with a 4.10% increase on mean IOU.

preprint2020arXiv

Automated classification of stems and leaves of potted plants based on point cloud data

The accurate classification of plant organs is a key step in monitoring the growing status and physiology of plants. A classification method was proposed to classify the leaves and stems of potted plants automatically based on the point cloud data of the plants, which is a nondestructive acquisition. The leaf point training samples were automatically extracted by using the three-dimensional convex hull algorithm, while stem point training samples were extracted by using the point density of a two-dimensional projection. The two training sets were used to classify all the points into leaf points and stem points by utilizing the support vector machine (SVM) algorithm. The proposed method was tested by using the point cloud data of three potted plants and compared with two other methods, which showed that the proposed method can classify leaf and stem points accurately and efficiently.

preprint2020arXiv

BARNet: Bilinear Attention Network with Adaptive Receptive Fields for Surgical Instrument Segmentation

Surgical instrument segmentation is extremely important for computer-assisted surgery. Different from common object segmentation, it is more challenging due to the large illumination and scale variation caused by the special surgical scenes. In this paper, we propose a novel bilinear attention network with adaptive receptive field to solve these two challenges. For the illumination variation, the bilinear attention module can capture second-order statistics to encode global contexts and semantic dependencies between local pixels. With them, semantic features in challenging areas can be inferred from their neighbors and the distinction of various semantics can be boosted. For the scale variation, our adaptive receptive field module aggregates multi-scale features and automatically fuses them with different weights. Specifically, it encodes the semantic relationship between channels to emphasize feature maps with appropriate scales, changing the receptive field of subsequent convolutions. The proposed network achieves the best performance 97.47% mean IOU on Cata7 and comes first place on EndoVis 2017 by 10.10% IOU overtaking second-ranking method.

preprint2020arXiv

Controlled release of entrapped nanoparticles from thermoresponsive hydrogels with tunable network characteristics

Thermoresponsive hydrogels have been studied intensively for creating smart drug carriers and controlled drug delivery. Understanding the drug release kinetics and corresponding transport mechanisms of nanoparticles (NPs) in a thermoresponsive hydrogel network is the key to the successful design of a smart drug delivery system. We construct a mesoscopic model of rigid NPs entrapped in a hydrogel network in an aqueous solution, where the hydrogel network is formed by cross-linked semiflexible polymers of PNIPAM. By varying the environmental temperature crossing the lower critical solution temperature of PNIPAM we can significantly change the hydrogel network characteristics. We systematically investigate how the matrix porosity and the nanoparticle size affect the NPs' transport kinetics at different temperatures. Quantitative results on the mean-squared displacement and the van Hove displacement distributions of NPs show that all NPs entrapped in the smart hydrogels undergo subdiffusion at both low and high temperatures. For a coil state, the subdiffusive exponent and the diffusion coefficient of NPs increase due to the increased kinetic energy and the decreased confinement on NPs, while the transport of NPs in the hydrogels can be also enhanced by decreasing the matrix porosity and NPs' size. However, when the solution temperature is increased above the critical temperature, the hydrogel network collapses following the coil-to-globule transition, with the NPs tightly trapped in some local regions inside the hydrogels. Consequently, the NP diffusion coefficient can be reduced by two orders of magnitude, or the diffusion processes can even be completely stopped. These findings provide new insights for designing controlled drug release from stimuli-responsive hydrogels, including autonomously switch on/off drug release to respond to the changes of the local environment.

preprint2020arXiv

Design and Control of a Variable Aerial Cable Towed System

Aerial Cable Towed Systems (ACTS) are composed of several Unmanned Aerial Vehicles (UAVs) connected to a payload by cables. Compared to towing objects from individual aerial vehicles, an ACTS has significant advantages such as heavier payload capacity, modularity, and full control of the payload pose. They are however generally large with limited ability to meet geometric constraints while avoiding collisions between UAVs. This paper presents the modelling, performance analysis, design, and a proposed controller for a novel ACTS with variable cable lengths, named Variable Aerial Cable Towed System (VACTS).Winches are embedded on the UAVs for actuating the cable lengths similar to a Cable-Driven Parallel Robot to increase the versatility of the ACTS. The general geometric, kinematic and dynamic models of the VACTS are derived, followed by the development of a centralized feedback linearization controller. The design is based on a wrench analysis of the VACTS, without constraining the cables to pass through the UAV center of mass, as in current works. Additionally, the performance of the VACTS and ACTS are compared showing that the added versatility comes at the cost of payload and configuration flexibility. A prototype confirms the feasibility of the system.

preprint2020arXiv

Exemplar Normalization for Learning Deep Representation

Normalization techniques are important in different advanced neural networks and different tasks. This work investigates a novel dynamic learning-to-normalize (L2N) problem by proposing Exemplar Normalization (EN), which is able to learn different normalization methods for different convolutional layers and image samples of a deep network. EN significantly improves flexibility of the recently proposed switchable normalization (SN), which solves a static L2N problem by linearly combining several normalizers in each normalization layer (the combination is the same for all samples). Instead of directly employing a multi-layer perceptron (MLP) to learn data-dependent parameters as conditional batch normalization (cBN) did, the internal architecture of EN is carefully designed to stabilize its optimization, leading to many appealing benefits. (1) EN enables different convolutional layers, image samples, categories, benchmarks, and tasks to use different normalization methods, shedding light on analyzing them in a holistic view. (2) EN is effective for various network architectures and tasks. (3) It could replace any normalization layers in a deep network and still produce stable model training. Extensive experiments demonstrate the effectiveness of EN in a wide spectrum of tasks including image recognition, noisy label learning, and semantic segmentation. For example, by replacing BN in the ordinary ResNet50, improvement produced by EN is 300% more than that of SN on both ImageNet and the noisy WebVision dataset.

preprint2020arXiv

Formal modeling and performance evaluation for hybrid systems:a probabilistic hybrid process algebra-based approach

Probabilistic behavior is omnipresent in computer controlled systems, in particular, so-called safety-critical hybrid systems, because of various reasons, like uncertain environments, or fundamental properties of nature. In this paper, we extend existing hybrid process algebra $ACP_{hs}^{srt}$ with probability without replacing nondeterministic choice operator. In view of some shortcomings in existing approximate probabilistic bisimulation, we relax the constrains and propose a novel approximate probabilistic bisimulation relation. After that, we present a performance evaluation language, CTRML, to reason over probabilistic systems, which extend the results to real number. Along with the specification language, we present a set of algorithms for the evaluation of the language. Additionally, we transfer the hybrid process algebra to probabilistic transition system and show experimental results.

preprint2020arXiv

IllumiNet: Transferring Illumination from Planar Surfaces to Virtual Objects in Augmented Reality

This paper presents an illumination estimation method for virtual objects in real environment by learning. While previous works tackled this problem by reconstructing high dynamic range (HDR) environment maps or the corresponding spherical harmonics, we do not seek to recover the lighting environment of the entire scene. Given a single RGB image, our method directly infers the relit virtual object by transferring the illumination features extracted from planar surfaces in the scene to the desired geometries. Compared to previous works, our approach is more robust as it works in both indoor and outdoor environments with spatially-varying illumination. Experiments and evaluation results show that our approach outperforms the state-of-the-art quantitatively and qualitatively, achieving realistic augmented experience.

preprint2020arXiv

Mesoscopic modeling of heptane: A surface tension calculation

Accurate and efficient flow models for hydrocarbons are important in the development of enhanced geotechnical engineering for energy source recovery and carbon capture & storage in low-porosity, low-permeability rock formations. This work reports an atomistically-validated, mesoscopic model for heptane based on a many-body dissipative particle dynamics (mDPD) method. In this model, each heptane molecule is coarse-grained in one mDPD bead and the mDPD model parameters are calibrated with a rigorous approach using reference data, including experimental measurements and/or molecular dynamics (MD) simulations. Results show that this mDPD model accurately predicts the bulk pressure-density relation of heptane and surface tension. Notice that our approach can be used to calibrate the mDPD model for other hydrocarbons as well, though heptane is chosen as a representative source fluid for its abundance in source rocks. Further, our timing test indicates that the mDPD model is three orders of magnitude faster than its MD counterpart for simulations of bulk heptane in equivalent volumes. Overall, this work serves as a key prerequisite for the development of accurate and efficient mesoscale models for the flow of hydrocarbons confined in mesoporous rock formations.

preprint2020arXiv

Multimode silicon photonics using on-chip geometrical-optics

On-chip optical interconnect has been widely accepted as a promising technology to realize future large-scale multiprocessors. Mode-division multiplexing (MDM) provides a new degree of freedom for optical interconnects to dramatically increase the link capacity. Present on-chip multimode devices are based on traditional wave-optics. Although large amount of computation and optimization are adopted to support more modes, mode-independent manipulation is still hard to be achieved due to severe mode dispersion. Here, we propose a universal solution to standardize the design of fundamental multimode building blocks, by introducing a geometrical-optics-like concept adopting waveguide width larger than the working wavelength. The proposed solution can tackle a group of modes at the same time with very simple processes, avoiding demultiplexing procedure and ensuring compact footprint. Compare to conventional schemes, it is scalable to larger mode channels without increasing the complexity and whole footprint. As a proof of concept, we demonstrate a set of multimode building blocks including crossing, bend, coupler and switches. Low losses of multimode waveguide crossing and bend are achieved, as well as ultra-low power consumption of the multimode switch is realized since it enables reconfigurable routing for a group of modes simultaneously. Our work promotes the multimode photonics research and makes the MDM technique more practical.

preprint2020arXiv

PointASNL: Robust Point Clouds Processing using Nonlocal Neural Networks with Adaptive Sampling

Raw point clouds data inevitably contains outliers or noise through acquisition from 3D sensors or reconstruction algorithms. In this paper, we present a novel end-to-end network for robust point clouds processing, named PointASNL, which can deal with point clouds with noise effectively. The key component in our approach is the adaptive sampling (AS) module. It first re-weights the neighbors around the initial sampled points from farthest point sampling (FPS), and then adaptively adjusts the sampled points beyond the entire point cloud. Our AS module can not only benefit the feature learning of point clouds, but also ease the biased effect of outliers. To further capture the neighbor and long-range dependencies of the sampled point, we proposed a local-nonlocal (L-NL) module inspired by the nonlocal operation. Such L-NL module enables the learning process insensitive to noise. Extensive experiments verify the robustness and superiority of our approach in point clouds processing tasks regardless of synthesis data, indoor data, and outdoor data with or without noise. Specifically, PointASNL achieves state-of-the-art robust performance for classification and segmentation tasks on all datasets, and significantly outperforms previous methods on real-world outdoor SemanticKITTI dataset with considerate noise. Our code is released through https://github.com/yanx27/PointASNL.

preprint2020arXiv

Super-Necking Crystal Growth and Structural and Magnetic Properties of SrTb$_2$O$_4$ Single Crystals

We report on single-crystal growths of the SrTb$_2$O$_4$ compound by a super-necking technique with a laser-floating-zone furnace and study the stoichiometry, growth mode, and structural and magnetic properties by scanning electronic microscopy, neutron Laue, X-ray powder diffraction, and the physical property measurement system. We optimized the growth parameters, mainly the growth speed, atmosphere, and the addition of a Tb$_4$O$_7$ raw material. Neutron Laue diffraction displays the characteristic feature of a single crystal. Our study reveals an atomic ratio of Sr:Tb $ = 0.97(2){:}2.00(1)$ and a possible layer by layer crystal growth mode. Our X-ray powder diffraction study determines the crystal structure, lattice constants and atomic positions. The paramagnetic (PM) Curie--Weiss (CW) temperature $θ_{\texttt{CW}} =$ 5.00(4) K, and the effective PM moment $M^{\texttt{eff}}_{\texttt{mea}} =$ 10.97(1) $μ_\texttt{B}$ per Tb$^{3+}$ ion. The data of magnetization versus temperature can be divided into three regimes, showing a coexistence of antiferromagnetic and ferromagnetic interactions. This probably leads to the magnetic frustration in the SrTb$_2$O$_4$ compound. The magnetization at 2 K and 14 T originates from both the Tb1 and Tb2 sites and is strongly frustrated with an expected saturation field at $\sim$41.5 T, displaying an intricate phase diagram with three ranges.

preprint2020arXiv

Ultrasound Liver Fibrosis Diagnosis using Multi-indicator guided Deep Neural Networks

Accurate analysis of the fibrosis stage plays very important roles in follow-up of patients with chronic hepatitis B infection. In this paper, a deep learning framework is presented for automatically liver fibrosis prediction. On contrary of previous works, our approach can take use of the information provided by multiple ultrasound images. An indicator-guided learning mechanism is further proposed to ease the training of the proposed model. This follows the workflow of clinical diagnosis and make the prediction procedure interpretable. To support the training, a dataset is well-collected which contains the ultrasound videos/images, indicators and labels of 229 patients. As demonstrated in the experimental results, our proposed model shows its effectiveness by achieving the state-of-the-art performance, specifically, the accuracy is 65.6%(20% higher than previous best).

preprint2020arXiv

Unifying Specialist Image Embedding into Universal Image Embedding

Deep image embedding provides a way to measure the semantic similarity of two images. It plays a central role in many applications such as image search, face verification, and zero-shot learning. It is desirable to have a universal deep embedding model applicable to various domains of images. However, existing methods mainly rely on training specialist embedding models each of which is applicable to images from a single domain. In this paper, we study an important but unexplored task: how to train a single universal image embedding model to match the performance of several specialists on each specialist's domain. Simply fusing the training data from multiple domains cannot solve this problem because some domains become overfitted sooner when trained together using existing methods. Therefore, we propose to distill the knowledge in multiple specialists into a universal embedding to solve this problem. In contrast to existing embedding distillation methods that distill the absolute distances between images, we transform the absolute distances between images into a probabilistic distribution and minimize the KL-divergence between the distributions of the specialists and the universal embedding. Using several public datasets, we validate that our proposed method accomplishes the goal of universal image embedding.

preprint2020arXiv

UXNet: Searching Multi-level Feature Aggregation for 3D Medical Image Segmentation

Aggregating multi-level feature representation plays a critical role in achieving robust volumetric medical image segmentation, which is important for the auxiliary diagnosis and treatment. Unlike the recent neural architecture search (NAS) methods that typically searched the optimal operators in each network layer, but missed a good strategy to search for feature aggregations, this paper proposes a novel NAS method for 3D medical image segmentation, named UXNet, which searches both the scale-wise feature aggregation strategies as well as the block-wise operators in the encoder-decoder network. UXNet has several appealing benefits. (1) It significantly improves flexibility of the classical UNet architecture, which only aggregates feature representations of encoder and decoder in equivalent resolution. (2) A continuous relaxation of UXNet is carefully designed, enabling its searching scheme performed in an efficient differentiable manner. (3) Extensive experiments demonstrate the effectiveness of UXNet compared with recent NAS methods for medical image segmentation. The architecture discovered by UXNet outperforms existing state-of-the-art models in terms of Dice on several public 3D medical image segmentation benchmarks, especially for the boundary locations and tiny tissues. The searching computational complexity of UXNet is cheap, enabling to search a network with the best performance less than 1.5 days on two TitanXP GPUs.

preprint2019arXiv

Complementarity between micro-micro and micro-macro entanglement in a Bose-Einstein condensate with two Rydberg impurities

We theoretically study complementarity between micro-micro and micro-macro entanglement in a Bose-Einstein condensate with two Rydberg impurities. We investigate quantum dynamics of micro-micro and micro-macro entanglement in the micro-macro system. It is found that strong micro-macro entanglement between Rydberg impurities and the BEC can be generated by the use of initial micro-micro entanglement between two Rydberg impurities, which acts as the seed entanglement to create micro-macro entanglement. We demonstrate a curious complementarity relation between micro-micro and micro-macro entanglement, and find that the complementarity property can be sustained to some extend even though in the presence of the BEC decoherence.

preprint2019arXiv

Influence of Boundaries and Thermostatting on Nonequilibrium Molecular Dynamics Simulations of Heat Conduction in Solids

Nonequilibrium molecular dynamics (NEMD) has been extensively used to study thermal transport at various length scales in many materials. In this method, two local thermostats at different temperatures are used to generate a nonequilibrium steady state with a constant heat flux. Conventionally, the thermal conductivity of a finite system is calculated as the ratio between the heat flux and the temperature gradient extracted from the linear part of the temperature profile away from the local thermostats. Here we show that, with a proper choice of the thermostat, the nonlinear part of the temperature profile should actually not be excluded in thermal transport calculations. We compare NEMD results against those from the atomistic Green's function method in the ballistic regime, and those from the homogeneous nonequilibrium molecular dynamics method in the ballistic-to-diffusive regime. These comparisons suggest that in all the transport regimes, one should directly calculate the thermal conductance from the temperature difference between the heat source and sink and, if needed, convert it to the thermal conductivity by multiplying it with the system length. Furthermore, we find that the Langevin thermostat outperforms the Nosé-Hoover (chain) thermostat in NEMD simulations because of its stochastic and local nature. We show that this is particularly important for studying asymmetric carbon-based nanostructures, for which the Nosé-Hoover thermostat can produce artifacts leading to unphysical thermal rectification. Our findings are important to obtain correct results from molecular dynamics simulations of nanoscale heat transport as the accuracy of the interatomic potentials is rapidly improving.

preprint2019arXiv

PPINN: Parareal Physics-Informed Neural Network for time-dependent PDEs

Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great degree. While effective for relatively short-term time integration, when long time integration of the time-dependent PDEs is sought, the time-space domain may become arbitrarily large and hence training of the neural network may become prohibitively expensive. To this end, we develop a parareal physics-informed neural network (PPINN), hence decomposing a long-time problem into many independent short-time problems supervised by an inexpensive/fast coarse-grained (CG) solver. In particular, the serial CG solver is designed to provide approximate predictions of the solution at discrete times, while initiate many fine PINNs simultaneously to correct the solution iteratively. There is a two-fold benefit from training PINNs with small-data sets rather than working on a large-data set directly, i.e., training of individual PINNs with small-data is much faster, while training the fine PINNs can be readily parallelized. Consequently, compared to the original PINN approach, the proposed PPINN approach may achieve a significant speedup for long-time integration of PDEs, assuming that the CG solver is fast and can provide reasonable predictions of the solution, hence aiding the PPINN solution to converge in just a few iterations. To investigate the PPINN performance on solving time-dependent PDEs, we first apply the PPINN to solve the Burgers equation, and subsequently we apply the PPINN to solve a two-dimensional nonlinear diffusion-reaction equation. Our results demonstrate that PPINNs converge in a couple of iterations with significant speed-ups proportional to the number of time-subdomains employed.

preprint2018arXiv

Self-cleaning of hydrophobic rough surfaces by coalescence-induced wetting transition

The superhydrophobic leaves of a lotus plant and other natural surfaces with self-cleaning function have been studied intensively for the development of artificial biomimetic surfaces. Surface roughness generated by hierarchical structures is a crucial property required for superhydrophobicity and self-cleaning. Here, we demonstrate a novel self-cleaning mechanism of textured surfaces attributed to a spontaneous coalescence-induced wetting transition. We focus on the wetting transition as it represents a new mechanism, which can explain why droplets on rough surfaces are able to change from the highly adhesive Wenzel state to the low-adhesion Cassie-Baxter state and achieve self-cleaning. In particular, we perform many-body dissipative particle dynamics simulations of liquid droplets sitting on mechanically textured substrates. We quantitatively investigate the wetting behavior of an isolated droplet as well as coalescence of droplets for both Cassie-Baxter and Wenzel states. Our simulation results reveal that droplets in the Cassie-Baxter state have much lower contact angle hysteresis and smaller hydrodynamic resistance than droplets in the Wenzel state. When small neighboring droplets coalesce into bigger ones on textured hydrophobic substrates, we observe a spontaneous wetting transition from a Wenzel state to a Cassie-Baxter state, which is powered by the surface energy released upon coalescence of the droplets. For superhydrophobic surfaces, the released surface energy may be sufficient to cause a jumping motion of droplets off the surface, in which case adding one more droplet to coalescence may increase the jumping velocity by one order of magnitude. When multiple droplets are involved, we find that the spatial distribution of liquid components in the coalesced droplet can be controlled by properly designing the overall arrangement of droplets and the distance between them.

preprint2017arXiv

Active learning of constitutive relation from mesoscopic dynamics for macroscopic modeling of non-Newtonian flows

We simulate complex fluids by means of an on-the-fly coupling of the bulk rheology to the underlying microstructure dynamics. In particular, a macroscopic continuum model of polymeric fluids is constructed without a pre-specified constitutive relation, but instead it is actively learned from mesoscopic simulations where the dynamics of polymer chains is explicitly computed. To couple the macroscopic rheology of polymeric fluids and the microscale dynamics of polymer chains, the continuum approach (based on the finite volume method) provides the transient flow field as inputs for the (mesoscopic) dissipative particle dynamics (DPD), and in turn DPD returns an effective constitutive relation to close the continuum equations. In this multiscale modeling procedure, we employ an active learning strategy based on Gaussian process regression (GPR) to minimize the number of expensive DPD simulations, where adaptively selected DPD simulations are performed only as necessary. Numerical experiments are carried out for flow past a circular cylinder of a non-Newtonian fluid, modeled at the mesoscopic level by bead-spring chains. The results show that only five DPD simulations are required to achieve an effective closure of the continuum equations at Reynolds number Re=10. Furthermore, when Re is increased to 100, only one additional DPD simulation is required for constructing an extended GPR-informed model closure. Compared to traditional message-passing multiscale approaches, applying an active learning scheme to multiscale modeling of non-Newtonian fluids can significantly increase the computational efficiency. Although the method demonstrated here obtains only a local viscosity from the mesoscopic model, it can be extended to other multiscale models of complex fluids whose macro-rheology is unknown.

preprint2016arXiv

A dissipative particle dynamics method for arbitrarily complex geometries

We present a local detection method for dissipative particle dynamics (DPD) involving arbitrarily shaped geometric three-dimensional domains. By introducing an indicator variable of boundary volume fraction (BVF) for each fluid particle, the boundary of arbitrary-shape objects is detected on-the-fly for the moving fluid particles using only the local particle configuration. Therefore, this approach eliminates the need of an analytical description of the boundary and geometry of objects in DPD simulations and makes it possible to load the geometry of a system directly from experimental images or computer-aided designs/drawings. Wall penetration is inferred from the value of the BVF and prevented by a predictor-corrector algorithm. The no-slip boundary condition is achieved by employing effective dissipative coefficients for liquid-solid interactions. Quantitative evaluations of the new method are performed for the plane Poiseuille flow, the plane Couette flow and the Wannier flow in a cylindrical domain and compared with their corresponding analytical solutions and (high-order) spectral element solution of the Navier-Stokes equations. We verify that the proposed method yields correct no-slip boundary condition for velocity and generates negligible fluctuations of density and temperature in the vicinity of the wall surface. Moreover, we construct a very complex 3D geometry - the "Brown Pacman" microfluidic device - to explicitly demonstrate how to construct a DPD system with complex geometry directly from loading a graphical image. In addition to stationary arbitrary-shape objects, the new method is particularly useful for problems involving moving and deformable boundaries, because it only uses local information of neighboring particles and satisfies the desired boundary conditions on-the-fly.