Searcharxiv⌕ Search

arXiv subjects

Wei Li

Publications and source records attributed to Wei Li.

At least 937 records · Page 52Linked to original sources

Ferroelectric materials and their applications in green catalysis

The demand for renewable and environmentally friendly energy source has attracted extensive research on high performance catalysts. Ferroelectrics which are a class of materials with a switchable polarization are the unique and promising catalyst candidates due to the significant effects of polarization on surfaces physical and chemical properties. The band bending at the ferroelectric/semiconductor interface induced by the polarization flip promotes the charge separation and transfer, there by enhancing the photocatalytic performance. More importantly, the reactants can be selectively adsorbed on the surface of the ferroelectric materials depending on the polarization direction, which can effectively lift the basic limitations as imposed by Sabatier principle on catalytic activity. This review summarizes the latest developments of ferroelectric materials, and introduces the ferroelectric-related catalytic application. The possible research directions of 2D ferroelectric materials in chemical catalysis is discussed at the end. The review is expected to inspire the extensive research interests from physical, chemical and material science communities.

cond-mat.mtrl-sci↗

Exploiting Both Domain-specific and Invariant Knowledge via a Win-win Transformer for Unsupervised Domain Adaptation

Unsupervised Domain Adaptation (UDA) aims to transfer knowledge from a labeled source domain to an unlabeled target domain. Most existing UDA approaches enable knowledge transfer via learning domain-invariant representation and sharing one classifier across two domains. However, ignoring the domain-specific information that are related to the task, and forcing a unified classifier to fit both domains will limit the feature expressiveness in each domain. In this paper, by observing that the Transformer architecture with comparable parameters can generate more transferable representations than CNN counterparts, we propose a Win-Win TRansformer framework (WinTR) that separately explores the domain-specific knowledge for each domain and meanwhile interchanges cross-domain knowledge. Specifically, we learn two different mappings using two individual classification tokens in the Transformer, and design for each one a domain-specific classifier. The cross-domain knowledge is transferred via source guided label refinement and single-sided feature alignment with respect to source or target, which keeps the integrity of domain-specific information. Extensive experiments on three benchmark datasets show that our method outperforms the state-of-the-art UDA methods, validating the effectiveness of exploiting both domain-specific and invariant

cs.CV↗

Spin-Triplet Pairing Induced by Near-Neighbor Attraction in the Cuprate Chain

In quantum materials, the electronic interaction and the electron-phonon coupling are, in general, two essential ingredients, the combined impact of which may drive exotic phases. Recently, an anomalously strong electron-electron attraction, mediated by phonons, has been unveiled in one-dimensional copper-oxide chain Ba$_{2-x}$Sr$_x$CuO$_{3+δ}$. Yet, it is unclear how this strong near-neighbor attraction $V$ influences the superconductivity pairing in the compound. Here we perform accurate many-body calculations to study the extended Hubbard model with on-site Coulomb repulsion $U>0$ and attraction $V<0$ that well describes the cuprate chain and likely other similar transition-metal materials with both strong correlations and lattice effects. We find a rich quantum phase diagram containing an intriguing Tomonaga-Luttinger liquid phase -- besides the spin density wave and various phase separation phases -- that can host dominant spin-triplet pairing correlations and divergent superconductive susceptibility. Upon doping, the spin-triplet superconducting regime can be further broadened in the parameter space and extends to larger $U$, offering a feasible mechanism to realize $p$-wave superconductivity in realistic cuprate chains.

cond-mat.str-el↗

FastFlow: Unsupervised Anomaly Detection and Localization via 2D Normalizing Flows

Unsupervised anomaly detection and localization is crucial to the practical application when collecting and labeling sufficient anomaly data is infeasible. Most existing representation-based approaches extract normal image features with a deep convolutional neural network and characterize the corresponding distribution through non-parametric distribution estimation methods. The anomaly score is calculated by measuring the distance between the feature of the test image and the estimated distribution. However, current methods can not effectively map image features to a tractable base distribution and ignore the relationship between local and global features which are important to identify anomalies. To this end, we propose FastFlow implemented with 2D normalizing flows and use it as the probability distribution estimator. Our FastFlow can be used as a plug-in module with arbitrary deep feature extractors such as ResNet and vision transformer for unsupervised anomaly detection and localization. In training phase, FastFlow learns to transform the input visual feature into a tractable distribution and obtains the likelihood to recognize anomalies in inference phase. Extensive experimental results on the MVTec AD dataset show that FastFlow surpasses previous state-of-the-art methods in terms of accuracy and inference efficiency with various backbone networks. Our approach achieves 99.4% AUC in anomaly detection with high inference efficiency.

cs.CV↗

AWESAM: A Python Module for Automated Volcanic Event Detection Applied to Stromboli

Many active volcanoes in the world exhibit Strombolian activity, which is typically characterized by relatively frequent mild events and also by rare and much more destructive major explosions and paroxysms. Detailed analyses of past major and minor events can help to understand the eruptive behavior of the volcano and the underlying physical and chemical processes. Catalogs of volcanic eruptions may be established using continuous seismic recordings at stations in the proximity of volcanoes. However, in many cases, the analysis of the recordings relies heavily on the manual picking of events by human experts. Recently developed Machine Learning-based approaches require large training data sets which may not be available a priori. Here, we propose an alternative automated approach: the Adaptive-Window Volcanic Event Selection Analysis Module (AWESAM). This process of creating event catalogs consists of three main steps: (i) identification of potential volcanic events based on squared ground-velocity amplitudes, an adaptive MaxFilter, and a prominence threshold. (ii) catalog consolidation by comparing and verification of the initial detections based on recordings from two different seismic stations. (iii) identification and exclusion of signals from regional tectonic earthquakes. The software package is applied to publicly accessible continuous seismic recordings from two almost equidistant stations at Stromboli volcano in Italy. We tested AWESAM by comparison with a hand-picked catalog and found that around 95 percent of the eruptions with a signal-to-noise ratio above three are detected. In a first application, we derive a new amplitude-frequency relationship from over 290.000 volcanic events at Stromboli during 2019-2020. The module allows for a straightforward generalization and application to other volcanoes worldwide.

physics.geo-ph↗

Acceleration of DNA Replication of Klenow Fragment by Small Resisting Force

DNA polymerases are an essential class of enzymes or molecular motors that catalyze processive DNA syntheses during DNA replications. A critical issue for DNA polymerases is their molecular mechanism of processive DNA replication. We have previously proposed a model for chemomechanical coupling of DNA polymerases, based on which the predicted results have been provided about the dependence of DNA replication velocity upon the external force on Klenow fragment of DNA polymerase I. Here, we performed single molecule measurements of the replication velocity of Klenow fragment under the external force by using magnetic tweezers. The single molecule data verified quantitatively the previous theoretical predictions, which is critical to the chemomechanical coupling mechanism of DNA polymerases. A prominent characteristic for the Klenow fragment is that the replication velocity is independent of the assisting force whereas the velocity increases largely with the increase of the resisting force, attains the maximum velocity at about 3.8 pN and then decreases with the further increase of the resisting force.

cond-mat.soft↗

SgSum: Transforming Multi-document Summarization into Sub-graph Selection

Most of existing extractive multi-document summarization (MDS) methods score each sentence individually and extract salient sentences one by one to compose a summary, which have two main drawbacks: (1) neglecting both the intra and cross-document relations between sentences; (2) neglecting the coherence and conciseness of the whole summary. In this paper, we propose a novel MDS framework (SgSum) to formulate the MDS task as a sub-graph selection problem, in which source documents are regarded as a relation graph of sentences (e.g., similarity graph or discourse graph) and the candidate summaries are its sub-graphs. Instead of selecting salient sentences, SgSum selects a salient sub-graph from the relation graph as the summary. Comparing with traditional methods, our method has two main advantages: (1) the relations between sentences are captured by modeling both the graph structure of the whole document set and the candidate sub-graphs; (2) directly outputs an integrate summary in the form of sub-graph which is more informative and coherent. Extensive experiments on MultiNews and DUC datasets show that our proposed method brings substantial improvements over several strong baselines. Human evaluation results also demonstrate that our model can produce significantly more coherent and informative summaries compared with traditional MDS methods. Moreover, the proposed architecture has strong transfer ability from single to multi-document input, which can reduce the resource bottleneck in MDS tasks. Our code and results are available at: \url{https://github.com/PaddlePaddle/Research/tree/master/NLP/EMNLP2021-SgSum}.

cs.CL↗

Deep Learning for UAV-based Object Detection and Tracking: A Survey

Owing to effective and flexible data acquisition, unmanned aerial vehicle (UAV) has recently become a hotspot across the fields of computer vision (CV) and remote sensing (RS). Inspired by recent success of deep learning (DL), many advanced object detection and tracking approaches have been widely applied to various UAV-related tasks, such as environmental monitoring, precision agriculture, traffic management. This paper provides a comprehensive survey on the research progress and prospects of DL-based UAV object detection and tracking methods. More specifically, we first outline the challenges, statistics of existing methods, and provide solutions from the perspectives of DL-based models in three research topics: object detection from the image, object detection from the video, and object tracking from the video. Open datasets related to UAV-dominated object detection and tracking are exhausted, and four benchmark datasets are employed for performance evaluation using some state-of-the-art methods. Finally, prospects and considerations for the future work are discussed and summarized. It is expected that this survey can facilitate those researchers who come from remote sensing field with an overview of DL-based UAV object detection and tracking methods, along with some thoughts on their further developments.

cs.CV↗

MST: Masked Self-Supervised Transformer for Visual Representation

Transformer has been widely used for self-supervised pre-training in Natural Language Processing (NLP) and achieved great success. However, it has not been fully explored in visual self-supervised learning. Meanwhile, previous methods only consider the high-level feature and learning representation from a global perspective, which may fail to transfer to the downstream dense prediction tasks focusing on local features. In this paper, we present a novel Masked Self-supervised Transformer approach named MST, which can explicitly capture the local context of an image while preserving the global semantic information. Specifically, inspired by the Masked Language Modeling (MLM) in NLP, we propose a masked token strategy based on the multi-head self-attention map, which dynamically masks some tokens of local patches without damaging the crucial structure for self-supervised learning. More importantly, the masked tokens together with the remaining tokens are further recovered by a global image decoder, which preserves the spatial information of the image and is more friendly to the downstream dense prediction tasks. The experiments on multiple datasets demonstrate the effectiveness and generality of the proposed method. For instance, MST achieves Top-1 accuracy of 76.9% with DeiT-S only using 300-epoch pre-training by linear evaluation, which outperforms supervised methods with the same epoch by 0.4% and its comparable variant DINO by 1.0\%. For dense prediction tasks, MST also achieves 42.7% mAP on MS COCO object detection and 74.04% mIoU on Cityscapes segmentation only with 100-epoch pre-training.

cs.CV↗

Learning UI Navigation through Demonstrations composed of Macro Actions

We have developed a framework to reliably build agents capable of UI navigation. The state space is simplified from raw-pixels to a set of UI elements extracted from screen understanding, such as OCR and icon detection. The action space is restricted to the UI elements plus a few global actions. Actions can be customized for tasks and each action is a sequence of basic operations conditioned on status checks. With such a design, we are able to train DQfD and BC agents with a small number of demonstration episodes. We propose demo augmentation that significantly reduces the required number of human demonstrations. We made a customization of DQfD to allow demos collected on screenshots to facilitate the demo coverage of rare cases. Demos are only collected for the failed cases during the evaluation of the previous version of the agent. With 10s of iterations looping over evaluation, demo collection, and training, the agent reaches a 98.7\% success rate on the search task in an environment of 80+ apps and websites where initial states and viewing parameters are randomized.

cs.AI↗

Detecting Confined and Deconfined Spinons in Dynamical Quantum Simulations

Dynamical spin-structure factor (DSF) contains fingerprint information of collective excitations in interacting quantum spin systems. In solid state experiments, DSF can be measured through neutron scatterings. However, it is in general challenging to compute the spectral properties accurately via many-body simulations. Currently, quantum simulation and computation constitute a thriving research field, which are believed to provide a very promising platform for simulating quantum many-body systems. In this work, we establish a link between the many-body dynamics and quantum simulations by studying the non-equilibrium DSF (nDSF) measured on direct product states, which are accessible in contemporary quantum simulators with Rydberg atoms, superconducting qubits, etc. Based on the many-body calculations of transverse field Ising chains, we find the nDSF can be used to sensitively probe the multi-spinon continua associated with the two-spinon creation and the spinon-antispinon process, etc. Moreover, we further demonstrate that the low-energy spinons can be confined -- forming spinon bound states -- under a finite longitudinal field. Our results pave the way of quantum simulation and manipulation of fractional excitations in highly-entangled quantum many-body systems.

quant-ph↗

$SL(3,\mathbb{Z})$ Modularity and New Cardy Limits of the $\mathcal{N}=4$ Superconformal Index

The entropy of $1/16$-th BPS AdS$_5$ black holes can be microscopically accounted for by the superconformal index of the $\mathcal{N}=4$ super-Yang-Mills theory. One way to compute this is through a Cardy-like limit of a formula for the index obtained in [1] using the "$S$-transformation" of the elliptic $Γ$ function. In this paper, we derive more general $SL(3,\mathbb{Z})$ modular properties of the elliptic $Γ$ function. We then use these properties to obtain a three integer parameter family of generalized Cardy-like limits of the $\mathcal{N}=4$ superconformal index. From these limits, we obtain entropy formulae that have a similar form as that of the original AdS$_5$ black hole, up to an overall rescaling of the entropy. We interpret this both on the field theory and the gravitational side. Finally, we comment on how our work suggests a generalization of the Farey tail to four dimensions.

hep-th↗

The optimal positive operator-valued measure for state discrimination

Evaluating the amount of information obtained from non-orthogonal quantum states is an important topic in the field of quantum information. The commonly used evaluation method is Holevo bound, which only provides a loose upper bound for quantum measurement. In this paper, we provide a theoretical study of the positive operator-valued measure (POVM) for discriminating nonorthogonal states. We construct a generalized POVM measurement operation, and derive the optimal one for state discrimination by Lagrange multiplier method. With simulation, we find that the optimal POVM measurement provides a tight upper bound for state discrimination, which is significantly lower than that predicted by Holevo bound. The derivation of optimal POVM measurement will play an important role in the security research of quantum key distribution.

quant-ph↗

Query-Variant Advertisement Text Generation with Association Knowledge

Online advertising is an important revenue source for many IT companies. In the search advertising scenario, advertisement text that meets the need of the search query would be more attractive to the user. However, the manual creation of query-variant advertisement texts for massive items is expensive. Traditional text generation methods tend to focus on the general searching needs with high frequency while ignoring the diverse personalized searching needs with low frequency. In this paper, we propose the query-variant advertisement text generation task that aims to generate candidate advertisement texts for different web search queries with various needs based on queries and item keywords. To solve the problem of ignoring low-frequency needs, we propose a dynamic association mechanism to expand the receptive field based on external knowledge, which can obtain associated words to be added to the input. These associated words can serve as bridges to transfer the ability of the model from the familiar high-frequency words to the unfamiliar low-frequency words. With association, the model can make use of various personalized needs in queries and generate query-variant advertisement texts. Both automatic and human evaluations show that our model can generate more attractive advertisement text than baselines.

cs.CL↗

Morpho-evolution with learning using a controller archive as an inheritance mechanism

The joint optimisation of body-plan and control via evolutionary processes can be challenging in rich morphological spaces in which offspring can have body-plans that are very different from either of their parents. This causes a potential mismatch between the structure of an inherited controller and the new body. To address this, we propose a framework that combines an evolutionary algorithm to generate body-plans and a learning algorithm to optimise the parameters of a neural controller. The topology of this controller is created once the body-plan of each offspring body-plan is generated. The key novelty of the approach is to add an external archive for storing learned controllers that map to explicit `types' of robots (where this is defined with respect the features of the body-plan). By learning from a controller with an appropriate structure inherited from the archive, rather than from a randomly initialised one, we show that both the speed and magnitude of learning increases over time when compared to an approach that starts from scratch, using two tasks and three environments. The framework also provides new insights into the complex interactions between evolution and learning.

cs.RO↗

Evolution of electronic structure in pristine and hole-doped kagome metal RbV$_3$Sb$_5$

We report on in situ low-temperature (4 K) scanning tunneling microscope measurements of atomic and electronic structures of the cleaved surfaces of an alkali-based kagome metal RbV$_3$Sb$_5$ single crystals. We find that the dominant pristine surface exhibits Rb-1x1 structure, in which a unique unidirectional $\sqrt{3}a_0$ charge order is discovered. As the sample temperature slightly rises, Rb-$\sqrt{3}$x1 and Rb-$\sqrt{3}$x$\sqrt{3}$ reconstructions form due to desorption of surface Rb atoms. Our conductance mapping results demonstrate that Rb desorption not only gives rise to hole doping, but also renormalizes the electronic band structures. Surprisingly, we find a ubiquitous gap opening near the Fermi level in tunneling spectra on all the surfaces despite their large differences of hole-carrier concentration, indicating an orbital-selective band reconstruction in RbV$_3$Sb$_5$.

cond-mat.supr-con↗

DiaKG: an Annotated Diabetes Dataset for Medical Knowledge Graph Construction

Knowledge Graph has been proven effective in modeling structured information and conceptual knowledge, especially in the medical domain. However, the lack of high-quality annotated corpora remains a crucial problem for advancing the research and applications on this task. In order to accelerate the research for domain-specific knowledge graphs in the medical domain, we introduce DiaKG, a high-quality Chinese dataset for Diabetes knowledge graph, which contains 22,050 entities and 6,890 relations in total. We implement recent typical methods for Named Entity Recognition and Relation Extraction as a benchmark to evaluate the proposed dataset thoroughly. Empirical results show that the DiaKG is challenging for most existing methods and further analysis is conducted to discuss future research direction for improvements. We hope the release of this dataset can assist the construction of diabetes knowledge graphs and facilitate AI-based applications.

cs.CL↗

LUAI Challenge 2021 on Learning to Understand Aerial Images

This report summarizes the results of Learning to Understand Aerial Images (LUAI) 2021 challenge held on ICCV 2021, which focuses on object detection and semantic segmentation in aerial images. Using DOTA-v2.0 and GID-15 datasets, this challenge proposes three tasks for oriented object detection, horizontal object detection, and semantic segmentation of common categories in aerial images. This challenge received a total of 146 registrations on the three tasks. Through the challenge, we hope to draw attention from a wide range of communities and call for more efforts on the problems of learning to understand aerial images.

cs.CV↗