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

Xi Fu

dblp:158/4785 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
8since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

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

TopicWeightPapersLastEvidence papers
Smart cities and intelligent transportation
logistics
0.712023
Filling Delivery Time Automatically Based on Couriers' Trajectories · IEEE Trans. Knowl. Data Eng. 2023
Data mining
spatiotemporal data mining
0.712023
Filling Delivery Time Automatically Based on Couriers' Trajectories · IEEE Trans. Knowl. Data Eng. 2023
Data mining › spatiotemporal data mining
trajectory data mining
0.712023
Filling Delivery Time Automatically Based on Couriers' Trajectories · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Deep learning architectures and training › attention mechanism › attention network
pointer network
0.212023
Filling Delivery Time Automatically Based on Couriers' Trajectories · IEEE Trans. Knowl. Data Eng. 2023

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

trajectory mining · 2.0stay point extraction · 2.0pointer network · 2.0
YearPublicationVenuePosition
2026 EEG-to-gait decoding via phase-aware representation learning
abstract
Accurate decoding of lower-limb motion from EEG signals is essential for advancing brain-computer interface (BCI) applications in movement intent recognition and control. This study presents NeuroDyGait, a two-stage, phase-aware EEG-to-gait decoding framework that explicitly models temporal continuity and domain relationships. To address challenges of causal, phase-consistent prediction and cross-subject variability, Stage I learns semantically aligned EEG-motion embeddings via relative contrastive learning with a cross-attention-based metric, while Stage II performs domain relation-aware decoding through dynamic fusion of session-specific heads. Comprehensive experiments on two benchmark datasets (GED and FMD) show substantial gains over baselines, including a recent 2025 model EEG2GAIT. The framework generalizes to unseen subjects and maintains inference latency below 5 ms per window, satisfying real-time BCI requirements. Visualization of learned attention and phase-specific cortical saliency maps further reveals interpretable neural correlates of gait phases. Future extensions will target rehabilitation populations and multimodal integration.
Xi Fu, Wei-Bang Jiang, Rui Liu 0034, Gernot R. Müller-Putz, Cuntai Guan
Neural Networks1
2026 MARINE-Transformer: A General-purpose framework for multivariate ocean time series analysis
Hao Wang 0260, Xiang Li 0064, Xi Fu, Meihong Yang, Yinglong Wang 0001, Prayag Tiwari
Neural Networks3
2025 A D-Band CMOS Transceiver Chipset Supporting 640Gb/s Date Rate with 4?4 Line-of-Sight MIMO
abstract
A D-band (114--170GHz) CMOS transceiver (TRX) chipset covering a 56GHz signal-chain bandwidth with a 640-Gb/s data rate is proposed in this work. The design includes an 8-way low-Q power-combined power amplifier (PA), a 2-way low-Q power-combined low noise amplifier (LNA), wideband-impedance-transformation mixers, and common-source-based cascaded distributed amplifiers (DA) to improve bandwidth and linearity. The proposed TRX chipset achieves a 200Gb/s SISO data rate and a 640Gb/s MIMO data rate.
Chenxin Liu, Zheng Li 0021, Yudai Yamazaki, Hans Herdian, Anyi Tian, Jun Sakamaki, Xi Fu, Sena Kato, Hongye Huang, Shinsuke Hara, Akifumi Kasamatsu, Hiroyuki Sakai 0009, Kazuaki Kunihiro, Atsushi Shirane, Kenichi Okada 0001
ASP-DAC9
2025 Attention-Enhanced 3D Craniomaxillofacial Anatomical Landmark Detection Based on Projection
Yuyou Zhong, Xi Fu, Ruilin Zhao, Feng Niu, JunJun Pan
CGI (2)4
2025 A Dynamic Ensemble and Replaying Model for Online Marine Sensor Data Prediction
Xiang Li 0064, Xi Fu, Congqi Lin, Hao Wang 0260, Meihong Yang, Yinglong Wang 0001
ECML/PKDD (8)2
2025 Ocean-Llama: A Self-supervised Pre-trained Deep Learning Model for Ocean Observation Data
Hao Wang 0260, Xiang Li 0064, Xi Fu, Liting Geng
PRCV (4)3
2023 Filling Delivery Time Automatically Based on Couriers' Trajectories
abstract
Nowadays, couriers are still the main solution to address the "last mile" problem in logistics. They are usually required to record the delivery time of each parcel manually, which is essential for delivery insurances, delivery performance evaluations, and customer available time discovery. Stay points extracted from couriers' trajectories provide a chance to fill the delivery time automatically to ease their burdens. However, it is challenging due to inaccurate delivery locations and various stay scenarios. To this end, we propose the improved Delivery Time Inference (DTInf+), to infer the delivery time of waybills based on couriers' trajectories. Our solution is composed of three steps: 1) Data Pre-processing, which organizes waybills and stay points by delivery trips, 2) Delivery Location Mining, which obtains the delivery location for each address and each Geocoded waybill location by mining historical delivery caused stay points, and 3) Delivery Event-based Matching, which jointly selects the best-matched stay point for waybills at the same delivery location based on Pointer Network-like model SPSelector to infer the delivery time. Extensive experiments and case studies based on real-world datasets from JD Logistics confirm the effectiveness of our approach. Finally, a system powered by DTInf+ is deployed in JD Logistics.
Sijie Ruan, Xi Fu, Cheng Long 0001, Zi Xiong, Jie Bao 0003, Yiheng Chen, Yu Zheng 0004
IEEE Trans. Knowl. Data Eng.2
2022 MATN: Multi-model Attention Network for Gait Prediction from EEG
abstract
Predicting gait trajectories from electroencephalography (EEG) is useful for lower limb rehabilitation. The temporal dynamics of EEG pertaining to individual subjects while they are walking require a personalized treatment inside the deep neural network. Also, the EEG data collected from different sessions or days may exhibit varied distributions, further hindering the model generality. Therefore, we propose the Multi-model ATtention Network (MATN) to address these issues. MATN exploits the self-attention mechanism on the spatio-temporal EEG encoding to learn the subject-specific temporal dynamics. To adapt to varied data distributions, MATN employs knowledge distillation, which includes a teacher and student model. The latter is supervised by the intermediate feature maps from the trained teacher and the labels. Experiments of the regression of bilateral joint angles on the legs (hip, knee, and ankle) are carried out using the MoBI dataset in a subject-specific manner. Our MATN achieves more than 18% improvement on the Pearson's correlation coefficient compared to five other state-of-the-art methods.
Xi Fu, Cuntai Guan
IJCNN1
2016 Partially Decompressing Binary Interpolative Coding for Fast Query Processing
Xi Fu, Peng Li 0021, Rui Li 0022, Bin Wang 0004
WISE (2)1
2014 Robust 1-bit compressive sensing against sign flips
abstract
In this paper, we introduce a new robust 1-bit compressive sensing reconstruction algorithm in the noisy environment, where a lot of signs are flipped. By calculating the number of inconsistencies, this algorithm can adaptively detect the positions where sign flips occur. Subsequently, the sparse signals can be recovered by using "corrected" measurements without a priori knowledge of the noise level. Numerical experiments show the high performance of signal recovery for the proposed algorithm in the presence of both measurement noise and transmission noise.
Xi Fu, Fang-Ming Han, Hongxing Zou
GLOBECOM1