Location Selection Query in Google Maps using Voronoi-based Spatial Skyline (VS2) Algorithm

Google Maps is one of the popular location selection systems. One of the popular features of Google Maps is nearby search. For example, someone who wants to find the closest restaurants to his location can use the nearby search feature. This feature only considers one specific location in providing the desired place choice. In a real-world situation, there may be a need to consider more than one location in selecting the desired place. Assume someone would like to choose a hotel close to the conference hall, the museum, beach, and souvenir store. In this situation, nearby search feature in Google Maps may not be able to suggest a list of hotels that are interesting for him based on the distance from each destination places. In this paper, we have successfully developed a web-based application of Google Maps search using Voronoi-based Spatial Skyline (VS2) algorithm to choose some Point Of Interest (POI) from Google Maps as their considered locations to select desired place. We used Google Maps API to provide POI information for our web-based application. The experiment result showed that the execution time increases while the number of considered location increases

MapReduceによるエリアスカイライン問合せ及びキューイングシステムのパラメータ推定に関する研究

広島大学(Hiroshima University)博士(工学)Doctor of Engineeringdoctora

SKYLINE QUERY BASED ON USER PREFERENCES IN CELLULAR ENVIRONMENTS

The recommendation system is an important tool for providing personalized suggestions to users about products or services. However, previous research on individual recommendation systems using skyline queries has not considered the dynamic personal preferences of users. Therefore, this study aims to develop an individual recommendation model based on the current individual preferences and user location in a mobile environment. We propose an RFM (Recency, Frequency, Monetary) score-based algorithm to predict the current individual preferences of users. This research utilizes the skyline query method to recommend local cuisine that aligns with the individual preferences of users. The attributes used in selecting suitable local cuisine include individual preferences, price, and distance between the user and the local cuisine seller. The proposed algorithm has been implemented in the JALITA mobile-based Indonesian local cuisine recommendation system. The results effectively recommend local cuisine that matches the dynamic individual preferences and location of users. Based on the implementation results, individual recommendations are provided to mobile users anytime and anywhere they are located. In this study, three skyline objects are generated: soto betawi (C5), Mie Aceh Daging Goreng (C4), and Gado-gado betawi (C3), which are recommended local cuisine based on the current individual preferences (U1) and user location (L1). The implementation results are exemplified for one user located at (U1L1), providing recommendations for soto betawi (C5) with an individual preference score of 0.96, Mie Aceh Daging Goreng (C4) with an individual preference score of 0.93, and Gado-gado betawi (C3) with an individual preference score of 0.98. Thus, this research contributes to the field of individual recommendation systems by considering the dynamic user location and preferences

知的領域選択問合せに関する研究

広島大学(Hiroshima University)博士(工学)Doctor of Engineeringdoctora

Textually Relevant Spatial Skylines

postprin

Diamond Dicing

In OLAP, analysts often select an interesting sample of the data. For example, an analyst might focus on products bringing revenues of at least 100 000 dollars, or on shops having sales greater than 400 000 dollars. However, current systems do not allow the application of both of these thresholds simultaneously, selecting products and shops satisfying both thresholds. For such purposes, we introduce the diamond cube operator, filling a gap among existing data warehouse operations. Because of the interaction between dimensions the computation of diamond cubes is challenging. We compare and test various algorithms on large data sets of more than 100 million facts. We find that while it is possible to implement diamonds in SQL, it is inefficient. Indeed, our custom implementation can be a hundred times faster than popular database engines (including a row-store and a column-store).Comment: 29 page

Energy-Efficient β

As the first priority of query processing in wireless sensor networks is to save the limited energy of sensor nodes and in many sensing applications a part of skyline result is enough for the user’s requirement, calculating the exact skyline is not energy-efficient relatively. Therefore, a new approximate skyline query, β-approximate skyline query which is limited by a guaranteed error bound, is proposed in this paper. With an objective to reduce the communication cost in evaluating β-approximate skyline queries, we also propose an energy-efficient processing algorithm using mapping and filtering strategies, named Actual Approximate Skyline (AAS). And more than that, an extended algorithm named Hypothetical Approximate Skyline (HAS) which replaces the real tuples with the hypothetical ones is proposed to further reduce the communication cost. Extensive experiments on synthetic data have demonstrated the efficiency and effectiveness of our proposed approaches with various experimental settings

PlaNet - Photo Geolocation with Convolutional Neural Networks

Is it possible to build a system to determine the location where a photo was taken using just its pixels? In general, the problem seems exceptionally difficult: it is trivial to construct situations where no location can be inferred. Yet images often contain informative cues such as landmarks, weather patterns, vegetation, road markings, and architectural details, which in combination may allow one to determine an approximate location and occasionally an exact location. Websites such as GeoGuessr and View from your Window suggest that humans are relatively good at integrating these cues to geolocate images, especially en-masse. In computer vision, the photo geolocation problem is usually approached using image retrieval methods. In contrast, we pose the problem as one of classification by subdividing the surface of the earth into thousands of multi-scale geographic cells, and train a deep network using millions of geotagged images. While previous approaches only recognize landmarks or perform approximate matching using global image descriptors, our model is able to use and integrate multiple visible cues. We show that the resulting model, called PlaNet, outperforms previous approaches and even attains superhuman levels of accuracy in some cases. Moreover, we extend our model to photo albums by combining it with a long short-term memory (LSTM) architecture. By learning to exploit temporal coherence to geolocate uncertain photos, we demonstrate that this model achieves a 50% performance improvement over the single-image model

Algorithms for Skidding Distance Modelling on a Raster Digital Terrain Model

Algorithms for determining skyline skidding and tractor skidding distances on raster digital terrain models are introduced and presented. Modules named DOWN, UP, STRDOWN, STRUP were programmed in Turbo Basic language to work with a raster Digital Terrain Model. The DTM, interpolated from a set of digitized contours, and all other data were handled in the IDRISI GIS environment. Implications of these algorithms are discussed, especially their advantages and disadvantages relative to the opening of forests, and more broadly forest operational planning. Flowcharts illustrating the method for calculating tractor and skyline skidding distance are included