Ying Zhang

Ms. Ying Zhang

orcid

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
31 July 2024 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
PHPengfei He
Pengfei He
YZYing Zhang
Ying Zhang
HGHan Gan
Han Gan
JMJianfei Ma
Jianfei Ma
HZHongxin Zhang
Hongxin Zhang

11 June 2024 in IEEE Access
Verified
Journal Article
Open access
PHPengfei He
Pengfei He
PFPeng-Fei Fan
Peng-Fei Fan
SWShi-E Wu
Shi-E Wu
YZYing Zhang
Ying Zhang
A refined bidirectional A* algorithm proposes to address the issue of imprecise path planning for unmanned mining vehicles navigating through complex open-pit mining terrains. To ensure the smooth traversal of these vehicles, a gradient factor incorporates into the cost function to circumvent obstacles along the pathway. Additionally, a weighted coefficient introduces into the heuristic function to fine-tune the combination of Euclidean and Manhattan distances, enhancing the accuracy of path distance measurement and ultimately leading to an optimal path. The enhanced algorithm adeptly simultaneously explores from both the starting and end points, significantly reducing search time and improving path planning efficiency. Utilizing the established map of the mining environment, an experiment for unmanned mining vehicle path planning devises, and a simulation test of the global path planning algorithm conducts using the MATLAB platform. The experimental results demonstrate that the refined bidirectional A* algorithm exhibits accelerated search speed and superior path planning effectiveness.

4 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YZYing Zhang
Ying Zhang
PHPengfei He
Pengfei He
HGHan Gan
Han Gan
HZHongxin Zhang
Hongxin Zhang
PFPengfei Fan
Pengfei Fan
Support vector machines (SVMs) have been widely used in side-channel power analysis. The selection of the penalty factor and kernel parameter heavily influences how well support vector machines work. Setting reasonable SVM hyperparameters is a key issue in side-channel power analysis. The novel side-channel power analysis method SA-SVM, which combines simulated annealing (SA) and support vector machines (SVMs) to analyze the power traces and crack the key, is proposed in this paper as a solution to this issue. This method differs from other approaches in that it integrates SA and SVMs, enabling us to more effectively explore the search space and produce superior results. In this paper, we conducted experiments on SA-SVM and SVM models from three different aspects: the selection of kernel functions, the number of parameters, and the number of eigenvalues. To compare our results with previous research, we performed experimental evaluations on open datasets. The results indicate that, compared with the SVM model, the SA-SVM model improved the accuracy by 0.25% to 3.25% and reduced the required time by 39.96% to 98.02% when the point of interest was 53, recovering the key using only three power traces. The SA-SVM model outperforms existing methods in terms of accuracy and computation time.