ID 原文 译文
18085 第1阶段利用Voronoi图获得整个网络的覆盖孔，检测Voronoi多边形内的未覆盖区域，并提供虚拟力驱动传感器移动，同时采用动态调整策略改变移动步长，从而减少能量损耗； The first stage uses the Voronoi diagram to obtain the coverage hole of the entire network, and detectsthe uncovered area in the Voronoi polygon, and provides virtual force to drive the sensor movement, and usesthe dynamic adjustment strategy to change the moving step size, thereby reducing energy loss;
18086 第2阶段提出一种检测机制，利用Delaunay三角网检测传感器之间的局部覆盖孔并进行修复。 The second stage proposes a detection mechanism that uses a Delaunay triangulation to detect local coverage holes between sensors and repair them.
18087 仿真结果表明，该算法在提高网络覆盖率的同时加快了收敛速度，为部署移动无线传感网络提供了新的解决思路。 The simulation results show that the algorithm accelerates the convergence speed while improving the network coverage, and provides a new solution for deploying mobile wireless sensor networks.
18088 针对目前客户端反外挂方法的诸多局限，该文提出一种基于内核事件的网络游戏反外挂方法，并实现了反外挂系统CheatBlocker。 In view of many limitations of current client anti plug-in methods, an anti-cheat method based onkernel events is proposed, and the network game anti-cheat system called CheatBlocker is implemented.
18089 该方法通过监控Windows系统中的内核事件监视和拦截进程间的异常访问及异常模块注入，同时从内核注入反外挂动态加载库(DLL)用以阻断鼠标键盘的模拟。 This method uses the kernel event monitoring provided by Windows to intercept the abnormal access between processes and the injection of abnormal modules. At the same time, the anti-cheat Dynamic Loaded Library(DLL) injected from the kernel can block the simulation of the mouse keyboard.
18090 实验结果表明，CheatBlocker可防御进程模块注入外挂和用户输入模拟类外挂，且具有较低的性能开销。 The experimental results showthat CheatBlocker can defend against process module injection cheating and user input simulation cheating,and has low performance overhead.
18091 而且，CheatBlocker无需修改内核数据或代码，相比于目前的反外挂系统具有更好的通用性与兼容性。 Moreover, CheatBlocker does not need to modify the kernel data or codewhich ensures the integrity of the kernel and is more compatible than the current anti-cheat systems.
18092 针对现有RS码识别算法需要对码字符号在不同域之间进行转化，且容错性能较差的问题，该文提出一种直接利用软判决序列完成RS码识别算法。 To solve the problem that the existing algorithms for recognition of RS codes need to transform thecode characters among different domains and poor performance, a new algorithm based on soft decision isproposed.
18093 算法首先从RS码定义出发，给出了RS码校验关系从GF(2m)到GF(2)上的等价转换方式，从而避免了不同域下复杂的符号转化； Firstly, starting from the definition of RS codes, the equivalent conversion mode of the check relationof RS code from GF (2m) to GF (2) is given, which avoids the complex symbol transformation in differentdomains.
18094 其次引入了能够衡量校验关系成立大小的平均校验符合度概念，然后基于其统计特性以及极大极小判决准则，遍历可能的码长以及对应的m级本原多项式，进行初始码根校验匹配，从而完成码长以及本原多项式识别； Secondly, the average check conformity which can measure the validity of the check relationship isintroduced and based on its statistical characteristics and minimax decision criteria, the possible code lengthand corresponding m-level primitive polynomials are traversed to match the initial code root, as the results, thecode length and primitive polynomial are recognized.