ID 原文 译文
16415 最后计算每一个方形特征区域的Zernike矩，将水印信息嵌入在量化调制正则化Zernike矩的幅值当中。 Finally, the Zernike moments of each square feature area are calculated,the watermarking information is embeded to quantized modulation regularized Zernike moments.
16416 实验结果表明，Lena图峰值信噪比达到40 dB以上时，本文算法对常规图像处理以及缩放、旋转、剪切等几何攻击和组合攻击都有相对较强的鲁棒性。 Theexperimental results show that when the peak signal-to-noise ratio of the Lena reaches more than 40 dB, thealgorithm has relatively strong robustness to conventional image processing, geometric attacks such as scaling,rotation, and shearing and combined attacks.
16417 针对贝叶斯变分推理收敛精度低和搜索过程中易陷入局部最优的问题，该文基于模拟退火理论(SA)和最大期望理论(EM)， For the problem that Bayesian variational inference with low convergence precision is easy to fall intolocal optimum during search process, a Bayesian variational inference algorithm based on Expectation-Maximization (EM) and Simulated Annealing (SA) is proposed.
16418 考虑变分推理过程中初始先验对最终结果的影响和变分自由能的优化效率问题，构建了双重EM模型学习变分参数的初始先验，以降低初始先验的敏感性， The influence of the initial prior on the finalresult and the optimization efficiency of the variational free energy in the process of variational inference cannot be ignored. The double EM is introduced to construct the initial prior of the variational parameter toreduce the sensitivity of the initial prior.
16419 同时构建逆温度参数改进变分自由能函数，使变分自由能在优化过程得到有效控制，并提出一种基于最大期望模拟退火的贝叶斯变分推理算法。 And the inverse temperature parameter is introducted to improve thefree energy function, which makes the energy be effectively controlled in the optimization process. This paperuses convergence criterion theory to analyze the convergence of the algorithm.
16420 该文使用收敛性准则理论分析算法的收敛性，利用所提算法对一个混合高斯分布实例进行实验仿真，实验结果表明该算法具有较优的收敛结果。 The proposed algorithm is used for experiments with an Gaussian mixture model and the experimental results show that the proposed algorithm has better convergence results.
16421 联盟结构生成是分布式人工智能的重要研究内容，一般仅依据智能体效用生成任意数量的联盟，这导致最优联盟结构生成的计算复杂度NP难。 The coalition structure generation is an important domain of distributed artificial intelligence. Mostcoalition formation models are only based on the utility, and any number of coalitions are permitted, whichmakes it be NP complexity difficult to generate the optimal coalition structure.
16422 实际上，信任是合作的基础，信任关系对最终效用有直接的影响，应该综合考虑信任和效用关系。 Actually, Trust is the base ofcooperation and has direct effect on the final utility. So, not only utility but also trust relationship should beseriously considered.
16423 针对以上问题，该文扩展效用约束为信任和效用约束，用信任和效用二元组表示，以此作为联盟结构生成的依据。 To this end, the utility constraint is extended to trust and utility constraint, a two-tuplesis used to represent utility and trust, which is the base of coalition structure generation.
16424 借鉴图割的s-t-cut算法，研究了基于信任和效用关系的联盟结构生成，在保证智能体个体理性和联盟稳定(无块)的前提下，使用信任和效用关系对网络进行切割，从而形成联盟。 Inspired by the classics-t-cut algorithm for graph cut, coalition structure generation constrained by trust and utility relationship is investigated. Assuming that individual rationality of agents and the stability of coalition (there is no block) issatisfied, the network is cut by the relationship of utility and trust to formation coalitions.