Jinshou Yu’s research while affiliated with East China University of Science and Technology and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (21)


Improved Particle Swarm Optimization Based Fault Diagnosis Approach for Power Electronic Devices
  • Article

January 2009

·

9 Reads

·

2 Citations

Yan Yang

·

Ruqing Chen

·

Jinshou Yu

294 fault states of 12-pulse waveform controlled rectifier circuit are studied. According to the fault voltage waveforms of rectifier, a special fault classification method is proposed. To enhance the performance of particle swarm optimization (PSO), a novel PSO with disturbance (DPSO) is put forward by introducing an evolution speed factor in standard PSO. Simulation results and comparisons with standard PSO show that DPSO enhances the searching efficiency and improves the searching quality effectively. Finally, DPSO is successfully applied in neural network fault diagnosis modeling.


Research and application of abnormal-monitoring based on Expert System for purifying units in ammonia plant

April 2008

·

10 Reads

An expert system has been developed for monitoring the abnormal process and avoiding the dangers of purifying units in ammonia plant in this work. The regular knowledge expression method of ldquorule frame + rule bodyrdquo is used to building the knowledge base. It uses hybrid strategy for inference engine. The system is stable and reliable when put into operation, and it can monitor the abnormal process real-time, keep away the dangers of purifying units in ammonia plant, and realize fault-tolerant control under certain operation state.


Research and Application of a Hierarchical Fault Diagnosis System Based on Support Vector Machine

September 2007

·

13 Reads

·

1 Citation

support vector machine (SVM) is a kind of machine learning method based on the statistical learning theory, it has been applied in the fault diagnosis field. After analyzing SVM pattern classification theory, a hierarchical structure fault detection and identification (FDI) system is presented in this paper, and simulation results show that this method can effectively handle the complex process characteristic and improve FDI model performance.


A Hybrid Optimization Method Based on Cellular Automata and its Application in Soft-Sensing Modeling

September 2007

·

7 Reads

·

2 Citations

By studying cellular automata, a new optimization method based on cellular automata is proposed by this paper. The new optimization method assumes that "life game" are applied in operator of genetic algorithm (GA). Experiment results show that the new method has good optimization performance. Then, a hybrid neural network algorithm based on life game, GA and back-propagation algorithm is presented to train soft-sensing model of acrylonitrile yield. Experiment results show that the hybrid soft sensing model proposed in this paper has good performance and high measuring precision.


An Improved Bagging Neural Network Ensemble Algorithm and Its Application

September 2007

·

69 Reads

·

18 Citations

For aggregation to be effective the component artificial neural networks (ANNs) must be as accurate and diverse as possible, an improved Bagging neural network ensemble algorithm is proposed to cope with this problem. The Euclidean distances between two arbitrary samples of the original training set are analyzed, the training subsets of component ANNs are distilled from this set then. The subsets elements have good properties of ergodicity and representativeness in sample space. The outputs of component ANNs are combined via weighted averaging and the optimal weights are determined by particle swarm optimization. Experimental studies on four typical regression datasets show that this approach has improved the quality of training subsets. Thus, the ensemble generalization ability is improved. Finally the improved algorithm is applied to construct an ANN-based soft sensor model for real-time measuring the ethylene yield. Application results show that this model has high measuring precision as well as good generalization ability.


A Modified Discrete Binary Ant Colony Optimization and Its Application in Chemical Process Fault Diagnosis

October 2006

·

16 Reads

·

5 Citations

Lecture Notes in Computer Science

Considering fault diagnosis is a small sample problem in real chemical process industry, Support Vector Machines (SVM) is adopted as classifier to discriminate chemical process steady faults. To improve fault diagnosis performance, it is essential to reduce the dimensionality of collected data. This paper presents a modified discrete binary ant colony optimization (MDBACO) to optimize discrete combinational problems, and then further combines it with SVM to accomplishing fault feature selection. The tests of optimizing benchmark functions show the developed MDBACO is valid and effective. The fault diagnosis results and comparisons of simulations based on Tennessee Eastman Process (TEP) prove the feature selection method based on MDBACO and SVM can find the essential fault variables quickly and exactly, and greatly increases the fault diagnosis correct rates as irrelevant variables are eliminated properly.


A Modified Adaptive Chaotic Binary Ant System and Its Application in Chemical Process Fault Diagnosis

September 2006

·

14 Reads

·

5 Citations

Lecture Notes in Computer Science

Fault diagnosis is a small sample problem as fault data are absent in the real production process. To tackle it, Support Vector Machines (SVM) is adopted to diagnose the chemical process steady faults in this paper. Considering the high data dimensionality in the large-scaled chemical industry seriously spoil classification capability of SVM, a modified adaptive chaotic binary ant system (ACBAS) is proposed and combined with SVM for fault feature selection to remove the irrelevant variables and ensure SVM classifying correctly. Simulation results and comparisons of Tennessee Eastman Process show the developed ACBAS can find the essential fault feature variables effectively and exactly, and the SVM fault diagnosis method combined with ACBAS-based feature selection greatly improve the diagnosing performance as unnecessary variables are eliminated properly.


Three Sub-Swarm Discrete Particle Swarm Optimization Algorithm

September 2006

·

11 Reads

·

27 Citations

Three sub-swarm discrete particle swarm optimization algorithm (THSDPSO) is proposed. The new algorithm assumes that all particles are divided into three sub- swarms. One sub-swarm flies toward the global best position. The second sub-swarm flies in the opposite direction. The last sub-swarm flies randomly around the global best position. In THSDPSO algorithm, two ways are used to handle the position of particles. One way is using the corresponding velocity as a probability measure by the transfer function and THSDPSO with this way is called BTHSDPSO. Another is directly using the hard limit function and THSDPSO with this way is called HTHSDPSO. The two THSDPSOs and basic discrete particle swarm optimization algorithm (DPSO) are all used to solve two well-known test functions' optimization problems. Simulation results show that the two THSDPSOs are both able to find the best fitness more quickly and more precisely than DPSO. Especially the HTHSDPSO has more wonderful optimization performance.


Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems

July 2006

·

105 Reads

·

66 Citations

This paper presents a decoupled path planning based on ant colony algorithm and distributed navigation with collision avoidance for multi-robot systems. An improved ant colony algorithm is proposed to plan a reasonable collision-free path for each mobile robot of multi-robot system in the decoupled path planning scheme in complicated static environment. The special functions are added into the regular ant colony algorithm to improve the selective strategy. When an ant explores a dead-corner in path searching, a dead-corner table is established and a penalty function is used for the trail intensity updated in order to avoid the path deadlock of mobile robot. A behavior strategy on "first come and first service" is adopted to solve the conflict between moving robots in distributed local navigation. Simulation results show that the proposed method can effectively improve the performance of the planned path, and the individual robots with collision-free can achieve to reach their goal locations by the simple local navigation strategies


A New On-Line Modeling Approach to Nonlinear Dynamic Systems

May 2006

·

3 Reads

Lecture Notes in Computer Science

An improved radial basis function neural network (IRBFNN) with unsymmetrical Gaussian function is presented to simplify the structure of RBFNN. The improved resource allocating network (IRAN) is developed to design IRBFNN online for nonlinear dynamic system modeling, integrating the typical resource allocating network (RAN) with merging method for similar hidden units, deleting strategy for redundant hidden units, and LMS learning algorithm with moving data window for output link weights of network. The proposed approach can effectively improve the precision and generalization of IRBFNN. The combination of IRBFNN and IRAN is competent for the online modeling of nonlinear dynamic systems. The feasibility and effectiveness of the modeling method have been demonstrated by simulations.


Citations (15)


... Although the accuracy and generalization ability of the model were improved, the evolutionary algorithm used in this high-dimensional optimization problem generally has the drawbacks of fast convergence and is easy to converge into local optimization. The Kalman particle swarm optimization (KPSO) [17] combines the Kalman filter principle into the PSO [18], which reduces the number of iterations for the algorithm to find the global optimum in solving high-dimensional optimization problems. After combining the principle of the Kalman filter, the optimization ability of PSO has been improved, and it has been further improved and applied to practical engineering [19]. ...

Reference:

An improved Kalman particle swarm optimization for modeling and optimizing of boiler combustion characteristics
The Kalman particle swarm optimization algorithm and its application in soft-sensor of acrylonitrile yield
  • Citing Conference Paper
  • January 2006

Lecture Notes in Computer Science

... Knowledge-based identification systems [18] have also been introduced for a predefined set of faults, where the fault search engines are designed to adapt themselves to model variations. Particle swarm optimization [19,20], fuzzy [26], fuzzy expert systems [21], Markov-based techniques [10,12] and time-averaging technique [27] are all designed based on the knowledge of the system. ...

Improved Particle Swarm Optimization Based Fault Diagnosis Approach for Power Electronic Devices
  • Citing Article
  • January 2009

... Earlier soft sensor applications employed popular traditional evolutionary algorithms such as genetic algorithm (GA), PSO, ant colony optimization (ACO), and differential evolution (DE) (Chen and Yu, 2005;Lahiri and Khalfe, 2009;Li and Liu, 2011;Shakil et al., 2009). However, later studies reported several novel evolutionary algorithms for soft sensor design. ...

Particle Swarm Optimization Neural Network and Its Application in Soft-Sensing Modeling
  • Citing Conference Paper
  • July 2005

Lecture Notes in Computer Science

... This method mimics animal behaviors for global path planning. Some examples of these methods are particle swarm optimisation (PSO) and firefly algorithm (FA) [27], and improved ant colony optimization (ACO) [28], [29], [30]. The most recent category is the reinforcement learning (RL)-based planning method. ...

Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems
  • Citing Conference Paper
  • July 2006

... The Kalman PSO (KPSO) [16] is a new approach to particle motion in PSO that reduces the number of iterations required to reach an optimum solution. In [28] it is shown that KPSO has better optimization capability than PSO over three test functions. It uses the Kalman filter algorithm to calculate the next position of each particle. ...

Lecture Notes in Computer Science
  • Citing Conference Paper
  • January 2006

Lecture Notes in Computer Science

... The idea of ACO is inspired by the phenomenon that ants can find the shortest path from the nest to the food by using chemical materials called pheromone left behind their trails and ants are able to adapt to the changes in the environment. By transforming binary-coded optimization problems as the corresponding shortest path search problems in which each node connects to the next one with two edges, that is, path 0 and path 1 representing 0 and 1, respectively, ACO can be easily modified and applied to binary-coded problems [34]. In Binary ACO (BACO), each ant selects routes based on the pheromone on the path 0 and path 1, and the probabilities of being 0 and 1 are calculated as ...

A Modified Adaptive Chaotic Binary Ant System and Its Application in Chemical Process Fault Diagnosis
  • Citing Conference Paper
  • September 2006

Lecture Notes in Computer Science

... The variance will be decreasing as time increases in order to control the neighborhood size among neurons at a given time t. The expected value E [fi (x)] is similar to the k-means algorithm in the sense that, if we remove the neighboring function 'Pcj (t) then, the remaining equations are similar to the mathematical formulation of the k-means algorithm [16]. Thus, the SOM can be also defined as a setting M number of cluster center (according to M neurons) and organizing them in a SOM lattice array. ...

Fuzzy Self-Organizing Map Neural Network Using Kernel PCA and the Application
  • Citing Conference Paper
  • August 2005

Lecture Notes in Computer Science

... Furthermore, as the BPN is based on the gradient information of the error function, when the problems are complex or the gradient information is hard to obtain, BPN may be helpless. To overcome the disadvantages, many optimization algorithms have been introduced in the study and design of neural networks such as constructing a neural network based on the particle swarm optimization algorithm [47], and using evolutionary algorithms to optimize the neural networks [48][49][50], which have been proved feasible and effective. ...

Two Sub-swarms Particle Swarm Optimization Algorithm
  • Citing Conference Paper
  • August 2005

Lecture Notes in Computer Science