Maximum principles for vectorial approximate minimisers on non-convex functionals

We establish Maximum Principles which apply to vectorial approximate minimizers of the general integral functional of Calculus of Variations. Our main result is a version of the Convex Hull Property. The primary advance compared to results already existing in the literature is that we have dropped the quasiconvexity assumption of the integrand in the gradient term. The lack of weak Lower semicontinuity is compensated by introducing a nonlinear convergence technique, based on the approximation of the projection onto a convex set by reflections and on the invariance of the integrand in the gradient term under the Orthogonal Group. Maximum Principles are implied for the relaxed solution in the case of non-existence of minimizers and for minimizing solutions of the Euler–Lagrange system of PDE.

A high frequency $hp$ boundary element method for scattering by convex polygons

In this paper we propose and analyze a hybrid $hp$ boundary element method for the solution of problems of high frequency acoustic scattering by sound-soft convex polygons, in which the approximation space is enriched with oscillatory basis functions which efficiently capture the high frequency asymptotics of the solution. We demonstrate, both theoretically and via numerical examples, exponential convergence with respect to the order of the polynomials, moreover providing rigorous error estimates for our approximations to the solution and to the far field pattern, in which the dependence on the frequency of all constants is explicit. Importantly, these estimates prove that, to achieve any desired accuracy in the computation of these quantities, it is sufficient to increase the number of degrees of freedom in proportion to the logarithm of the frequency as the frequency increases, in contrast to the at least linear growth required by conventional methods.

Rapid preconditioning of data for accelerating convex hull algorithms

Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the original set of n points. The method is O(n). It helps any convex hull algorithm run faster. The empirical analysis of a practical case shows a percentage reduction in points of over 98%, that is reflected as a faster computation with a speedup factor of at least 4.

Spatio-temporal variations of ozone and nitrogen dioxide concentrations under urban trees and in a nearby open area

The evergreen Quercus ilex L. is one of the most common trees in Italian urban environments and is considered effective in the uptake of particulate and gaseous atmospheric pollutants. However, the few available estimates on O3 and NO2 removal by urban Q. ilex originate from model-based studies (which indicate NO2/O3 removal capacity of Q. ilex) and not from direct measurements of air pollutant concentrations. Thus, in the urban area of Siena (central Italy) we began long-term monitoring of O3/NO2 concentrations using passive samplers at a distance of 1, 5, 10 m from a busy road, under the canopies of Q. ilex and in a nearby open-field. Measurements performed in the period June 2011-October 2013 showed always a greater decrease of NO2 concentrations under the Q. ilex canopy than in the open-field transect. Conversely, a decrease of average O3 concentrations under the tree canopy was found only in autumn after the typical Mediterranean post-summer rainfalls. Our results indicate that interactions between O3/NO2 concentrations and trees in Mediterranean urban ecosystems are affected by temporal variations in climatic conditions. We argue therefore that the direct measurement of atmospheric pollutant concentrations should be chosen to describe local changes of aerial pollution.

Trees for development? Articulating the ambiguities of power, authority and legitimacy in governing Ghana’s mineral rich forests

The growth of mining activities in Africa in the last decade has coincided with increased attention on the fate of the continent’s forests, specifically in the contexts of livelihoods and climate change. Although mining has serious environmental impacts, scant attention has been paid to the processes which shape decision-making in contexts where minerals and forests overlap. Focussing on the illustrative case of Ghana, this paper articulates the dynamics of power, authority and legitimacy of private companies, traditional authorities and key state institutions in governing mining activities in forests. The analysis highlights how mining companies and donors promote a neoliberal model of resource management which entrenches their ability to benefit from mineral exploitation and marginalises the role of state institutions and traditional authorities in decision-making. This subsequently erodes state authority and legitimacy and compounds the contested nature of traditional authorities’ legitimacy. A more nuanced examination of foundational governance questions concerning the relative role of the state, traditional authorities and private interests is needed.

An assessment of the impact of trees upon archaeology within a relict wetland

An evaluation of a surviving stretch of the Abbot's Way, in the Somerset Levels and Moors, was undertaken to assess the consequences of the previous management regime and inform future management of the site. The scheduled site appeared to have been dewatered and desiccated as a consequence of tree planting and the effects of a deep, adjacent drainage ditch during the previous decade. The evaluation considered the condition of the Neolithic timbers and associated palaeoenvironmental record from three trenches and, where possible, compared the results with those obtained form the 1974 excavation (Girling, 1976). The results of this analysis suggest that the hydrological consequences of tree planting and colonization had a detrimental effect on both the condition of the timbers and insect remains. However, pollen and plant macro-fossils survived well although there was modern contamination. A trench opened outside the scheduled area. where the ground was waterlogged and supported a wet acid grassland flora, revealed similar problems of survival and condition. This almost certainly reflects a period of peat extraction and an associated seasonally fluctuating water table in the 1950s and 1960s; in fact pollen survived better in the scheduled dewatered area. These results are compared with those recovered from the Sweet Track which was evaluated in 1996. Both sites have been subject to recent tree growth but the Sweet Track has been positively managed in terms of hydrology. The most notable difference between the two sites is that insects and wood survived better at the Sweet Track sites than at the Abbot's Way. Insects seem to be a more sensitive indicator of site desiccation than plant remains. It is recommended that any programme of management of wetland for archaeology should avoid deliberate tree planting and natural scrub and woodland generation. It should also take into account past as well as present land use.

Preconditioning 2D integer data for fast convex hull computations

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.