Ping Guo

Dr. Ping Guo

College of Computer Science, Chongqing University, Chongqing 400044, China
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
14 July 2019 in Sensors
Verified
Journal Article
Open access
PDF file
WLWenkai Liu
Wenkai Liu
PGPing Guo
Ping Guo
LYLian Ye
Lian Ye
Fault diagnosis is critical to ensuring the safety and reliable operation of rotating machinery systems. Long short-term memory networks (LSTM) have received a great deal of attention in this field. Most of the LSTM-based fault diagnosis methods have too many parameters and calculation, resulting in large memory occupancy and high calculation delay. Thus, this paper proposes a low-delay lightweight recurrent neural network (LLRNN) model for mechanical fault diagnosis, based on a special LSTM cell structure with a forget gate. The input vibration signal is segmented into several shorter sub-signals in order to shorten the length of the time sequence. Then, these sub-signals are sent into the network directly and converted into the final diagnostic results without any manual participation. Compared with some existing methods, our experiments illustrate that the proposed method has less memory space occupancy and lower computational delay while maintaining the same level of accuracy.

8 May 2019 in IEEE Access
Verified
Journal Article
Open access
PGPing Guo
Ping Guo
CQChangsheng Quan
Changsheng Quan
HCHaizhu Chen
Haizhu Chen
Since the membrane algorithm was proposed, it has been used for many optimization problems such as travelling salesman problem, the knapsack problem and so on. In membrane algorithms, the membranes have two functions: container and comparator. As a container, each membrane contains one evolutionary algorithm like genetic algorithm and ant colony algorithm. These algorithms are called subalgorithms, and used to evolve individuals. As a comparator, the membrane will compare the results of subalgorithms, and select the best as the base of the next evolvement. This paper proposes a novel evolutionary algorithm called Membrane Evolutionary Algorithm Framework (MEAF). Unlike the presented membrane algorithms, the membranes in MEAF will be evolved to solve problems by using four operators that are abstracted from the life cycle of living cells. Based on MEAF, a membrane evolutionary algorithm called MEAMVC is proposed to solve the minimum vertex cover (MVC) problem. The experimental results show the advantages of MEAMVC when MEAMVC is compared with two state-of-art MVC algorithms proposed in recent years.

25 July 2022 in Signal, Image and Video Processing
Verified
Journal Article
Closed access
PDF file
YWYanxia Wang
Yanxia Wang
JWJingyi Wang
Jingyi Wang
PGPing Guo
Ping Guo

2 January 2023 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
HLHuijun Liu
Huijun Liu
ALAo Lee
Ao Lee
WLWenshi Lee
Wenshi Lee
PGPing Guo
Ping Guo
The traveling salesman problem (TSP) is an NP-hard problem. Thus far, a large number of researchers have proposed different ant colony optimization (ACO) algorithms to solve the TSP. These algorithms inevitably encounter problems such as long convergence time and the tendency to easily fall into local optima. On the basis of the ACO algorithm, this study proposes a dynamic adaptive ACO algorithm (DAACO). DAACO realizes the diversity of initialization of the ACO algorithm by dynamically determining the number of ants to be prevented from falling into local optimization. DAACO also adopts a hybrid local selection strategy to increase the quality of ant optimization and reduce the optimization time. Among the 20 instances of the TSPLIB dataset, the DAACO algorithm obtains 19 optimal values, and the solutions of 10 instances are better than those of other algorithms. The experimental results on the TSPLIB dataset show that the DAACO algorithm has obvious advantages in terms of convergence time, solution quality, and average value relative to existing state-of-the-art ACO algorithms.

30 October 2020 in IEEE Access
Verified
Journal Article
Open access
PGPing Guo
Ping Guo
MHMengliang Hou
Mengliang Hou
LYLian Ye
Lian Ye
In recent years, heuristic intelligent algorithms have achieved rapid development in solving combinatorial optimization problems. Travelling salesman problem(TSP) is one of the classical NP-hard problems in combinatorial optimization, and it needs for more accurate and faster algorithms. Combining heuristic algorithm and cell-like P system, this paper proposes a membrane evolutionary algorithm for solving TSP(MEATSP). MEATSP abstracts the behaviors of biological cells such as fusion, division, cytolysis and selection into operators, and obtains the optimal solution of the problem through the evolution of membrane structure and objects within the membrane. Experiments on TSPLIB data sets show that the proposed algorithm performs well in both optimal solution and average residual, and it has strong stability when solving TSP with different scales.

20 May 2019 in IEEE Access
Verified
Journal Article
Open access
LYLian Ye
Lian Ye
JZJinhang Zheng
Jinhang Zheng
PGPing Guo
Ping Guo
MPMario J. Perez-Jimenez
Mario J. Perez-Jimenez
Membrane computing is a kind of distributed and parallel computing model inspired by biological cell mechanism. The maximum parallelism of membrane computing improve the computational efficiency of its computational model. In this paper, a tissue P system named ΠKP is proposed to solve the 0-1 knapsack problem, which is one of classic NP hard problems. ΠKP could obtain accurate solutions of knapsack problem and point out the amount of accurate solutions, which mainly consists of three stages: first, generate all the solutions of knapsack problem by cell division; then calculate the weights and total values in all the candidate membranes, which will be kept or dissolved according to the restriction of knapsack problem; check out the final solutions. The instances are executed on a membrane simulator named UPSimulator, and the result of the experiments shows the whole searching procedure by the rules and proves the correctness and efficiency of the system.