检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京理工大学计算机科学与技术学院,江苏南京210094
出 处:《系统仿真学报》2008年第3期657-661,共5页Journal of System Simulation
基 金:国家自然科学基金(60672074);江苏省自然科学基金(BK2006569)
摘 要:当前影响协同虚拟环境规模扩展性的首要问题是控制用户之间的网络数据传输,兴趣管理方法是一种有效的解决技术。针对现有兴趣管理方法在大规模协同虚拟环境领域的不足,提出了一种适用于大规模协同虚拟环境的兴趣管理放法。该方法首先采用网格划分空间进行判断,将对象的感兴趣对象集合快速收敛到一个较小的范围,然后利用空间交互感知机制以及协作感知机制计算对象之间的感知强度,并以此为基础划分兴趣层次进行分级兴趣管理。实验结果表明该方法能有效地过滤数据,提高网络资源的利用率。Currently, the key problem that limits Collaborative Virtual Environment's scalability is how to control network data transmission between participants. Interest Management is an effective technology, but the existing Interest Management methods are not suitable to large scale Collaborative Virtual Environment. A novel Interest Management method oriented to large scale Collaborative Virtual Environment was devised. First, the method converges objects' interest aggregated to small range using grids to partitions space. Then the method calculated the awareness intensity using space interaction awareness and collaboration awareness mechanisms. Based on awareness intensity calculation, interest levels and multi-level Interest Management were proposed. The efficiency of data's filtration and network resource's utilization were indicated by the simulation experiment's results.
关 键 词:协同虚拟环境 兴趣管理 空间交互感知 协作感知 网格
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.21.248.40