ID 原文 译文
7894 采用聚合算法减小线性规划问题的规模,并利用迭代算法求得其最优解。 Using aggregation algorithm reduce the size of the linear programming problem, and the optimal solutions obtained by iterative algorithm.
7895 最后通过数值算例,说明了失效相关程度对折扣总成本以及最优维修策略的影响,探究了模型中成本参数对维修策略的影响。 Finally, a numerical example, illustrates the degree of failure related to discount the total cost and the influence of the optimal maintenance strategy, explores the model of cost parameters effect on the maintenance strategy.
7896 算法对比的实验结果显示,采用聚合迭代算法可以有效提高运算速度,降低内存占用。 Algorithm comparing the experimental results show that, using the aggregation iterative algorithm can effectively improve the operation speed, reduce the memory footprint.
7897 针对当前图论频谱分配模型下寻找最优解困难,容易陷入局部最优等问题,将蝙蝠算法引入到认知无线电频谱分配中,并利用图论频谱分配模型的特点,对二进制蝙蝠算法进行改进,以达到更好的效果。 In view of the current graph spectrum allocation model to find the optimal solution is difficult, the most superior easily trapped in local problems, the bat algorithm is introduced into the cognitive radio spectrum allocation, and the advantage of the characteristics of spectrum allocation model of graph theory, the binary bat algorithm was improved, in order to achieve better results.
7898 首先,将蝙蝠算法的选择策略改为贪婪选择,增强了蝙蝠算法在当前位置的开发能力。 First, change the bat algorithm selection strategy to choose greed, enhances the bat algorithm in the current position of development capabilities.
7899 其次,统计种群中各蝙蝠经历的最好位置的分布情况,利用蝙蝠位置的统计特性指导蝙蝠寻优,加快算法的收敛速度。 Bats in second, the statistical population experience the best location of the distribution, using the statistical features of bats location guidance bat optimization, to speed up the convergence speed of the algorithm.
7900 最后,在局部搜索时,直接在离散域操作,减少实数到二进制的映射,缩短搜索时间。 Finally, in the local search, directly in the discrete domain operation, reduce the mapping of the real Numbers to binary, shorten the search time.
7901 仿真结果表明,本文算法在效益优于过去的算法的情况下收敛速度更快。 The simulation results show that the algorithm in the case of efficiency is better than the past algorithm convergence speed is faster.
7902 针对传统到达时间定位中出现的目标节点与传感器锚节点不同步的问题,提出了一种时钟同步与目标定位联合估计算法。 For traditional in the time of arrival location of the target node and sensor anchor node sync problem, put forward a kind of clock synchronization and target joint estimation algorithm.
7903 该算法分为两个阶段,首先通过引入辅助变量,根据加权最小二乘准则求出时钟偏差和目标位置的初始值; The algorithm can be divided into two stages, first, by introducing auxiliary variables, based on the weighted least square criteria and the clock error and the initial value of the target position;