Sicheng Zhu
Sicheng Zhu has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Fangyun Dong
China Electric Power Research Institute
1 shared publication - Hui Zhang
China Electric Power Research Institute
1 shared publication - Huixia Ding
China Electric Power Research Institute, Beijing 100192, China
1 shared publication - Jingyi Tang
Shanghai University,School of Computer Engineering and Science,Shanghai,China,200444
1 shared publication - Ling Teng
China Electric Power Research Institute Beijing China
1 shared publication - Sachula Meng
Information & Communication Department, China Electric Power Research Institute, Beijing 100192, China
1 shared publication
Latest Publications
- 25 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Assessing Word Difficulty: A Mapping Method
This paper presents a word difficulty mapping method that utilizes three indicators: Average Number of Times, Word Frequency Score, and Word Difficulty Score, to map the difficulty of words. The effectiveness of this method is demonstrated using the EERIE as a case study. To predict the Average Number of Times, a Refined Simulated Annealing Model, which combines K-Dimension Tree, is employed. Subsequently, word difficulty is mapped using K-Means cluster analysis. The results indicate a strong correlation between the Average Number of Times, Frequency Score of The Word, Difficulty Score of The Word and word difficulty, highlighting the efficacy of the proposed word difficulty mapping method.
- 25 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Assessing Word Difficulty: A Mapping Method
This paper presents a word difficulty mapping method that utilizes three indicators: Average Number of Times, Word Frequency Score, and Word Difficulty Score, to map the difficulty of words. The effectiveness of this method is demonstrated using the EERIE as a case study. To predict the Average Number of Times, a Refined Simulated Annealing Model, which combines K-Dimension Tree, is employed. Subsequently, word difficulty is mapped using K-Means cluster analysis. The results indicate a strong correlation between the Average Number of Times, Frequency Score of The Word, Difficulty Score of The Word and word difficulty, highlighting the efficacy of the proposed word difficulty mapping method.
- Open Access
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Empirical Matching‐Based Computation Offloading Optimization for 5G and Edge Computing‐Integrated EIoT
Electric Internet of things (EIoT) that integrates 5G and edge computing can provide data transmission and processing guarantee for smart grid. However, computation offloading optimization including joint optimization of server selection and computation resource allocation still faces several challenges such as difficulty in tradeoff balance among various quality of service (QoS) parameters, coupling between server selection and computation resource allocation, and multi‐device competition. To address these challenges, we propose an empirical matching‐based computation offloading optimization algorithm for 5G and edge computing‐integrated EIoT. The optimization objective is to minimize the computation offloading delay by jointly optimizing large timescale server selection and small timescale computation resource allocation. We first model the large timescale server selection problem as a many‐to‐one matching problem, which can be decoupled from small timescale computation resource allocation by establishing a matching preference list based on empirical performance. Then, the large timescale server selection problem is solved by pricing‐based matching with a quota algorithm. Furthermore, based on the obtained suboptimal result of large timescale server selection, the small timescale computation resource allocation problem is subsequently solved by Lagrange dual decomposition, the result of which is used to update large timescale empirical performance. Finally, extensive simulations are carried out to demonstrate the superior performance of the proposed algorithm by comparing it with existing algorithms.
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Open AccessEmpirical Matching‐Based Computation Offloading Optimization for 5G and Edge Computing‐Integrated EIoT
Electric Internet of things (EIoT) that integrates 5G and edge computing can provide data transmission and processing guarantee for smart grid. However, computation offloading optimization including joint optimization of server selection and computation resource allocation still faces several challenges such as difficulty in tradeoff balance among various quality of service (QoS) parameters, coupling between server selection and computation resource allocation, and multi‐device competition. To address these challenges, we propose an empirical matching‐based computation offloading optimization algorithm for 5G and edge computing‐integrated EIoT. The optimization objective is to minimize the computation offloading delay by jointly optimizing large timescale server selection and small timescale computation resource allocation. We first model the large timescale server selection problem as a many‐to‐one matching problem, which can be decoupled from small timescale computation resource allocation by establishing a matching preference list based on empirical performance. Then, the large timescale server selection problem is solved by pricing‐based matching with a quota algorithm. Furthermore, based on the obtained suboptimal result of large timescale server selection, the small timescale computation resource allocation problem is subsequently solved by Lagrange dual decomposition, the result of which is used to update large timescale empirical performance. Finally, extensive simulations are carried out to demonstrate the superior performance of the proposed algorithm by comparing it with existing algorithms.