其中包括使用普通gcc、ccache + gcc、ccache +distcc + gcc所需的编译时间，编译在一个四节点网络中进行并选用了不同的并发distcc作业数目值。
I've included The Times for building with plain GCC, ccache + GCC, and ccache + distcc + GCC in a four-node network with various values of concurrent distcc jobs.
为什么在同一图BFS给出不同的节点位置不同的运行时间？
Why does BFS gives different running time for different node positions in same graph?
索引树的结构决定了平均访问索引节点的数目，但是即使对于相同的索引结构，如果采用不同的广播序列，则平均访问时间也不尽相同。
The structure of the index tree decides the average index number to be visited, but even regarding the same index structure, the average visit time is different if the broadcast sequence is different.
通过对该电机定子温度场计算结果的后处理，得出了该电机定子运行在不同时间段里的温度分布图，以及该电机定子壳体任一节点的温升曲线。
Dealing with the calculation results of the temperature field of the motor stator, we obtain the temperature distributed diagram at not same segment, and the temperature rising the curve of any node.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
应用推荐