Probabilistic mapping with mobile robots in structured environments

La mayor parte de los entornos diseñados por el hombre presentan características geométricas específicas. En ellos es frecuente encontrar formas poligonales, rectangulares, circulares . . . con una serie de relaciones típicas entre distintos elementos del entorno. Introducir este tipo de conocimiento en el proceso de construcción de mapas de un robot móvil puede mejorar notablemente la calidad y la precisión de los mapas resultantes. También puede hacerlos más útiles de cara a un razonamiento de más alto nivel. Cuando la construcción de mapas se formula en un marco probabilístico Bayesiano, una especificación completa del problema requiere considerar cierta información a priori sobre el tipo de entorno. El conocimiento previo puede aplicarse de varias maneras, en esta tesis se presentan dos marcos diferentes: uno basado en el uso de primitivas geométricas y otro que emplea un método de representación cercano al espacio de las medidas brutas. Un enfoque basado en características geométricas supone implícitamente imponer un cierto modelo a priori para el entorno. En este sentido, el desarrollo de una solución al problema SLAM mediante la optimización de un grafo de características geométricas constituye un primer paso hacia nuevos métodos de construcción de mapas en entornos estructurados. En el primero de los dos marcos propuestos, el sistema deduce la información a priori a aplicar en cada caso en base a una extensa colección de posibles modelos geométricos genéricos, siguiendo un método de Maximización de la Esperanza para hallar la estructura y el mapa más probables. La representación de la estructura del entorno se basa en un enfoque jerárquico, con diferentes niveles de abstracción para los distintos elementos geométricos que puedan describirlo. Se llevaron a cabo diversos experimentos para mostrar la versatilidad y el buen funcionamiento del método propuesto. En el segundo marco, el usuario puede definir diferentes modelos de estructura para el entorno mediante grupos de restricciones y energías locales entre puntos vecinos de un conjunto de datos del mismo. El grupo de restricciones que se aplica a cada grupo de puntos depende de la topología, que es inferida por el propio sistema. De este modo, se pueden incorporar nuevos modelos genéricos de estructura para el entorno con gran flexibilidad y facilidad. Se realizaron distintos experimentos para demostrar la flexibilidad y los buenos resultados del enfoque propuesto. Abstract Most human designed environments present specific geometrical characteristics. In them, it is easy to find polygonal, rectangular and circular shapes, with a series of typical relations between different elements of the environment. Introducing this kind of knowledge in the mapping process of mobile robots can notably improve the quality and accuracy of the resulting maps. It can also make them more suitable for higher level reasoning applications. When mapping is formulated in a Bayesian probabilistic framework, a complete specification of the problem requires considering a prior for the environment. The prior over the structure of the environment can be applied in several ways; this dissertation presents two different frameworks, one using a feature based approach and another one employing a dense representation close to the measurements space. A feature based approach implicitly imposes a prior for the environment. In this sense, feature based graph SLAM was a first step towards a new mapping solution for structured scenarios. In the first framework, the prior is inferred by the system from a wide collection of feature based priors, following an Expectation-Maximization approach to obtain the most probable structure and the most probable map. The representation of the structure of the environment is based on a hierarchical model with different levels of abstraction for the geometrical elements describing it. Various experiments were conducted to show the versatility and the good performance of the proposed method. In the second framework, different priors can be defined by the user as sets of local constraints and energies for consecutive points in a range scan from a given environment. The set of constraints applied to each group of points depends on the topology, which is inferred by the system. This way, flexible and generic priors can be incorporated very easily. Several tests were carried out to demonstrate the flexibility and the good results of the proposed approach.

Single optical surface imaging designs with unconstrained object to image mapping

In this work, novel imaging designs with a single optical surface (either refractive or reflective) are presented. In some of these designs, both object and image shapes are given but mapping from object to image is obtained as a result of the design. In other designs, not only the mapping is obtained in the design process, but also the shape of the object is found. In the examples considered, the image is virtual and located at infinity and is seen from known pupil, which can emulate a human eye. In the first introductory part, 2D designs have been done using three different design methods: a SMS design, a compound Cartesian oval surface, and a differential equation method for the limit case of small pupil. At the point-size pupil limit, it is proven that these three methods coincide. In the second part, previous 2D designs are extended to 3D by rotation and the astigmatism of the image has been studied. As an advanced variation, the differential equation method is used to provide the freedom to control the tangential rays and sagittal rays simultaneously. As a result, designs without astigmatism (at the small pupil limit) on a curved object surface have been obtained. Finally, this anastigmatic differential equation method has been extended to 3D for the general case, in which freeform surfaces are designed.

A systematic mapping study on the open source software development process.

Abstract?Background: There is no globally accepted open source software development process to define how open source software is developed in practice. A process description is important for coordinating all the software development activities involving both people and technology. Aim: The research question that this study sets out to answer is: What activities do open source software process models contain? The activity groups on which it focuses are Concept Exploration, Software Requirements, Design, Maintenance and Evaluation. Method: We conduct a systematic mapping study (SMS). A SMS is a form of systematic literature review that aims to identify and classify available research papers concerning a particular issue. Results: We located a total of 29 primary studies, which we categorized by the open source software project that they examine and by activity types (Concept Exploration, Software Requirements, Design, Maintenance and Evaluation). The activities present in most of the open source software development processes were Execute Tests and Conduct Reviews, which belong to the Evaluation activities group. Maintenance is the only group that has primary studies addressing all the activities that it contains. Conclusions: The primary studies located by the SMS are the starting point for analyzing the open source software development process and proposing a process model for this community. The papers in our paper pool that describe a specific open source software project provide more regarding our research question than the papers that talk about open source software development without referring to a specific open source software project.

Applying concept mapping strategies to improve students’ lifelong learning in physical chemistry

Este artículo ofrece una reflexión sobre el papel de los mapas conceptuales en el actual escenario de la educación In the present paper, we carry out the application of concept mapping strategies to learning Physical Chemistry, in particular, of all aspect of Corrosion. This strategy is an alternative method to supplement examinations: it can show the teacher how much the students knew and how much they didn´t know; and the students can evaluate their own learning. Before giving tile matter on Corrosion, the teachers evaluated the previous knowledge of the students in the field and explained to the students how create the conceptual maps with Cmap tools. When the subject is finished, teachers are assessed the conceptual maps developed by students and therefore also the level of the students learning. Teachers verified that the concept mapping is quite suitable for complicated theorics as Corrosion and it is an appropriate tool for the consolidation of educational experiences and for improvement affective lifelong learning. By using this method we demonstrated that the set of concepts accumulated in the cognitive structure of every student in unique and every student has therefore arranged the concepts from top to bottom in the mapping field in different ways with different linking" phrases, although these are involved in the same learning task.

From Analysis Model to Software Architecture: a PIM2PIM Mapping.

To our knowledge, no current software development methodology explicitly describes how to transit from the analysis model to the software architecture of the application. This paper presents a method to derive the software architecture of a system from its analysis model. To do this, we are going to use MDA. Both the analysis model and the architectural model are PIMs described with UML 2. The model type mapping designed consists of several rules (expressed using OCL and natural language) that, when applied to the analysis artifacts, generate the software architecture of the application. Specifically the rules act on elements of the UML 2 metamodel (metamodel mapping). We have developed a tool (using Smalltalk) that permits the automatic application of these rules to an analysis model defined in RoseTM to generate the application architecture expressed in the architectural style C2.

Mapping Dynamics into Graphs. The Visibility Algorithm

Si no tenemos en cuenta posibles procesos subyacentes con significado físico, químico, económico, etc., podemos considerar una serie temporal como un mero conjunto ordenado de valores y jugar con él algún inocente juego matemático como transformar dicho conjunto en otro objeto con la ayuda de una operación matemática para ver qué sucede: qué propiedades del conjunto original se conservan, cuáles se transforman y cómo, qué podemos decir de alguna de las dos representaciones matemáticas del objeto con sólo atender a la otra... Este ejercicio sería de cierto interés matemático por sí solo. Ocurre, además, que las series temporales son un método universal de extraer información de sistemas dinámicos en cualquier campo de la ciencia. Esto hace ganar un inesperado interés práctico al juego matemático anteriormente descrito, ya que abre la posibilidad de analizar las series temporales (vistas ahora como evolución temporal de procesos dinámicos) desde una nueva perspectiva. Hemos para esto de asumir la hipótesis de que la información codificada en la serie original se conserva de algún modo en la transformación (al menos una parte de ella). El interés resulta completo cuando la nueva representación del objeto pertencece a un campo de la matemáticas relativamente maduro, en el cual la información codificada en dicha representación puede ser descodificada y procesada de manera efectiva. ABSTRACT Disregarding any underlying process (and therefore any physical, chemical, economical or whichever meaning of its mere numeric values), we can consider a time series just as an ordered set of values and play the naive mathematical game of turning this set into a different mathematical object with the aids of an abstract mapping, and see what happens: which properties of the original set are conserved, which are transformed and how, what can we say about one of the mathematical representations just by looking at the other... This exercise is of mathematical interest by itself. In addition, it turns out that time series or signals is a universal method of extracting information from dynamical systems in any field of science. Therefore, the preceding mathematical game gains some unexpected practical interest as it opens the possibility of analyzing a time series (i.e. the outcome of a dynamical process) from an alternative angle. Of course, the information stored in the original time series should be somehow conserved in the mapping. The motivation is completed when the new representation belongs to a relatively mature mathematical field, where information encoded in such a representation can be effectively disentangled and processed. This is, in a nutshell, a first motivation to map time series into networks.

Land Cover Mapping by an Optimized Object-Oriented Approach. Case of Study Mediterranean Landscapes

Remote sensing information from spaceborne and airborne platforms continues to provide valuable data for different environmental monitoring applications. In this sense, high spatial resolution im-agery is an important source of information for land cover mapping. For the processing of high spa-tial resolution images, the object-based methodology is one of the most commonly used strategies. However, conventional pixel-based methods, which only use spectral information for land cover classification, are inadequate for classifying this type of images. This research presents a method-ology to characterise Mediterranean land covers in high resolution aerial images by means of an object-oriented approach. It uses a self-calibrating multi-band region growing approach optimised by pre-processing the image with a bilateral filtering. The obtained results show promise in terms of both segmentation quality and computational efficiency.

Initial design with L2 Monge-Kantorovich theory for the Monge–Ampère equation method of freeform optics

The Monge–Ampère (MA) equation arising in illumination design is highly nonlinear so that the convergence of the MA method is strongly determined by the initial design. We address the initial design of the MA method in this paper with the L2 Monge-Kantorovich (LMK) theory, and introduce an efficient approach for finding the optimal mapping of the LMK problem. Three examples, including the beam shaping of collimated beam and point light source, are given to illustrate the potential benefits of the LMK theory in the initial design. The results show the MA method converges more stably and faster with the application of the LMK theory in the initial design.

Dynamic mapping at the laminar level of odor-elicited responses in rat olfactory bulb by functional MRI

We have applied functional MRI (fMRI) based on blood oxygenation level-dependent (BOLD) image-contrast to map odor-elicited olfactory responses at the laminar level in the rat olfactory bulb (OB) elicited by iso-amyl acetate (10−2 dilution of saturated vapor) with spatial and temporal resolutions of 220×220×1,000 μm and 36 s. The laminar structure of the OB was clearly depicted by high-resolution in vivo anatomical MRI with spatial resolution of 110×110×1,000 μm. In repeated BOLD fMRI measurements, highly significant (P < 0.001) foci were located in the outer layers of both OBs. The occurrence of focal OB activity within a domain at the level of individual glomeruli or groups of glomeruli was corroborated on an intra- and inter-animal basis under anesthetized conditions with this noninvasive method. The dynamic studies demonstrated that the odor-elicited BOLD activations were highly reproducible on a time scale of minutes, whereas over tens of minutes the activations sometimes varied slowly. We found large BOLD signal (ΔS/S = 10–30%) arising from the olfactory nerve layer, which is devoid of synapses and composed of unmyelinated fibers and glial cells. Our results support previous studies with other methods showing that odors elicit activity within glomerular layer domains in the mammalian OB, and extend the analysis to shorter time periods at the level of individual glomeruli or groups of glomeruli. With further improvement, BOLD fMRI should be ideal for systematic analysis of the functional significance of individual glomeruli in olfactory information encoding and of spatiotemporal processing within the olfactory system.

Temporal mapping of gene expression levels during the differentiation of individual primary hematopoietic cells

A hierarchical order of gene expression has been proposed to control developmental events in hematopoiesis, but direct demonstration of the temporal relationships between regulatory gene expression and differentiation has been difficult to achieve. We modified a single-cell PCR method to detect 2-fold changes in mRNA copies per cell (dynamic range, 250–250,000 copies/cell) and used it to sequentially quantitate gene expression levels as single primitive (CD34+,CD38−) progenitor cells underwent differentiation to become erythrocytes, granulocytes, or monocyte/macrophages. Markers of differentiation such as CD34 or cytokine receptor mRNAs and transcription factors associated with their regulation were assessed. All transcription factors tested were expressed in multipotent progenitors. During lineage-specific differentiation, however, distinct patterns of expression emerged. SCL, GATA-2, and GATA-1 expression sequentially extinguished during erythroid differentiation. PU.1, AML1B, and C/EBPα expression profiles and their relationship to cytokine receptor expression in maturing granulocytes could be distinguished from similar profiles in monocytic cells. These data characterize the dynamics of gene expression accompanying blood cell development and define a signature gene expression pattern for specific stages of hematopoietic differentiation.

Multiple-complete-digest restriction fragment mapping: Generating sequence-ready maps for large-scale DNA sequencing

Multiple-complete-digest mapping is a DNA mapping technique based on complete-restriction-digest fingerprints of a set of clones that provides highly redundant coverage of the mapping target. The maps assembled from these fingerprints order both the clones and the restriction fragments. Maps are coordinated across three enzymes in the examples presented. Starting with yeast artificial chromosome contigs from the 7q31.3 and 7p14 regions of the human genome, we have produced cosmid-based maps spanning more than one million base pairs. Each yeast artificial chromosome is first subcloned into cosmids at a redundancy of ×15–30. Complete-digest fragments are electrophoresed on agarose gels, poststained, and imaged on a fluorescent scanner. Aberrant clones that are not representative of the underlying genome are rejected in the map construction process. Almost every restriction fragment is ordered, allowing selection of minimal tiling paths with clone-to-clone overlaps of only a few thousand base pairs. These maps demonstrate the practicality of applying the experimental and software-based steps in multiple-complete-digest mapping to a target of significant size and complexity. We present evidence that the maps are sufficiently accurate to validate both the clones selected for sequencing and the sequence assemblies obtained once these clones have been sequenced by a “shotgun” method.

Mapping of a Myosin-binding Domain and a Regulatory Phosphorylation Site in M-Protein, a Structural Protein of the Sarcomeric M Band

The myofibrils of cross-striated muscle fibers contain in their M bands cytoskeletal proteins whose main function seems to be the stabilization of the three-dimensional arrangement of thick filaments. We identified two immunoglobin domains (Mp2–Mp3) of M-protein as a site binding to the central region of light meromyosin. This binding is regulated in vitro by phosphorylation of a single serine residue (Ser76) in the immediately adjacent amino-terminal domain Mp1. M-protein phosphorylation by cAMP-dependent kinase A inhibits binding to myosin LMM. Transient transfection studies of cultured cells revealed that the myosin-binding site seems involved in the targeting of M-protein to its location in the myofibril. Using the same method, a second myofibril-binding site was uncovered in domains Mp9–Mp13. These results support the view that specific phosphorylation events could be also important for the control of sarcomeric M band formation and remodeling.