• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IAENG transactions on engineering technologies >Labeling the Nodes in the Intrinsic Order Graph with Their Weights
【24h】

Labeling the Nodes in the Intrinsic Order Graph with Their Weights

机译：在内部顺序图中用权重标记节点

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

摘要

This chapter deals with the study of some new properties of the intrinsic order graph. The intrinsic order graph is the natural graphical representation of a complex stochastic Boolean system (CSBS). A CSBS is a system depending on an arbitrarily large number n of mutually independent random Boolean variables. The intrinsic order graph displays its 2~n vertices (associated to the CSBS) from top to bottom, in decreasing order of their occurrence probabilities. New relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1 -bits in a binary n -tuple) are derived. Further, the distribution of the weights of the 2~n nodes in the intrinsic order graph is analyzed.
机译：本章研究内在有序图的一些新特性。内在有序图是复杂随机布尔系统（CSBS）的自然图形表示。 CSBS是一种系统，它依赖于相互独立的随机布尔变量的任意数量的n。内在顺序图从上到下显示其2〜n个顶点（与CSBS关联），并按其出现概率的降序排列。推导了固有排序和汉明权重之间的新关系（即二进制n元组中1位的数目）。进一步分析了本征阶图中2〜n个节点的权重分布。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号