Xiang Fu

Xiang Fu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
12 March 2023 in Electronics
Verified
Journal Article
Open access
PDF file
XFXiang Fu
Xiang Fu
ZYZemin Yuan
Zemin Yuan
TYTingjian Yu
Tingjian Yu
YGYun Ge
Yun Ge
This study sought to address the problem of the insufficient extraction of shallow object information and boundary information when using traditional FPN structures in current object detection algorithms, which degrades object detection accuracy. In this paper, a new FPN structure model, DA-FPN, is proposed. DA-FPN replaces the 1 × 1 convolution used in the conventional FPN structure for lateral connection with a 3 × 3 deformable convolution and adds a feature alignment module after the 2x downsampling operation used for lateral connection. This design allows the detection framework to extract more accurate information about the boundary of the object, particularly the boundary information of small objects. A bottom-up module was also added to incorporate the shallow information of the object more accurately into the high-level feature map, and a feature alignment module was added to the bottom-up module, thereby improving object detection accuracy. The experimental results show that DA-FPN can improve the accuracy of the single-stage object detection algorithms FoveaBox and GFL by 1.7% and 2.4%, respectively, on the MS-COCO dataset. This model was also found to improve the two-stage object detection algorithm SABL by 2.4% and offer higher small object detection accuracy and better robustness.

17 February 2026 in arXiv
Verified
Preprint
Open access
PDF file
XFXiang Fu
Xiang Fu
SMShiman Meng
Shiman Meng
WZWeiping Zhang
Weiping Zhang
LGLuanzheng Guo
Luanzheng Guo
KSKento Sato
Kento Sato
MSMartin Schulz
Martin Schulz
After all these years and all these other shared memory programming frameworks, OpenMP is still the most popular one. However, its greater levels of non-deterministic execution makes debugging and testing more challenging. The ability to record and deterministically replay the program execution is key to address this challenge. However, scalably replaying OpenMP programs is still an unresolved problem. In this paper, we propose two novel techniques that use Distributed Clock (DC) and Distributed Epoch (DE) recording schemes to eliminate excessive thread synchronization for OpenMP record and replay. Our evaluation on representative HPC applications with ReOMP, which we used to realize DC and DE recording, shows that our approach is 2-5x more efficient than traditional approaches that synchronize on every shared-memory access. Furthermore, we demonstrate that our approach can be easily combined with MPI-level replay tools to replay non-trivial MPI+OpenMP applications. We achieve this by integrating \toolname into ReMPI, an existing scalable MPI record-and-replay tool, with only a small MPI-scale-independent runtime overhead.

17 February 2026 in arXiv
Verified
Preprint
Open access
PDF file
XHXin Huang
Xin Huang
WZWeiping Zhang
Weiping Zhang
SMShiman Meng
Shiman Meng
WXWubiao Xu
Wubiao Xu
XFXiang Fu
Xiang Fu
KSKento Sato
Kento Sato
Checkpoint/Restart (C/R) saves the running state of the programs periodically, which consumes considerable system resources. We observe that not every piece of data is involved in the computation in typical HPC applications; such unused data should be excluded from checkpointing for better storage/compute efficiency. To find out, we propose a systematic approach that leverages automatic differentiation (AD) to scrutinize every element within variables (e.g., arrays) for checkpointing allowing us to identify critical/uncritical elements and eliminate uncritical elements from checkpointing. Specifically, we inspect every single element within a variable for checkpointing with an AD tool to determine whether the element has an impact on the application output or not. We empirically validate our approach with eight benchmarks from the NAS Parallel Benchmark (NPB) suite. We successfully visualize critical/uncritical elements/regions within a variable with respect to its impact (yes or no) on the application output. We find patterns/distributions of critical/uncritical elements/regions quite interesting and follow the physical formulation/logic of the algorithm.The evaluation on NPB benchmarks shows that our approach saves storage for checkpointing by up to 20%.