The lower bound of maximum predictable time can be formulated into a constrained nonlinear opti- mization problem, and the traditional solutions to this problem are the filtering method and the conditional nonlinear o...The lower bound of maximum predictable time can be formulated into a constrained nonlinear opti- mization problem, and the traditional solutions to this problem are the filtering method and the conditional nonlinear optimal perturbation (CNOP) method. Usually, the CNOP method is implemented with the help of a gradient descent algorithm based on the adjoint method, which is named the ADJ-CNOP. However, with the increasing improvement of actual prediction models, more and more physical processes are taken into consideration in models in the form of parameterization, thus giving rise to the on–off switch problem, which tremendously affects the effectiveness of the conventional gradient descent algorithm based on the ad- joint method. In this study, we attempted to apply a genetic algorithm (GA) to the CNOP method, named GA-CNOP, to solve the predictability problems involving on–off switches. As the precision of the filtering method depends uniquely on the division of the constraint region, its results were taken as benchmarks, and a series of comparisons between the ADJ-CNOP and the GA-CNOP were performed for the modified Lorenz equation. Results show that the GA-CNOP can always determine the accurate lower bound of maximum predictable time, even in non-smooth cases, while the ADJ-CNOP, owing to the effect of on–off switches, often yields the incorrect lower bound of maximum predictable time. Therefore, in non-smooth cases, using GAs to solve predictability problems is more effective than using the conventional optimization algorithm based on gradients, as long as genetic operators in GAs are properly configured.展开更多
There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced se...There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm (ESEA) to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.展开更多
In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. T...In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.展开更多
Sturm-Liouville operators on a finite interval with discontinuities are considered. We give a uniqueness theorem for determining the potential and the parameters in boundary and under discontinuous conditions from a p...Sturm-Liouville operators on a finite interval with discontinuities are considered. We give a uniqueness theorem for determining the potential and the parameters in boundary and under discontinuous conditions from a particular set of eigenvalues, and provide corresponding reconstruction algorithm, which can be applicable to McLaughlin-Rundell's uniqueness theorem (see J. Math. Phys. 28, 1987).展开更多
Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have...Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have low level of contrast and are corrupted with strong speckle noise. Due to these effects, segmentation of ultrasound images is very challenging and traditional image segmentation methods may not be leads to satisfactory results. The active contour method has been one of the widely used techniques for image segmentation;however, due to low quality of ultrasound images, it has encountered difficulties. In this paper, we presented a segmental method combined genetic algorithm and active contour with an energy minimization procedure based on genetic algorithms. This method have been proposed to overcome some limits of classical active contours, as con-tour initialization and local minima (speckle noise), and have been successfully applied on medical ultrasound images. Experimental result on medical ultrasound image show that our presented method only can correctly segment the circular tissue’s on ultra-sound images.展开更多
In this paper, we have proposed a novel model called proximal support matrix machine (PSMM), which is mainly based on the models of proximal support vector machine (PSVM) and low rank support matrix machine (LRSMM). I...In this paper, we have proposed a novel model called proximal support matrix machine (PSMM), which is mainly based on the models of proximal support vector machine (PSVM) and low rank support matrix machine (LRSMM). In design, the PSMM model has comprehensively considered both the relationship between samples of the same class and the structure of rows or columns of matrix data. To a certain extent, our novel model can be regarded as a synthesis of the PSVM model and the LRSMM model. Since the PSMM model is an unconstrained convex problem in essence, we have established an alternating direction method of multipliers algorithm to deal with the proposed model. Finally, since a great deal of experiments on the minst digital database show that the PSMM classifier has a good ability to distinguish two digits with little difference, it encourages us to conduct more complex experiments on MIT face database, INRIA person database, the students face database and Japan female facial expression database. Meanwhile, the final experimental results show that PSMM performs better than PSVM, twin support vector machine, LRSMM and linear twin multiple rank support matrix machine in the demanding image classification tasks.展开更多
基金supported bythe National Natural Science Foundation of China(Grant Nos40975063 and 40830955)
文摘The lower bound of maximum predictable time can be formulated into a constrained nonlinear opti- mization problem, and the traditional solutions to this problem are the filtering method and the conditional nonlinear optimal perturbation (CNOP) method. Usually, the CNOP method is implemented with the help of a gradient descent algorithm based on the adjoint method, which is named the ADJ-CNOP. However, with the increasing improvement of actual prediction models, more and more physical processes are taken into consideration in models in the form of parameterization, thus giving rise to the on–off switch problem, which tremendously affects the effectiveness of the conventional gradient descent algorithm based on the ad- joint method. In this study, we attempted to apply a genetic algorithm (GA) to the CNOP method, named GA-CNOP, to solve the predictability problems involving on–off switches. As the precision of the filtering method depends uniquely on the division of the constraint region, its results were taken as benchmarks, and a series of comparisons between the ADJ-CNOP and the GA-CNOP were performed for the modified Lorenz equation. Results show that the GA-CNOP can always determine the accurate lower bound of maximum predictable time, even in non-smooth cases, while the ADJ-CNOP, owing to the effect of on–off switches, often yields the incorrect lower bound of maximum predictable time. Therefore, in non-smooth cases, using GAs to solve predictability problems is more effective than using the conventional optimization algorithm based on gradients, as long as genetic operators in GAs are properly configured.
基金supported by the Aviation Science Funds of China(2010ZC13012)the Fund of Jiangsu Innovation Program for Graduate Education (CXLX11 0203)
文摘There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm (ESEA) to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.
文摘In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
基金supported in part by the National Natural Science Foundation of China(11611530682,11171152 and 91538108)Natural Science Foundation of Jiangsu Province of China(BK 20141392)supported by the China Scholarship Fund(201706840062)
文摘Sturm-Liouville operators on a finite interval with discontinuities are considered. We give a uniqueness theorem for determining the potential and the parameters in boundary and under discontinuous conditions from a particular set of eigenvalues, and provide corresponding reconstruction algorithm, which can be applicable to McLaughlin-Rundell's uniqueness theorem (see J. Math. Phys. 28, 1987).
文摘Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have low level of contrast and are corrupted with strong speckle noise. Due to these effects, segmentation of ultrasound images is very challenging and traditional image segmentation methods may not be leads to satisfactory results. The active contour method has been one of the widely used techniques for image segmentation;however, due to low quality of ultrasound images, it has encountered difficulties. In this paper, we presented a segmental method combined genetic algorithm and active contour with an energy minimization procedure based on genetic algorithms. This method have been proposed to overcome some limits of classical active contours, as con-tour initialization and local minima (speckle noise), and have been successfully applied on medical ultrasound images. Experimental result on medical ultrasound image show that our presented method only can correctly segment the circular tissue’s on ultra-sound images.
文摘针对传统极限学习机易陷入局部最优解的缺点以及环境变化导致光伏出力波动的特点,构建了一种基于自适应噪声完全集成经验模态分解(complete ensemble empirical mode decomposition with adaptive noise,CEEMDAN)算法,结合黑猩猩优化算法优化极限学习机神经网络的光伏出力短期预测模型。首先利用CEEMDAN算法将影响光伏输出功率的关键环境因素序列进行分解,得到数据信号在不同时间尺度的局部特征,降低环境因素序列的非平稳性,然后将各分解子序列和光伏历史数据序列作为黑猩猩算法优化的极限学习机预测模型输入进行预测。最后,选用DKASC Solar Centre光伏电站数据集对不同预测模型进行验证对比。实例仿真结果表明,构建的改进光伏出力预测组合模型的各项指标预测效果更好,且适用不同环境的光伏发电预测。
文摘In this paper, we have proposed a novel model called proximal support matrix machine (PSMM), which is mainly based on the models of proximal support vector machine (PSVM) and low rank support matrix machine (LRSMM). In design, the PSMM model has comprehensively considered both the relationship between samples of the same class and the structure of rows or columns of matrix data. To a certain extent, our novel model can be regarded as a synthesis of the PSVM model and the LRSMM model. Since the PSMM model is an unconstrained convex problem in essence, we have established an alternating direction method of multipliers algorithm to deal with the proposed model. Finally, since a great deal of experiments on the minst digital database show that the PSMM classifier has a good ability to distinguish two digits with little difference, it encourages us to conduct more complex experiments on MIT face database, INRIA person database, the students face database and Japan female facial expression database. Meanwhile, the final experimental results show that PSMM performs better than PSVM, twin support vector machine, LRSMM and linear twin multiple rank support matrix machine in the demanding image classification tasks.