Distance queries for complex spatial objects in oracle spatial

This paper describes the architecture and working of a recently implemented knowledge-based GIS (KBGIS-II) that was designed to satisfy several general criteria for GIS. The system has four major functions, query-answering, learning, editing and training. The main query finds constrained locations for spatial objects that are describable in a predicate-calculus based spatial object language. The main search procedures include a family of constraint-satisfaction procedures that use a spatial object knowledge base to search efficiently for complex spatial objects in large, multi-layered spatial data bases. These data bases are represented in quadtree form. The search strategy is designed to reduce the computational cost of search in the average case. The learning capabilities of the system include the addition of new locations of complex spatial objects to the knowledge base as queries are answered, and the ability to learn inductively definitions of new spatial objects from examples. The new definitions are added to the knowledge base by the system. The system is currently performing all its designated tasks successfully, although currently implemented on inadequate hardware.

The management of complex spatial objects in applications, such as geography and cartography, imposes stringent new requirements on spatial database systems, in particular on efficient query processing. As shown before, the performance of spatial query processing can be improved by decomposing complex spatial objects into simple components. Up to now, only decomposition techniques generating a linear number of very simple components, e.g. triangles or trapezoids, have been considered. In this paper, we will investigate the natural trade-off between the complexity of the components and the redundancy, i.e. the number of components, with respect to its effect on efficient query processing. In particular, we present two new decomposition methods generating a better balance between the complexity and the number of components than previously known techniques. We compare these new decomposition methods to the traditional undecomposed representation as well as to the well-known decomposition into convex polygons with respect to their performance in spatial query processing. This comparison points out that for a wide range of query selectivity the new decomposition techniques clearly outperform both the undecomposed representation and the convex decomposition method. More important than the absolute gain in performance by a factor of up to an order of magnitude is the robust performance of our new decomposition techniques over the whole range of query selectivity.

This publication presents a survey on the clustering algorithms proposed for spatiotemporal data. We begin our study with definitions of spatiotemporal datatypes. Next we provide a categorization of spatiotemporal datatypes with the special emphasis on the spatial representation and diversity in temporal aspect. We conduct our deliberation focusing mainly on the complex spatiotemporal objects. In particular, we review algorithms for two problems already proposed in literature: clustering complex spatiotemporal objects as polygons or geographical areas and measuring distances between complex spatial objects. In addition to description of the problems mentioned above, we also attempt to provide a comprehensive references review and provide a general look on the different problems related to the clustering spatiotemporal data.

Detecting autocorrelation problems from GPS collar data in livestock studies

BackgroundMeasuring mobility is critical for understanding neighborhood influences on older adults’ health and functioning. Global Positioning Systems (GPS) may represent an important opportunity to measure, describe, and compare mobility patterns in older adults.MethodsWe generated three types of activity spaces (Standard Deviation Ellipse, Minimum Convex Polygon, Daily Path Area) using GPS data from 95 older adults in Vancouver, Canada. Calculated activity space areas and compactness were compared across sociodemographic and resource characteristics.ResultsArea measures derived from the three different approaches to developing activity spaces were highly correlated. Participants who were younger, lived in less walkable neighborhoods, had a valid driver’s license, had access to a vehicle, or had physical support to go outside of their homes had larger activity spaces. Mobility space compactness measures also differed by sociodemographic and resource characteristics.ConclusionsThis research extends the literature by demonstrating that GPS tracking can be used as a valuable tool to better understand the geographic mobility patterns of older adults. This study informs potential ways to maintain older adult independence by identifying factors that influence geographic mobility.Electronic supplementary materialThe online version of this article (doi:10.1186/1476-072X-13-51) contains supplementary material, which is available to authorized users.

PurposeWith the rapid development of the indoor spaces positioning technologies such as the radio-frequency identification (RFID), Bluetooth and WI-FI, the locations of indoor spatial objects (static or moving) constitute an important foundation for a variety of applications. However, there are many challenges and limitations associated with the structuring and querying of spatial objects in indoor spaces. The purpose of this study is to address the current trends, limitations and future challenges associated with the structuring and querying of spatial objects in indoor spaces. Also it addresses the related features of indoor spaces such as indoor structures, positioning technologies and others.Design/methodology/approachIn this paper, the author focuses on understanding the aspects and challenges of spatial database managements in indoor spaces. The author explains the differences between indoor spaces and outdoor spaces. Also examines the issues pertaining to indoor spaces positioning and the impact of different shapes and structures within these spaces. In addition, the author considers the varieties of spatial queries that relate specifically to indoor spaces.FindingsMost of the research on data management in indoor spaces does not consider the issues and the challenges associated with indoor positioning such as the overlapping of Wi-Fi. The future trend of the indoor spaces includes included different shapes of indoors beside the current 2D indoor spaces on which the majority of the data structures and query processing for spatial objects have focused on. The diversities of the indoor environments features such as directed floors, multi-floors cases should be considered and studied. Furthermore, indoor environments include many special queries besides the common ones queries that used in outdoor spaces such as KNN, range and temporal queries. These special queries need to be considered in data management and querying of indoor environments.Originality/valueTo the best of the author’s knowledge, this paper successfully addresses the current trends, limitations and future challenges associated with the structuring and querying of spatial objects in indoor spaces.

Many geographical applications have to deal with spatial objects that reveal an intrinsically vague or fuzzy nature. A spatial object is fuzzy if locations exist that cannot be assigned completely to the object or to its complement. Spatial database systems and Geographical Information Systems are currently unable to cope with this kind of data. Based on an available abstract data model of fuzzy spatial data types for fuzzy points, fuzzy lines, and fuzzy regions, this paper proposes the Spatial Plateau Algebra that provides spatial plateau data types as an executable type system for fuzzy spatial data types. Each spatial plateau object consists of a finite number of crisp counterparts that are all adjacent or disjoint to each other, are associated with different membership values, and hence form different plateaus. The formal framework and the implementation are based on well known, exact models and available implementations of crisp spatial data types. Spatial plateau set and metric operations as well as spatial plateau topological predicates on spatial plateau objects are expressed as a combination of geometric methods on the underlying crisp spatial objects. This paper offers a conceptually clean specification for implementing a database extension for fuzzy spatial objects and their operations and predicates. Further, we demonstrate the embedding of these new data types as attribute data types in a database schema as well as the incorporation of fuzzy spatial operations and predicates into a database query language.

Migratory bird species pose serious management challenges because it is difficult to determine habitats utilized during their entire life cycles. As American woodcock populations have experienced long-term declines, wintering habitat management has become increasingly important. Past studies on woodcock have relied predominantly on Very High Frequency (VHF) telemetry, which require an observer to manually track them to gather location information. Our study employed both Global Positioning System (GPS) and VHF tags on woodcock to gather high resolution movement data in order to evaluate habitat use and compare VHF and GPS approaches to habitat sampling. We simulated a VHF approach to tracking the same individuals from the GPS tag data (spanning 252 bird-days) and utilized vegetation samples from our VHF tracked birds to evaluate use and random paired location sampling. We found that many random locations fell within the Minimum Convex Polygons (MCP) as defined via the GPS tags (average diurnal MCP size was 0.04 ha). Overall, our results suggest that evaluating resource selection by woodcock requires discerning the appropriate scale(s) of habitat selection via the identification of the spatial and temporal components underlying individual movement ecology.

The emerging new services for GPS and mobile users have developed applications that access and exploit spatial objects with new components (e.g. text and social network). Web objects, including blogs, tweets, photos and videos, are embedded into a map by the APIs of map service providers, where textual messages are associated with geographic information. Location-based social networking services, arising from Facebook and Foursquare, allow users to browse and share their traces of locations among the social networks. Among this class of applications, the highlight is that the retrieved spatial objects (e.g. points of interest and moving users) are featured with new components. Integrating such new components into the spatial query processing has produced large amounts of promising results. However, handling new components along with the retrieval of spatial objects increases the complexity of such joint query processing significantly. Thus, management over data from such multiple domains has been received considerable attention from database research community.\n\nIn this thesis, we introduce three interesting problems and study their sophisticated solutions for processing spatial objects with new components: (i) category-aware optimal route query (CORQ), (ii) social and spatial ranking query (SSRQ), and (iii) efficient notification of meeting point (ENMP) query. Our results for (i) and (ii) facilitate the retrieval of spatial objects from multiple domains while our solutions for (iii) provide effective tools for synchronous management of multiple moving users from a social network. Category-aware optimal route queries (CORQ) are generalized from the traveling salesman problem and enable users to retrieve shortest routes covering selected categories. Social and spatial ranking queries (SSRQ) are relevant to spatial object recommendations using social information and allow users to obtain the spatial objects that not only are near their locations but also impress them with high social influence. Efficient notification of meeting point (ENMP) queries are variants of aggregate nearest neighbor queries and provide real-time rearrangement for multiple moving users according to their locations.\n\nQuery processing in such multiple domains is complicated due to the mixture of domain information and their integration within one search. Naïve algorithms for these problems incur either numerous expensive evaluations or massive communication cost, which render them inapplicable to large datasets. Our main research purpose is to design efficient and effective solutions for the proposed problems, that avoid the aforementioned shortcomings of naïve algorithms.

Millions of small Unmanned Aerial Systems (sUAS), or drones weighing less than 55 pounds, will fly in urban airspaces within a decade. This is in addition to goals for increased Urban Air Mobility (UAM): larger transportation UAS and piloted air vehicles, including air taxi service and innovative aviation designs to revolutionize transportation. A significant problem is the lack of current management systems for this extremely large volume of air traffic, composed of heterogeneous drone shapes, sizes, and onboard equipment capabilities, flying adjacent to larger UAM vehicles in spaces previously unoccupied by General Aviation (GA). Robust and resilient detection, identification, localization, and tracking of sUAS sharing UAM airspace is complicated by urban factors such as non-transmitting, non-cooperative drones. Exacerbating these challenges, current technological limitations and vulnerabilities in Global Positioning System (GPS), Automatic Dependent Surveillance-Broadcast (ADS-B), and Inertial Navigation Systems (INS) can pose safety and security threats. To streamline a vision of safe and secure sUAS-UAM shared airspace, we propose Drone Net, a UAS Traffic Management (UTM) network of multi-modal ground and flight instruments. Drone Net is an architecture fusing a network of passive visual and acoustic sensor nodes with active Radio Detection and Ranging (radar) and Light Detection and Ranging (lidar) sensing methods for UTM, designed for integration with existing Air Traffic Control (ATC) and future UAM systems. The purpose of the Drone Net system is to evaluate use of Electro-Optical/Infrared (EO/IR) and acoustic arrays networked within an urban UAS operating region such as uncontrolled Class-G and waiver-granted Class-D airspace. The Drone Net approach combines detection, tracking, and localization estimation from radar, ADS-B, and EO/IR such that the design is robust to sensor errors, sample loss, and spoofing or other types of attacks. The system experimental design allows for emulation of corrupted ADS-B, GPS, and INS data on our flight platform including capability to communicate with ground radar and EO/IR to recover from flight instrument major and minor malfunctions such that a Drone Net cooperative UAS can be engineered to be fail-safe and fail-secure. We hypothesize that the Drone Net network of rooftop sensors, shown below, provides this conceptualized fail-safe, fail-secure property based upon the combination of self-localization with backup and confirming data from the ground sensor network. Further, with ground-system sensor fusion as well as UTM flight plan and registration information fusion, the overall system can manage small UAS that are both compliant and non-compliant alongside GA and UAM more safely than a single mode like ADS-B alone. To test our hypothesis, we envision two experiments this year. First, a test to confirm that we can emulate ADS-B, GPS, and INS sensor data corruption, leading to recovery using backup flight (lidar, EO/IR) or ground (radar, EO/IR) data to safely land an ALTA6 or other test UAS. Second, a series of Sense-and-Avoid (SAA) experiments between our test UAS and a tethered aerial obstacle. In the future, we will use this experience with fail-safe, fail-secure methods and software to further test more advanced scenarios between multiple UAS. The network of Drone Net instruments in a local area as well as regional and more global cloud-based networks will allow for heterogeneous information fusion and algorithm development for multi-sensor drone detection, classification, and identification with more accuracy than a single database or sensor system. The latent power of the Drone Net project is in its open-design ground and flight sensor network with data sharing capability to improve data mining and machine learning over time for analysis and security applications. More concrete applications for Drone Net include UTM integration with ATC and UAM, but also airspace safety and security for campus and public venues in general. Herein, we will present our experimental design and current test data from Embry-Riddle Aeronautical University in collaboration with University of Colorado Boulder toward completing the open specification for ground and flight instruments. We would additionally like to invite others to participate in growing the network and the data available for UTM, UAM, and GA shared airspace research.

This paper describes a currently on-going multicenter, randomized controlled trial designed to assess the efficacy of calf neuromuscular electrical stimulation (NMES) on changes in maximal walking distance in people with lower extremity peripheral artery disease (PAD), compared with a non-intervention control-group. This study (NCT03795103) encompasses five participating centers in France. PAD participants with a predominant claudication at the calf level and a maximal treadmill walking distance ≤300 m are randomized into one of the two groups: NMES group or Control group. The NMES program consists of a 12-week program of electrical stimulations at the calf-muscle level. The primary outcome of the study is the change in maximal treadmill walking distance at 12 weeks. Main secondary outcomes include changes in the pain-free treadmill walking distance; 6 min total walking distance; global positioning system (GPS)-measured outdoor walking capacity; daily physical activity level by accelerometry; self-reported walking impairment; self-reported quality of life; ankle-brachial index; and skin microvascular function, both at the forearm and calf levels. Recruitment started in September 2019 and data collection is expected to end in November 2022.

Abstract. Understanding and analyzing complex spatial objects involves the integration of surface, terrain, and subsurface data into 3D spatial models. However, describing and efficiently analyzing the connections between these data model is particularly challenging. This study aims to generate TIN data structure that enable the 3D representation of surface terrain subsurface integration. Furthermore, to ensure accurate representation within a unified 3D model, spatial relationships between the TIN data model could be obtained. Consequently, three – dimensional Triangular Irregular Networks (3D TIN) mesh of spatial objects representations and indexing structures were created. The integration of spatial objects, encompassing surface, terrain, and subsurface elements, is realized through a unified model. This synergy is achieved by combining the distinct 2D and 3D topology structures of each component. The resulting comprehensive model captures the intricate relationships and interactions within the spatial environment. This study provides additional insight into the representation and analysis of surface, terrain, and subsurface management in 3D spatial models. Hence, better decision making, resource management, underground utility installations, and evaluation of spatial objects will be made possible in our future work.

Directional query is critical in many domains, especially in geographic information systems (GIS), which are also frequently used as selection conditions in spatial queries. In this paper, we explore the processing of directional queries based on MRD-tree and open shape model. The interior node of MRD-tree contains not only index entries but also data entries, where the data entry contains the pointer of actual spatial object in disk, the maximum boundary rectangle (MBR) and the maximum enclosed circle (MEC) of the spatial data object. And open shape model converts the processing of the direction predicates into the processing of topological operations between open shapes and closed geometry objects. So a number of spatial objects were excluded immensely to compute during the filter step, and it is unnecessary to know the boundary of the embedding world and also eliminates the computation related to the world boundary. Our experimental evaluation shows that directional query based on MRD-tree Index and open shape model consistently outperforms classical directional queries based on R-tree and range model while the degree of performance improvement varies by several parameters.

Evaluation of a spatial join typically has two steps: a filter step that applies the join on approximations of spatial objects and a refinement step that determines the actual intersection of two spatial objects. In this paper, we study the effectiveness of filters with different approximations including minimum bounding rectangles, rectilinear approximations, minimum 5-corner bounding convex polygons, and convex hulls. We compare the effectiveness of filters by comparing the number of "false hits" in the filter result using these approximations. We analyze the impact of parameters such as approximation quality and aspect ratios of input polygons on the filter effectiveness.

Distribution of Salers cows in contrasting rangeland pastures relative to established slope and water guidelines