从原始结构着手，通过使用二进制组合算法来产生一系列具有不同节点分布的子结构，即拓扑组。
Starting with a ground structure, we use binary number combinatorial algorithm to generate a number of topologies, which are a sequence of substructures with different node distributions.
为了避免结果奇异，在优化过程中，给被删去的构件一个微小的截面积，使一个给定的拓扑组的结构维数保持不变。
In order to avoid a singular solution, we keep the dimension of the truss for a given topology unchanged by giving the truss member to be removed a tiny cross-sectional area.
如果消息传递拓扑无法保证顺序，则无法无法百分之百地确定组中所有其他消息已经达到。
If the messaging topology is such that ordering cannot be guaranteed, then we cannot be 100% sure that all of the other messages in the group have arrived.
应用推荐