Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xinliang Wu

dblp:00/4153 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
6since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Language models and text generation · 56% Representation and self-supervised learning · 44%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model training
domain-adaptive pre-training
0.712023
Tele-Knowledge Pre-training for Fault Analysis · ICDE 2023
Machine learning › Representation and self-supervised learning
pre-training
0.712023
Tele-Knowledge Pre-training for Fault Analysis · ICDE 2023
Knowledge graphs
knowledge graph construction
0.712023
Tele-Knowledge Pre-training for Fault Analysis · ICDE 2023
Natural language and speech › Language models and text generation › large language model › knowledge in language models
knowledge injection
0.212023
Tele-Knowledge Pre-training for Fault Analysis · ICDE 2023
Compilers and program optimization
loop transformation
0.112008
Power-Aware Code Restructuring for Embedded Parallel Storing Device · PerCom 2008
Embedded and real-time systems
embedded storage
0.012008
Power-Aware Code Restructuring for Embedded Parallel Storing Device · PerCom 2008

Methods — techniques the papers use, named apart from their topics

prompt hints · 1.3adaptive numerical encoding · 1.3static analysis · 0.2
YearPublicationVenuePosition
2025 A Role-based Hierarchical Adaptive Routing Protocol for Clustered UAV Swarms
abstract
Flying Ad Hoc Networks (FANETs) are self-organizing wireless networks composed of Unmanned Aerial Vehicles (UAVs), designed to enable collaborative tasks without relying on fixed infrastructure. Characterized by high mobility, dynamic topology, and three-dimensional spatial movement, FANETs pose critical challenges to routing protocols, particularly to the broadcast storm problem caused by uncontrolled flooding in large-scale deployments. To address the challenges of broadcast storms in FANETs, this paper proposes RHARP, a role-based hierarchical routing protocol for FANETs. RHARP innovatively integrates bio-inspired swarm communication principles with role-based network clustering, establishing functional correspondence between decentralized coordination in biological swarms and differentiated node roles in FANETs. Through functional decoupling, RHARP delegates intra-cluster routing decisions to gateway nodes to alleviate cluster head (CH) workload. It achieves dynamic inter-cluster communication optimization through hierarchical routing strategies and on-demand path discovery mechanisms. By systematically integrating role-based clustering with adaptive routing, RHARP provides a scalable and cost-effective communication framework for large-scale FANET deployments while maintaining protocol agility. The simulation results demonstrate the effectiveness of RHARP across various dynamic scenarios.
Tianen Guan, Xinliang Wu, Zhongliang Zhao, Wenbing Tang 0001, Yang Liu 0003
VTC2025-Fall3
2024 Ensemble based fully convolutional transformer network for time series classification
Yilin Dong 0001, Yuzhuo Xu, Rigui Zhou, Changming Zhu, Jin Liu 0009, Jiamin Song, Xinliang Wu
Appl. Intell.7
2024 Self-attention empowered graph convolutional network for structure learning and node embedding
Mengying Jiang, Guizhong Liu, Yuanchao Su, Xinliang Wu
Pattern Recognit.4
2023 Tele-Knowledge Pre-training for Fault Analysis
abstract
In this work, we share our experience on tele-knowledge pre-training for fault analysis, a crucial task in telecommunication applications that requires a wide range of knowledge normally found in both machine log data and product documents. To organize this knowledge from experts uniformly, we propose to create a Tele-KG (tele-knowledge graph). Using this valuable data, we further propose a tele-domain language pre-training model TeleBERT and its knowledge-enhanced version, a tele-knowledge re-training model KTeleBERT. which includes effective prompt hints, adaptive numerical data encoding, and two knowledge injection paradigms. Concretely, our proposal includes two stages: first, pre-training TeleBERT on 20 million tele-related corpora, and then re-training it on 1 million causal and machine-related corpora to obtain KTeleBERT. Our evaluation on multiple tasks related to fault analysis in tele-applications, including root-cause analysis, event association prediction, and fault chain tracing, shows that pretraining a language model with tele-domain data is beneficial for downstream tasks. Moreover, the KTeleBERT re-training further improves the performance of task models, highlighting the effectiveness of incorporating diverse tele-knowledge into the model.
Zhuo Chen 0007, Wen Zhang 0015, Mingyang Chen 0002, Yuxia Geng, Zhen Bi, Yichi Zhang 0009, Zhen Yao 0001, Wenting Song, Xinliang Wu, Zhaoyang Lian, Lei Cheng 0005, Huajun Chen
ICDE11
2023 Hybrid-driven Gaussian process online learning for highly maneuvering multi-target tracking
abstract
The performance of existing maneuvering target tracking methods for highly maneuvering targets in cluttered environments is unsatisfactory. This paper proposes a hybrid-driven approach for tracking multiple highly maneuvering targets, leveraging the advantages of both data-driven and model-based algorithms. The time-varying constant velocity model is integrated into the Gaussian process (GP) of online learning to improve the performance of GP prediction. This integration is further combined with a generalized probabilistic data association algorithm to realize multi-target tracking. Through the simulations, it has been demonstrated that the hybrid-driven approach exhibits significant performance improvements in comparison with widely used algorithms such as the interactive multi-model method and the data-driven GP motion tracker.
Qiang Guo 0009, Long Teng 0004, Tianxiang Yin, Xinliang Wu, Wenming Song
Frontiers Inf. Technol. Electron. Eng.5
2022 Generalized labeled multi-Bernoulli filter with signal features of unknown emitters
abstract
A novel algorithm that combines the generalized labeled multi-Bernoulli (GLMB) filter with signal features of the unknown emitter is proposed in this paper. In complex electromagnetic environments, emitter features (EFs) are often unknown and time-varying. Aiming at the unknown feature problem, we propose a method for identifying EFs based on dynamic clustering of data fields. Because EFs are time-varying and the probability distribution is unknown, an improved fuzzy C-means algorithm is proposed to calculate the correlation coefficients between the target and measurements, to approximate the EF likelihood function. On this basis, the EF likelihood function is integrated into the recursive GLMB filter process to obtain the new prediction and update equations. Simulation results show that the proposed method can improve the tracking performance of multiple targets, especially in heavy clutter environments.
Qiang Guo 0009, Long Teng 0004, Xinliang Wu, Wenming Song, Dayu Huang
Frontiers Inf. Technol. Electron. Eng.3
2008 Power-Aware Code Restructuring for Embedded Parallel Storing Device
abstract
In order to cope with the energy challenge emerging with the process of parallelism in embedded storing device, this paper focuses on the static code restructuring of nested loop array accessing related to storing device. Departing the running time of different devices can extend the duration time when it is in low- power state. Experiment shows that power-aware code restructuring can effectively reduce state switching times and extra power wasted. Static method described in this paper can achieve up to 12% power reduction if it cooperates with proper dynamic method.
Bin Xie 0002, Qingsong Shi, Liangliang Tong, Jiangwei Huang, Xinliang Wu, Tianzhou Chen
PerCom5