【24h】

On Permutation Masks in Hamming Negative Selection

机译:Hamming负选择中的置换掩码

获取原文
获取原文并翻译 | 示例

摘要

Permutation masks were proposed for reducing the number of holes in Hamming negative selection when applying the r-contiguous or r-chunk matching rule. Here, we show that (randomly determined) permutation masks re-arrange the semantic representation of the underlying data and therefore shatter self-regions. As a consequence, detectors do not cover areas around self regions, instead they cover randomly distributed elements across the space. In addition, we observe that the resulting holes occur in regions where actually no self regions should occur.
机译:提出了置换掩码,以在应用r连续或r块匹配规则时减少汉明负选择中的孔数。在这里,我们显示了(随机确定的)置换掩码重新排列了基础数据的语义表示,因此破坏了自身区域。结果,探测器不会覆盖自身区域周围的区域,而是会覆盖整个空间中随机分布的元素。此外,我们观察到,产生的孔出现在实际上不应出现自身区域的区域中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号