为提高网格环境下海量空间数据管理与并行化处理效率,将网格环境下的分布并行处理技术与空间索引相融合,提出了一种空间索引框架(grid slot and hash Rtree,GSHR-Tree).该索引树结构基于散列hash表和动态空间槽,结合R树结构的范围查询...为提高网格环境下海量空间数据管理与并行化处理效率,将网格环境下的分布并行处理技术与空间索引相融合,提出了一种空间索引框架(grid slot and hash Rtree,GSHR-Tree).该索引树结构基于散列hash表和动态空间槽,结合R树结构的范围查询优势和哈希表结构的高效单key查询,分析改进了索引结构的组织和存储.构造了适合于大规模空间数据的网格并行空间计算的索引结构,该索引树算法根据空间数据划分策略,动态分割空间槽,并将它们映射到多个节点机上.每个节点机再将其对应空间槽中的空间对象组织成R树,以大节点R树方式在多个节点上分布索引数据.以空间范围查询并行处理的系统响应时间为性能评估指标,通过模拟实验证明,该GSHR-Tree索引满足了当前网格环境空间索引的需要,并具有设计合理、性能高效的特点.展开更多
文章介绍了美国明尼苏达大学(University of Minnesota)的一项有关仔猪福利方面的研究。此项研究的目的是确定料槽对保育期生长快慢和仔猪行为的影响。保育猪n=192;初始重(7.4±1.6)kg)置于24个圈栏中(每圈8头),其中12个猪圈配备了...文章介绍了美国明尼苏达大学(University of Minnesota)的一项有关仔猪福利方面的研究。此项研究的目的是确定料槽对保育期生长快慢和仔猪行为的影响。保育猪n=192;初始重(7.4±1.6)kg)置于24个圈栏中(每圈8头),其中12个猪圈配备了2个槽口的料槽(另外12个圈配5个槽口料槽)。根据商品猪上市时校正体重,将猪分为生长较慢(SG)和生长较快(FG)两组(SG<105 kg;FG≥105 kg)。进入保育舍后头4 d和第21天对仔猪的行为进行录像记录,9周龄时对96头试验猪进行摄食率测定。研究结果表明,属于SG组的猪用于饮水的时间较FG组要长(P<0.05);与配有2个槽口的相比,属于SG组里配有5个槽口圈栏的猪站或走的时间要少(P<0.05)。这些结果表明,提供更多槽口的喂料器可能有利于改善猪的福利。展开更多
Abstract: In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism inclu...Abstract: In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism includes two novel algorithms: a source-based multicast tree topology construction algorithm followed by an interference-aware multieast scheduling algorithm. The proposed multicast interfer- ence-aware scheduling algorithm can be ap- plied to both source-based and rendez- vous-based multicast tree topologies. Results of our simulation study show that in compari- son to the mechanism used for the IEEE 802.16's standard, the proposed multicast tree generation algorithm reduces the number of consumed mini-slots by 64% on average. Moreover, using the proposed interfer- ence-aware scheduling algorithm decreases the number of required mini-slots by a further 22% on average. Therefore, the proposed mul- ticast scheduling mechanism shows a higher throughput than the previous approaches and it is more scalable with respect to increasing the number of multicast groups as well as in- creasing the number of members inside each multicast group.展开更多
文摘为提高网格环境下海量空间数据管理与并行化处理效率,将网格环境下的分布并行处理技术与空间索引相融合,提出了一种空间索引框架(grid slot and hash Rtree,GSHR-Tree).该索引树结构基于散列hash表和动态空间槽,结合R树结构的范围查询优势和哈希表结构的高效单key查询,分析改进了索引结构的组织和存储.构造了适合于大规模空间数据的网格并行空间计算的索引结构,该索引树算法根据空间数据划分策略,动态分割空间槽,并将它们映射到多个节点机上.每个节点机再将其对应空间槽中的空间对象组织成R树,以大节点R树方式在多个节点上分布索引数据.以空间范围查询并行处理的系统响应时间为性能评估指标,通过模拟实验证明,该GSHR-Tree索引满足了当前网格环境空间索引的需要,并具有设计合理、性能高效的特点.
文摘Abstract: In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism includes two novel algorithms: a source-based multicast tree topology construction algorithm followed by an interference-aware multieast scheduling algorithm. The proposed multicast interfer- ence-aware scheduling algorithm can be ap- plied to both source-based and rendez- vous-based multicast tree topologies. Results of our simulation study show that in compari- son to the mechanism used for the IEEE 802.16's standard, the proposed multicast tree generation algorithm reduces the number of consumed mini-slots by 64% on average. Moreover, using the proposed interfer- ence-aware scheduling algorithm decreases the number of required mini-slots by a further 22% on average. Therefore, the proposed mul- ticast scheduling mechanism shows a higher throughput than the previous approaches and it is more scalable with respect to increasing the number of multicast groups as well as in- creasing the number of members inside each multicast group.