Search

Abstract The North Sea (NS) is changing rapidly. Temporal variations in fishing intensity and eutrophic conditions, along with the ongoing impact of climate change, act in synergy resulting in modifications in marine communities. Although zooplankton has been extensively investigated, studies often ignore the large-sized meso- and macro-zooplankton (>500 µm), including holoplankton and meroplankton taxa. Here, we examined changes in abundances and community structure of these organisms between 1975 and 2018, using univariate and multivariate analysis, at different taxonomic levels. Abrupt changes in the abundances of (sub)communities occurred during different time periods and resulted in a significant restructuration of the entire community in 2006. These changes were consistent with the regime shifts reported in the NS and were a consequence of the environmental pressures on the whole community or on specific subcommunities. In the long term, the community shifted from higher abundances of hydrozoans and holoplankton taxa to an increasing abundance of decapods. Furthermore, we reveal the environmental variables that most explain the variability in the community dynamics, highlighting the importance of temperature and top-down processes. Our study underlines the relevance of investigations at different taxonomic levels, which elucidates how distinct responses to environmental changes ultimately shape the entire community structure.

Existing question answering systems struggle to answer factoid questions when geospatial information is involved. This is because most systems cannot accurately detect the geospatial semantic elements from the natural language questions, or capture the semantic relationships between those elements. In this paper, we propose a geospatial semantic encoding schema and a semantic graph representation which captures the semantic relations and dependencies in geospatial questions. We demonstrate that our proposed graph representation approach aids in the translation from natural language to a formal, executable expression in a query language. To decrease the need for people to provide explanatory information as part of their question and make the translation fully automatic, we treat the semantic encoding of the question as a sequential tagging task, and the graph generation of the query as a semantic dependency parsing task. We apply neural network approaches to automatically encode the geospatial questions into spatial semantic graph representations. Compared with current template-based approaches, our method generalises to a broader range of questions, including those with complex syntax and semantics. Our proposed approach achieves better results on GeoData201 than existing methods.

Conversing about places with a computer poses a range of challenges to current AI.

The present study tested if the quadratic relationship which exists between stepping frequency and gait dynamics in walking can be generalized to stairmill climbing. To accomplish this, we investigated the joint angle dynamics and variability during continuous stairmill climbing at stepping frequencies both above and below the preferred stepping frequency (PSF). Nine subjects performed stairmill climbing at 80, 90, 100, 110 and 120% PSF and treadmill walking at preferred walking speed during which sagittal hip, knee and ankle angles were extracted. Joint angle dynamics were quantified by the largest Lyapunov exponent (LyE) and correlation dimension (CoD). Joint angle variability was estimated by the mean ensemble standard deviation (meanSD). MeanSD and CoD for all joints were significantly higher during stairmill climbing but there were no task differences in LyE. Changes in stepping frequency had only limited effect on joint angle variability and did not affect joint angle dynamics. Thus, we concluded that the quadratic relationship between stepping frequency and gait dynamics observed in walking is not present in stairmill climbing based on the investigated parameters.

© 2008 The authors and IOS Press. All rights reserved. Constraint networks in qualitative spatial and temporal reasoning are always complete graphs. When one adds an extra element to a given network, previously unknown constraints are derived by intersections and compositions of other constraints, and this may introduce inconsistency to the overall network. Likewise, when combining two consistent networks that share a common part, the combined network may become inconsistent. In this paper, we analyse the problem of combining these binary constraint networks and develop certain conditions to ensure combining two networks will never introduce an inconsistency for a given spatial or temporal calculus. This enables us to maintain a consistent world-view while acquiring new information in relation with some part of it. In addition, our results enable us to prove other important properties of qualitative spatial and temporal calculi in areas such as representability and complexity.

Aerial surveys conducted using manned or unmanned aircraft with customized camera payloads can generate a large number of images. Manual review of these images to extract data is prohibitive in terms of time and financial resources, thus providing strong incentive to automate this process using computer vision systems. There are potential applications for these automated systems in areas such as surveillance and monitoring, precision agriculture, law enforcement, asset inspection, and wildlife assessment. In this paper, we present an efficient machine learning system for automating the detection of marine species in aerial imagery. The effectiveness of our approach can be credited to the combination of a well-suited region proposal method and the use of Deep Convolutional Neural Networks (DCNNs). In comparison to previous algorithms designed for the same purpose, we have been able to dramatically improve recall to more than 80% and improve precision to 27% by using DCNNs as the core approach.

When a puzzle game is created, its design parameters must be chosen to allow solvable and interesting challenges to be created for the player. We investigate the use of random sampling as a computationally inexpensive means of automated game analysis, to evaluate the BoxOff family of puzzle games. This analysis reveals useful insights into the game, such as the surprising fact that almost 100% of randomly generated challenges have a solution, but less than 10% will be solved using strictly random play, validating the inventor’s design choices. We show the 1D game to be trivial and the 3D game to be viable.

In this paper, we introduce a path algebra well suited for navigation in environments that can be abstracted as topological graphs. From this path algebra, we derive algorithms to reduce routes in such environments. The routes are reduced in the sense that they are shorter (contain fewer edges), but still connect the endpoints of the initial routes. Contrary to planning methods descended from Disjktra’s Shortest Path Algorithm like D , the navigation methods derived from our path algebra do not require any graph representation. We prove that the reduced routes are optimal when the graphs are without cycles. In the case of graphs with cycles, we prove that whatever the length of the initial route, the length of the reduced route is bounded by a constant that only depends on the structure of the environment.

Information available on company websites can help people navigate to the offices of groups and individuals within the company. Automatically retrieving this within-organisation spatial information is a challenging AI problem This paper introduces a novel unsupervised pattern-based method to extract within-organisation spatial information by taking advantage of HTML structure patterns, together with a novel Conditional Random Fields (CRF) based method to identify different categories of within-organisation spatial information. The results show that the proposed method can achieve a high performance in terms of F-Score, indicating that this purely syntactic method based on web search and an analysis of HTML structure is well-suited for retrieving within-organisation spatial information.