• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science - ICCA 2003 Pt.2 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia >Data Loss Reparation Due to Indeterminate Fine-Grained Parallel Computation
【24h】

Data Loss Reparation Due to Indeterminate Fine-Grained Parallel Computation

机译：不确定的细粒度并行计算导致的数据丢失修复

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The new method of a gap recovery in symbol sequences is presented. A covering is combined from the suitable reasonably short strings of the parts of a sequence available for an observation. Two criteria are introduced to choose the best covering. It must yield the maximum of entropy of a frequency dictionary developed over the sequence obtained due to the recovery, if an overlapping combined from the copies of strings from the available parts of the sequence exists. The second criterion identifies the best covering in case when one has to use any string to cover the gap; here the best covering must yield the minimum of specific entropy of the frequency dictionary developed over the available parts of the sequence against that one developed over the entire sequence obtained due to the recovery. Kirdin kinetic machine that is the ideal fine-grained structureless computer has been used to resolve the problem of the reconstruction of a gap in symbol sequence.
机译：提出了一种新的符号序列间隙恢复方法。覆盖是由可用于观察的序列的各个部分的适当合理的短字符串组合而成。引入了两个标准来选择最佳覆盖率。如果存在来自序列可用部分的字符串副本的重叠组合，则它必须产生在因恢复而获得的序列上开发的频率字典的最大熵。第二个标准是确定最佳覆盖率，以防万一必须使用任何字符串来填补空白。在这里，最好的覆盖范围必须使在序列的可用部分上形成的频率字典的特定熵的最小值与在由于恢复而获得的整个序列上形成的频率字典的熵相比的最小值。 Kirdin动力学机器是理想的细粒度无结构计算机，已用于解决符号序列中间隙的重建问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号