Stretchable electronics for artificial skin

Postprint (published version

Developing Allometric Equations for Teak Plantations Located in the Coastal Region of Ecuador from Terrestrial Laser Scanning Data

Traditional studies aimed at developing allometric models to estimate dry above-ground biomass (AGB) and other tree-level variables, such as tree stem commercial volume (TSCV) or tree stem volume (TSV), usually involves cutting down the trees. Although this method has low uncertainty, it is quite costly and inefficient since it requires a very time-consuming field work. In order to assist in data collection and processing, remote sensing is allowing the application of non-destructive sampling methods such as that based on terrestrial laser scanning (TLS). In this work, TLS-derived point clouds were used to digitally reconstruct the tree stem of a set of teak trees (Tectona grandis Linn. F.) from 58 circular reference plots of 18 m radius belonging to three different plantations located in the Coastal Region of Ecuador. After manually selecting the appropriate trees from the entire sample, semi-automatic data processing was performed to provide measurements of TSCV and TSV, together with estimates of AGB values at tree level. These observed values were used to develop allometric models, based on diameter at breast height (DBH), total tree height (h), or the metric DBH2 × h, by applying a robust regression method to remove likely outliers. Results showed that the developed allometric models performed reasonably well, especially those based on the metric DBH2 × h, providing low bias estimates and relative RMSE values of 21.60% and 16.41% for TSCV and TSV, respectively. Allometric models only based on tree height were derived from replacing DBH by h in the expression DBH2 x h, according to adjusted expressions depending on DBH classes (ranges of DBH). This finding can facilitate the obtaining of variables such as AGB (carbon stock) and commercial volume of wood over teak plantations in the Coastal Region of Ecuador from only knowing the tree height, constituting a promising method to address large-scale teak plantations monitoring from the canopy height models derived from digital aerial stereophotogrammetry

Object-Based Greenhouse Classification from GeoEye-1 and WorldView-2 Stereo Imagery

Remote sensing technologies have been commonly used to perform greenhouse detection and mapping. In this research, stereo pairs acquired by very high-resolution optical satellites GeoEye-1 (GE1) and WorldView-2 (WV2) have been utilized to carry out the land cover classification of an agricultural area through an object-based image analysis approach, paying special attention to greenhouses extraction. The main novelty of this work lies in the joint use of single-source stereo-photogrammetrically derived heights and multispectral information from both panchromatic and pan-sharpened orthoimages. The main features tested in this research can be grouped into different categories, such as basic spectral information, elevation data (normalized digital surface model; nDSM), band indexes and ratios, texture and shape geometry. Furthermore, spectral information was based on both single orthoimages and multiangle orthoimages. The overall accuracy attained by applying nearest neighbor and support vector machine classifiers to the four multispectral bands of GE1 were very similar to those computed from WV2, for either four or eight multispectral bands. Height data, in the form of nDSM, were the most important feature for greenhouse classification. The best overall accuracy values were close to 90%, and they were not improved by using multiangle orthoimages

En busca de una paternidad desconocida : la imagen de Nuestra Señora de la Concepción en el panorama escultórico barroco malagueño, una primera aproximación a su estudio histórico-artístico

45 páginas.Trabajo Fin de Máster Propio en Escultura Barroca Española (2013/14). Director/Tutor: Juan Antonio Sánchez López. La imagen de Nuestra Señora de la Concepción es una talla dieciochesca que, tradicionalmente, ha venido a estar adscrita a las manos del escultor malagueño Fernando Ortiz (1717-1771). A partir de este trabajo justificamos el surgimiento de la morfología presentada por dicha talla a través de un profundo recorrido por la imaginería del siglo XVIII realizada en Málaga. Además, las analogías presentadas por algunas imágenes realizadas por las mismas fechas, finales del XVIII, permiten apuntar la existencia de varias manos que se dedicaron a explotar las poéticas establecidas por Ortiz después de 1756. Por último, y teniendo en cuenta que un alto número de imágenes de repoblación en esta ciudad proceden del culto doméstico, dedicamos un punto a la atención de las imágenes de urna y su conversión en imágenes de culto interno y procesión

New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics

This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial or non homogeneous comparisons. In this paper, we review these heuristics and perform a comprehensive computational evaluation to determine which are the most efficient ones. A total of 20 heuristics are implemented and compared in this study. In addition, we propose four new heuristics for the problem. Firstly, two memory-based constructive heuristics are proposed, where a sequence is constructed by inserting jobs one by one in a partial sequence. The most promising insertions tested are kept in a list. However, in contrast to the Tabu search, these insertions are repeated in future iterations instead of forbidding them. Secondly, we propose two constructive heuristics based on Johnson’s algorithm for the permutation flowshop scheduling problem. The computational results carried out on an extensive testbed show that the new proposals outperform the existing heuristics.Ministerio de Ciencia e Innovación DPI2016-80750-

Efficient heuristics for the hybrid flow shop scheduling problem with missing operations

In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are interested in the special case where there are missing operations, i.e. some stages are skipped, a condition inspired in a realistic problem found in a plastic manufacturer. The main contribution of our paper is twofold. On the one hand we carry out a computational analysis to study the hardness of the hybrid flowshop scheduling problem with missing operations as compared to the classical hybrid flowshop problem. On the other hand, we propose a set of heuristics that captures some special features of the missing operations and compare these algorithms with already existing heuristics for the classical hybrid flowshop, and for the hybrid flowshop problem with missing operations. The extensive computational experience carried out shows that our proposal outperforms existing methods for the problem, indicating that it is possible to improve the makespan by interacting with the jobs with missing operations.Ministerio de Ciencia e Innovación DPI2016-80750-

Bidirectional locomotion of magnetically assembled nanorod-sphere propeller

Postprint (published version

On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively inserting, one by one, the non-scheduled jobs into all positions of an existing subsequence, and then, among the so obtained subsequences, selecting the one yielding the lowest (partial) makespan. This procedure usually causes a high number of ties (different subsequences with the same best partial makespan) that must be broken via a tie-breaking mechanism. The particular tie-breaking mechanism employed is known to have a great influence in the performance of the NEH, therefore different procedures have been proposed in the literature. However, to the best of our knowledge, no tie-breaking mechanism has been proposed for the iterated greedy. In our paper, we present a new tie-breaking mechanism based on an estimation of the idle times of the different subsequences in order to pick the one with the lowest value of the estimation. The computational experiments carried out show that this mechanism outperforms the existing ones both for the NEH and the iterated greedy for different CPU times. Furthermore, embedding the proposed tie-breaking mechanism into the iterated greedy provides the most efficient heuristic for the problem so far.Ministerio de Ciencia e Innovación DPI2010-15573/DP