arXiv subjects

Li Chen

Publications and source records attributed to Li Chen.

At least 451 records · Page 25Linked to original sources

arXiv2022

Condensation Droplet Sieve

Large droplets emerging during dropwise condensation impair surface properties such as anti-fogging/frosting ability and heat transfer efficiency. How to spontaneously detach massive randomly distributed droplets with controlled sizes has remained a great challenge. Herein, we present a general solution called condensation droplet sieve, through fabricating microscale thin-walled lattice (TWL) structures coated with a superhydrophobic layer. Growing droplets were observed to jumped off this TWL surface with 100% probability once becoming slightly larger than the lattices. The maximum radius and residual volume of droplets were strictly confined to 16 μm and 3.2 nl/mm2 respectively, greatly surpassing the current state of the art. We reveal that this extremely efficient jumping is attributed to the large tolerance of coalescence mismatch and effective isolation of droplets between neighbouring lattices. Our work provides a new perspective for the design and fabrication of high-performance anti-dew materials.

cond-mat.mtrl-sci↗

arXiv2022

A Data-driven Adversarial Examples Recognition Framework via Adversarial Feature Genome

Adversarial examples pose many security threats to convolutional neural networks (CNNs). Most defense algorithms prevent these threats by finding differences between the original images and adversarial examples. However, the found differences do not contain features about the classes, so these defense algorithms can only detect adversarial examples without recovering the correct labels. In this regard, we propose the Adversarial Feature Genome (AFG), a novel type of data that contains both the differences and features about classes. This method is inspired by an observed phenomenon, namely the Adversarial Feature Separability (AFS), where the difference between the feature maps of the original images and adversarial examples becomes larger with deeper layers. On top of that, we further develop an adversarial example recognition framework that detects adversarial examples and can recover the correct labels. In the experiments, the detection and classification of adversarial examples by AFGs has an accuracy of more than 90.01\% in various attack scenarios. To the best of our knowledge, our method is the first method that focuses on both attack detecting and recovering. AFG gives a new data-driven perspective to improve the robustness of CNNs. The source code is available at https://github.com/GeoX-Lab/Adv_Fea_Genome.

cs.CV↗

arXiv2022

Design of Placement Delivery Arrays for Coded Caching with Small Subpacketizations and Flexible Memory Sizes

Coded caching is an emerging technique to reduce the data transmission load during the peak-traffic times. In such a scheme, each file in the data center or library is usually divided into a number of packets to pursue a low broadcasting rate based on the designed placements at each user's cache. However, the implementation complexity of this scheme increases as the number of packets increases. It is crucial to design a scheme with a small subpacketization level, while maintaining a relatively low transmission rate. It is known that the design of caches in users (i.e., the placement phase) and broadcasting (i.e., the delivery phase) can be unified in one matrix, namely the placement delivery array (PDA). This paper proposes a novel PDA construction by selecting proper orthogonal arrays (POAs), which generalizes some known constructions but with a more flexible memory size. Based on the proposed PDA construction, an effective transformation is further proposed to enable a coded caching scheme to have a smaller subpacketization level. Moreover, two new coded caching schemes with the coded placement are considered. It is shown that the proposed schemes yield a lower subpacketization level and transmission rate over some existing schemes.

cs.IT↗

arXiv2022

Global weak solutions to the Vlasov-Poisson-Fokker-Planck-Navier-Stokes system

We consider the compressible Vlasov-Poisson-Fokker-Planck-Navier-Stokes system in a three dimensional bounded domain with nonhomogeneous Dirichlet boundary conditions. The system describes the evolution of charged particles ensemble dispersed in an isentropic fluid. For the adiabatic coefficient $γ>3/2$, we establish the global existence of weak solutions to this system with arbitrary large initial and boundary data.

math.AP↗

arXiv2021

Task Transformer Network for Joint MRI Reconstruction and Super-Resolution

The core problem of Magnetic Resonance Imaging (MRI) is the trade off between acceleration and image quality. Image reconstruction and super-resolution are two crucial techniques in Magnetic Resonance Imaging (MRI). Current methods are designed to perform these tasks separately, ignoring the correlations between them. In this work, we propose an end-to-end task transformer network (T$^2$Net) for joint MRI reconstruction and super-resolution, which allows representations and feature transmission to be shared between multiple task to achieve higher-quality, super-resolved and motion-artifacts-free images from highly undersampled and degenerated MRI data. Our framework combines both reconstruction and super-resolution, divided into two sub-branches, whose features are expressed as queries and keys. Specifically, we encourage joint feature learning between the two tasks, thereby transferring accurate task information. We first use two separate CNN branches to extract task-specific features. Then, a task transformer module is designed to embed and synthesize the relevance between the two tasks. Experimental results show that our multi-task model significantly outperforms advanced sequential methods, both quantitatively and qualitatively.

eess.IV↗

arXiv2021

Diagnosis of Intelligent Reflecting Surface in Millimeter-wave Communication Systems

Intelligent reflecting surface (IRS) is a promising technology for enhancing wireless communication systems. It adaptively configures massive passive reflecting elements to control wireless channel in a desirable way. Due to hardware characteristics and deploying environments, an IRS may be subject to reflecting element blockages and failures, and hence developing diagnostic techniques is of great significance to system monitoring and maintenance. In this paper, we develop diagnostic techniques for IRS systems to locate faulty reflecting elements and retrieve failure parameters. Three cases of channel state information (CSI) availability are considered. In the first case where full CSI is available, a compressed sensing based diagnostic technique is proposed, which significantly reduces the required number of measurements. In the second case where only partial CSI is available, we jointly exploit the sparsity of the millimeter-wave channel and the failure, and adopt compressed sparse and low-rank matrix recovery algorithm to decouple channel and failure. In the third case where no CSI is available, a novel atomic norm is introduced as the sparsity-inducing norm of the cascaded channel, and the diagnosis problem is formulated as a joint sparse recovery problem. Finally, the proposed diagnostic techniques are validated through numerical simulations.

eess.SY↗

arXiv2021

Estimating the Distribution of Ratio of Paired Event Times in Phase II Oncology Trials

With the rapid development of new anti-cancer agents which are cytostatic, new endpoints are needed to better measure treatment efficacy in phase II trials. For this purpose, Von Hoff (1998) proposed the growth modulation index (GMI), i.e. the ratio between times to progression or progression-free survival times in two successive treatment lines. An essential task in studies using GMI as an endpoint is to estimate the distribution of GMI. Traditional methods for survival data have been used for estimating the GMI distribution because censoring is common for GMI data. However, we point out that the independent censoring assumption required by traditional survival methods is always violated for GMI, which may lead to severely biased results. In this paper, we construct nonparametric estimators for the distribution of GMI, accounting for the dependent censoring of GMI. We prove that the proposed estimators are consistent and converge weakly to zero-mean Gaussian processes upon proper normalization. Extensive simulation studies show that our estimators perform well in practical situations and outperform traditional methods. A phase II clinical trial using GMI as the primary endpoint is provided for illustration.

stat.ME↗

arXiv2021

Weighted Mean Difference Statistics for Paired Data in Presence of Missing Values

Missing data is a common issue in many biomedical studies. Under a paired design, some subjects may have missing values in either one or both of the conditions due to loss of follow-up, insufficient biological samples, etc. Such partially paired data complicate statistical comparison of the distribution of the variable of interest between the two conditions. In this paper, we propose a general class of test statistics based on the difference in weighted sample means without imposing any distributional or model assumption. An optimal weight is derived for this class of tests. Simulation studies show that our proposed test with the optimal weight performs well and outperforms existing methods in practical situations. Two cancer biomarker studies are provided for illustration.

stat.ME↗

arXiv2021

Aesthetic Photo Collage with Deep Reinforcement Learning

Photo collage aims to automatically arrange multiple photos on a given canvas with high aesthetic quality. Existing methods are based mainly on handcrafted feature optimization, which cannot adequately capture high-level human aesthetic senses. Deep learning provides a promising way, but owing to the complexity of collage and lack of training data, a solution has yet to be found. In this paper, we propose a novel pipeline for automatic generation of aspect ratio specified collage and the reinforcement learning technique is introduced in collage for the first time. Inspired by manual collages, we model the collage generation as sequential decision process to adjust spatial positions, orientation angles, placement order and the global layout. To instruct the agent to improve both the overall layout and local details, the reward function is specially designed for collage, considering subjective and objective factors. To overcome the lack of training data, we pretrain our deep aesthetic network on a large scale image aesthetic dataset (CPC) for general aesthetic feature extraction and propose an attention fusion module for structural collage feature representation. We test our model against competing methods on two movie datasets and our results outperform others in aesthetic quality evaluation. Further user study is also conducted to demonstrate the effectiveness.

cs.CV↗

arXiv2021

Cloning one's voice using very limited data in the wild

With the increasing popularity of speech synthesis products, the industry has put forward more requirements for personalized speech synthesis: (1) How to use low-resource, easily accessible data to clone a person's voice. (2) How to clone a person's voice while controlling the style and prosody. To solve the above two problems, we proposed the Hieratron model framework in which the prosody and timbre are modeled separately using two modules, therefore, the independent control of timbre and the other characteristics of audio can be achieved while generating speech. The practice shows that, for very limited target speaker data in the wild, Hieratron has obvious advantages over the traditional method, in addition to controlling the style and language of the generated speech, the mean opinion score on speech quality of the generated speech has also been improved by more than 0.2 points.

eess.AS↗

arXiv2021

Rigorous derivation of population cross-diffusion systems from moderately interacting particle systems

Population cross-diffusion systems of Shigesada-Kawasaki-Teramoto type are derived in a mean-field-type limit from stochastic, moderately interacting many-particle systems for multiple population species in the whole space. The diffusion term in the stochastic model depends nonlinearly on the interactions between the individuals, and the drift term is the gradient of the environmental potential. In the first step, the mean-field limit leads to an intermediate nonlocal model. The local cross-diffusion system is derived in the second step in a moderate scaling regime, when the interaction potentials approach the Dirac delta distribution. The global existence of strong solutions to the intermediate and the local diffusion systems is proved for sufficiently small initial data. Furthermore, numerical simulations on the particle level are presented.

math.AP↗

arXiv2021

Analysis and mean-field derivation of a porous-medium equation with fractional diffusion

A mean-field-type limit from stochastic moderately interacting many-particle systems with singular Riesz potential is performed, leading to nonlocal porous-medium equations in the whole space. The nonlocality is given by the inverse of a fractional Laplacian, and the limit equation can be interpreted as a transport equation with a fractional pressure. The proof is based on Oelschläger's approach and a priori estimates for the associated diffusion equations, coming from energy-type and entropy inequalities as well as parabolic regularity. An existence analysis of the fractional porous-medium equation is also provided, based on a careful regularization procedure, new variants of fractional Gagliardo--Nirenberg inequalities, and the div-curl lemma. A consequence of the mean-field limit estimates is the propagation of chaos property.

math.AP↗

arXiv2021

DAPnet: A Double Self-attention Convolutional Network for Point Cloud Semantic Labeling

Airborne Laser Scanning (ALS) point clouds have complex structures, and their 3D semantic labeling has been a challenging task. It has three problems: (1) the difficulty of classifying point clouds around boundaries of objects from different classes, (2) the diversity of shapes within the same class, and (3) the scale differences between classes. In this study, we propose a novel double self-attention convolutional network called the DAPnet. The double self-attention includes the point attention module (PAM) and the group attention module (GAM). For problem (1), the PAM can effectively assign different weights based on the relevance of point clouds in adjacent areas. Meanwhile, for the problem (2), the GAM enhances the correlation between groups, i.e., grouped features within the same classes. To solve the problem (3), we adopt a multiscale radius to construct the groups and concatenate extracted hierarchical features with the output of the corresponding upsampling process. Under the ISPRS 3D Semantic Labeling Contest dataset, the DAPnet outperforms the benchmark by 85.2\% with an overall accuracy of 90.7\%. By conducting ablation comparisons, we find that the PAM effectively improves the model than the GAM. The incorporation of the double self-attention module has an average of 7\% improvement on the pre-class accuracy. Plus, the DAPnet consumes a similar training time to those without the attention modules for model convergence. The DAPnet can assign different weights to features based on the relevance between point clouds and their neighbors, which effectively improves classification performance. The source codes are available at: https://github.com/RayleighChen/point-attention.

cs.CV↗

arXiv2021

Hypothesis testing for populations of networks

It has become an increasingly common practice for scientists in modern science and engineering to collect samples of multiple network data in which a network serves as a basic data object. The increasing prevalence of multiple network data calls for developments of models and theory that can deal with inference problems for populations of networks. In this work, we propose a general procedure for hypothesis testing of networks and in particular, for differentiating distributions of two samples of networks. We consider a very general framework which allows us to perform tests on large and sparse networks. Our contribution is two-fold: (1) We propose a test statistics based on the singular value of a generalized Wigner matrix. The asymptotic null distribution of the statistics is shown to follow the Tracy--Widom distribution as the number of nodes tends to infinity. The test also yields asymptotic power guarantee with the power tending to one under the alternative; (2) The test procedure is adapted for change-point detection in dynamic networks which is proven to be consistent in detecting the change-points. In addition to theoretical guarantees, another appealing feature of this adapted procedure is that it provides a principled and simple method for selecting the threshold that is also allowed to vary with time. Extensive simulation studies and real data analyses demonstrate the superior performance of our procedure with competitors.

stat.ME↗

arXiv2021

Extracting all Aspect-polarity Pairs Jointly in a Text with Relation Extraction Approach

Extracting aspect-polarity pairs from texts is an important task of fine-grained sentiment analysis. While the existing approaches to this task have gained many progresses, they are limited at capturing relationships among aspect-polarity pairs in a text, thus degrading the extraction performance. Moreover, the existing state-of-the-art approaches, namely token-based se-quence tagging and span-based classification, have their own defects such as polarity inconsistency resulted from separately tagging tokens in the former and the heterogeneous categorization in the latter where aspect-related and polarity-related labels are mixed. In order to remedy the above defects, in-spiring from the recent advancements in relation extraction, we propose to generate aspect-polarity pairs directly from a text with relation extraction technology, regarding aspect-pairs as unary relations where aspects are enti-ties and the corresponding polarities are relations. Based on the perspective, we present a position- and aspect-aware sequence2sequence model for joint extraction of aspect-polarity pairs. The model is characterized with its ability to capture not only relationships among aspect-polarity pairs in a text through the sequence decoding, but also correlations between an aspect and its polarity through the position- and aspect-aware attentions. The experi-ments performed on three benchmark datasets demonstrate that our model outperforms the existing state-of-the-art approaches, making significant im-provement over them.

cs.CL↗

arXiv2021

Convergence towards the Vlasov-Poisson Equation from the $N$-Fermionic Schrödinger Equation

We consider the quantum dynamics of $N$ interacting fermions in the large $N$ limit. The particles in the system interact with each other via repulsive interaction that is regularized Coulomb potential with a polynomial cutoff with respect to $N$.From the quantum system, we derive the Vlasov-Poisson system by simultaneously estimating the semiclassical and mean-field residues in terms of the Husimi measure.

math-ph↗

arXiv2021

Hessian equations of Krylov type on Kähler manifolds

In this paper, we consider Hessian equations with its structure as a combination of elementary symmetric functions on closed Kähler manifolds. We provide a sufficient and necessary condition for the solvability of these equations, which generalize the results of Hessian equations and Hessian quotient equations.

math.DG↗

arXiv2021

Weak entropy solution for a Keller-Segel type fluid model

In this paper, we consider a Keller-Segel type fluid model, which is a kind of Euler-Poisson system with a self-gravitational force. We show that similar to the parabolic case, there is a critical mass $8π$ such that if the initial total mass $M$ is supercritical, i.e., $M> 8π$, then any weak entropy solution with the same mass $M$ must blow up in finite time. The a priori estimates of weak entropy solutions for critical mass $M=8π$ and subcritical mass $M<8π$ are also obtained.

math.AP↗