Lipschitz compact operators

We introduce the notion of Lipschitz compact (weakly compact, finite-rank, approximable) operators from a pointed metric space X into a Banach space E. We prove that every strongly Lipschitz p-nuclear operator is Lipschitz compact and every strongly Lipschitz p-integral operator is Lipschitz weakly compact. A theory of Lipschitz compact (weakly compact, finite-rank) operators which closely parallels the theory for linear operators is developed. In terms of the Lipschitz transpose map of a Lipschitz operator, we state Lipschitz versions of Schauder type theorems on the (weak) compactness of the adjoint of a (weakly) compact linear operator.

3D model based map building

Comunicación presentada en el IX Workshop de Agentes Físicos (WAF'2008), Vigo, 11-12 septiembre 2008.

3D plane-based egomotion for SLAM on semi-structured environment

Several works deal with 3D data in SLAM problem. Data come from a 3D laser sweeping unit or a stereo camera, both providing a huge amount of data. In this paper, we detail an efficient method to extract planar patches from 3D raw data. Then, we use these patches in an ICP-like method in order to address the SLAM problem. Using ICP with planes is not a trivial task. It needs some adaptation from the original ICP. Some promising results are shown for outdoor environment.

Towards a reverse engineering approach for guiding user in applying data mining

Comunicación presentada en las XVI Jornadas de Ingeniería del Software y Bases de Datos, JISBD 2011, A Coruña, 5-7 septiembre 2011.

El portafolio discente en línea como herramienta de aprendizaje transversal

El desarrollo de competencias transversales proporciona al alumno una formación integral. Sin embargo, la puesta en práctica de la transversalidad entre asignaturas no es una tarea trivial y plantea varios inconvenientes que deben resueltos de una manera óptima para aprovechar las sinergias entre asignaturas. En nuestro caso las necesidades son: i) espacio común para la gestión de documentos, ii) disponibilidad en cualquier momento y en cualquier lugar, y iii) posibilidad de colaboración en tareas de edición de los documentos. Hemos aplicado un portafolio discente en línea que permite evaluar el resultado del aprendizaje de las asignaturas en su conjunto, y para ello hemos usado las herramientas de acceso libre que proporciona Google por su interactividad, disponibilidad y facilidad para las tareas de colaboración.

How online applications can help to achieve integral learning

The development of transversal competencies provides an integral education. However, its practical implementation among different subjects is not a trivial task. There are several issues that should be previously solved in an optimal way to take advantage of the synergy among subjects. Main issues are: i) the need for a common space for the documents management, ii) the availability of the document everywhere and anytime, and iii) the possibility to collaborate in the documents edition tasks. It was implemented a virtual portfolio for the students which allows the assessment of all the subjects in a global way. To this goal we used the Google apps due to its free access, availability and suitability for the collaborative editing tasks.

Creación automática de sistemas de búsqueda de respuestas en dominios restringidos

Los sistemas de búsqueda de respuestas (BR) se pueden considerar como potenciales sucesores de los buscadores tradicionales de información en la Web. Para que sean precisos deben adaptarse a dominios concretos mediante el uso de recursos semánticos adecuados. La adaptación no es una tarea trivial, ya que deben integrarse e incorporarse a sistemas de BR existentes varios recursos heterogéneos relacionados con un dominio restringido. Se presenta la herramienta Maraqa, cuya novedad radica en el uso de técnicas de ingeniería del software, como el desarrollo dirigido por modelos, para automatizar dicho proceso de adaptación a dominios restringidos. Se ha evaluado Maraqa mediante una serie de experimentos (sobre el dominio agrícola) que demuestran su viabilidad, mejorando en un 29,5% la precisión del sistema adaptado.

Métodos de máxima verosimilitud en ecología y su aplicación en modelos de vecindad

Los métodos de máxima verosimilitud (MMV) ofrecen un marco alternativo a la estadística frecuentista convencional, alejándose del uso del p-valor para el rechazo de una única hipótesis nula y optando por el uso de las verosimilitudes para evaluar el grado de apoyo en los datos a un conjunto de hipótesis alternativas (o modelos) de interés para el investigador. Estos métodos han sido ampliamente aplicados en ecología en el marco de los modelos de vecindad. Dichos modelos usan una aproximación espacialmente explícita para describir procesos demográficos de plantas o procesos ecosistémicos en función de los atributos de los individuos vecinos. Se trata por tanto de modelos fenomenológicos cuya principal utilidad radica en funcionar como herramientas de síntesis de los múltiples mecanismos por los que las especies pueden interactuar e influenciar su entorno, proporcionando una medida del efecto per cápita de individuos de distintas características (ej. tamaño, especie, rasgos fisiológicos) sobre los procesos de interés. La gran ventaja de aplicar los MMV en el marco de los modelos de vecindad es que permite ajustar y comparar múltiples modelos que usen distintos atributos de los vecinos y/o formas funcionales para seleccionar aquel con mayor soporte empírico. De esta manera, cada modelo funcionará como un “experimento virtual” para responder preguntas relacionadas con la magnitud y extensión espacial de los efectos de distintas especies coexistentes, y extraer conclusiones sobre posibles implicaciones para el funcionamiento de comunidades y ecosistemas. Este trabajo sintetiza las técnicas de implementación de los MMV y los modelos de vecindad en ecología terrestre, resumiendo su uso hasta la fecha y destacando nuevas líneas de aplicación.

Noise-tolerance feasibility for restricted-domain Information Retrieval systems

Information Retrieval systems normally have to work with rather heterogeneous sources, such as Web sites or documents from Optical Character Recognition tools. The correct conversion of these sources into flat text files is not a trivial task since noise may easily be introduced as a result of spelling or typeset errors. Interestingly, this is not a great drawback when the size of the corpus is sufficiently large, since redundancy helps to overcome noise problems. However, noise becomes a serious problem in restricted-domain Information Retrieval specially when the corpus is small and has little or no redundancy. This paper devises an approach which adds noise-tolerance to Information Retrieval systems. A set of experiments carried out in the agricultural domain proves the effectiveness of the approach presented.

Synthesis and Characterization of Lactic Acid Oligomers: Evaluation of Performance as Poly(Lactic Acid) Plasticizers

The use of fully bio-based and biodegradable materials for massive applications, such as food packaging, is an emerging tendency in polymer research. But the formulations proposed in this way should preserve or even increase the functional properties of conventional polymers, such as transparency, homogeneity, mechanical properties and low migration of their components to foodstuff. This is not always trivial, in particular when brittle biopolymers, such as poly(lactic acid) (PLA), are considered. In this work the formulation of innovative materials based on PLA modified with highly compatible plasticizers, i.e. oligomers of lactic acid (OLAs) is proposed. Three different synthesis conditions for OLAs were tested and the resulting additives were further blended with commercial PLA obtaining transparent and ductile materials, able for films manufacturing. These materials were tested in their structural, thermal and tensile properties and the best formulation among the three materials was selected. OLA with molar mass (Mn) around 1,000 Da is proposed as an innovative and fully compatible and biodegradable plasticizer for PLA, able to replace conventional plasticizers (phthalates, adipates or citrates) currently used for films manufacturing in food packaging applications.

Quantum spin Hall phase in multilayer graphene

The so-called quantum spin Hall phase is a topologically nontrivial insulating phase that is predicted to appear in graphene and graphenelike systems. In this paper we address the question of whether this topological property persists in multilayered systems. We consider two situations: purely multilayer graphene and heterostructures where graphene is encapsulated by trivial insulators with a strong spin-orbit coupling. We use a four-orbital tight-binding model that includes full atomic spin-orbit coupling and we calculate the Z2 topological invariant of the bulk states as well as the edge states of semi-infinite crystals with armchair termination. For homogeneous multilayers we find that even when the spin-orbit interaction opens a gap for all possible stackings, only those with an odd number of layers host gapless edge states while those with an even number of layers are trivial insulators. For heterostructures where graphene is encapsulated by trivial insulators, it turns out that interlayer coupling is able to induce a topological gap whose size is controlled by the spin-orbit coupling of the encapsulating materials, indicating that the quantum spin Hall phase can be induced by proximity to trivial insulators.

Comparative study of RPSALG algorithm for convex semi-infinite programming

The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.