Effectiveness of Low-Cost Planting Techniques for Improving Water Availability to Olea europaea Seedlings in Degraded Drylands

Reforestation projects in semiarid lands often yield poor results. Water scarcity, poor soil fertility, and structure strongly limit the survival and growth of planted seedlings in these areas. At two experimental semiarid sites, we evaluated a variety of low-cost planting techniques in order to increase water availability to plants. Treatments included various combinations of traditional planting holes; water-harvesting microcatchments; stone or plastic mulches; small waterproof sheets to increase water harvesting; dry wells; buried clay pots; and deep irrigation. Some of these treatments were also combined with addition of composted biosolids. Waterproof sheets significantly enhanced water harvesting (43%) and soil moisture in the planting hole (40%), especially for low-intensity rainfall events. Treatment effects on the survival and growth of Olea europaea seedlings varied between experimental sites. At the most water-limited site, clay pots, and dry wells improved seedling survival, while no treatment enhanced seedling growth. At the least water-stressed site, the application of composted sludge significantly improved seedling growth. We conclude that nutrient-mediated stress is subordinate to water stress in arid and semiarid environments, and we suggest modifications on the microsite scale to address these limiting conditions in Mediterranean drylands.

Cost-Effective Force Field Tailored for Solid-Phase Simulations of OLED Materials

A united atom force field is empirically derived by minimizing the difference between experimental and simulated crystal cells and melting temperatures for eight compounds representative of organic electronic materials used in OLEDs and other devices: biphenyl, carbazole, fluorene, 9,9′-(1,3-phenylene)bis(9H-carbazole)-1,3-bis(N-carbazolyl)benzene (mCP), 4,4′-bis(N-carbazolyl)-1,1′-biphenyl (pCBP), phenazine, phenylcarbazole, and triphenylamine. The force field is verified against dispersion-corrected DFT calculations and shown to also successfully reproduce the crystal structure for two larger compounds employed as hosts in phosphorescent and thermally activated delayed fluorescence OLEDs: N,N′-di(1-naphthyl)-N,N′-diphenyl-(1,1′-biphenyl)-4,4′-diamine (NPD), and 1,3,5-tri(1-phenyl-1H-benzo[d]imidazol-2-yl)phenyl (TPBI). The good performances of the force field coupled to the large computational savings granted by the united atom approximation make it an ideal choice for the simulation of the morphology of emissive layers for OLED materials in crystalline or glassy phases.

Convergence analysis and validation of low cost distance metrics for computational cost reduction of the Iterative Closest Point algorithm

The Iterative Closest Point algorithm (ICP) is commonly used in engineering applications to solve the rigid registration problem of partially overlapped point sets which are pre-aligned with a coarse estimate of their relative positions. This iterative algorithm is applied in many areas such as the medicine for volumetric reconstruction of tomography data, in robotics to reconstruct surfaces or scenes using range sensor information, in industrial systems for quality control of manufactured objects or even in biology to study the structure and folding of proteins. One of the algorithm’s main problems is its high computational complexity (quadratic in the number of points with the non-optimized original variant) in a context where high density point sets, acquired by high resolution scanners, are processed. Many variants have been proposed in the literature whose goal is the performance improvement either by reducing the number of points or the required iterations or even enhancing the complexity of the most expensive phase: the closest neighbor search. In spite of decreasing its complexity, some of the variants tend to have a negative impact on the final registration precision or the convergence domain thus limiting the possible application scenarios. The goal of this work is the improvement of the algorithm’s computational cost so that a wider range of computationally demanding problems from among the ones described before can be addressed. For that purpose, an experimental and mathematical convergence analysis and validation of point-to-point distance metrics has been performed taking into account those distances with lower computational cost than the Euclidean one, which is used as the de facto standard for the algorithm’s implementations in the literature. In that analysis, the functioning of the algorithm in diverse topological spaces, characterized by different metrics, has been studied to check the convergence, efficacy and cost of the method in order to determine the one which offers the best results. Given that the distance calculation represents a significant part of the whole set of computations performed by the algorithm, it is expected that any reduction of that operation affects significantly and positively the overall performance of the method. As a result, a performance improvement has been achieved by the application of those reduced cost metrics whose quality in terms of convergence and error has been analyzed and validated experimentally as comparable with respect to the Euclidean distance using a heterogeneous set of objects, scenarios and initial situations.