As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attacke...As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers.Although the moving target defense(MTD)has been proposed to increase the attack difficulty for the attackers,there is no solo approach can cope with different attacks;in addition,it is impossible to implement all these approaches simultaneously due to the resource limitation.Thus,the selection of an optimal defense strategy based on MTD has become the focus of research.In general,the confrontation of two players in the security domain is viewed as a stochastic game,and the reward matrices are known to both players.However,in a real security confrontation,this scenario represents an incomplete information game.Each player can only observe the actions performed by the opponent,and the observed actions are not completely accurate.To accurately describe the attacker’s reward function to reach the Nash equilibrium,this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker.Next,the possible rewards of the attacker in each confrontation via the observation matrix were corrected.On this basis,the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy.Moreover,the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment.Finally,the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward.展开更多
The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circ...The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circumstances. Thus, a threshold selection method is proposed on the basis of area difference between background and object and intra-class variance. The threshold selection formulae based on one-dimensional (1-D) histogram, two-dimensional (2-D) histogram vertical segmentation and 2-D histogram oblique segmentation are given. A fast recursive algorithm of threshold selection in 2-D histogram oblique segmentation is derived. The segmented images and processing time of the proposed method are given in experiments. It is compared with some fast algorithms, such as Otsu, maximum entropy and Fisher threshold selection methods. The experimental results show that the proposed method can effectively segment the small object images and has better anti-noise property.展开更多
作为一种非线性维数约减算法,高斯过程隐变量模型(Gaussian process latent variable model,GPLVM)由于其适合处理小样本、高维数据,因而在模式识别、计算机视觉等领域得到了广泛应用.基于此,提出一种基于改进GPLVM的SAR图像目标特征提...作为一种非线性维数约减算法,高斯过程隐变量模型(Gaussian process latent variable model,GPLVM)由于其适合处理小样本、高维数据,因而在模式识别、计算机视觉等领域得到了广泛应用.基于此,提出一种基于改进GPLVM的SAR图像目标特征提取及自动识别方法,其中利用改进的GPLVM进行特征提取,高斯过程分类进行目标识别.传统GPLVM使用共轭梯度法对似然函数进行优化,为避免梯度估值易受噪声干扰、步长对算法影响严重等缺点,提出基于免疫克隆选择算法的GPLVM,利用其具有快速收敛到全局最优的特性提高算法性能.实验结果表明,该算法不仅降低了特征维数,且提高了识别精度,从而验证了算法用于SAR图像目标识别的有效性.展开更多
基金This paper is supported by the National Key R&D Program of China(2017YFB0802703)the National Nature Science Foundation of China(61602052).
文摘As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers.Although the moving target defense(MTD)has been proposed to increase the attack difficulty for the attackers,there is no solo approach can cope with different attacks;in addition,it is impossible to implement all these approaches simultaneously due to the resource limitation.Thus,the selection of an optimal defense strategy based on MTD has become the focus of research.In general,the confrontation of two players in the security domain is viewed as a stochastic game,and the reward matrices are known to both players.However,in a real security confrontation,this scenario represents an incomplete information game.Each player can only observe the actions performed by the opponent,and the observed actions are not completely accurate.To accurately describe the attacker’s reward function to reach the Nash equilibrium,this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker.Next,the possible rewards of the attacker in each confrontation via the observation matrix were corrected.On this basis,the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy.Moreover,the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment.Finally,the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward.
基金Sponsored by The National Natural Science Foundation of China(60872065)Science and Technology on Electro-optic Control Laboratory and Aviation Science Foundation(20105152026)State Key Laboratory Open Fund of Novel Software Technology,Nanjing University(KFKT2010B17)
文摘The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circumstances. Thus, a threshold selection method is proposed on the basis of area difference between background and object and intra-class variance. The threshold selection formulae based on one-dimensional (1-D) histogram, two-dimensional (2-D) histogram vertical segmentation and 2-D histogram oblique segmentation are given. A fast recursive algorithm of threshold selection in 2-D histogram oblique segmentation is derived. The segmented images and processing time of the proposed method are given in experiments. It is compared with some fast algorithms, such as Otsu, maximum entropy and Fisher threshold selection methods. The experimental results show that the proposed method can effectively segment the small object images and has better anti-noise property.
文摘作为一种非线性维数约减算法,高斯过程隐变量模型(Gaussian process latent variable model,GPLVM)由于其适合处理小样本、高维数据,因而在模式识别、计算机视觉等领域得到了广泛应用.基于此,提出一种基于改进GPLVM的SAR图像目标特征提取及自动识别方法,其中利用改进的GPLVM进行特征提取,高斯过程分类进行目标识别.传统GPLVM使用共轭梯度法对似然函数进行优化,为避免梯度估值易受噪声干扰、步长对算法影响严重等缺点,提出基于免疫克隆选择算法的GPLVM,利用其具有快速收敛到全局最优的特性提高算法性能.实验结果表明,该算法不仅降低了特征维数,且提高了识别精度,从而验证了算法用于SAR图像目标识别的有效性.
