Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
A Hybrid Slime Mould Genetic Algorithm Based on Spatial Attenuation Self-diffusion Mechanism
PAN Jiawen, ZHAI Weixin, GUO Zhou, HU Banshao, CHENG Chengqi, WU Caicong
Acta Scientiarum Naturalium Universitatis Pekinensis    2025, 61 (1): 14-44.   DOI: 10.13209/j.0479-8023.2024.047
Abstract1309)   HTML    PDF(pc) (11710KB)(3412)       Save
According to the imbalance between exploration and exploitation, susceptibility to local optima, and low search efficiency of metaheuristic algorithms, a hybrid slime mould genetic algorithm based on spatial attenuation self-diffusion mechanism if presented. The algorithm uses genetic algorithm as the basic structure, and guides individuals to search in the solution space by recombining features through three operations: selection, crossover, and mutation. Firstly, it introduces oscillation-contraction mechanism with characteristics of both positive-negative feedback and random walking as crossover operators to enhance both global and local search capabilities. Secondly, a self-diffusion mechanism based on spatial decay is proposed as a mutation operator. This mechanism guides the diffusion motion using a spatial scale which decreases over the algorithm's lifecycle, promoting diversity in the early stages and effective exploration of neighborhood information in the later stages. Finally, a discriminative control strategy is introduced to adaptively adjust the algorithm's parameters based on the distribution deviation of the population fitness. This strategy helps balance the exploration and exploitation capabilities of the algorithm. To validate the algorithm's performance, experiments are conducted on two publicly available benchmark test sets: IEEE CEC2017 and IEEE CEC2021. The results demonstrate that the proposed algorithm effectively balances exploration and exploitation capabilities and exhibits superior optimization performance compared with other 23 different types of algorithms.
Related Articles | Metrics | Comments0
Prediction of PM2.5 Hour Concentration Based on U-net Neural Network
LI Yihang, ZHAI Weixin, YAN Hanqi, ZHU Daoye, TONG Xiaochong, CHENG Chengqi
Acta Scientiarum Naturalium Universitatis Pekinensis    2020, 56 (5): 796-804.   DOI: 10.13209/j.0479-8023.2020.065
Abstract3260)   HTML    PDF(pc) (1434KB)(1444)       Save
Most of the previous PM2.5 prediction models present unsatisfactory performance in several aspects, including predicting accuracy and generalization ability, especially in case of the sudden change in the value of PM2.5 situation. Therefore, we propose a method based on the U-net neural network to predict the hourly PM2.5 concentration value on the research area, attempting to improve the prediction performance. The proposed model includes two major steps. First, based on the inverse distance interpolation of historical wind field data, discrete station PM2.5 values are interpolated into a PM2.5 grid map; second, the U-net neural network is applied to train the prepared spatiotemporal grid data and make predictions. The model can use the PM2.5 concentration values of the grid map extracted at different time stamps for the PM2.5 prediction. The PM2.5 concentration values at all locations in the research region can be achieved. Specifically, the prediction accuracy and the generalization ability of the model in case of sudden changes are revealed. Experimental results indicate that the proposed method has a 10% improvement in the prediction accuracy of PM2.5 concentration values in the case of sudden change.
Related Articles | Metrics | Comments0
Research on Continuity of Multi-Scale Space-Filling Curves
ZHAI Weixin, CHEN Bo, TONG Xiaochong, CHENG Chengqi
Acta Scientiarum Naturalium Universitatis Pekinensis    2018, 54 (2): 331-335.   DOI: 10.13209/j.0479-8023.2017.147
Abstract3242)   HTML83)    PDF(pc) (343KB)(1419)       Save

Multi-scale two-dimensional Hilbert curve is constructed, and specially the scale dimension is treated as the third dimension. The new structure embodies the multi-level characteristics and overcomes the drawback of Z sequence coding pattern, thus improving the continuity of the curve and advancing the spatial retrieval efficiency. The authors conducted two kinds of experiments based on the quad-tree model to compare the retrieval efficiency of Hilbert curve and Z curve. The consequence indicates that the multi-scale Hilbert curve performs better than Z curve, and the improvement on different data distributions vary from 15% to 30%.

Related Articles | Metrics | Comments0
A Camshift Motion Tracking Algorithm Based on Kalman Filter
ZHAI Weixin;CHENG Chengqi
Acta Scientiarum Naturalium Universitatis Pekinensis    2015, 51 (5): 799-804.  
Abstract1226)      PDF(pc) (3288KB)(3485)       Save
Related Articles | Metrics | Comments0