一种全局上下文状态分布式协同推理方法的评价

Alexandre Skyrme, M. Endler
{"title":"一种全局上下文状态分布式协同推理方法的评价","authors":"Alexandre Skyrme, M. Endler","doi":"10.1109/SBSC.2012.8","DOIUrl":null,"url":null,"abstract":"In many occasions of our daily lives, we are willing to spontaneously interact or collaborate with nearby people for sharing ideas, chatting, saving time/money, or helping each other. For that purpose, it is often necessary to identify and reason about shared context situations that are based on distributed sources of local contexts. So far, most of the work that investigates mechanisms to support spontaneous discovery and interaction among mobile users has not thoroughly explored means of automatic detection of common Global Context States (GCS). In this paper, we discuss a distributed reasoning approach and algorithm that determines a distributed Global Context State among potentially interacting agents. We also evaluate the complexity of the algorithm - through simulation - and identify how the convergence of the algorithm is influenced by users' mobility patterns, the requested minimum number of contributing agents required to conclude a reasoning process and the volatility of each agent's local context.","PeriodicalId":257965,"journal":{"name":"2012 Brazilian Symposium on Collaborative Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Evaluation of an Approach for Distributed Cooperative Reasoning of Global Context States\",\"authors\":\"Alexandre Skyrme, M. Endler\",\"doi\":\"10.1109/SBSC.2012.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many occasions of our daily lives, we are willing to spontaneously interact or collaborate with nearby people for sharing ideas, chatting, saving time/money, or helping each other. For that purpose, it is often necessary to identify and reason about shared context situations that are based on distributed sources of local contexts. So far, most of the work that investigates mechanisms to support spontaneous discovery and interaction among mobile users has not thoroughly explored means of automatic detection of common Global Context States (GCS). In this paper, we discuss a distributed reasoning approach and algorithm that determines a distributed Global Context State among potentially interacting agents. We also evaluate the complexity of the algorithm - through simulation - and identify how the convergence of the algorithm is influenced by users' mobility patterns, the requested minimum number of contributing agents required to conclude a reasoning process and the volatility of each agent's local context.\",\"PeriodicalId\":257965,\"journal\":{\"name\":\"2012 Brazilian Symposium on Collaborative Systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Brazilian Symposium on Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBSC.2012.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Brazilian Symposium on Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBSC.2012.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在我们日常生活的许多场合,我们愿意自发地与附近的人互动或合作,分享想法,聊天,节省时间/金钱,或互相帮助。为此,通常有必要识别和推断基于本地上下文的分布式源的共享上下文情况。到目前为止,大多数研究支持移动用户之间自发发现和交互的机制的工作尚未彻底探索通用全局上下文状态(GCS)的自动检测方法。在本文中,我们讨论了一种分布式推理方法和算法,用于确定潜在交互代理之间的分布式全局上下文状态。我们还通过模拟评估了算法的复杂性,并确定了算法的收敛性如何受到用户移动模式、完成推理过程所需的最小贡献代理数量以及每个代理本地上下文的波动性的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evaluation of an Approach for Distributed Cooperative Reasoning of Global Context States
In many occasions of our daily lives, we are willing to spontaneously interact or collaborate with nearby people for sharing ideas, chatting, saving time/money, or helping each other. For that purpose, it is often necessary to identify and reason about shared context situations that are based on distributed sources of local contexts. So far, most of the work that investigates mechanisms to support spontaneous discovery and interaction among mobile users has not thoroughly explored means of automatic detection of common Global Context States (GCS). In this paper, we discuss a distributed reasoning approach and algorithm that determines a distributed Global Context State among potentially interacting agents. We also evaluate the complexity of the algorithm - through simulation - and identify how the convergence of the algorithm is influenced by users' mobility patterns, the requested minimum number of contributing agents required to conclude a reasoning process and the volatility of each agent's local context.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信