检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院,辽宁沈阳110004
出 处:《东北大学学报(自然科学版)》2007年第5期656-659,共4页Journal of Northeastern University(Natural Science)
基 金:国家自然科学基金资助项目(60473031)
摘 要:现有的单粒度信任模型不能很好地解决可信度计算的粒度问题,而多粒度模型在度量节点可信度时,仅考虑了相关领域的包含关系,欠缺对相交关系的考虑.据此,提出了一种新的Peer-to-Peer环境下的多粒度信任模型,该模型可以针对节点在具体的领域计算其可信度,并在计算过程中考虑了相关领域的相交关系.首先给出了领域模型的定义,在此基础上给出了信任模型的定义,然后对模型的迭代收敛问题以及可信度的分布式放置和获取问题作了深入的探讨.分析表明,该模型较已有模型在可信度计算的粒度及工程可行性等方面有较大的提高.The current single trust model can not deal with the trust computation well for different aspects and, on the other hand, the multiple-grain trust model only considers the inclusion relation between different domains but takes no account of their intersection relation. A novel Peer-to-Peer trust model is thus presented on the basis of domain model, which considers both the trust computation of different aspects and the intersection relation between different domains. Defining the domain model, the trust model is formally defined. Then, the convergence of iteration for trust computation is analyzed and the methods of distributed placement and acquisition of trust are given. Compared to the current trust model, the proposed one is more precision in trust computation of multiple aspects and more feasible in practical projects to compute peer trust.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.4