ID 原文 译文
46106 转发用户使用该锚点进行增量近邻查询并求精。 Forwarding users use the incremental nearest neighbor query throught the anchor point and accurate.
46107 通过在不同的路网环境数据集上实验，表明该算法具有较好的隐私保护效果，并且具有较高的工作效率。 Experiments in road network environment with different data sets show that the privacy protection works well in the algorithm, and own high work efficiency.
46108 任务分配是诸如智能雷场等无线传感器及执行器网络军事应用中的重要组成部分。 Task allocation is an essential part of many military applications of WSAN such as intelligent minefield.
46109 在这些系统中，最优任务分配方案的关键是如何获得节点—目标分配方案。 The key problem of task allocation decision in these systems for the optimal scheme on task allocation is how to obtain the node-target assignment.
46110 结合目标相关参数和雷弹节点状态等，分析任务效能的多种影响因素，通过极差正规化对正向和逆向指标区别处理， Combing with the factors of target’s parameters and node’s own status, the various influence factors of task efficiency were analyzed and the positive and negative indicators were processed by range normalization method separately.
46111 提出线性加权的任务效能函数，将其作为任务分配方案的评价指标。 The linear-weighted task efficiency function was proposed in the applications of WSAN such as intelligent minefield.
46112 任务效能函数包括目标威胁程度和雷弹节点状态等多种任务效能影响因素的描述，能更全面地反映目标威胁程度和节点价值等多种因素对系统的综合影响，可根据不同的多因素任务分配应用需求灵活构建。 It can be utilized as the evaluation index of assignment schemes since it reflected the integrated impact of target’s threat and node’s value on the system more comprehensively. Task efficiency function can be constructed flexibly based on the demand of different multi factor task allocation application.
46113 多因素任务分配问题的实质是如何进行节点—目标分配，使系统达到最大综合任务效能，可将该问题转化为指派问题进行求解。 The essence of the problem was how to make node-target assignment to achieve the maximum task efficiency of the whole system. This problem turned into assignment problem and can be solved.
46114 通过应用实验实现和验证了多因素任务分配模型， Finally, an application was implemented to demonstrate this scheme.
46115 实验结果表明该模型适合于小规模的多因素任务分配问题如智能雷场应用等。 The results show that the model is suitable for small-scale multi factor task allocation problem in intelligent minefield system.