ID 原文 译文
46456 仿真实验结果表明，与D-ViNE、R-ViNE 以及 RW-BFS 相比，蚁群混合遗传算法能有效地将虚拟网络请求的接受率提高 10%，并较好地改善了节点和链路的平均利用率以及映射的收益成本比值。 Simulation experiment results show that acceptance rate of virtual network requests can be increased by 10% efficiently using the antcolony hybrid genetic algorithm, compared with existing mapping algorithms D-ViNE, RW-BFS and R-ViNE. Furthermore, proposed method can greatly improve the average utilization rate of nodes and links and the ratio of the mappingincome to cost.
46457 现有的关联规则推荐技术在数据提取时主要侧重于关联规则的提取效率，缺乏对冷、热门数据推荐平衡性的考虑和有效处理。 Existing association rule recommendation technologies were focus on extraction efficiency of association rule in data mining. However, it lacked consideration of recommendation balance between popular and unusual data and efficient processing.
46458 为了提高个性化推荐效率和推荐质量，平衡冷门与热门数据推荐权重，对关联规则的Apriori 算法频繁项集挖掘问题进行了重新评估和分析，定义了新的测评指标推荐非空率以及 k 前项频繁项集关联规则的概念， In order to improve the quality and efficiency of personalized recommendation and balance the recommendation weight of cold and hot data, the problem of mining frequent itemset based on association rule was revaluation analyzed, a new evaluation metric called recommendation RecNon and a notion of k-pre association rule were defined,and the pruning strategy based on k-pre frequent itemset was designed.
46459 设计了基于 k 前项频繁项集的剪枝方法，提出了优化 Apriori 算法且适合不同测评标准值的 k前项频繁项集挖掘算法，降低频繁项集提取的时间复杂度。 Moreover, an association rule mining algorithm-based on the idea was proposed, which optimized the Apriori algorithm and was suitable for different evaluation criteria,reduced the time complexity of mining frequent itemset.
46460 理论分析比较与实验表明，k 前项剪枝方法提高了频繁项集的提取效率，拥有较高的推荐非空率、调和平均值和推荐准确率，有效地平衡了冷、热门数据的推荐权重。 The theoretic analysis and experiment results on the algorithm show that the method improved the efficiency of data mining and has higher RecNon, F-measure and precision of recommendation, and efficiently balance the recommendation weight of cold data and popular one.
46461 现有的基于传统公钥密码体制（PKI, public key infrastructure）和基于身份的密码体制（IBC, identity-basedcryptosystem）之间的异构签密方案都有一定的缺陷，基于此，提出一种新的双向的基于 PKI 和 IBC 的异构签密方案。 Exiting heterogeneous sign encryption schemes which were between public key infrastructure (PKI) and identity-based cryptosystem (IBC) have some limitations. A new heterogeneous sign encryption scheme between PKI and IBC was proposed.
46462 在随机预言模型中和在基于计算性 Diffie-Hellman 困难问题（CDHP, computational Diffie-Hellman problem）、q-Diffie-Hellman 逆问题（q-DHIP, q-Diffie-Hellman inversion problem）和双线性 Diffie-Hellman 困难问题（BDHP,bilinear Diffie-Hellman problem）的假设下，该方案满足机密性和不可伪造性。 In the random oracle mode, the scheme ensured confidentiality and unforgeability on the basis of the assumption of computational Diffie-Hellman problem (CDHP), q-Diffie-Hellman inversion problem (q-DHIP) and bilinear Diffie-Hellman problem (BDHP).
46463 同时，该方案还满足密文的无连接性和匿名性。 Simultaneously, the proposed scheme guaranteed unconnectedness and anonymity of the ciphertext.
46464 与已有同类异构签密方案对比，该方案不仅实现了签密的双向性，而且在PKI 和IBC 生成系统参数时不作限制，更加符合实际的应用环境。 Compared with other heterogeneous schemes, the scheme achieved two-way sign encryption, and it generated parameters without restrict, which was suitable for actual situations.
46465 模拟实验表明，该方案具有可行性，并且满足用户对系统响应时间的要求。 Simulation tests show that proposed scheme is feasible.