This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree （or/P-tree, BP-tree, and IBP-tree, respectively, for short）, for maintaining future events in a gener...This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree （or/P-tree, BP-tree, and IBP-tree, respectively, for short）, for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms have been selected and studied, that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms. The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with the event set of all the sizes and their performance is almost independent of the stochastic distributions.展开更多
通过在U-tree中添加时间戳和速度矢量等时空因素,提出一种基于U-tree的高效率当前及未来不确定位置信息检索的索引结构TPU-tree,可以支持多维空间中不确定移动对象的索引,并提出了一种改进的基于p-bound的MP_BBRQ(modifiedp-bound based...通过在U-tree中添加时间戳和速度矢量等时空因素,提出一种基于U-tree的高效率当前及未来不确定位置信息检索的索引结构TPU-tree,可以支持多维空间中不确定移动对象的索引,并提出了一种改进的基于p-bound的MP_BBRQ(modifiedp-bound based range query)域查询处理算法,能够引入搜索区域进行预裁剪以减少查询精炼阶段所需代价偏高的积分计算.实验仿真表明,采用MP_BBRQ算法的TPU-tree概率查询性能极大地优于传统的TPR-tree索引,且更新性能与传统索引大致相当,具有良好的实用价值.展开更多
文摘This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree （or/P-tree, BP-tree, and IBP-tree, respectively, for short）, for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms have been selected and studied, that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms. The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with the event set of all the sizes and their performance is almost independent of the stochastic distributions.
基金the National Special Program of Transgenic Plants Research and Development (2009ZX08-009-129B)National Natural Science Foundation of China (30971857)
文摘本研究中,通过隐马尔科夫模型(HMM)和杨树蛋白质库搜索,共找到 17 个杨树铵转运体蛋白(PtAMTs)。利用生物信息学方法,我们对杨树家族 17 条 AMT 蛋白序列的系统发生和 AMT 基因组定位进行分析,然后对其氨基酸组成成分、理化性质以及二级结构进行预测和分析,同时还分析了杨树与拟南芥、水稻、番茄、百脉根和欧洲油菜的 AMT 基因家族之间的联系。二级结构预测结果发现不同成员间氨基酸数目、氨基酸序列间的疏水性存在一定的差异;α- 螺旋和无规则卷曲为主要二级结构组成部分。同源性比对分析表明,PtAMT 基因家族主要分为 2 个亚家族,AMT1 (11 个成员)和 AMT2 (6 个成员),基因结果分析表明 AMT2 亚家族成员不含内含子。杨树 AMT 蛋白的亚细胞定位分析表明 PtAMT 主要定位于膜结构上。电子表达图谱分析结果表明:只有 XP_002309151 和 XP_002334025 基因有对应的 EST 序列,并有相应的电子表达谱,并主要在花蕾表达。
文摘通过在U-tree中添加时间戳和速度矢量等时空因素,提出一种基于U-tree的高效率当前及未来不确定位置信息检索的索引结构TPU-tree,可以支持多维空间中不确定移动对象的索引,并提出了一种改进的基于p-bound的MP_BBRQ(modifiedp-bound based range query)域查询处理算法,能够引入搜索区域进行预裁剪以减少查询精炼阶段所需代价偏高的积分计算.实验仿真表明,采用MP_BBRQ算法的TPU-tree概率查询性能极大地优于传统的TPR-tree索引,且更新性能与传统索引大致相当,具有良好的实用价值.
