Yao Liu

Dr. Yao Liu


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 February 2026 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
YLYe Liu
Ye Liu
HPHaoying Pang
Haoying Pang
YLYao Liu
Yao Liu
JQJiale Quan
Jiale Quan
LMLongyan Ma
Longyan Ma
WQWei Quan
Wei Quan
With the rapid development of quantum technology, the application of high-precision atomic sensors is becoming increasingly widespread, such as in the detection and navigation of human cardiac, magnetic, and brain magnetic fields.The magnetic shielding system is the foundation for ensuring its high-precision measurement. The study employed the finite element method to quantitatively analyze the variations in magnetic shielding effectiveness for different hole sizes. The effect of nanocrystalline magnetic noise in weak magnetic and rotational measurements is also analyzed, and the use of a transfer function combined with Allan variance is proposed to quantitatively assess the effect of nanocrystalline magnetic noise on the long-term stability of rotational measurements. Furthermore, experimental measurements of the nanocrystalline shielding were conducted under static direct-current (DC). Finally, the K-Rb-4He magnetometer and K-Rb-21Ne were built to perform in-situ magnetic noise testing on the inner layer nanocrystalline magnetic shielding. The shielding effect, magnetic noise level, and long-term stability of inertial measurement were compared between nanocrystallines and ferrites as the innermost layer of magnetic shielding. The final results show that the nanocrystalline alloy as the innermost magnetic shield reduces the magnetic noise by 32.3% and the magnetic noise equivalent long-term rotational error by 45.9% at a smaller volume compared to ferrite.

23 May 2024 in Electronics
Verified
Journal Article
Open access
PDF file
YLYao Liu
Yao Liu
YLYe Liu
Ye Liu
Entity alignment (EA) is a critical task in integrating diverse knowledge graph (KG) data and plays a central role in data-driven AI applications. Traditional EA approaches rely on entity embeddings, but their effectiveness is limited by scarce KG input data and representation learning techniques. Large language models have shown promise, but face challenges such as high hardware requirements, large model sizes and computational inefficiency, which limit their applicability. To overcome these limitations, we propose an entity-alignment model that compares the similarity between entities by capturing both semantic and topological information to enable the alignment of entities with high similarity. First, we analyze descriptive information to quantify semantic similarity, including individual features such as types and attributes. Then, for topological analysis, we introduce four conditions based on graph connectivity and structural patterns to determine subgraph similarity within three hops of the entity’s neighborhood, thereby improving accuracy. Finally, we integrate semantic and topological similarity using a weighted approach that considers dataset features. Our model requires no pre-training and is designed to be compact and generalizable to different datasets. Experimental results on four standard EA datasets validate the effectiveness of our proposed model.


9 June 2026 in Journal of Chemical Information and Modeling
Verified
Journal Article
Closed access
YLYao Liu
Yao Liu
YZYifei Zhou
Yifei Zhou
XWXin Wang
Xin Wang
LZLei Zhao
Lei Zhao

8 January 2025 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
YLYao Liu
Yao Liu
YZYongfei Zhang
Yongfei Zhang
With the increasing amount of data in various domains, knowledge graphs (KGs) have become powerful tools for representing complex and heterogeneous information in a structured way, and for extracting valuable information from knowledge graphs through embedding techniques to support downstream tasks such as recommendation and Q&A systems. Knowledge graphs consist of triples that are continuously added as knowledge is updated. However, most existing embedding models are designed for static graphs, requiring the entire model to be retrained for each update, which is time-consuming. Existing global dynamic embedding models focus on exploiting the structural and relational information of the whole graph to achieve embedding quality, resulting in reduced dynamic efficiency. To address this problem, we propose a relational clustering-based parallel space model in which knowledge from different domains is embedded in different subspaces, allowing each subspace to focus on the data characteristics of a specific domain, thereby improving the quality of knowledge. Second, the new data only affects some subspaces but not the performance of other spaces, improving the model's adaptability to dynamics. Furthermore, we employ two incremental approaches based on the type of added data to improve the efficiency of dynamic embedding while ensuring that the added data preserves the characteristics of the parallel space. The experimental results show that the dynamic embedding efficiency of our model is improved by an average of 50.3% compared to the SOTA dynamic embedding model for the link prediction task. Particularly on FB15K, our model not only improves the efficiency by 41% but also increases the accuracy by 7.5%, demonstrating the accuracy and efficiency of our model.

15 October 2026 in Electronics
Verified
Journal Article
Open access
PDF file
HYHangyuan Yang
Hangyuan Yang
YZYongfei Zhang
Yongfei Zhang
SCSiyu Chen
Siyu Chen
YLYao Liu
Yao Liu
XWXin Wang
Xin Wang
Normalization narrows visual domain gaps but moves discriminative cues into its residual. Many normalization-residual decomposition methods for domain generalization (DG) and unsupervised domain adaptation (UDA) rely primarily on channel-wise modeling, while existing spatial-channel variants treat spatial and channel cues independently, and symmetric losses judge recovery only against the normalized feature, possibly less discriminative than the original. We propose Interaction-Calibrated Attention-Based Asymmetric Feature Decomposition and Recovery (ICAA). Its Interaction-Calibrated Attention-Based Feature Decomposition and Recovery (IAFDR) module uses Spatial-Channel Interactive Calibration to jointly calibrate spatial and channel evidence and selectively recover task-relevant information from normalization residuals, and an explicit correspondence between convolutional networks and vision transformers extends it to patch tokens. The Asymmetric Task-relevant Feature Decomposition loss encourages recovered features to be more certain than original ones and their complements less certain than normalized ones. ICAA improves every evaluated host across classification, segmentation, and detection: DAEL by 3.9/5.4 percentage points (pp) to 87.3%/71.5% on PACS/Office-Home (1.4/2.2 pp above the best CNN competitor), M3SDA by 9.8 pp to 52.4% on DomainNet, CSFDA by 3.1/4.1 pp to 55.7%/48.7% mIoU on GTA5/SYNTHIA→Cityscapes, and Faster R-CNN by 4.9 pp to 23.7% mAP on Foggy Cityscapes.