• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Evidence-based trust in distributed agent systems.
【24h】

Evidence-based trust in distributed agent systems.

机译：分布式代理系统中基于证据的信任。

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

摘要

Trust is a crucial basis for interactions among parties in large, open distributed systems. Yet, the scale and dynamism of such systems make it infeasible for each party to have a direct basis for trusting another party. For this reason, the participants in an open system must share information about trust. Traditional models of trust employ simple heuristics and ad hoc formulas, without adequate mathematical justification. These models fail to properly address the challenges of combining trust from conflicting sources, dealing with malicious agents, and updating trust.;This dissertation understands an agent Alice's trust in an agent Bob in terms of Alice's certainty in her belief that Bob is trustworthy. Unlike previous approaches, this dissertation formulates certainty in terms of a statistical measure defined over a probability distribution of the probability of positive outcomes. Specifically this dissertation makes the following contributions. It (1) Develops a mathematically well-formulated approach for an evidence-based account of trust; proves desirable properties of certainty; and establishes a bijection between evidence and trust. (2) Defines a concatenation, an aggregation, and a selection operator to propagate trust, and proves desirable properties of these operators. (3) Develops trust update mechanisms and formally analyzes their properties. (4) Extends the definition of certainty from binary events to multivalued events. Establishes a bijection between Dempster-Shafer belief space and evidence space, and defines a novel combination operator, which is commutative and associative. In contrast with traditional combination operators, which ignore conflict and sometimes yield counterintuitive results, the proposed operator treats conflict naturally.
机译：信任是大型开放式分布式系统中各方之间进行交互的重要基础。但是，这种系统的规模和动态性使得每一方都不可能有直接的基础来信任另一方。因此，开放系统中的参与者必须共享有关信任的信息。传统的信任模型采用简单的启发式方法和特殊公式，没有足够的数学依据。这些模型无法正确解决合并冲突来源的信任，处理恶意代理以及更新信任的挑战。与以前的方法不同，本论文根据对阳性结果概率的概率分布定义的统计量来确定确定性。具体而言，本论文做出了以下贡献。它（1）为以证据为基础的信任发展了数学上格式正确的方法；证明理想的确定性；并在证据和信任之间建立了双射。 （2）定义级联，聚合和选择运算符以传播信任，并证明这些运算符的理想属性。 （3）开发信任更新机制并正式分析其属性。 （4）将确定性的定义从二进制事件扩展到多值事件。在Dempster-Shafer信念空间和证据空间之间建立双射，并定义了一个新颖的组合算子，该算子是可交换的和关联的。与传统的组合运算符相比，后者忽略冲突，有时会产生违反直觉的结果，而提出的运算符自然地对待冲突。

著录项

  • 作者

    Wang, Yonghong.;

  • 作者单位

    North Carolina State University.;

  • 授予单位 North Carolina State University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2009
  • 页码 90 p.
  • 总页数 90
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

  • 入库时间 2022-08-17 11:38:30

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号