The diversity, adaptation and memory of biological immune system attract much attention of researchers. Several optimal algorithms based on immune system have also been proposed up to now. The distance concentra- tion...The diversity, adaptation and memory of biological immune system attract much attention of researchers. Several optimal algorithms based on immune system have also been proposed up to now. The distance concentra- tion-based artificial immune algorithm (DCAIA) is proposed to overcome defects of the classical artificial immune al- gorithm (CAIA) in this paper. Compared with genetic algorithm (GA) and CAIA, DCAIA is good for solving the prob- lem of precocity,holding the diversity of antibody, and enhancing convergence rate.展开更多
Based on fault diagnosis and fault tolerant technologies, the mine-hoist active fault-tolerant control system (MAFCS) is presented with corresponding strategies,, which includes the fault diagnosis module (FDM), the d...Based on fault diagnosis and fault tolerant technologies, the mine-hoist active fault-tolerant control system (MAFCS) is presented with corresponding strategies,, which includes the fault diagnosis module (FDM), the dynamic library (DL) and the fault-tolerant control module (FCM). When a fault is judged from some sensor by FDM, FCM reconfigure the state of MAFCS by calling the parameters from all sub libraries in DL, in order to ensure the reliabil- ity and safety of mine hoist. The simulating result shows that, MAFCS is of certain intelligence, which can adopt the corresponding control strategies according to different fault modes, even when there are quite difference between the real data and the prior fault modes.展开更多
The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which ...The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by sev- eral examples.展开更多
文摘The diversity, adaptation and memory of biological immune system attract much attention of researchers. Several optimal algorithms based on immune system have also been proposed up to now. The distance concentra- tion-based artificial immune algorithm (DCAIA) is proposed to overcome defects of the classical artificial immune al- gorithm (CAIA) in this paper. Compared with genetic algorithm (GA) and CAIA, DCAIA is good for solving the prob- lem of precocity,holding the diversity of antibody, and enhancing convergence rate.
文摘Based on fault diagnosis and fault tolerant technologies, the mine-hoist active fault-tolerant control system (MAFCS) is presented with corresponding strategies,, which includes the fault diagnosis module (FDM), the dynamic library (DL) and the fault-tolerant control module (FCM). When a fault is judged from some sensor by FDM, FCM reconfigure the state of MAFCS by calling the parameters from all sub libraries in DL, in order to ensure the reliabil- ity and safety of mine hoist. The simulating result shows that, MAFCS is of certain intelligence, which can adopt the corresponding control strategies according to different fault modes, even when there are quite difference between the real data and the prior fault modes.
文摘The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by sev- eral examples.
