2 research outputs found

    Approximate order-k Voronoi cells over positional streams

    Full text link
    Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed for providing exact answers particularly to continuous range and k-nearest neighbor queries against current object positions. In this work, we introduce a processing technique for efficiently maintaining an approximate order-k Voronoi cell around a certain point of interest when all objects continuously change their locations. This heuristic can easily provide a fairly reliable estimate of the k-nearest neighbors for any query point found inside the constructed cell. We further extend our method to handle positional updates that are not received concurrently for all objects, but instead remain valid for a specific time interval according to a sliding window model. Extensive experimental analysis over synthetic datasets confirms the robustness and scalability of this approach offering near real-time cell maintenance with acceptable error margins

    Soluci贸 paral路lelitzada d'interpolaci贸 kriging amb ajust automatitzat del variograma

    Get PDF
    El principal objectiu d'aquest treball 茅s proporcionar una metodologia per a reduir el temps de c脿lcul del m猫tode d'interpolaci贸 kriging sense p猫rdua de la qualitat del model resultat. La soluci贸 adoptada ha estat la paral路lelitzaci贸 de l'algorisme mitjan莽ant MPI sobre llenguatge C. Pr猫viament ha estat necessari automatitzar l'ajust del variograma que millor s'adapta a la distribuci贸 espacial de la variable d'estudi. Els resultats experimentals demostren la validesa de la soluci贸 implementada, en reduir de forma significativa els temps d'execuci贸 final de tot el proc茅s.El principal objetivo de este trabajo es proporcionar una metodolog铆a para reducir el tiempo de c谩lculo del m茅todo de interpolaci贸n kriging sin p茅rdida de la calidad del modelo resultado. La soluci贸n adoptada ha sido la paralelizaci贸n del algoritmo mediante MPI sobre lenguaje C. Previamente ha sido necesario automatizar el ajuste del variograma que mejor se adapta a la distribuci贸n espacial de la variable de estudio. Los resultados experimentales demuestran la validez de la soluci贸n implementada, al reducir de forma significativa los tiempos de ejecuci贸n finales del proceso completo.The main objective of this work is to provide a methodology to reduce the time needed to calculate the kriging interpolation method without losing any quality of the resulting model. The solution adopted has been the algorithm parallelization by MPI on C language. Previously, it has been necessary to automate the variogram fitting that best suits the spatial distribution of the variable at study. The experimental results demonstrate the validity of the implemented solution, to significantly reduce the execution times of the entire process
    corecore