Searcharxiv⌕ Search

arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 847 records · Page 47Linked to original sources

Catapulting of topological defects through elasticity bands in active nematics

Active materials are those in which individual, uncoordinated local stresses drive the material out of equilibrium on a global scale. Examples of such assemblies can be seen across scales from schools of fish to the cellular cytoskeleton and underpin many important biological processes. Synthetic experiments that recapitulate the essential features of such active systems have been the object of study for decades as their simple rules allow us to elucidate the physical underpinnings of collective motion. One system of particular interest has been active nematic liquid crystals (LCs). Because of their well understood passive physics, LCs provide a rich platform to interrogate the effects of active stress. The flows and steady state structures that emerge in an active LCs have been understood to result from a competition between nematic elasticity and the local activity. However most investigations of such phenomena consider only the magnitude of the elastic resistance and not its peculiarities. Here we investigate a nematic liquid crystal and selectively change the ratio of the material's splay and bend elasticities. We show that increases in the nematic's bend elasticity specifically drives the material into an exotic steady state where elongated regions of acute bend distortion or "elasticity bands" dominate the structure and dynamics. We show that these bands strongly influence defect dynamics, including the rapid motion or "catapulting" along the disintegration of one of these bands thus converting bend distortion into defect transport. Thus, we report a novel dynamical state resultant from the competition between nematic elasticity and active stress.

cond-mat.soft↗

CONTaiNER: Few-Shot Named Entity Recognition via Contrastive Learning

Named Entity Recognition (NER) in Few-Shot setting is imperative for entity tagging in low resource domains. Existing approaches only learn class-specific semantic features and intermediate representations from source domains. This affects generalizability to unseen target domains, resulting in suboptimal performances. To this end, we present CONTaiNER, a novel contrastive learning technique that optimizes the inter-token distribution distance for Few-Shot NER. Instead of optimizing class-specific attributes, CONTaiNER optimizes a generalized objective of differentiating between token categories based on their Gaussian-distributed embeddings. This effectively alleviates overfitting issues originating from training domains. Our experiments in several traditional test domains (OntoNotes, CoNLL'03, WNUT '17, GUM) and a new large scale Few-Shot NER dataset (Few-NERD) demonstrate that on average, CONTaiNER outperforms previous methods by 3%-13% absolute F1 points while showing consistent performance trends, even in challenging scenarios where previous approaches could not achieve appreciable performance.

cs.CL↗

An Open Natural Language Processing Development Framework for EHR-based Clinical Research: A case demonstration using the National COVID Cohort Collaborative (N3C)

While we pay attention to the latest advances in clinical natural language processing (NLP), we can notice some resistance in the clinical and translational research community to adopt NLP models due to limited transparency, interpretability, and usability. In this study, we proposed an open natural language processing development framework. We evaluated it through the implementation of NLP algorithms for the National COVID Cohort Collaborative (N3C). Based on the interests in information extraction from COVID-19 related clinical notes, our work includes 1) an open data annotation process using COVID-19 signs and symptoms as the use case, 2) a community-driven ruleset composing platform, and 3) a synthetic text data generation workflow to generate texts for information extraction tasks without involving human subjects. The corpora were derived from texts from three different institutions (Mayo Clinic, University of Kentucky, University of Minnesota). The gold standard annotations were tested with a single institution's (Mayo) ruleset. This resulted in performances of 0.876, 0.706, and 0.694 in F-scores for Mayo, Minnesota, and Kentucky test datasets, respectively. The study as a consortium effort of the N3C NLP subgroup demonstrates the feasibility of creating a federated NLP algorithm development and benchmarking platform to enhance multi-institution clinical NLP study and adoption. Although we use COVID-19 as a use case in this effort, our framework is general enough to be applied to other domains of interest in clinical NLP.

cs.CL↗

Thickness-dependent spin bistable transitions in single-crystalline molecular 2D material

The advent of two-dimensional (2D) crystals has led to numerous scientific breakthroughs. Conventional 2D systems have in-plane covalent bonds and a weak out-of-plane van-der-Waals bond. Here we report a new type of 2D material composed of discrete magnetic molecules, where anisotropic van-der-Waals interactions bond the molecules into a 2D packing. Through mechanical exfoliation, we can obtain single-crystalline molecular monolayers, which can be readily integrated into other 2D systems. Optical spectroscopy suggests the few-layered molecules preserve the temperature-induced spin-crossover switching observed in the bulk form but show a drastic increase in thermal hysteresis unique to these thin 2D molecule assemblies. The trapping of spin bistability with decreasing layer number can arise from domain wall dynamics in reduced dimensions. Our results establish molecular solids with strong anisotropy of intermolecular interactions as precursors to a novel class of 2D materials, affording new possibilities to control functionalities through substrate and interlayer interactions.

cond-mat.mes-hall↗

Flavor Diagonal Nucleon Charges

This talk provides an update on the calculation of matrix elements of flavor diagonal axial, scalar and tensor quark bilinear operators between the nucleon ground state. The simulations are done using Wilson-clover fermions on a sea of eight 2+1+1-flavor HISQ ensembles generated by the MILC collaboration. We discuss the signal in the connected and disconnected contributions, calculation of the renormalization constants and mixing in the RI-sMOM scheme, and control over the simultaneous chiral-continuum-finite-volume fit used to extract the final charges.

hep-lat↗

Rare-earth-free noncollinear metallic ferrimagnets Mn4-xZxN with compensation at room temperature

Compensated ferrimagnets, like antiferromagnets, show no net magnetization but their transport and magneto-optic properties resemble those of ferromagnets, thereby creating opportunities for applications in high-frequency spintronics and low-energy loss communications. Here we study the modification the noncollinear ferrimagnetic spin structure of Mn4N by a variety of metallic substitutions Z (Z = Cu - Ge and Ag - Sn) to achieve compensation at room temperature. The noncollinear frustrated 2.35 Bohr magneton moments of Mn on 3c sites of the (111) kagome planes tilt about 20 degree out-of-plane in Mn4N and are easily influenced by the substitutions on 1a sites, leading to different efficiency of compensation in Mn4-xZxN that increases gradually from group 11 (Cu, Ag) to group 14 (Ge, Sn) with increasing number of valance electrons. Elements from the 5th period are more efficient for compensation than those from the 4th period due to lattice expansion. The manganese site moments are determined by Z, orbital hybridization, charge transfer and the tilt angle, analyzed by constrained density functional theory. The Ga compound with compensation at room temperature for x = 0.26 is recommended for high-frequency spintronic applications.

cond-mat.mtrl-sci↗

Loss-tolerant all-photonic quantum repeater with generalized Shor code

The all-photonic quantum repeater (APQR) is a promising repeater scheme to realize long-distance quantum communication. For a practical APQR, an indispensable requirement is the robustness of the repeater graph state (RGS) against photon loss. We propose a new loss-tolerant scheme by applying the generalized Shor code to RGS, which can be experimentally demonstrated with current technology. Experimentally, we first prepare and verify the nine-qubit Shor code. Then, by applying the generalized Shor code to APQR and preparing a simplified encoded RGS with the structure of $1\times2$ based on the Shor code state, the effectiveness of our loss-tolerant scheme and the loss tolerance of the encoded RGS are respectively verified. Our results make an essential step toward a practical APQR and enrich the research of quantum error correction code.

quant-ph↗

An Interpretable Neuro-Symbolic Reasoning Framework for Task-Oriented Dialogue Generation

We study the interpretability issue of task-oriented dialogue systems in this paper. Previously, most neural-based task-oriented dialogue systems employ an implicit reasoning strategy that makes the model predictions uninterpretable to humans. To obtain a transparent reasoning process, we introduce neuro-symbolic to perform explicit reasoning that justifies model decisions by reasoning chains. Since deriving reasoning chains requires multi-hop reasoning for task-oriented dialogues, existing neuro-symbolic approaches would induce error propagation due to the one-phase design. To overcome this, we propose a two-phase approach that consists of a hypothesis generator and a reasoner. We first obtain multiple hypotheses, i.e., potential operations to perform the desired task, through the hypothesis generator. Each hypothesis is then verified by the reasoner, and the valid one is selected to conduct the final prediction. The whole system is trained by exploiting raw textual dialogues without using any reasoning chain annotations. Experimental studies on two public benchmark datasets demonstrate that the proposed approach not only achieves better results, but also introduces an interpretable decision process.

cs.CL↗

CancerBERT: a BERT model for Extracting Breast Cancer Phenotypes from Electronic Health Records

Accurate extraction of breast cancer patients' phenotypes is important for clinical decision support and clinical research. Current models do not take full advantage of cancer domain-specific corpus, whether pre-training Bidirectional Encoder Representations from Transformer model on cancer-specific corpus could improve the performances of extracting breast cancer phenotypes from texts data remains to be explored. The objective of this study is to develop and evaluate the CancerBERT model for extracting breast cancer phenotypes from clinical texts in electronic health records. This data used in the study included 21,291 breast cancer patients diagnosed from 2010 to 2020, patients' clinical notes and pathology reports were collected from the University of Minnesota Clinical Data Repository (UMN). Results: About 3 million clinical notes and pathology reports in electronic health records for 21,291 breast cancer patients were collected to train the CancerBERT model. 200 pathology reports and 50 clinical notes of breast cancer patients that contain 9,685 sentences and 221,356 tokens were manually annotated by two annotators. 20% of the annotated data was used as a test set. Our CancerBERT model achieved the best performance with macro F1 scores equal to 0.876 (95% CI, 0.896-0.902) for exact match and 0.904 (95% CI, 0.896-0.902) for the lenient match. The NER models we developed would facilitate the automated information extraction from clinical texts to further help clinical decision support. Conclusions and Relevance: In this study, we focused on the breast cancer-related concepts extraction from EHR data and obtained a comprehensive annotated dataset that contains 7 types of breast cancer-related concepts. The CancerBERT model with customized vocabulary could significantly improve the performance for extracting breast cancer phenotypes from clinical texts.

cs.IR↗

Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning

The existing matrix completion methods focus on optimizing the relaxation of rank function such as nuclear norm, Schatten-p norm, etc. They usually need many iterations to converge. Moreover, only the low-rank property of matrices is utilized in most existing models and several methods that incorporate other knowledge are quite time-consuming in practice. To address these issues, we propose a novel non-convex surrogate that can be optimized by closed-form solutions, such that it empirically converges within dozens of iterations. Besides, the optimization is parameter-free and the convergence is proved. Compared with the relaxation of rank, the surrogate is motivated by optimizing an upper-bound of rank. We theoretically validate that it is equivalent to the existing matrix completion models. Besides the low-rank assumption, we intend to exploit the column-wise correlation for matrix completion, and thus an adaptive correlation learning, which is scaling-invariant, is developed. More importantly, after incorporating the correlation learning, the model can be still solved by closed-form solutions such that it still converges fast. Experiments show the effectiveness of the non-convex surrogate and adaptive correlation learning.

cs.LG↗

New criterions on nonexistence of periodic orbits of planar dynamical systems and their applications

Characterizing existence or not of periodic orbit is a classical problem and it has both theoretical importance and many real applications. Here, several new criterions on nonexistence of periodic orbits of the planar dynamical system $\dot x=y,~\dot y=-g(x)-f(x,y)y$ are obtained in this paper, and by examples showing that these criterions are applicable, but the known ones are invalid to them. Based on these criterions, we further characterize the local topological structures of its equilibrium, which also show that one of the classical results by A.F. Andreev [Amer. Math. Soc. Transl. 8 (1958), 183--207] on local topological classification of the degenerate equilibrium is incomplete. Finally, as another application of these results, we classify the global phase portraits of a planar differential system, which comes from the third question in the list of the 33 questions posed by A. Gasull and also from a mechanical oscillator under suitable restriction to its parameters.

math.DS↗

Bridge the Gap between Supervised and Unsupervised Learning for Fine-Grained Classification

Unsupervised learning technology has caught up with or even surpassed supervised learning technology in general object classification (GOC) and person re-identification (re-ID). However, it is found that the unsupervised learning of fine-grained visual classification (FGVC) is more challenging than GOC and person re-ID. In order to bridge the gap between unsupervised and supervised learning for FGVC, we investigate the essential factors (including feature extraction, clustering, and contrastive learning) for the performance gap between supervised and unsupervised FGVC. Furthermore, we propose a simple, effective, and practical method, termed as UFCL, to alleviate the gap. Three key issues are concerned and improved: First, we introduce a robust and powerful backbone, ResNet50-IBN, which has an ability of domain adaptation when we transfer ImageNet pre-trained models to FGVC tasks. Next, we propose to introduce HDBSCAN instead of DBSCAN to do clustering, which can generate better clusters for adjacent categories with fewer hyper-parameters. Finally, we propose a weighted feature agent and its updating mechanism to do contrastive learning by using the pseudo labels with inevitable noise, which can improve the optimization process of learning the parameters of the network. The effectiveness of our UFCL is verified on CUB-200-2011, Oxford-Flowers, Oxford-Pets, Stanford-Dogs, Stanford-Cars and FGVC-Aircraft datasets. Under the unsupervised FGVC setting, we achieve state-of-the-art results, and analyze the key factors and the important parameters to provide a practical guidance.

cs.CV↗

Spatial-temporal Conv-sequence Learning with Accident Encoding for Traffic Flow Prediction

In an intelligent transportation system, the key problem of traffic forecasting is how to extract periodic temporal dependencies and complex spatial correlations. Current state-of-the-art methods for predicting traffic flow are based on graph architectures and sequence learning models, but they do not fully exploit dynamic spatial-temporal information in the traffic system. Specifically, the temporal dependencies in the short-range are diluted by recurrent neural networks. Moreover, local spatial information is also ignored by existing sequence models, because their convolution operation uses global average pooling. Besides, accidents may occur during object transition, which will cause congestion in the real world and further decrease prediction accuracy. To overcome these challenges, we propose Spatial-Temporal Conv-sequence Learning (STCL), where a focused temporal block uses unidirectional convolution to capture short-term periodic temporal dependencies effectively, and a patial-temporal fusion module is responsible for extracting dependencies of interactions and decreasing the feature dimensions. Moreover, as the accidents features have an impact on local traffic congestion, we employ position encoding to detect anomalies in complex traffic situations. We have conducted a large number of experiments on real-world tasks and verified the effectiveness of our proposed method.

cs.LG↗

Loop induced top quark FCNC through top quark and dark matter interactions

We present a comprehensive analysis of the loop induced top quark FCNC signals at the LHC within one class of the simplified model. The loop level FCNC interactions are well motivated to avoid the hierarchy of the top quark couplings from the new physics and standard model. Such a theory will posit a Majorana dark matter candidate and could be tested through dark matter relic density, direct detection experiments (the scattering between dark matter and heavy nuclei), and the collider signals at the LHC. We find that the spin-independent (SI) scattering between Majorana dark matter and nuclei will vanish at the leading order, while the next-to-leading order correction to the SI scattering becomes significance to constrain the parameter space of the model. A detailed comparison from direct detection experiments and LHC searches is also discussed and both of them are very important to full constrain the model.

hep-ph↗

Intelligent Reflecting Surface for Multi-Path Beam Routing with Active/Passive Beam Splitting and Combining

Intelligent reflecting surface (IRS) can be densely deployed in wireless networks to significantly enhance the communication channels. In this letter, we consider the downlink transmission from a multi-antenna base station (BS) to a single-antenna user, by exploiting the cooperative passive beamforming (CPB) and line-of-sight (LoS) path diversity gains of multi-IRS signal reflection. Unlike existing works where only one single multi-IRS reflection path from the BS to user is selected, we propose a new and more general multi-path beam routing scheme. Specifically, the BS sends the user's information signal via multiple orthogonal active beams (termed as active beam splitting), which point towards different IRSs. Then, these beamed signals are subsequently reflected by selected IRSs via their CPB in different paths, and finally coherently combined at the user's receiver (thus named {\it \textbf{passive beam combining}}). For this scheme, we formulate a new multi-path beam routing design problem to jointly optimize the number of IRS reflection paths, the selected IRSs for each of the reflection paths, the active/passive beamforming at the BS/each selected IRS, as well as the BS's power allocation over different active beams, so as to maximize the received signal power at the user. To solve this challenging problem, we first derive the optimal BS/IRS beamforming and BS power allocation for a given set of reflection paths. The clique-based approach in graph theory is then applied to solve the remaining multi-path selection problem efficiently. Simulation results show that our proposed multi-path beam routing scheme significantly outperforms its conventional single-path beam routing special case.

cs.IT↗

FedOCR: Communication-Efficient Federated Learning for Scene Text Recognition

While scene text recognition techniques have been widely used in commercial applications, data privacy has rarely been taken into account by this research community. Most existing algorithms have assumed a set of shared or centralized training data. However, in practice, data may be distributed on different local devices that can not be centralized to share due to the privacy restrictions. In this paper, we study how to make use of decentralized datasets for training a robust scene text recognizer while keeping them stay on local devices. To the best of our knowledge, we propose the first framework leveraging federated learning for scene text recognition, which is trained with decentralized datasets collaboratively. Hence we name it FedOCR. To make FedCOR fairly suitable to be deployed on end devices, we make two improvements including using lightweight models and hashing techniques. We argue that both are crucial for FedOCR in terms of the communication efficiency of federated learning. The simulations on decentralized datasets show that the proposed FedOCR achieves competitive results to the models that are trained with centralized data, with fewer communication costs and higher-level privacy-preserving.

cs.CV↗

Intelligent Reflecting Surface-Aided Spectrum Sensing for Cognitive Radio

Spectrum sensing is a key enabling technique for cognitive radio (CR), which provides essential information on the spectrum availability. However, due to severe wireless channel fading and path loss, the primary user (PU) signals received at the CR or secondary user (SU) can be practically too weak for reliable detection. To tackle this issue, we consider in this letter a new intelligent reflecting surface (IRS)-aided spectrum sensing scheme for CR, by exploiting the large aperture and passive beamforming gains of IRS to boost the PU signal strength received at the SU to facilitate its spectrum sensing. Specifically, by dynamically changing the IRS reflection over time according to a given codebook, its reflected signal power varies substantially at the SU, which is utilized for opportunistic signal detection. Furthermore, we propose a weighted energy detection method by combining the received signal power values over different IRS reflections, which significantly improves the detection performance. Simulation results validate the performance gain of the proposed IRS-aided spectrum sensing scheme, as compared to different benchmark schemes.

cs.IT↗

A Survey on Channel Estimation and Practical Passive Beamforming Design for Intelligent Reflecting Surface Aided Wireless Communications

Intelligent reflecting surface (IRS) has emerged as a key enabling technology to realize smart and reconfigurable radio environment for wireless communications, by digitally controlling the signal reflection via a large number of passive reflecting elements in real-time. Different from conventional wireless communication techniques that only adapt to but have no or limited control over dynamic wireless channels, IRS provides a new and cost-effective means to combat the wireless channel impairments in a proactive manner. However, despite its great potential, IRS faces new and unique challenges in its efficient integration into wireless communication systems, especially its channel estimation and passive beamforming design under various practical hardware constraints. In this paper, we provide a comprehensive survey on the up-to-date research in IRS-aided wireless communications, with an emphasis on the promising solutions to tackle practical design issues. Furthermore, we discuss new and emerging IRS architectures and applications as well as their practical design problems to motivate future research.

cs.IT↗