ID	原文	译文
2933	为研究不同网络节点重要性指标对网络中重要节点的影响程度，进而优选出较能体现网络重要节点性质的指标。	In network theory, it is interest to study the influences of different nodes on the key nodes in the network, and build or select the proper node importance index to model it.
2934	本文基于主成分分析(Principal Component Analysis，简记 PCA)，选取七个节点重要性指标对网络重要性节点贡献率进行计算分析，	This paper selects seven node importance indices to calcu-late and analyze their contributions in nodes'importance evaluation with Principal Component Analysis.
2935	同时选取了七种不同的网络进行实验，得到指标贡献率大小顺序，利用肯德尔系数对重要指标与其余指标进行相关性分析，得到不同指标之间的相关系数及相关系数大小的影响因素。	Seven empirical networks are used for experiments. Moreover, the order of different contributions of indices is obtained, and the correlation a-nalysis between the most important index and the other indices is carried out using the Kendall coefficient, and factors affect-ing the correlation coefficient are also discussed.
2936	本文为研究网络重要节点选择指标提供了一种思路，同时为研究不同节点间的相互关系提供了研究方法。	This paper provides a way to select the node importance index in the net-work, and the results could also be used for studying the relationships between different nodes.
2937	针对仿人机器人步行过程中存在的机器人关节角加速度约束影响控制性能的问题，提出一种考虑关节角加速度约束的仿人机器人偏摆力矩控制方法。	To cancel the effect on control performance due to joint acceleration constraints during humanoid robotwalks, a new yaw moment control approach with consideration of joint acceleration constraints is proposed.
2938	该方法充分考虑了双臂在摆动过程中对偏摆力矩的影响，根据力矩平衡条件得到需要抵消的偏摆力矩的大小与方向，将偏摆力矩的控制问题转化为带约束条件的二次规划问题，	After analyzing the effect on stability caused by the motion of arms swing, the undesired yaw moment which needs to be counteracted iscomputed. Then, the yaw moment control problem is formulated as a quadratic programming problem with inequality con-straints.
2939	并设计了一种在线变步长迭代算法计算得到优化后的双臂摆动轨迹。	To solve this optimization problem effectively, an online variable step-size iteration method is designed to generatethe trajectories of arms swinging.
2940	实验表明，该方法能有效抵消机器人步行中产生的偏摆力矩，避免控制过程中的“削峰”现象，有效提高机器人的步行稳定性。	The experiment and simulation results verified that the proposed approach can effectively compensate yaw moment, avoid peak cut-off phenomenon and guarantee the stable walking.
2941	重叠社团在社交网络大数据中普遍存在。	Overlap between community pairs is commonplace in large-scale social networks.
2942	针对现有重叠社团挖掘算法易将重叠区域错误地划分为独立的社团且计算复杂的问题，提出了一种基于局部信息度量的快速重叠社团挖掘算法(Local information based Fast Over-lapped Communities Detection，Li-FOCD)。	The most existing over-lapped community detection algorithms may falsely identify overlaps as communities because the overlap area is denser than others, and those algorithms are computationally demanding and cannot scale well with the size of networks. In this paper, wepropose a fast overlapping community discovery algorithm based on some locally computed information—Local informationbased Fast Overlapped Communities Detection (Li-FOCD).