| ID | 原文 | 译文 |
| 51747 | 且验证误差的思想移植性强，可用于块稀疏压缩感知。 | It is also noted that the idea of verifying the error has strong portability, which can be used for block sparse compression sensing. |
| 51748 | 考虑基站端配备多天线的情况，将发送信号转为块稀疏模型， | Considering that the base station is equipped with multiple antennas, the transmission signal is transformed into a block sparse model. |
| 51749 | 提出验证误差的块稀疏正交匹配追踪(VE-BOMP)算法进行活跃用户数据检测。 | A Validation Error Block Sparse Orthogonal Matching Pursuit(VE-BOMP) algorithm is also proposed to detect active user data. |
| 51750 | 仿真结果表明，VE-OMP算法能够在稀疏度未知的情况下对多用户同时进行活跃性估计和数据检测， | The simulation results show that the VE-OMP algorithm can jointly detect the activity and data of the users under the condition of unknown sparsity. |
| 51751 | VE-BOMP算法可用于多天线接收系统，其检测性能随天线数的增加而提高。 | The VE-BOMP algorithm can also be used in multi antenna receiving system, and its detection performance increases with the increase of the number of antennas. |
| 51752 | 大范围灾难的发生将导致多个数据中心同时毁坏，现有内容备份策略无法完全恢复所有数据。因此，在灾难发生前需对灾难区域内数据进行转移。 | A large-scale disaster will affect multiple data centers of an optical cloud network and the contents stored in these data centers should be evacuated for recovery as soon as possible. |
| 51753 | 文章研究了内容分块(CF)数据中心光网络灾前的快速数据转移问题， | This paper addresses the problem of data evacuation in a Content-Fragmentation(CF) based optical cloud network before a large-scale disaster. |
| 51754 | 构建了混合整数线性规划(MILP)模型并提出了最小时延(LD)快速数据转移算法(简称LD算法)。 | We formulate this problem as a Mixed Integer Linear Programming(MILP) model and develop an efficient Least Delay(LD) based evacuation algorithm. |
| 51755 | LD算法的性能与MILP模型非常接近，整个网络数据转移时间接近最优解。 | Numerical results show that the performance of proposed LD algorithm is similar to that of the MILP model. |
| 51756 | 此外，仿真结果表明，在相同数据冗余度下，采用LD算法的CF数据中心光网络比内容复制数据中心光网络最多节省42%的数据转移时间。 | In addition, compared to the content replication scheme, the CF based optical cloud network using LD algorithm always takes shorter times to evacuate data. |