1) interested trees
兴趣树
1.
In this paper a new service restoration algorithm is recommended, which regards source and unsupplied loads as an interested point, and simplifies the problem by finding interested trees of a given graph according to the radial character of distribution system.
文中介绍的算法根据配电网的辐射状结构特征，把电源点和失去供电的负荷点看作“兴趣点”，把寻找供电路径转化为求解给定图的“兴趣树”，从而简化了问题。
2) Interest category tree
兴趣分类树
3) interest rule tree
兴趣规则树
4) user interest tree
用户兴趣树
5) balance interest tree
平衡兴趣树
1.
Spatial data service scheduling algorithm of P2P networks based on balance interest tree
基于平衡兴趣树的P2P空间数据服务调度
6) user interest hierarchy tree
用户兴趣层次树
1.
Namely,the principle of Zipf distribution is introduced to find out the latent semantic space of files,where the user interest is clustered according to underlying factors and a user interest hierarchy tree is built in.
即先通过Zipf分布原理找到文档的潜在语义空间,在此空间中对用户的兴趣进行聚类,并建立用户兴趣描述文件(user profile),即建立用户兴趣层次树。
补充资料：海南龙血树（小花龙血树）
百合科Liliaceae
乔木状，高3-4m。叶聚生于茎和枝顶，几呈套叠状，长约70cm，抱茎，无柄。圆锥花序长约30cm，花序轴无毛或近无毛。分布于海南西南部，生于背风区的干燥砂土上。越南、柬埔寨也有分布。国家三级保护濒危种。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条