ID 原文 译文
1433 采用期望最大化算法(Expectation Maximization，EM)求解模型参数。 Expectation Maximi-zation (EM)is used to estimate the model parameters.
1434 为了实现自动确定类别数，采用贝叶斯信息准则(Bayesian Information Criterion，BIC)求解最优类别数，其中惩罚项采用加权像素数定义。 Bayesian Information Criterion (BIC)is used to solve the optimalnumber of classes, where penalty term is defined by the weighted number of pixels.
1435 为了验证提出算法可行性和有效性，对模拟和全色遥感影像进行分割实验，并对分割结果进行定性和定量分析。 To test the feasibility and availability of the proposed algorithm, segmentation experiments are carried out on simulated and panchromatic remote sensing images.
1436 结果表明 HGMM 具有准确建模复杂统计分布的能力，提出算法具有高精度和高效率，同时可自动确定最优类别数。 Segmentation results are analyzed qualitatively and quantitatively, which show that HGMM can accurately model the compli-cated statistical distributions. The proposed algorithm can obtain high accuracy and has good efficiency, as well as determinethe optimal number of classes.
1437 车载自组织网络中节点的高速移动性使得网络拓扑频繁变化，造成路由效率低下。 The high-speed mobility of the nodes makes the network topology change frequently, and the transmissionpath can be easily interrupted, so the routing efficiency is lower in Vehicular ad hoc network (VANET).
1438 本文提出了一种面向高速路车联网场景的自适应路由方法。 We present an a-daptive routing method for high-speed-road scenario of the Internet of Vehicle in this paper.
1439 本方法采用了贪婪机会转发(GOF)算法，在选择下一跳转发节点时，同时考虑到目的节点的距离计算、节点间的链路状态以及下一跳的有效节点度状况来找出最优转发节点，并提出新的计算连通概率的方法。 This method uses Greedy Op-portunity Forwarding (GOF)algorithm to find the optimal forwarding node when the next hop forwarding node is selectedand it takes into account the distance calculation of the destination node, the link state between the nodes and the effectivenode degree of the next hop. We propose a new method to calculate the probability of connectivity.
1440 仿真实验和实际道路场景的测试表明，与相关算法相比在路由稳定性方面表现出较好的效果。 The simulation resultsand tests of the actual high-speed-road scenario show that our RAR method has good performance in the stability of routing, which is compared with the relative algorithms.
1441 线性密码分析是针对分组密码的强有力的攻击方法，估计分组密码抵抗线性密码分析的能力是分组密码安全性评估的重要内容之一。 Linear cryptanalysis is a powerful attack on block ciphers. To evaluate the security against linear cryptanal-ysis is one of the most important part for the security evaluation of block ciphers.
1442 基于实际应用背景，提出了“四分组类 CLEFIA 变换簇”的概念， In this paper, the concept of four-blockCLEFIA-like transform cluster is put forward based on the background of practical application.