ID 原文 译文
47266 其中，功率控制子问题可借助 Dinkelbach 法和拉格朗日对偶得到最优解； Specifically, the power control subproblem can be optimallysolved with the help of Dinkelbach method and Lagrange duality.
47267 信道分配子问题等价于集装箱问题，属于 NP 难问题，因此，提出一种启发式算法，实现算法性能与复杂度之间的折中。 Based on the above results, the channel assignmentsubproblem turns out to be the set packing problem which was generally NP-hard problem, Therefore, a heuristicalgorithm was further devised to achieve a tradeoff between performance and complexity.
47268 仿真结果表明所提联合资源分配方案优于单一资源优化方案，此外，其具有多项式复杂度且其性能接近理论最优解。 Simulations show that theproposed joint resource allocation scheme outperforms the ones where only single resource variable is optimized, and itachieves the polynomial-time complexity at only minor performance loss when compared to the global optimum.
47269 工业控制系统是国家关键基础设施的重要组成部分，一旦遭受网络攻击，会造成财产损失、人员伤亡等严重后果。 Industrial control system was an important part of national critical infrastructure, once it was suffered from thecyber attack, it would cause property damage, casualties and other serious disasters.
47270 为向工控安全领域的研究人员提供理论支持，对工控系统攻击的特点和检测难点进行了分析， For providing theoretical supports toindustrial security researchers, the features of attacks in an industrial control system and the difficulties of detection tothese attacks were introduced.
47271 报告了工业系统中入侵检测技术的研究现状， Then, a survey of intrusion detection technologies used by the industrial control systemswas given.
47272 并对不同检测技术的性能和特点进行了比较， Also, the performance and characteristic were compared for the different types of detection technologies.
47273 最后生成了一份工业入侵检测研究综述。 Finally, an industrial intrusion detection research was generated.
47274 针对内容中心网络（CCN, content centric networking）中沿路径缓存策略存在的问题，设计了一种最大介数节点和边缘节点协同的缓存策略。 To overcome the problems of the on-path caching schemes in the content centric networking, a coordinatedcaching scheme based on the node with the max betweenness value and edge node was designed.
47275 根据网络拓扑特性，在最大介数节点感知流行内容，边缘节点协同跟踪； According to thetopology characteristics, the popular content was identified at the node with the max betweenness value and tracked at theedge node.