Meiwen Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Meiwen Li has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Qingtao Wu
School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, China
5 shared publications - Junlong Zhu
School of Information Engineering, Henan University of Science and Technology, Luoyang, China
4 shared publications - Lin Wang
School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, China
4 shared publications - Mingchuan Zhang
School of Information Engineering, Henan University of Science and Technology, Luoyang, China
3 shared publications - Ruijuan Zheng
School of Information Engineering, Henan University of Science and Technology, Luoyang, China
3 shared publications - Aoxiang Zhao1 shared publication
Latest Publications
- 18 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 351
GDAS-Merge: Grouped Differentiable Adaptive Search for multimodal model merging
- 18 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 351
GDAS-Merge: Grouped Differentiable Adaptive Search for multimodal model merging
- 10 March 2026
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 29 (2) , 66
Medical dynamic feature enhanced multimodal fusion for medical visual question answering
- 10 March 2026
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 29 (2) , 66
Medical dynamic feature enhanced multimodal fusion for medical visual question answering
- 24 February 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 119
DB-MLCNet: A dual-branch network for microbubble localization and counting in PFO assessment
- 24 February 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 119
DB-MLCNet: A dual-branch network for microbubble localization and counting in PFO assessment
- 11 March 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 276
A decentralized adaptive method with consensus step for non-convex non-concave min-max optimization problems
- 11 March 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 276
A decentralized adaptive method with consensus step for non-convex non-concave min-max optimization problems
- Open Access
- 5 March 2025
- Published by MDPI AG in Electronics
- Vol. 14 (5) , 1031
A Radical-Based Token Representation Method for Enhancing Chinese Pre-Trained Language Models
In the domain of natural language processing (NLP), a primary challenge pertains to the process of Chinese tokenization, which remains challenging due to the lack of explicit word boundaries in written Chinese. The existing tokenization methods often treat each Chinese character as an indivisible unit, neglecting the finer semantic features embedded in the characters, such as radicals. To tackle this issue, we propose a novel token representation method that integrates radical-based features into the process. The proposed method extends the vocabulary to include both radicals and original character tokens, enabling a more granular understanding of Chinese text. We also conduct experiments on seven datasets covering multiple Chinese natural language processing tasks. The results show that our method significantly improves model performance on downstream tasks. Specifically, the accuracy of BERT on the BQ Croups dataset was enhanced to 86.95%, showing an improvement of 1.65% over the baseline. Additionally, the BERT-wwm performance demonstrated a 1.28% enhancement, suggesting that the incorporation of fine-grained radical features offers a more efficacious solution for Chinese tokenization and paves the way for future research in Chinese text processing.
- 5 March 2025
- Published by MDPI AG in Electronics
- Vol. 14 (5) , 1031
Open AccessA Radical-Based Token Representation Method for Enhancing Chinese Pre-Trained Language Models
In the domain of natural language processing (NLP), a primary challenge pertains to the process of Chinese tokenization, which remains challenging due to the lack of explicit word boundaries in written Chinese. The existing tokenization methods often treat each Chinese character as an indivisible unit, neglecting the finer semantic features embedded in the characters, such as radicals. To tackle this issue, we propose a novel token representation method that integrates radical-based features into the process. The proposed method extends the vocabulary to include both radicals and original character tokens, enabling a more granular understanding of Chinese text. We also conduct experiments on seven datasets covering multiple Chinese natural language processing tasks. The results show that our method significantly improves model performance on downstream tasks. Specifically, the accuracy of BERT on the BQ Croups dataset was enhanced to 86.95%, showing an improvement of 1.65% over the baseline. Additionally, the BERT-wwm performance demonstrated a 1.28% enhancement, suggesting that the incorporation of fine-grained radical features offers a more efficacious solution for Chinese tokenization and paves the way for future research in Chinese text processing.
- Open Access
- 1 January 2018
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
A Computing Offloading Game for Mobile Devices and Edge Cloud Servers
Computing offloading of mobile devices (MDs) through cloud is a greatly effective way to solve the problem of local resource constraints. However, cloud servers are usually located far away from MDs leading to a long response time. To this end, edge cloud servers (ECSs) provide a shorter response time due to being closer to MDs. In this paper, we propose a computing offloading game for MDs and ECSs. We prove the existence of a Stackelberg equilibrium in the game. In addition, we propose two algorithms, F‐SGA and C‐SGA, for delay‐sensitive and compute‐intensive applications, respectively. Moreover, the response time is reduced by F‐SGA, which makes decisions quickly. An optimal decision is obtained by C‐SGA, which achieves the equilibrium. Both algorithms above proposed can adjust the computing resource and utility of system users according to parameters control in computing offloading. The simulation results show that the game significantly saves the computing resources and response time of both the MD and the ECSs during the computing offloading process.
- 1 January 2018
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
Open AccessA Computing Offloading Game for Mobile Devices and Edge Cloud Servers
Computing offloading of mobile devices (MDs) through cloud is a greatly effective way to solve the problem of local resource constraints. However, cloud servers are usually located far away from MDs leading to a long response time. To this end, edge cloud servers (ECSs) provide a shorter response time due to being closer to MDs. In this paper, we propose a computing offloading game for MDs and ECSs. We prove the existence of a Stackelberg equilibrium in the game. In addition, we propose two algorithms, F‐SGA and C‐SGA, for delay‐sensitive and compute‐intensive applications, respectively. Moreover, the response time is reduced by F‐SGA, which makes decisions quickly. An optimal decision is obtained by C‐SGA, which achieves the equilibrium. Both algorithms above proposed can adjust the computing resource and utility of system users according to parameters control in computing offloading. The simulation results show that the game significantly saves the computing resources and response time of both the MD and the ECSs during the computing offloading process.