The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a set of spatial points $(DS)$, each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., {pub, restaurant, museum}). The user may also specify partial order constraints between different categories, e.g.,...
Taking Jiangxia District in Wuhan City as the research region by using RS and GIS comprehensively. According to the country secondary category and classification standard interpretation. Reveal the characteristics of the fractal structures of the distribution of land use types. Explore the significance of the fractal on land use types. The fractal dimensions (D) and stability indexes (S) of first...
Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested graphs, termed complete-graph-of-rings (CGR). We discuss a systematic and concrete way to transfer these graphs to array codes, unveil an interesting relation between...
One of the most important kinds of queries in spatial network databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels, gas station, car, etc., the k-NN query returns the k nearest neighbors from the query object to interested objects. This paper proposes...
This paper presents innovative ideas to construct maximum distance separable (MDS) codes, optimal error correction codes that achieve the singleton bounds. The proposed codes are based on a circularly symmetric construction applied to a novel class of nested graphs, referred to as complete-graph-of-rings (CGR). We demonstrate the general idea of transforming graphs to array codes, provide the sufficient...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.