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

Zhangyong Li

dblp:142/9558 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
5since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 5 · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 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.

Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › insertion-deletion codes
burst deletion/insertion correction
0.912025
Correcting Burst Deletion/Insertion and Random Substitution Errors With Stacking Codes in Non-Binary Segmented Burst Deletion/Insertion Channels · IEEE Trans. Commun. 2025
Coding theory
error-correcting codes
0.912025
Correcting Burst Deletion/Insertion and Random Substitution Errors With Stacking Codes in Non-Binary Segmented Burst Deletion/Insertion Channels · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes
insertion-deletion codes
0.912025
Correcting Burst Deletion/Insertion and Random Substitution Errors With Stacking Codes in Non-Binary Segmented Burst Deletion/Insertion Channels · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes
reed-muller codes
0.912025
Correcting Burst Deletion/Insertion and Random Substitution Errors With Stacking Codes in Non-Binary Segmented Burst Deletion/Insertion Channels · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes
reed-solomon codes
0.312025
Correcting Burst Deletion/Insertion and Random Substitution Errors With Stacking Codes in Non-Binary Segmented Burst Deletion/Insertion Channels · IEEE Trans. Commun. 2025

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

stacking codes · 0.9decoding algorithm · 0.9
YearPublicationVenuePosition
2026 Guided feature learning network focusing on spatial and frequency domains for real-time small object detection
Huiqian Wang, Zhangyong Li, En Mou, Tiecheng Song, Guanjie Zeng
Eng. Appl. Artif. Intell.3
2026 DABF-Net : Dynamic adaptive basis fusion network for breast ultrasound image segmentation
Bowen Peng, En Mou, Jiashun Mao, Zhangyong Li, Kangle Yong, Biao Qu, Yamei Luo
Expert Syst. Appl.7
2026 A Lightweight UAV Object Detector Based on Optimized YOLOv8 Fused With an Auxiliary Learning Branch for AIoT
abstract
In Artificial Intelligence of Things (AIoT)-enabled edge sensing systems, unmanned aerial vehicles have emerged as the dominant low-altitude monitoring platform owing to their wide-area coverage. However, in large-scale surveillance scenarios, sensor limitations and the inherent difficulty in preserving discriminative features for tiny targets hinder robust small object detection. Therefore, we propose the MSFR-DEF-YOLO framework, which combines densely efficient flow YOLO (DEF-YOLO) with multi-scale feature reconstruction (MSFR) auxiliary branches. We first enhance fine-grained feature extraction by optimizing the network structure and integrating an efficient downsampling module (EDM). Next, a dynamic dense feature pyramid (DDFP) is designed to incorporate dense cross-layer connections and bidirectional feature flows, enhancing multi-scale context consistency. Additionally, the introduction of the MSFR auxiliary branch integrates shallow and deep features from the backbone network, enabling feature reconstruction and information compensation, thereby further improving small object detection capabilities. To verify the improvements, we tested a range of network configurations on different YOLO versions. Our model outperforms other versions in the YOLO series. Moreover, on four public datasets, MSFR-DEF-YOLO achieves mAP50 improvements of 8.8%, 6.9%, 1.8%, and 6% compared to YOLOv8n, all while using only 20% of the parameters of YOLOv8n. To further reduce the computational overhead, this paper proposes a lightweight MSFR-L-YOLO model that utilizes a unidirectional path neck design. Compared to MSFR-DEF-YOLO, this model reduces the number of parameters by 15% while maintaining high efficiency, thereby reducing computational requirements and achieving comparable accuracy. This provides an efficient solution for AIoT-enabled airborne sensing systems.
Huiqian Wang, Zhangyong Li, En Mou, Tiecheng Song, Shuai Xia
IEEE Internet Things J.3
2025 Correcting Burst Deletion/Insertion and Random Substitution Errors With Stacking Codes in Non-Binary Segmented Burst Deletion/Insertion Channels
abstract
In this paper, we propose stacking codes and decoding algorithms to correct burst deletion/insertion and random substitution errors in a non-binary segment-Lmaxburst-Ddeletion and maxburst-Sinsertion (NB-SBDI(L,D,S)) channel without knowing the codeword boundaries. Specifically, in the NB-SBDI(L,D,S) channel, at most a single non-binary burst (a block of consecutive bits/symbols) of deletions or insertions of length up toDorS, respectively, exists in a block ofLconsecutive non-binary symbols. The proposed stacking-codes are constructed by stacking multiple Reed-Muller(RM)/modified BCH/modified binary representation of Reed-Solomon (BRRS) codes, respectively, and no marker codes are involved. We show that, in the NB-SBDI(L,D,S) channel, the proposed approach can not only correct both burst deletions/insertions and random substitution errors, but also achieve error-free decoding for stacking-RM/modified stacking-BCH/modified stacking-BRRS codes for burst deletions/insertions as long as no substitution errors exist. Also, the modified stacking-BRRS code is more rate efficient than the existing Song code [1], the stacking-RM/modified stacking-BCH codes are more rate efficient than the Song code if max(D,S) and code length are small.
Yong Li 0023, Peng Xu 0002, Jihua Zhou, Zhangyong Li
IEEE Trans. Commun.6
2023 Resource Scheduling Based on Multi-Factor Priority for High Performance Requirements in WBANs
abstract
Media access control (MAC) plays a pivotal role in ensuring proper operation in wireless body area networks (WBAN). However, current solutions still cannot satisfy high performance requirements of low latency and energy efficiency for emergency data reporting. In this article, we propose a Multi- Factor Emergency Scheduling Scheme (MESS) for meeting such a strict demand. First, we design a Data Classification method including periodic data and emergency data. Unlike consistent data characteristics in other schemes, data heterogeneity is considered in our solution, which is more practical for different nodes. Second, we carefully devise a Multi-Factor Priority Division Scheme according to the Disease-Related Factor, Critical Degree Factor, Health Severity Factor and Age of Information Factor. This is more comprehensive consideration of the key characteristics of the node. In addition, we design a Dynamic Slot Allocation and Sequencing Approach, in which time slots of nodes are allocated based on the Data Classification and Multi-Factor Priority-Based Ordering. This enhances low latency and guarantees energy efficiency of nodes, and short waiting time of emergency data. Extensive simulations exhibit the advantages of MESS in terms of delay and energy efficiency.
Jinzhao Lin, Zhangyong Li
GLOBECOM3
2019 A lightweight method of data encryption in BANs using electrocardiogram signal
Tong Bai, Jinzhao Lin, Guoquan Li 0001, Huiqian Wang, Peng Ran, Zhangyong Li, Wei Wu 0002, Gwanggil Jeon
Future Gener. Comput. Syst.6
2019 An optimized protocol for QoS and energy efficiency on wireless body area networks
Tong Bai, Jinzhao Lin, Guoquan Li 0001, Huiqian Wang, Peng Ran, Zhangyong Li, Wei Wu 0002, Gwanggil Jeon
Peer-to-Peer Netw. Appl.6
2018 Protocol with self-adaptive GB for BANs
abstract
Body area networks (BANs) are systems of wearable computing devices for long‐term monitoring of personal health care. BAN is an emerging technology for the worldwide ageing population. In the BAN system, the transceiver is the most energy‐consuming part of a sensor node and radio transmission in the vicinity of the human body is highly lossy and inefficient. Therefore, the energy of the sensor node constraints the life cycle and quality of service of the network; consequently, low‐cost protocol shaves attracted wide interest. This study proposes a frame structure model of a self‐adaptive guard band protocol, which introduces a GB in each time slot according to the allowed maximum time drift of the crystal, adaptively adjusts the value of the GB based on the actual time drift, and then ensures that the node simultaneously maintains the sleeping state and synchronisation with the coordinator during beacon transmission, thus reducing the energy consumption.
Tong Bai, Jinzhao Lin, Guoquan Li 0001, Zhangyong Li, Huiqian Wang, Zeljko Zilic
IET Commun.5