每个节点的分形权值是根据文章被分割的子块中的句子的权重的总和计算出来的。
The fractal value of each node is calculated as the sum of sentence weights ofthe sentences under the range-block.
证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。
In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.
根据源文件的结构和描述，一个源文件被分成一些子块，形成一棵分形树。
The source document is partitioned into range-blocks according to document structure and represented as a fractal tree.
应用推荐