欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
一个大小为N、度为足、取值为v、强度为t的t-维组合覆盖阵是一个N×k矩阵，其取值为v的符号集，并且任意N×t子矩阵的行都至少包含取值为1，符号集的任-t元组一次．提出了一种基于差阵的t-维组合覆盖阵代数递归构建新方法，该方法在已有的覆盖阵基础上可大规模地扩展参数个数，实现任意t个参数组合的有效覆盖（f≥2），是一种实用的生成高维组合覆盖阵代数递归新方法．同时，给出了该新方法的理论推导与算法实现．
英文摘要：
A t-covering array of size N, degree k, order v and strength t is an N x k array with entries from a set of v symbols such that any N x t subarray contains a t-tuple of v symbols at least once as a row. This paper presents a new algebraic recursive method for constructing covering arrays based on difference matrices. The method can extend parameter factors on the existing covering arrays and cover all the combinations of any t parameter factors （t≥2）. The method, which recursively generates high strength covering arrays, is practical. Meanwhile, the theoretical derivation and realization of the proposed algebraic recursive algorithm are given.
同期刊论文项目
同项目期刊论文
An XML query rewriting mechanism with multiple ontologies integration based on complex semantic mapp
期刊信息
位置：