英语翻译AbstractThepaperdescribesanewmethodofcontinuouslymonitoringtheknearestneighborsofagivenobjectinthemobileenvironment.Insteadofmonitoringallknearestneighbors,wechoosetomonitorthek-th(nearest)neighborsince

Question

英语翻译
Abstract
The paper describes a new method of continuously monitoring the k nearest neighbors of a given object in the mobile environment.Instead of monitoring all k nearest neighbors,we choose to monitor the k -th (nearest) neighbor since the necessary condition of changes in the KNN is the change of the k -th neighbor.In addition,rather than in the original space,we consider the moving objects in a transformed time-distance (TD) space,where each object is represented by a curve.A beach-line algorithm is developed to monitor the change of the k -th neighbor,which enables us to maintain the KNN incrementally.An extensive empirical study shows that the beach-line algorithm outperforms the most efficient existing algorithm by a wide margin,especially when k or n (the total number of objects) is large.
1.Introduction
The proliferation of mobile objects and highly advanced positioning techniques make some e-services to large number of mobile objects possible and desirable,which also poses new challenges to exploit the knowledge of objects’ changing locations,one of which involves providing the information of the k nearest neighbors of a given object.Informally,the KNN problem is to find a set of k nearest mobile objects to a given location at a given moment.

Answer 1

摘要 本文描述连续监视一个新方法一个指定的对象的k 最近的邻居在流动环境.而不是监测所有k 最近的邻居,我们选择监测k - th (最近的) 邻居因为变化的必要条件在KNN 上是k 的变动- th 邻居.另外,而不是在原始的空间,我们考虑移动的对象在被变换的时间距离(TD) 空间,各个对象由曲线代表.海滩线算法被开发监测k - th 邻居的变动,使我们增加地维护KNN .一项广泛的经验主义的研究表示,海滩线算法胜过最高效率的现有的算法由宽边际,特别是当k 或n (对象的总数) 是大的.1.介绍 流动对象的扩散和高度推进安置技术使一些e 服务对流动对象的大数字成为可能并且中意,并且形成新挑战利用对象的改变的地点知识,其中之一介入提供一个指定的对象的k 最近的邻居的信息.不拘形式地,KNN 问题将发现一套k 最近的流动对象对一个指定的地点在指定的片刻.