ID	原文	译文
46946	为此，提出一种网络编码云存储数据更新算法，	To solve this problem, a network coding cloud storage data updating algorithm was pro-posed.
46947	存储节点只需要根据服务器发送的差值矩阵，更新部分编码块，就可以完成整个文件的更新。	Just by sending files change difference matrix, the storage node could update parts of the coding block accordinglywhich could complete the entire update files.
46948	实验结果表明，所提算法和 RS 编码、Tornado 编码相比，在保证了数据安全的前提下大大提高了数据更新和数据重构的效率。	Experimental results show that compared with RS coding and Tornado cod-ing, the algorithm can not only ensure data security, but also greatly improve the efficiency of data update and data recon-struction.
46949	提出了一种基于马尔可夫链的轻量级机会路由转发策略（MOR），	A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.
46950	该方法将网络运行划分为多个等距的时间周期，利用活跃度描述节点每个周期的随机相遇状态，	In thescheme, the execute process of network was divided into a plurality of equal time period, and the random encounter stateof node in each time period was represented by activity degree.
46951	多个连续周期的状态序列构成一个离散的马尔可夫链，将节点活跃度评估转换为状态预测问题，	The state sequence of a plurality of continuous time pe-riod constitutes a discrete Markov chain.
46952	利用马尔可夫模型预测相遇节点后续周期的状态，有效地提高了节点活跃度评估的准确性。	The activity degree of encounter node was estimated by Markov model to pre-dict its state of future time period, which can enhance the accuracy of activity degree estimation.
46953	构建了基于节点活跃度和平均相遇间隔的综合效用评估方法，	Then, the method ofcomprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounterinterval.
46954	节点是消息转发决策的依据，	MOR used the utility of node for making a routing forwarding decision.
46955	节点只需维护前一周期的状态和状态转移概率矩阵，以及记录与其他节点平均相遇间隔的向量表，	Each node only maintained a state oflast time period and a state transition probability matrix, and a vector recording the average encounter interval of nodes.