ID	原文	译文
46926	改进传统 ACO 算法，设计一种包含单景区内所有景点的游览路径生成算法，帮助用户检索旅游景点中优质资源并规划有效的游览路径。	To help users searching high-quality resources and planning aneffective tour path, a tour path generation algorithm was designed which contained all the attractions in the scenic area byusing the HITS algorithm to evaluate the attraction and improving the traditional ACO algorithm.
46927	为评估景区热点和路线规划方法的效果，进行多种算法对比实验，	The multi algorithmcomparison experiment was conducted to evaluate the effectiveness of the hot spots and route planning methods.
46928	结果表明所选方法具备高效性和实用性。	The re-sults show that the method is efficient and practical.
46929	在格上利用 2 个不同的加密方案及拉格朗日插值多项构造了一个可重新拆分的门限多代理者的代理重加密方案，即在密文输入输出面与重加密面的加密方案是不同的，这使噪音的界有更宽的选择范围。	Two different encryption schemes and Lagrange polynomial were used to construct a resplittable thresholdmulti-broker proxy re-encryption scheme on the lattice, namely the encryption in the ciphertext input and output side wasdifferent from the encryption in the re-encryption side which make the bound of noise was more relaxed.
46930	另外，门限多代理者不仅保证了重加密密钥的安全性，而且当个别代理不能提供正常服务时，重加密方案仍能正确工作。	Threshold multiproxy not only ensure the safety of re-encryption key, but also ensure re-encryption scheme can still work even if the in-dividual proxy could not provide normal services.
46931	该方案证明是 IND-UniRTPRE-CPA 安全的。	The scheme is proven IND-UniRTPRE-CPA secure.
46932	针对协作认知网络设计了一种高能效（energy efficiency）最佳中继协作传输方案（BCT）。	An innovative EE-oriented cooperative sensing and transmission scheme in relay-assisted cognitive radio net-works, called energy-efficient best-relay cooperative transmission (BCT) was proposed.
46933	基于 BCT 机制，考虑次级中断概率为约束条件，在衰落信道下建模了以感知时间与功率为优化变量的系统平均能效最大化问题。	Based on the BCT scheme, meanenergy efficiency (MEE) maximization problem with sensing duration and transmitting power as optimization variableswas modeled for fading channels under constraint of minimal secondary outage probability.
46934	借助 Jensen 不等式，并将原问题分解成 2 个相对独立的子问题来分别求解感知时间与功率分配，	By virtue of Jensen’s inequa-lity, the original optimization problem was decomposed into two relatively independent subproblems which solved sens-ing duration and power allocation respectively.
46935	提出了一种高效的交叉迭代算法得到系统次优解。	And for the two subproblems, an efficient cross iteration based algorithmwas proposed to obtain the suboptimal solutions.