Shiqiang Nie

Dr. Shiqiang Nie


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
4 September 2024 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ZLZhike Li
Zhike Li
YWYong Wang
Yong Wang
SNShiqiang Nie
Shiqiang Nie
JWJinyu Wang
Jinyu Wang
CZChi Zhang
Chi Zhang
WWWeiguo Wu
Weiguo Wu

24 October 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BLBo Lan
Bo Lan
Fei WangFei Wang
Fei Wang
LXLekun Xia
Lekun Xia
FNFan Nai
Fan Nai
SNShiqiang Nie
Shiqiang Nie
Jinsong HanJinsong Han
Jinsong Han
More than 246 million children and adolescents suffer from school violence and bullying, e.g., verbal harassment, social harassment, and physical bullying, every year, according to a report from the United Nations Educational, Scientific and Cultural Organization. School violence and bullying severely harm the physical and emotional well-being of the victims, increasing the risks of depression, anxiety, sleep difficulties, lower academic achievement, dropping out of school, and even suicide attempts. Since school physical bullying always happens in the blind spots of surveillance cameras, in this paper, we propose to utilize Wi-Fi, a widely deployed infrastructure, to detect school physical bullying. We design residual wavelet Transformer networks to conduct noise removal and action feature learning in an end-to-end manner. Besides, we propose two data augmentation methods in the temporal domain of Wi-Fi signals to simulate the different speeds and extents of bullying actions performed. Extensive evaluation of 20-paired volunteers demonstrates that (1) Wi-Fi can effectively detect physical school bullying. (2) The proposed approaches outperform Long-Short-Time-Memory networks, ResNet-1D, ViT, etc. (3) The proposed data augmentation methods can work as plug-and-play modules to improve the detection accuracy of all the above-mentioned approaches.

18 June 2025 in Journal of Systems Architecture
Verified
Journal Article
Closed access
SNShiqiang Nie
Shiqiang Nie
CZChi Zhang
Chi Zhang
MLMenghan Li
Menghan Li
FYFangxing Yu
Fangxing Yu
YLYaming Li
Yaming Li
WWWeiguo Wu
Weiguo Wu

25 March 2023 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
CZChi Zhang
Chi Zhang
SNShiqiang Nie
Shiqiang Nie
JWJinyu Wang
Jinyu Wang
SLSong Liu
Song Liu
WWWeiguo Wu
Weiguo Wu

11 January 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CZChi Zhang
Chi Zhang
FYFangxing Yu
Fangxing Yu
SNShiqiang Nie
Shiqiang Nie
WTWei Tang
Wei Tang
FLFei Liu
Fei Liu
WWWeiguo Wu
Weiguo Wu
The explosive growth of massive data makes shingled magnetic recording (SMR) disks a promising candidate for balancing capacity and cost. SMR disks are typically configured with a persistent buffer to reduce the read–modify–write (RMW) overhead introduced by non-sequential writes. Traditional SMR zones-based persistent buffers are subject to sequential-write constraints, and frequent cleanups cause disk performance degradation. Conventional magnetic recording (CMR) zones with in-place update capabilities enable less frequent cleanups and are gradually being used to construct persistent buffers in certain SMR disks. However, existing CMR zones-based persistent buffer designs fail to accurately capture hot blocks with long update periods and are limited by an inflexible data layout, resulting in inefficient cleanups. To address the above issues, we propose a strategy called Amphisbaena. First, a two-phase data block classification method is proposed to capture frequently updated blocks. Then, a locality-aware buffer space management scheme is developed to dynamically manage blocks with different update frequencies. Finally, a latency-sensitive garbage collection policy based on the above is designed to mitigate the impact of cleanup on user requests. Experimental results show that Amphisbaena reduces latency by an average of 29.9% and the number of RMWs by an average of 37% compared to current state-of-the-art strategies.

9 May 2025 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
SNShiqiang Nie
Shiqiang Nie
ZLZhike Li
Zhike Li
FYFangxing Yu
Fangxing Yu
SLSong Liu
Song Liu
WWWeiguo Wu
Weiguo Wu
While low-density parity-check code has been adopted in 3-D flash for improving chip reliability, it suffers from severe read latency due to the increasing number of read retries. Recent studies propose read-level recording to mitigate the performance loss from failed read retries. However, existing schemes induce large updating overhead and achieve suboptimal results, making it critical to develop better tradeoffs among storage overhead, process variation, and performance improvement. In this article, we propose AR$^{2}$, an adaptive read-level recording scheme to improve read performance for 3-D NOT AND (NAND) flash. It consists of two designs: AR$^{2}$-win and AR$^{2}$-pre. AR$^{2}$-win records the number of read levels that fit the majority of the last $N$ reads, which prevents the worst page from dominating the read level recording. AR$^{2}$-pre predicts the number of read levels for the next read based on the recorded one and a simple machine learning model, which prevents using stale recorded levels in large-capacity solid-state drives (SSDs). Our experimental results show that AR$^{2}$ significantly improves the read performance for 3-D NAND flash and achieves on average 15% or more read latency reduction over the state-of-the-art.