ID 原文 译文
45906 在感知不同的虚拟机应用特征环境的基础上，使用 GM(1,N)灰色预测模型对每次迭代周期产生的内存脏页面数进行预测。 Then, different virtual machine application characteristics were perceived, with which the number of dirty memory pages produced during the migrations was predicted by the use of GM(1,N) grey prediction model.
45907 同时使用残差修正进行误差调整，使预测结果更可靠， At the same time, using residual correction to adjust error makes results more reliable.
45908 结合预测的内存脏页面数量进行网络带宽动态预留调整。 According to the prediction of memory dirty pages, network bandwidth was adjusted and reserved.
45909 实验表明：与传统的 pre-copy 策略相比，本方法在含网络密集型应用或内存密集应用的虚拟机迁移时，能够有效提高网络性能，降低迁移时间。 Compared with the traditional pre-copy strategy, the given experiments show that the optimized strategy proposed can improve the performance of network and reduce migratory cost for the memory-intensive and network-intensive applications.
45910 提出了一种能够应用于树形结构的拜占庭容错系统，并给出了基于深度与广度的拜占庭节点上限算法。 A tree topology based Byzantine fault tolerance system was designed and the calculation of the Byzantine node bound based on depth and width was given.
45911 通过对树进行群组划分，设计了一致性协议，保障了系统的安全性； The consistency protocol was designed through divide the tree into groups by communication and work, which guaranteed the safety of system.
45912 通过联合签名机制决定节点的权限； The access of a node was determined with joint signature mechanism.
45913 通过视图转换协议将高层拜占庭节点置换到叶子节点，保证了系统的活性。 The Byzantine nodes were placed to the leaves by view change protocol, which guaranteed the liveness of the system.
45914 在传统协议的基础上，该系统支持多任务同时执行，减少了节点间通信量，较大地降低了系统的空间复杂度，提高了系统的可行性，进一步缩小了与非拜占庭系统的差距。 On the foundation of traditional protocol, the new protocol support multiple tasks operating at the sametime, and communication between nodes is largely decreased, as well as the space complexity, hence the feasibility being promoted, and the gap between Byzantine fault tolerance system and the non-Byzantine systems being narrowed.
45915 空气质量预监测已成为一种迫切需求，而这是一个复杂的系统工程。 Air quality forecast has become an urgent need. However, numerical forecast of air quality is a complex systems engineering.