Zhengying Cai

Dr. Zhengying Cai

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 September 2019 in IEEE Access
Verified
Journal Article
Open access
ZCZhengying Cai
Zhengying Cai
JQJing Qu
Jing Qu
PLPingping Liu
Pingping Liu
JYJiao Yu
Jiao Yu
To improve the security performance of blockchain smart contracts against quantum attacks, a smart contract based on light-weighted quantum blind signature is proposed here. Firstly, a smart contract architecture is built after the discussion of related researches, and the information processing and information transmitting for quantum blink signature are analyzed. Secondly, the life cycle and signature rules of quantum blind signature for smart contracts are presented. Thirdly, a quantum blind signature protocol for single signer in light-weighted smart contract is put forward, where its algorithm design and business flow are introduced in detail before the security performance of the proposed algorithm is analyzed. Fourthly, based on the former single-person signature algorithm, a more complex multi-person quantum blind signature algorithm is proposed, and its security is also analyzed. Fifthly, related references are compared to verify the proposed method. The proposed quantum signature schemes based on quantum entanglement characteristics can be used in single signer case or more, and will improve the security of blockchain smart contracts against quantum attacks, but with light-weighted structure and no need of any trusted third party or arbitrary institute. Finally, some suggestions for engineering application and the research results are summarized and the future research is prospected.

17 December 2024 in Sensors
Verified
Journal Article
Open access
PDF file
ZCZhengying Cai
Zhengying Cai
JDJingshu Du
Jingshu Du
THTianhao Huang
Tianhao Huang
ZLZhuimeng Lu
Zhuimeng Lu
ZLZeya Liu
Zeya Liu
FGFirst Name Gong
First Name Gong
With the widespread use of autonomous guided vehicles (AGVs), avoiding collisions has become a challenging problem. Addressing the issue is not straightforward since production efficiency, collision avoidance, and energy consumption are conflicting factors. This paper proposes a novel edge computing method based on vehicle edge intelligence to solve the energy-efficient collision-free machine/AGV scheduling problem. First, a vehicle edge intelligence architecture was built, and the corresponding state transition diagrams for collision-free scheduling were developed. Second, the energy-efficient collision-free machine/AGV scheduling problem was modeled as a multi-objective function with electric capacity constraints, where production efficiency, collision prevention, and energy conservation were comprehensively considered. Third, an artificial plant community algorithm was explored based on the edge intelligence of AGVs. The proposed method utilizes a heuristic search and the swarm intelligence of multiple AGVs to realize energy-efficient collision-free scheduling and is suitable for deploying on embedded platforms for edge computing. Finally, a benchmark dataset was developed, and some benchmark experiments were conducted, where the results revealed that the proposed heuristic method could effectively instruct multiple automatic guided vehicles to avoid collisions with high energy efficiency.

6 January 2020 in IEEE Access
Verified
Journal Article
Open access
ZCZhengying Cai
Zhengying Cai
ZXZeping Xiong
Zeping Xiong
KWKunpeng Wan
Kunpeng Wan
YXYaqi Xu
Yaqi Xu
FXFan Xu
Fan Xu
The node selecting problem of traffic network is a significant issue and is difficult to be solved. In this paper, an artificial slime mold method is proposed to help us solve the problem. First, the chief components of an artificial slime mold are introduced to simulate the foraging behavior of a true slime mold, including external food sources, plasmodium, myxamoeba, nucleus, and nutrients. Then the learning mechanism of nutrient concentration for the artificial slime mold is illustrated, though there is no brain or neuron in its body. After that, the node selecting approach is described according to the propagation capabilities of nodes. Second, the algorithm flow is designed to show how to solve this kind of complex selecting problem. The algorithm flow to select important traffic nodes by artificial slime mold is composed of 4 main steps, including initialization, food searching, feeding, and selecting for output. Third, a comprehensive example is designed and derived from references to certificate that the proposed artificial slime mold can help us select important traffic nodes by their generated traffic topologies. The contributions of this paper are important both for traffic node selecting and artificial learning mechanism in theoretical and practical aspects.

24 March 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZCZhengying Cai
Zhengying Cai
ZMZhe Ma
Zhe Ma
ZZZiyi Zuo
Ziyi Zuo
YXYafei Xiang
Yafei Xiang
明王明韬 王
明韬 王
Image edge detection is a difficult task, because it requires the accurate removal of irrelevant pixels, while retaining important pixels that describe the image’s structural properties. Here, an artificial plant community algorithm is proposed to aid in the solving of the image edge detection problem. First, the image edge detection problem is modeled as an objective function of an artificial plant community searching for water sources and nutrients. After many iterations, the artificial plant community is concentrated in habitable areas that are rich in water sources and nutrients, that is, the image edges, and the nonhabitable zones that are not suitable for living are deserted, that is, the nonedges. Second, an artificial plant community algorithm is designed to solve the objective function by simulating the growth process of a true plant community. The living behavior of the artificial plant community includes three operations: seeding, growing, and fruiting. The individuals in the plant community also correspond to three forms, namely seeds, individuals, and fruit. There are three fitness comparisons in each iteration. The first fitness comparison of each iteration is carried out during the seeding operation. Only the fruit with higher fitness levels in the last iteration can become seeds, while the fruit with low fitness levels die, and some new seeds are randomly generated. The second fitness comparison is implemented in the growing operation. Only the seeds with higher fitness levels can become individuals, but the seeds with lower fitness levels will die; thus, the community size will decrease. The third fitness comparison is in the fruiting operation, where the individual with the greatest fitness can produce an identical fruit through parthenogenesis, and the individuals with higher fitness levels can learn from each other and produce more fruit, so the population size can be restored. Through the continuous cycle of these three operations, the artificial plant community will finally determine the edge pixels and delete the nonedge pixels. Third, the experiment results reveal how the proposed algorithm generates the edge image, and the comparative results demonstrate that the proposed artificial plant community algorithm can effectively solve the image edge detection problems. Finally, this study and some limitations are summarized, and future directions are suggested. The proposed algorithm is expected to act as a new research tool for solving various complex problems.

15 November 2021 in Entropy
Verified
Journal Article
Open access
PDF file
ZCZhengying Cai
Zhengying Cai
SLShi Liu
Shi Liu
ZHZhangyi Han
Zhangyi Han
RWRui Wang
Rui Wang
YHYuehua Huang
Yuehua Huang
Traditional anti-quantum methods and multi-signature technologies to secure the blockchain against quantum attacks will quickly reduce the efficiency and scalability of the industrial blockchain, where the computational resources will experience a polynomial rise with the increasing number of traders. Here, a quantum blind multi-signature method is proposed for the multi-party transaction to provide anti-quantum security. First, the proposed multi-party transaction frame and quantum key distribution in the industrial blockchain are introduced. It integrates a novel quantum blind multi-signature algorithm that is based on the quantum entanglement mechanism, and it is absolutely secure in theory. Second, the anti-quantum multi-signature algorithm is illustrated, where there are four phases, i.e., initialization, signing, verification, and implementation. Third, the security and complexity of the proposed framework are analyzed and compared with related methods in references, and our proposed method is verified to be able to offer good computational performance and blockchain scalability for multi-party transaction. Last, the paper is summarized and future research directions are proposed.

13 June 2012 in Optimization
Verified
Journal Article
Closed access
RXRenbin Xiao
Renbin Xiao
ZCZhengying Cai
Zhengying Cai
XZXinhui Zhang
Xinhui Zhang
In green logistics operation, all logistics processes form a bidirectional closed-loop topology. In order to model and optimize such a kind of structure, a standardized closed-loop logistics operation reference model is built which aims to provide supply chain managers with general analysis. Based on the reference model, potential risks of closed-loop logistics chain can be analyzed including not only the visible forward and reverse logistics flow but also the invisible information flow. A qualitative decision-making model for different logistics organizations under risk is proposed and a profit function is developed according to logistics management decision-making process of all logistics nodes under different risks. The proposed model considers different risk management strategy problems. The optimization problem is described as a multi-objective decision-making problem with minimization of the risk loss as well as risk management cost and maximization of the profit. The profit model is solved by genetic algorithm. In the model, in order to express uncertainties of different risk preference information, risk is assessed by a three-dimensional vector in priority, probability and loss. A quantified reference model is introduced through a three-dimensional vague vector map, where several information gathering methods based on vague set are discussed and compared through a case study.