| ID | 原文 | 译文 |
| 3763 | 基于 Gossip 协议提出一种在区块链网络的共识节点和验证节点间的区块分层传播机制。 | A block layeredpropagation mechanism between consensus node and verified node was proposed based on the Gossip protocol. |
| 3764 | 然后，推导了区块传播时延模型以及区块链网络的去中心化评估模型，同时对区块传播时延以及网络去中心化程度进行均衡化分析。 | The block propagation delay model and decentralization evaluation model of blockchain networks were derived. The trade-off betweenthe block propagation delay and the decentralization degree of networks was analyzed. |
| 3765 | 仿真结果表明，随着共识节点的能力最小值增加，区块传播时延、区块链网络去中心化程度减小。 | The simulation results demonstratethat the block propagation delay and degree of network decentralization decrease with the increase of minimal capabilities ofconsensus nodes. |
| 3766 | 作为应用示例，针对确诊患者轨迹数据共享场景，基于以太坊开发平台进行了数据共享智能合约的实现和测试。 | As an application example, in the trajectory data sharing scenario of confirmed patients, the data sharingsmart contract is implemented and tested based on the Ethereum development platform. |
| 3767 | 针对无线供能边缘计算网络，提出了一种兼顾边缘服务器有限计算能力的系统计算能效最大化资源分配方法。 | For wireless powered mobile edge computing (MEC) network, a system computation energy efficiency (CEE)maximization scheme by considering the limited computation capacity at the MEC server side was proposed. |
| 3768 | 具体而言，通过联合优化边缘服务器和用户的计算频率与时间、边缘用户的发射功率与卸载时间、能量收集时间、本地计算时间及专用能量站的发射功率来建立一个系统计算能效最大化的优化问题。 | Specifically,a CEE maximization optimization problem was formulated by jointly optimizing the computing frequencies and execu-tion time of the MEC server and the edge user(EU), the transmit power and offloading time of each EU, the energy har-vesting time and the transmit power of the power beacon. |
| 3769 | 由于所建立的问题是一个高度非凸的分式规划问题且难以求解，因此首先通过引入广义分式规划理论将原问题转化为一个减式非凸问题，然后利用一系列辅助变量将其转化为一个等价的凸问题，并据此提出一种迭代算法来获取原问题的最优解。 | Since the formulated optimization problem was a non-convexfractional optimization problem and hard to solve, the formulated problem was firstly transformed into a non-convex sub-traction problem by means of the generalized fractional programming theory and then transform the subtraction probleminto an equivalent convex problem by introducing a series of auxiliary variables. |
| 3770 | 仿真结果验证了所提迭代算法的快速收敛性，并通过与其他方案进行比较，证明了所提的资源分配方案能够取得更高的系统计算能效。 | On this basis, an iterative algorithm toobtain the optimal solutions was proposed. Simulation results verify the fast convergence of the proposed algorithm andshow that the proposed resource allocation scheme can achieve a higher CEE by comparing with other schemes. |
| 3771 | 现有跨数据集行人再识别方法一般致力于减小 2 个数据集之间的数据分布差异，忽略了背景信息对识别性能的影响。 | The existing cross-dataset person re-identification methods were generally aimed at reducing the difference ofdata distribution between two datasets, which ignored the influence of background information on recognition perfor-mance. |
| 3772 | 针对上述问题，提出了一种基于多池化融合与背景消除网络的跨数据集行人再识别方法。 | In order to solve this problem, a cross-dataset person re-ID method based on multi-pool fusion and backgroundelimination network was proposed. |