ID 原文 译文
5224 其次构建了基于业务操作时间间隔的区块链网络隐蔽信道的场景； Then, a blockchain network covert channelscenario using service operation interval time was presented.
5225 最后提出了包含抗检测性、顽健性、传输效率的区块链网络隐蔽信道评估向量，为基于区块链环境的新型网络隐蔽信道的实用化奠定了理论基础。 Finally, the undetectability, robustness and rate of theblockchain network covert channel evaluation vectors was proposed. A theoretical foundation was laid for the practicalityof the new type of network covert channel in blockchain.
5226 电子商务等网络服务的兴起极大地促进了电子凭据业务的发展，传统数据存储方案无法满足海量电子凭据数据的快速访问需求。 The rise of e-commerce and other network services have greatly promoted the development of electronic billservice, while traditional data storage schemes can no longer satisfy the rapid access requirements of massive electronicbill data.
5227 针对上述问题，提出了一种面向海量电子凭据的分层可扩展存储架构，结合 hash 取模算法和一致性 hash 算法实现快速的数据定位，设计了基于 hash 取模算法的横向扩展方案，减少了节点增删时迁移的数据量。 To solve these problems, a hierarchical scalable storage architecture for massive electronic bill was proposed,which combined hash modular algorithm and consistent hash algorithm, and supported fast data locating. A horizontalexpansion scheme based on hash modular algorithm was designed to reduce the amount of data that needed to migratewhen adding or deleting data nodes.
5228 此外，设计并实现了基于热数据的缓存方案和基于访问时延的负载均衡方案，进一步提升数据访问的速度。 Besides, a data caching scheme based on hot data and a load balancing scheme basedon access delay were designed and implemented, further improving the speed of data access.
5229 最后通过实验证明了所提架构与方案的有效性。 Finally, the experimentsprove the effectiveness of proposed architecture and schemes.
5230 随着社交网络应用的不断发展，用户社交关系等个人隐私数据的安全保护问题亟待解决。 With the continuous development of social network application, user's personal social data is so sensitive that the problem of privacy protection needs to be solved urgently.
5231 为显著减小社交网络数据的敏感度，提出了一种基于边介数模型的差分隐私保护方案 BCPA。 In order to reduce the network data sensitivity, a differen-tial privacy protection scheme BCPA based on edge betweenness model was proposed.
5232 基于 dK 模型捕获图结构对应的2K 序列，根据边中介中心性系数对 2K 序列重新排序； The 2K sequence corresponding to the graph structure based on the dK model was captured, and 2K sequences based on the edge betweenness centralitywere reordered.
5233 依据排序结果将 2K 序列聚类成多个子序列，再利用 dK扰动算法对各子序列分别进行加噪； According to the result of reordering, the 2K sequence was grouped into several sub-sequences, and eachsub-sequence was respectively added with noise by a dK perturbation algorithm.