论文标题
分支点和稳定性
Branch points and stability
论文作者
论文摘要
数据集的层次结构POSET和分支点POSET都允许最小上限的微积分。一种涉及上限的方法用于表明与包含数据集相关的分支点的图是受控的同拷贝等效性，其中控件由受Hausdorff距离约束的上限关系表示。
The hierarchy poset and branch point poset for a data set both admit a calculus of least upper bounds. A method involving upper bounds is used to show that the map of branch points associated to the inclusion of data sets is a controlled homotopy equivalence, where the control is expressed by an upper bound relation that is constrained by Hausdorff distance.
