查找具有混合字母大小的数组
Locating arrays with mixed alphabet sizes
摘要：
定位阵列（LA）可以用来检测和识别基于组件的系统中的因素之间的交互故障。在所有因素具有相同值的假设下，具有单故障的LA的最优性和构造已经被广泛地研究。然而，在现实生活中，系统中的不同因素具有不同数量的可能值。因此，地方当局必须符合这些规定。我们在这里建立了一个一般的下界的大小混合级$(\bar{1},t)$定位阵列。给出了几种构造LA的方法，包括直接构造和递归构造。特别地，描述了产生满足下界的最优LA的构造。此外，还给出了满足该下界的最优LA序列。
英文摘要：
Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault have been investigated extensively under the assumption that all the factors have the same values. However, in real life, different factors in a system have different numbers of possible values. Thus, it is necessary for LAs to satisfy such requirements. We herein establish a general lower bound on the size of mixed-level $(\bar{1},t)$-locating arrays. Some methods for constructing LAs including direct and recursive constructions are provided. In particular, constructions that produce optimal LAs satisfying the lower bound are described. Additionally, some series of optimal LAs satisfying the lower bound are presented.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
