随机测试(random testing,RT)是一种简单易用的测试技术,它从输入域随机地选择测试用例,直至发现一个失效或测试资源耗尽.但它因为不利用任何软件需求和代码信息而被认为是效率低下的.基于失效域分布的特征,Chen提出了一种名叫适应性随...随机测试(random testing,RT)是一种简单易用的测试技术,它从输入域随机地选择测试用例,直至发现一个失效或测试资源耗尽.但它因为不利用任何软件需求和代码信息而被认为是效率低下的.基于失效域分布的特征,Chen提出了一种名叫适应性随机测试(adaptive random testing,ART)的新方法.ART虽然提高了随机测试的失效发现效率,但与RT一样,在发现一个失效后就停止测试,而现实中许多软件都是具有多个输入输出变量的,它可能存在多个缺陷,针对这样的软件进行测试,ART显然存在一定的局限.将I/O关系信息引入ART,在I/O关联性分析的基础上,提出了一种基于I/O的ART新方法.仿真实验的结果证明,相对于FSCS-ART而言,新算法发现失效的效率有了极大的提高,同时,它可以一次发现多个失效,更适用于多个输入输出变量的软件的测试.展开更多
作为典型的黑盒测试方法,随机测试(Random Testing,简称RT)具有简单高效、易于实现等优点。然而,由于产生测试用例的方式较为简单,它的失效检测能力往往不尽如人意。有学者通过对程序失效的特征进行分析,提出了适应性随机测试方法(Adapt...作为典型的黑盒测试方法,随机测试(Random Testing,简称RT)具有简单高效、易于实现等优点。然而,由于产生测试用例的方式较为简单,它的失效检测能力往往不尽如人意。有学者通过对程序失效的特征进行分析,提出了适应性随机测试方法(Adaptive Random Testing,简称ART),通过实现测试用例在输入域的均匀分布,提高了算法的失效检测能力。但是,该算法存在一个明显缺陷,在每次从候选集中生成新的测试用例时,需要与之前已测用例进行大量地距离计算,因此它的测试效率较低。针对这一问题,本文提出了一种基于二分划分的适应性随机测试方法,对输入域空间进行迭代二分,直到测试用例发现失效区域。实验结果表明,该算法能够有效地实现测试用例在输入域上的均匀分布,提高程序的失效检测能力,并且能够提高算法的运行效率。展开更多
随机测试和划分测试是两种重要的测试方法,关于两者在失效检测能力和效率方面的比较一直是软件测试领域的研究热点之一.适应性随机测试是对随机测试的一种增强,通过实现测试用例在输入域上的均匀分布,提高了随机测试的失效检测能力.该...随机测试和划分测试是两种重要的测试方法,关于两者在失效检测能力和效率方面的比较一直是软件测试领域的研究热点之一.适应性随机测试是对随机测试的一种增强,通过实现测试用例在输入域上的均匀分布,提高了随机测试的失效检测能力.该文从划分测试出发,借鉴了均匀分布的思想,提出了一种基于优先级的迭代划分测试方法(Iterative Partition Testing based on Priority Sampling,IPT-PS).首先迭代划分输入域并选取划分后子域的中心点作为待执行的测试用例,随后采取优先级策略,将待执行的测试用例分为3种不同优先等级并依次执行.迭代划分和中心采样仅需要已知输入域的空间信息,优先级执行则考虑了测试用例的不同空间特性,上述3种操作均仅需要很少的时间开销并力求实现测试用例在输入域上的均匀分布,以提高失效检测能力.该文通过理论分析给出了IPT-PS检测出对应失效所需测试用例数量的上界,并通过一系列实验结果表明:IPT-PS在仅使用接近随机测试时间开销的情况下,可以获得与适应性随机测试相近甚至更好的失效检测能力,是一种高效的测试方法.展开更多
The synchronization problem under two cases is considered. One is that the bound on the uncertainty existing in the controller is known, the other is that the bound is unknown. In the latter case, the simple adaptatio...The synchronization problem under two cases is considered. One is that the bound on the uncertainty existing in the controller is known, the other is that the bound is unknown. In the latter case, the simple adaptation laws for upper bound on the norm of the uncertainty is proposed. Using this adaptive upper bound, a variable structure control is designed. The proposed method does not guarantee the convergence of the adaptive upper bound to the real one but makes the system asymptotically stable.展开更多
In this paper, we propose an improved Directed Acyclic Graph Support Vector Machine （DAGSVM） for multi-class classification. Compared with the traditional DAGSVM, the improved version has advantages that the structu...In this paper, we propose an improved Directed Acyclic Graph Support Vector Machine （DAGSVM） for multi-class classification. Compared with the traditional DAGSVM, the improved version has advantages that the structure of the directed acyclic graph is not chosen random and fixed, and it can be adaptive to be optimal according to the incoming testing samples, thus it has a good generalization performance. From experiments on six datasets, we can see that the proposed improved version of DAGSVM is better than the traditional one with respect to the accuracy rate.展开更多
Identity-based signature has become an important technique for lightweight authentication as soon as it was proposed in 1984.Thereafter,identity-based signature schemes based on the integer factorization problem and d...Identity-based signature has become an important technique for lightweight authentication as soon as it was proposed in 1984.Thereafter,identity-based signature schemes based on the integer factorization problem and discrete logarithm problem were proposed one after another.Nevertheless,the rapid development of quantum computers makes them insecure.Recently,many efforts have been made to construct identity-based signatures over lattice assumptions against attacks in the quantum era.However,their efficiency is not very satisfactory.In this study,an efficient identity-based signature scheme is presented over the number theory research unit(NTRU) lattice assumption.The new scheme is more efficient than other lattice-and identity-based signature schemes.The new scheme proves to be unforgeable against the adaptively chosen message attack in the random oracle model under the hardness of the γ-shortest vector problem on the NTRU lattice.展开更多
文摘随机测试(random testing,RT)是一种简单易用的测试技术,它从输入域随机地选择测试用例,直至发现一个失效或测试资源耗尽.但它因为不利用任何软件需求和代码信息而被认为是效率低下的.基于失效域分布的特征,Chen提出了一种名叫适应性随机测试(adaptive random testing,ART)的新方法.ART虽然提高了随机测试的失效发现效率,但与RT一样,在发现一个失效后就停止测试,而现实中许多软件都是具有多个输入输出变量的,它可能存在多个缺陷,针对这样的软件进行测试,ART显然存在一定的局限.将I/O关系信息引入ART,在I/O关联性分析的基础上,提出了一种基于I/O的ART新方法.仿真实验的结果证明,相对于FSCS-ART而言,新算法发现失效的效率有了极大的提高,同时,它可以一次发现多个失效,更适用于多个输入输出变量的软件的测试.
文摘作为典型的黑盒测试方法,随机测试(Random Testing,简称RT)具有简单高效、易于实现等优点。然而,由于产生测试用例的方式较为简单,它的失效检测能力往往不尽如人意。有学者通过对程序失效的特征进行分析,提出了适应性随机测试方法(Adaptive Random Testing,简称ART),通过实现测试用例在输入域的均匀分布,提高了算法的失效检测能力。但是,该算法存在一个明显缺陷,在每次从候选集中生成新的测试用例时,需要与之前已测用例进行大量地距离计算,因此它的测试效率较低。针对这一问题,本文提出了一种基于二分划分的适应性随机测试方法,对输入域空间进行迭代二分,直到测试用例发现失效区域。实验结果表明,该算法能够有效地实现测试用例在输入域上的均匀分布,提高程序的失效检测能力,并且能够提高算法的运行效率。
文摘随机测试和划分测试是两种重要的测试方法,关于两者在失效检测能力和效率方面的比较一直是软件测试领域的研究热点之一.适应性随机测试是对随机测试的一种增强,通过实现测试用例在输入域上的均匀分布,提高了随机测试的失效检测能力.该文从划分测试出发,借鉴了均匀分布的思想,提出了一种基于优先级的迭代划分测试方法(Iterative Partition Testing based on Priority Sampling,IPT-PS).首先迭代划分输入域并选取划分后子域的中心点作为待执行的测试用例,随后采取优先级策略,将待执行的测试用例分为3种不同优先等级并依次执行.迭代划分和中心采样仅需要已知输入域的空间信息,优先级执行则考虑了测试用例的不同空间特性,上述3种操作均仅需要很少的时间开销并力求实现测试用例在输入域上的均匀分布,以提高失效检测能力.该文通过理论分析给出了IPT-PS检测出对应失效所需测试用例数量的上界,并通过一系列实验结果表明:IPT-PS在仅使用接近随机测试时间开销的情况下,可以获得与适应性随机测试相近甚至更好的失效检测能力,是一种高效的测试方法.
文摘The synchronization problem under two cases is considered. One is that the bound on the uncertainty existing in the controller is known, the other is that the bound is unknown. In the latter case, the simple adaptation laws for upper bound on the norm of the uncertainty is proposed. Using this adaptive upper bound, a variable structure control is designed. The proposed method does not guarantee the convergence of the adaptive upper bound to the real one but makes the system asymptotically stable.
文摘In this paper, we propose an improved Directed Acyclic Graph Support Vector Machine （DAGSVM） for multi-class classification. Compared with the traditional DAGSVM, the improved version has advantages that the structure of the directed acyclic graph is not chosen random and fixed, and it can be adaptive to be optimal according to the incoming testing samples, thus it has a good generalization performance. From experiments on six datasets, we can see that the proposed improved version of DAGSVM is better than the traditional one with respect to the accuracy rate.
基金supported by the National Natural Science Foundation of China(Nos.61173151,61472309,and 61303217)the Fundamental Research Funds for the Central Universities,China(No.JB140115)the Natural Science Foundation of Shaanxi Province,China(Nos.2013JQ8002 and 2014JQ8313)
文摘Identity-based signature has become an important technique for lightweight authentication as soon as it was proposed in 1984.Thereafter,identity-based signature schemes based on the integer factorization problem and discrete logarithm problem were proposed one after another.Nevertheless,the rapid development of quantum computers makes them insecure.Recently,many efforts have been made to construct identity-based signatures over lattice assumptions against attacks in the quantum era.However,their efficiency is not very satisfactory.In this study,an efficient identity-based signature scheme is presented over the number theory research unit(NTRU) lattice assumption.The new scheme is more efficient than other lattice-and identity-based signature schemes.The new scheme proves to be unforgeable against the adaptively chosen message attack in the random oracle model under the hardness of the γ-shortest vector problem on the NTRU lattice.
