Estimation of Key Dates and Stages in Rice Crops Using Dual-Polarization SAR Time Series and a Particle Filtering Approach

Information of crop phenology is essential for evaluating crop productivity. In a previous work, we determined phenological stages with remote sensing data using a dynamic system framework and an extended Kalman filter (EKF) approach. In this paper, we demonstrate that the particle filter is a more reliable method to infer any phenological stage compared to the EKF. The improvements achieved with this approach are discussed. In addition, this methodology enables the estimation of key cultivation dates, thus providing a practical product for many applications. The dates of some important stages, as the sowing date and the day when the crop reaches the panicle initiation stage, have been chosen to show the potential of this technique.

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.

Software for video-based multi-point frequency measuring and mapping

Complementary programs

Methods and algorithms for video-based multi-point frequency measuring and mapping

Software for video-based multi-point frequency measuring and mapping: http://hdl.handle.net/10045/53429

A Model to Visualize Information in a Complex Streets’ Network

his paper discusses a process to graphically view and analyze information obtained from a network of urban streets, using an algorithm that establishes a ranking of importance of the nodes of the network itself. The basis of this process is to quantify the network information obtained by assigning numerical values to each node, representing numerically the information. These values are used to construct a data matrix that allows us to apply a classification algorithm of nodes in a network in order of importance. From this numerical ranking of the nodes, the process finish with the graphical visualization of the network. An example is shown to illustrate the whole process.

A new betweenness centrality measure based on an algorithm for ranking the nodes of a network

We propose and discuss a new centrality index for urban street patterns represented as networks in geographical space. This centrality measure, that we call ranking-betweenness centrality, combines the idea behind the random-walk betweenness centrality measure and the idea of ranking the nodes of a network produced by an adapted PageRank algorithm. We initially use a PageRank algorithm in which we are able to transform some information of the network that we want to analyze into numerical values. Numerical values summarizing the information are associated to each of the nodes by means of a data matrix. After running the adapted PageRank algorithm, a ranking of the nodes is obtained, according to their importance in the network. This classification is the starting point for applying an algorithm based on the random-walk betweenness centrality. A detailed example of a real urban street network is discussed in order to understand the process to evaluate the ranking-betweenness centrality proposed, performing some comparisons with other classical centrality measures.

Analyzing the commercial activities of a street network by ranking their nodes: a case study in Murcia, Spain

Urban researchers and planners are often interested in understanding how economic activities are distributed in urban regions, what forces influence their special pattern and how urban structure and functions are mutually dependent. In this paper, we want to show how an algorithm for ranking the nodes in a network can be used to understand and visualize certain commercial activities of a city. The first part of the method consists of collecting real information about different types of commercial activities at each location in the urban network of the city of Murcia, Spain. Four clearly differentiated commercial activities are studied, such as restaurants and bars, shops, banks and supermarkets or department stores, but obviously we can study other. The information collected is then quantified by means of a data matrix, which is used as the basis for the implementation of a PageRank algorithm which produces a ranking of all the nodes in the network, according to their significance within it. Finally, we visualize the resulting classification using a colour scale that helps us to represent the business network.

Overexpression of guanylate cyclase activating protein 2 in rod photoreceptors in vivo leads to morphological changes at the synaptic ribbon

Guanylate cyclase activating proteins are EF-hand containing proteins that confer calcium sensitivity to retinal guanylate cyclase at the outer segment discs of photoreceptor cells. By making the rate of cGMP synthesis dependent on the free intracellular calcium levels set by illumination, GCAPs play a fundamental role in the recovery of the light response and light adaptation. The main isoforms GCAP1 and GCAP2 also localize to the synaptic terminal, where their function is not known. Based on the reported interaction of GCAP2 with Ribeye, the major component of synaptic ribbons, it was proposed that GCAP2 could mediate the synaptic ribbon dynamic changes that happen in response to light. We here present a thorough ultrastructural analysis of rod synaptic terminals in loss-of-function (GCAP1/GCAP2 double knockout) and gain-of-function (transgenic overexpression) mouse models of GCAP2. Rod synaptic ribbons in GCAPs−/− mice did not differ from wildtype ribbons when mice were raised in constant darkness, indicating that GCAPs are not required for ribbon early assembly or maturation. Transgenic overexpression of GCAP2 in rods led to a shortening of synaptic ribbons, and to a higher than normal percentage of club-shaped and spherical ribbon morphologies. Restoration of GCAP2 expression in the GCAPs−/− background (GCAP2 expression in the absence of endogenous GCAP1) had the striking result of shortening ribbon length to a much higher degree than overexpression of GCAP2 in the wildtype background, as well as reducing the thickness of the outer plexiform layer without affecting the number of rod photoreceptor cells. These results indicate that preservation of the GCAP1 to GCAP2 relative levels is relevant for maintaining the integrity of the synaptic terminal. Our demonstration of GCAP2 immunolocalization at synaptic ribbons at the ultrastructural level would support a role of GCAPs at mediating the effect of light on morphological remodeling changes of synaptic ribbons.

Innovation in the teaching of sustainable development in Europe: the case of ISLE Erasmus Network

Sustainable Development (SD) is one of the most widely used terms during the last years. It is a multidisciplinary concept, which applies mostly to life sciences but is not limited to them. Even though the short survey conducted by the authors revealed that there are only a few cases of Higher Educational Institutes (HEIs) around Europe that provide programs dedicated to SD, it is obvious that there is a constant raise in the need for implementing courses related to SD in existing programs. This paper discusses the case study of I.S.L.E., an Erasmus Academic Network, which aims to use the existing knowledge and tools in the context of teaching sustainable development topics in Universities and HEIs around Europe as a basis, and elaborate further by introducing an innovative approach towards the improvement of teaching SD in HEIs, based on the current needs as they are identified by the actions of the Network.

Coverage and invariance for the biological control of pests in mediterranean greenhouses

A major problem related to the treatment of ecosystems is that they have no available mathematical formalization. This implies that many of their properties are not presented as short, rigorous modalities, but rather as long expressions which, from a biological standpoint, totally capture the significance of the property, but which have the disadvantage of not being sufficiently manageable, from a mathematical standpoint. The interpretation of ecosystems through networks allows us to employ the concepts of coverage and invariance alongside other related concepts. The latter will allow us to present the two most important relations in an ecosystem – predator–prey and competition – in a different way. Biological control, defined as “the use of living organisms, their resources or their products to prevent or reduce loss or damage caused by pests”, is now considered the environmentally safest and most economically advantageous method of pest control (van Lenteren, 2011). A guild includes all those organisms that share a common food resource (Polis et al., 1989), which in the context of biological control means all the natural enemies of a given pest. There are several types of intraguild interactions, but the one that has received most research attention is intraguild predation, which occurs when two organisms share the same prey while at the same time participating in some kind of trophic interaction. However, this is not the only intraguild relationship possible, and studies are now being conducted on others, such as oviposition deterrence. In this article, we apply the developed concepts of structural functions, coverage, invariant sets, etc. (Lloret et al., 1998, Esteve and Lloret, 2006a, Esteve and Lloret, 2006b and Esteve and Lloret, 2007) to a tritrophic system that includes aphids, one of the most damaging pests and a current bottleneck for the success of biological control in Mediterranean greenhouses.

Pyrimidine-Derived Prolinamides as Recoverable Bifunctional Organocatalysts for Enantioselective Inter- and Intramolecular Aldol Reactions under Solvent-Free Conditions

Chiral L-prolinamides 2 containing the (R,R)- and (S,S)-trans-cyclohexane-1,2-diamine scaffold and a 2-pyrimidinyl unit are synthesized and used as general organocatalysts for intermolecular and intramolecular aldol reactions with 1,6-hexanedioic acid as a co-catalyst under solvent-free conditions. The intermolecular reaction between ketone–aldehyde and aldehyde–aldehyde must be performed under wet conditions with catalyst (S,S)-2b at 10 °C, which affords anti-aldols with high regio-, diastereo-, and enantioselectivities. For the Hajos–Parrish–Eder–Sauer–Wiechert reaction, both diastereomers of catalyst 2 give similar results at room temperature in the absence of water to give the corresponding Wieland–Miescher ketone and derivatives. Both types of reactions were scaled up to 1 g, and the organocatalysts were recovered by extractive workup and reused without any appreciable loss in activity. DFT calculations support the stereochemical results of the intermolecular process and the bifunctional role played by the organocatalyst by providing a computational comparison of the H-bonding networks occurring with catalysts 2a and 2b.

A Computational Architecture Based on RFID Sensors for Traceability in Smart Cities

Information Technology and Communications (ICT) is presented as the main element in order to achieve more efficient and sustainable city resource management, while making sure that the needs of the citizens to improve their quality of life are satisfied. A key element will be the creation of new systems that allow the acquisition of context information, automatically and transparently, in order to provide it to decision support systems. In this paper, we present a novel distributed system for obtaining, representing and providing the flow and movement of people in densely populated geographical areas. In order to accomplish these tasks, we propose the design of a smart sensor network based on RFID communication technologies, reliability patterns and integration techniques. Contrary to other proposals, this system represents a comprehensive solution that permits the acquisition of user information in a transparent and reliable way in a non-controlled and heterogeneous environment. This knowledge will be useful in moving towards the design of smart cities in which decision support on transport strategies, business evaluation or initiatives in the tourism sector will be supported by real relevant information. As a final result, a case study will be presented which will allow the validation of the proposal.

Azudes y acueductos del sistema de riego tradicional de la Vega Baja del Segura (Alicante, España)

En el presente trabajo se describen y analizan las principales obras hidráulicas del sistema de riego tradicional de la comarca de la Vega Baja del Segura, concretamente, los azudes y los acueductos. Los azudes de toma, construidos en el cauce del río Segura, representan el inicio del sistema, desde donde parte una extensa y compleja red de acueductos constituida por acequias y azarbes, como elementos fundamentales, que distribuyen el agua para el regadío. En este estudio se ha llevado a cabo una amplia y profunda investigación documental, tomado datos de campo y captado imágenes in situ que, junto con los diagramas aportados, resultan imprescindibles para comprender la magnitud del sistema. Los resultados obtenidos han servido no sólo para catalogar y caracterizar los elementos que integran el sistema hidráulico del regadío tradicional de la Vega Baja del Segura, sino también para poner de manifiesto un ejemplo real de optimización de recursos hídricos en una zona del sureste peninsular español de escasa e irregular pluviometría. Asimismo, el estudio efectuado revela un sistema de riego sumamente eficiente desde un punto de vista cuantitativo y no tanto desde el cualitativo, debido a la presencia, entre otros contaminantes, de altas concentraciones de sales.

Competencias y contenidos comunes de salud pública del Grado en Medicina en las universidades españolas

Objetivo: Consensuar las competencias profesionales de salud pública que deben adquirir los estudiantes en el Grado en Medicina y los contenidos fundamentales que debe incluir la materia de salud pública según el criterio de un grupo de docentes de salud pública del Grado en Medicina de distintas universidades españolas. Métodos: Se organizó una 2 ª Reunión del Foro de Profesorado Universitario de Salud Pública en la Universidad Rey Juan Carlos (Madrid, 11-12 de diciembre de 2014), en la que participaron 24 docentes de 19 universidades españolas con Grado en Medicina que fueron distribuidos en tres grupos durante tres sesiones de trabajo. En la primera sesión, se identificaron y clasificaron las competencias propias del Grado; en la segunda, se propusieron contenidos de salud pública para las competencias identificadas; en la tercera, se organizaron los contenidos en bloques temáticos. Los resultados se discutieron hasta alcanzar acuerdos, en distintas sesiones plenarias. Resultados: El mayor número de competencias identificadas corresponde a actividades de las funciones «Valorar las necesidades de salud de la población» y «Desarrollar políticas de salud». El programa final incluye contenidos básicos organizados en cinco bloques: Concepto de salud, salud pública y sus condicionantes; Epidemiología e investigación en salud; Condicionantes y problemas de salud; Estrategias, intervenciones y políticas; y Sistemas de salud, gestión clínica y sanitaria. Conclusiones: Las competencias y los contenidos comunes consensuados en este Foro constituyen una base para actualizar y mejorar la formación en salud pública de los futuros profesionales de la medicina.