ID 原文 译文
23585 由碰撞关系确定一系列非线性方程，采用分块分析的方法，从非线性方程中找到消息字差分间的信息泄漏规律，首次给出了算法在两步后发生碰撞的必要条件集，确定了输入差分的字分布情况。 The partition method is utilized to find the information leakage between the word differences of message in the nonlinear function determined by the collision. The necessary conditions of collision after two steps are proposed for the first time. The distribution of input difference is determined.
23586 在此基础上，将碰撞的必要条件转化成伪布尔函数最优化问题，利用混合整数规划模型进行求解。实验结果显示算法发生碰撞时，输入差的汉明重量至少为 28，其碰撞概率小于1402−，得到了比文献[7]更紧致的概率上界(原为1302−)。 Furthermore, necessary conditions are turned into Pseudo-Boolean optimization problems. With the usage of mixed integer programming, it is found that the weight of message difference must be higher than 28 with the collision probability less than 1402−, which is a better upper bound than ref. [7] 1302−.
23587 结果表明MORUS-640-128 算法具备良好的抗碰撞攻击能力。 The result shows that MORUS-640-128 has a good performance on resistance against collision attack.
23588 在带有噪声干扰的车辆异构网络中，针对当前基于决策树的垂直切换算法存在切换精准性不高的问题，该文详细分析并给出当前算法决策过程中存在的错误判决概率，提出一种基于决策树的稳健垂直切换算法。 In the vehicle heterogeneous network with noise and interference, the current vertical handoff algorithms based on decision tree have the problem of low handoff accuracy. In this paper, the decision processes of current algorithms are analyzed in detail and the formulation of false decision probability is given.
23589 首先，采用卡尔曼滤波算法，根据网络属性的预测值和当前测量值，并结合它们各自的噪声偏差，做出更准确的网络属性估计。 Firstly, the Kalman filtering algorithm is employed to obtain the more accurate network attribute values according to the predicted values, the current values, and their noise deviations.
23590 其次，针对少量网络属性值出现在判决门限附近的情况，提出概率阈值区间法，通过二次检测提高算法判决的准确性。 Secondly, a probability threshold interval method is proposed to do a twice detection to the situation of the attribute value which is near the threshold.
23591 仿真结果表明，所提算法提高了切换判决精准性和网络总吞吐量，降低了乒乓效应和切换失败率，并得到了与传统算法同阶的时间复杂度性能结果。 Simulation results show that the proposed algorithm can improve the accuracy of handoff decision and the total network throughput, and can also reduce the ping-pong effect and the failed handoff. Meanwhile, it still keeps the same-ordered time complexity with the traditional algorithms.
23592 L1 跟踪表示模型的稀疏性约束，使其对局部遮挡具有良好的鲁棒性，但同时也造成了跟踪速度慢的问题。 The sparsity constraint of the L1 tracker's representation model makes it have good robustness towards partial occlusion. However, the tracking speed of the L1 tracker is slow.
23593 针对此问题，该文提出使用编码迁移方法进行视觉跟踪。 To solve this study, this paper proposes a coding transfer method for visual tracking.
23594 该方法利用低分辨率字典计算候选目标表示系数，并使用高分辨率字典构造观测似然，有效地减小了跟踪过程中的计算量。 By making use of the low-resolution dictionary to calculate coefficients of the candidate targets and the high-resolution dictionary to construct the observation likelihood model, the method reduces calculation amount effectively in the process of tracking.