A new update strategy, distance-based update strategy, is presented in Location Dependent Continuous Query (LDCQ) under error limitation. There are different possibilities to intersect when the distances between movin...A new update strategy, distance-based update strategy, is presented in Location Dependent Continuous Query (LDCQ) under error limitation. There are different possibilities to intersect when the distances between moving objects and the querying boundary are different.Therefore, moving objects have different influences to the query result. We set different deviation limits for different moving objects according to distances. A great number of unnecessary updates are reduced and the payload of the system is relieved.展开更多
Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed...Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.展开更多
Medical image segmentation is a powerful and evolving technology in medical diagnosis.In fact,it has been identified as a very effective tool to support and accompany doctors in their fight against the spread of the c...Medical image segmentation is a powerful and evolving technology in medical diagnosis.In fact,it has been identified as a very effective tool to support and accompany doctors in their fight against the spread of the coronavirus(COVID-19).Various techniques have been utilized for COVID-19 image segmentation,including Multilevel Thresholding(MLT)-based meta-heuristics,which are considered crucial in addressing this issue.However,despite their importance,meta-heuristics have significant limitations.Specifically,the imbalance between exploration and exploitation,as well as premature convergence,can cause the optimization process to become stuck in local optima,resulting in unsatisfactory segmentation results.In this paper,an enhanced War Strategy Chimp Optimization Algorithm(WSChOA)is proposed to address MLT problems.Two strategies are incorporated into the traditional Chimp Optimization Algorithm.Golden update mechanism that provides diversity in the population.Additionally,the attack and defense strategies are incorporated to improve the search space leading to avoiding local optima.The experimental results were conducted by comparing WSChoA with recent and well-known algorithms using various evaluation metrics such as Feature Similarity Index(FSIM),Structural Similarity Index(SSIM),Peak signal-to-Noise Ratio(PSNR),Standard deviation(STD),Freidman Test(FT),and Wilcoxon Sign Rank Test(WSRT).The results obtained by WSChoA surpassed those of other optimization techniques in terms of robustness and accuracy,indicating that it is a powerful tool for image segmentation.展开更多
In this study,we propose a spatial prisoner's dilemma game model with a 2-stage strategy updating rule,and focus on the cooperation behavior of the system.In the first stage,i.e.,the pre-learning stage,a focal player...In this study,we propose a spatial prisoner's dilemma game model with a 2-stage strategy updating rule,and focus on the cooperation behavior of the system.In the first stage,i.e.,the pre-learning stage,a focal player decides whether to update his strategy according to the pre-learning factor β and the payoff difference between himself and the average of his neighbors.If the player makes up his mind to update,he enters into the second stage,i.e.,the learning stage,and adopts a strategy of a randomly selected neighbor according to the standard Fermi updating rule.The simulation results show that the cooperation level has a non-trivial dependence on the pre-learning factor.Generally,the cooperation frequency decreases as the pre-learning factor increases;but a high cooperation level can be obtained in the intermediate region of- 3〈 β 〈-1.We then give some explanations via studying the co-action of pre-learning and learning.Our results may sharpen the understanding of the influence of the strategy updating rule on evolutionary games.展开更多
The performance of data-driven models relies heavily on the amount and quality of training samples, so it might deteriorate significantly in the regions where samples are scarce. The objective of this paper is to deve...The performance of data-driven models relies heavily on the amount and quality of training samples, so it might deteriorate significantly in the regions where samples are scarce. The objective of this paper is to develop an online SVR model updating strategy to track the change in the process characteristics efficiently with affordable computational burden. This is achieved by adding a new sample that violates the Karush–Kuhn–Tucker conditions of the existing SVR model and by deleting the old sample that has the maximum distance with respect to the newly added sample in feature space. The benefits offered by such an updating strategy are exploited to develop an adaptive model-based control scheme, where model updating and control task perform alternately.The effectiveness of the adaptive controller is demonstrated by simulation study on a continuous stirred tank reactor. The results reveal that the adaptive MPC scheme outperforms its non-adaptive counterpart for largemagnitude set point changes and variations in process parameters.展开更多
为进一步优化重叠社区检测算法,提出了一种新的基于度和节点聚类系数的节点重要性定义,按照节点重要性降序更新节点,固定节点更新策略,提高社区检测的稳定性。在此基础上,提出了一种基于图嵌入和多标签传播的重叠社区检测算法(overlappi...为进一步优化重叠社区检测算法,提出了一种新的基于度和节点聚类系数的节点重要性定义,按照节点重要性降序更新节点,固定节点更新策略,提高社区检测的稳定性。在此基础上,提出了一种基于图嵌入和多标签传播的重叠社区检测算法(overlapping community detection based on graph embedding and multi-label propagation algorithm,OCD-GEMPA)。该算法结合node2vec模型对节点进行低维向量表示,构建节点之间的权重值矩阵,根据权重值计算标签归属系数,据此选择标签,避免了随机选择问题。在真实数据集和人工合成数据集上对该算法进行实验验证。实验结果表明,与其他重叠社区检测算法相比,OCD-GEMPA在EQ和NMI这两个指标都有明显提升,具有更好的准确性和稳定性。展开更多
文摘A new update strategy, distance-based update strategy, is presented in Location Dependent Continuous Query (LDCQ) under error limitation. There are different possibilities to intersect when the distances between moving objects and the querying boundary are different.Therefore, moving objects have different influences to the query result. We set different deviation limits for different moving objects according to distances. A great number of unnecessary updates are reduced and the payload of the system is relieved.
文摘Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.
文摘Medical image segmentation is a powerful and evolving technology in medical diagnosis.In fact,it has been identified as a very effective tool to support and accompany doctors in their fight against the spread of the coronavirus(COVID-19).Various techniques have been utilized for COVID-19 image segmentation,including Multilevel Thresholding(MLT)-based meta-heuristics,which are considered crucial in addressing this issue.However,despite their importance,meta-heuristics have significant limitations.Specifically,the imbalance between exploration and exploitation,as well as premature convergence,can cause the optimization process to become stuck in local optima,resulting in unsatisfactory segmentation results.In this paper,an enhanced War Strategy Chimp Optimization Algorithm(WSChOA)is proposed to address MLT problems.Two strategies are incorporated into the traditional Chimp Optimization Algorithm.Golden update mechanism that provides diversity in the population.Additionally,the attack and defense strategies are incorporated to improve the search space leading to avoiding local optima.The experimental results were conducted by comparing WSChoA with recent and well-known algorithms using various evaluation metrics such as Feature Similarity Index(FSIM),Structural Similarity Index(SSIM),Peak signal-to-Noise Ratio(PSNR),Standard deviation(STD),Freidman Test(FT),and Wilcoxon Sign Rank Test(WSRT).The results obtained by WSChoA surpassed those of other optimization techniques in terms of robustness and accuracy,indicating that it is a powerful tool for image segmentation.
基金Project supported by the Natural Science Foundation of Zhejiang Province of China (Grant Nos. Y1110766,Y1101316,Y6110317,and LY12A05003)the Key Science and Technology Plan Program of Zhejiang Province,China (Grant No. 2010C13021)
文摘In this study,we propose a spatial prisoner's dilemma game model with a 2-stage strategy updating rule,and focus on the cooperation behavior of the system.In the first stage,i.e.,the pre-learning stage,a focal player decides whether to update his strategy according to the pre-learning factor β and the payoff difference between himself and the average of his neighbors.If the player makes up his mind to update,he enters into the second stage,i.e.,the learning stage,and adopts a strategy of a randomly selected neighbor according to the standard Fermi updating rule.The simulation results show that the cooperation level has a non-trivial dependence on the pre-learning factor.Generally,the cooperation frequency decreases as the pre-learning factor increases;but a high cooperation level can be obtained in the intermediate region of- 3〈 β 〈-1.We then give some explanations via studying the co-action of pre-learning and learning.Our results may sharpen the understanding of the influence of the strategy updating rule on evolutionary games.
基金Supported by the National Basic Research Program of China(2012CB720500)Postdoctoral Science Foundation of China(2013M541964)Fundamental Research Funds for the Central Universities(13CX05021A)
文摘The performance of data-driven models relies heavily on the amount and quality of training samples, so it might deteriorate significantly in the regions where samples are scarce. The objective of this paper is to develop an online SVR model updating strategy to track the change in the process characteristics efficiently with affordable computational burden. This is achieved by adding a new sample that violates the Karush–Kuhn–Tucker conditions of the existing SVR model and by deleting the old sample that has the maximum distance with respect to the newly added sample in feature space. The benefits offered by such an updating strategy are exploited to develop an adaptive model-based control scheme, where model updating and control task perform alternately.The effectiveness of the adaptive controller is demonstrated by simulation study on a continuous stirred tank reactor. The results reveal that the adaptive MPC scheme outperforms its non-adaptive counterpart for largemagnitude set point changes and variations in process parameters.
文摘为进一步优化重叠社区检测算法,提出了一种新的基于度和节点聚类系数的节点重要性定义,按照节点重要性降序更新节点,固定节点更新策略,提高社区检测的稳定性。在此基础上,提出了一种基于图嵌入和多标签传播的重叠社区检测算法(overlapping community detection based on graph embedding and multi-label propagation algorithm,OCD-GEMPA)。该算法结合node2vec模型对节点进行低维向量表示,构建节点之间的权重值矩阵,根据权重值计算标签归属系数,据此选择标签,避免了随机选择问题。在真实数据集和人工合成数据集上对该算法进行实验验证。实验结果表明,与其他重叠社区检测算法相比,OCD-GEMPA在EQ和NMI这两个指标都有明显提升,具有更好的准确性和稳定性。