Pasar al contenido principal

EVOLUCION DE SISTEMAS DINAMICOS EN LA NUBE: UN ESCENARIO MARCO HACIA LAS INTERFACES DE USUARIO INTELIGENTES

TIN2013-41576-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2013
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario UNIVERSIDAD DE ALMERIA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 50
Encontrada(s) 1 página(s)

riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

GPU-aided edge computing for processing the k nearest-neighbor query on SSD-resident data

  • Velentzas, Polychronis
  • Vassilakipoulos, Michael
  • Corral Liria, Antonio Leopoldo
Edge computing aims at improving performance by storing and processing data closer to their source. The Nearest-Neighbor (-NN) query is a common spatial query in several applications. For example, this query can be used for distance classification of a group of points against a big reference dataset to derive the dominating feature class. Typically, GPU devices have much larger numbers of processing cores than CPUs and faster device memory than main memory accessed by CPUs, thus, providing higher computing power. However, since device and/or main memory may not be able to host an entire reference dataset, the use of secondary storage is inevitable. Solid State Disks (SSDs) could be used for storing such a dataset. In this paper, we propose an architecture of a distributed edge-computing environment where large-scale processing of the -NN query can be accomplished by executing an efficient algorithm for processing the -NN query on its (GPU and SSD enabled) edge nodes. We also propose a new algorithm for this purpose, a GPU-based partitioning algorithm for processing the -NN query on big reference data stored on SSDs. We implement this algorithm in a GPU-enabled edge-computing device, hosting reference data on an SSD. Using synthetic datasets, we present an extensive experimental performance comparison of the new algorithm against two existing ones (working on memory-resident data) proposed by other researchers and two existing ones (working on SSD-resident data) recently proposed by us. The new algorithm excels in all the conducted experiments and outperforms its competitors.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

PTL: A Model Transformation Language based on Logic Programming

  • Almendros Jiménez, Jesús Manuel
  • Iribarne Martínez, Luis Fernando
  • López Fernández, Jesús J.
  • Mora-Segura, Ángel
In this paper we present a model transformation language based on logic programming. The language, called PTL (Prolog based Transformation Language), can be considered as a hybrid language in which ATL (Atlas Transformation Language)-style rules are combined with logic rules for defining transformations. ATL-style rules are used to define mappings from source models to target models while logic rules are used as helpers. The implementation of PTL is based on the encoding of the ATL-style rules by Prolog rules. Thus, PTL makes use of Prolog as a transformation engine. We have provided a declarative semantics to PTL and proved the semantics equivalent to the encoded program. We have studied an encoding of OCL (Object Constraint Language) with Prolog goals in order to map ATL to PTL. Thus a subset of PTL can be considered equivalent to a subset of ATL. The proposed language can be also used for model validation, that is, for checking constraints on models and transformations. We have equipped our language with debugging and tracing capabilities which help developers to detect programming errors in PTL rules. Additionally, we have developed an Eclipse plugin for editing PTL programs, as well as for debugging, tracing and validation. Finally, we have evaluated the language with several transformation examples as well as tested the performance with large models.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Toward the adaptation of component-based architectures by model transformation: behind smart user interfaces

  • Criado Rodríguez, Javier
  • Rodríguez-Gracia, Diego
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
Graphical user interfaces are not always developed for remaining static. There are GUIs with the need of implementing some variability mechanisms. Component-based GUIs are an ideal target for incorporating this kind of operations, because they can adapt their functionality at run-time when their structure is updated by adding or removing components or by modifying the relationships between them. Mashup user interfaces are a good example of this type of GUI, and they allow to combine services through the assembly of graphical components. We intend to adapt component based user interfaces for obtaining smart user interfaces. With this goal, our proposal attempts to adapt abstract component-based architectures by using model transformation. Our aim is to generate at run-time a dynamic model transformation, because the rules describing their behavior are not pre set but are selected from a repository depending on the context. The proposal describes an adaptation schema based on model transformation providing a solution to this dynamic transformation. Context information is processed to select at run-time a rule subset from a repository. Selected rules are used to generate, through a higher-order transformation, the dynamic model transformation. This approach has been tested through a case study which applies different repositories to the same architecture and context. Moreover, a web tool has been developed for validation and demonstration of its applicability. The novelty of our proposal arises from the adaptation schema that creates a non pre-set transformation, which enables the dynamic adaptation of component-based architectures.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Distance Range Queries in SpatialHadoop

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakipoulos, Michael
Efficient processing of Distance Range Queries (DRQs) is of great importance in spatial databases due to the wide area of applications. This type of spatial query is characterized by a distance range over one or two datasets. The most representative and known DRQs are the ε Distance Range Query (εDRQ) and the ε Distance Range Join Query (εDRJQ). Given the increasing volume of spatial data, it is difficult to perform a DRQ on a centralized machine efficiently. Moreover, the εDRJQ is an expensive spatial operation, since it can be considered a combination of the εDR and the spatial join queries. For this reason, this paper addresses the problem of computing DRQs on big spatial datasets in SpatialHadoop, an extension of Hadoop that supports spatial operations efficiently, and proposes new algorithms in SpatialHadoop to perform efficient parallel DRQs on large-scale spatial datasets. We have evaluated the performance of the proposed algorithms in several situations with big synthetic and real-world datasets. The experiments have demonstrated the efficiency and scalability of our proposal.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Efficient query processing on large spatial databases A performance study

  • Roumelis, George
  • Vassilakipoulos, Michael
  • Corral Liria, Antonio Leopoldo
  • Manolopoulos, Yannis
Processing of spatial queries has been studied extensively in the literature. In most cases, it is accomplished by indexing spatial data using spatial access methods. Spatial indexes, such as those based on the Quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints and objects. In this paper, we study a recent balanced disk-based index structure for point data, called xBR + -tree, that belongs to the Quadtree family and hierarchically decomposes space in a regular manner. For the most common spatial queries, like Point Location, Window, Distance Range, Nearest Neighbor and Distance-based Join, the R-tree family is a very popular choice of spatial index, due to its excellent query performance. For this reason, we compare the performance of the xBR + -tree with respect to the R ∗ -tree and the R + -tree for tree building and processing the most studied spatial queries. To perform this comparison, we utilize existing algorithms and present new ones. We demonstrate through extensive experimental performance results (I/O efficiency and execution time), based on medium and large real and synthetic datasets, that the xBR + -tree is a big winner in execution time in all cases and a winner in I/O in most cases.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Creating datasets for data analysis through a cloud microservice-based architecture

  • Fernández García, Antonio Jesús
  • Criado Rodríguez, Javier
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
Data analysis is a trending technique due to the tendency of analyzing patterns or generating knowledge in different domains. However, it is difficult to know at design time what raw data should be collected, how it is going to be analyzed or which analysis techniques will be applied to data. Service-oriented architectures can be applied to solve these problems by providing flexible and reliable architectures. In this paper, we present a microservice-based software architecture in the cloud with the aim of generating datasets to carry out data analysis. This architecture facilitates acquiring data, which may be located in a data center, distributed, or even on different devices (ubiquitous computing) due to the rise of the IoT. It provides an infrastructure over which multiple developer’ groups can work in parallel on the microservices. These microservices also provide a reliable and affordable adaptability to the lack of specific requirements in some functionalities and the fast evolution and variability of them, due to the fast changing of client needs.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A Cloud Service for COTS component-based Architectures

  • Vallecillos Ruiz, Jesús
  • Criado Rodríguez, Javier
  • Padilla Soriano, Nicolás
  • Iribarne Martínez, Luis Fernando
The management of software architectures is an important subject, especially in component-based web user interfaces to enhance their accessibility, dynamism and management at run-time. The Cloud offers some favorable mechanisms for this kind of systems, since it allows us to manage the software remotely, guarantees high availability of the resources and enables us to perform mass storage. This article presents an infrastructure solution, based on the use of web services and cloud computing, for managing COTS-based architectures.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Modeling Big Data based Systems through Ontological Trading

  • Iribarne Martínez, Luis Fernando
  • Asensio, José Andrés
  • Padilla Soriano, Nicolás
  • Criado Rodríguez, Javier
One of the great challenges the information society faces is dealing with the huge amount of information generated and handled daily on the Internet. Today, progress in Big Data proposals attempt to solve this problem, but there are certain limitations to information search and retrieval due basically to the large volumes handled, the heterogeneity of the information and its dispersion among a multitude of sources. In this article, a formal framework is defined to facilitate the design and development of an Environmental Management Information System which works with an heterogeneous and large amount of data. Nevertheless, this framework can be applied to other information systems that work with Big Data, since it does not depend on the type of data and can be utilized in other domains. The framework is based on an Ontological Web-Trading Model (OntoTrader) which follows Model-Driven Engineering and Ontology-Driven Engineering guidelines to separate the system architecture from its implementation. The proposal is accompanied by a case study, SOLERES-KRS, an Environmental Knowledge Representation System designed and developed using Software Agents and Multi-Agent Systems.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Efficient distributed algorithms for distance join queries in spark-based spatial analytics systems

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakopoulos, Michael
Apache Sedona (formerly GeoSpark) is a new in-memory cluster computing system for processing large-scale spatial data, which extends the core of Apache Spark to support spatial datatypes, partitioning techniques, spatial indexes, and spatial operations (e.g., spatial range, nearest neighbor, and spatial join queries). Distancebased Join Queries (DJQs), like nearest neighbor join (kNNJQ) or closest pairs queries (kCPQ), are not supported by it. Therefore, in this paper, we investigate how to design and implement efficient DJQ distributed algorithms in Apache Sedona, using the most appropriate spatial partitioning and other optimization techniques. The results of an extensive set of experiments with real-world datasets are presented, demonstrating that the proposed kNNJQ and kCPQ distributed algorithms are efficient, scalable, and robust in Apache Sedona. Finally, Sedona is also compared to other similar cluster computing systems, showing the best performance for kCPQ and competitive results for kNNJQ.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Stigma-stop a serious game against the stigma in mental disorders

  • Piedra Fernández, José Antonio
  • Fernández García, Antonio Jesús
  • Cangas Díaz, Adolfo Javier
  • Ojeda Castelo, Juan Jesús
  • Cangas, Diego
In this work, a serious game is presented to sensitize young people to stigma in mental health. This a video game, developed by a multidisciplinary team (computer scientists, psychologists, psychiatrists and educators), features characters that have different mental disorders. It provides different information about what mental illness is while the player interacts with the characters in different ways, indicating which the most appropriate reactions are. There are also various short games aimed at eradicating stigma. The game will be available for free to teenagers and college students. Furthermore, it can be used both independently and as part of other existing programs in schools against stigma of mental disorders.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Art activities with Kinect to students with cognitive disabilities: Improving all motor skills

  • Bernal Bravo, César
  • Ojeda Castelo, Juan Jesús
  • Piedra Fernández, José Antonio
The study presents a set of interactive activities based on the dance and on the music for students with cognitive disabilities which are resisting to the therapies of rehabilitation with the physical therapist. The development of each one of these activities has achieved with teachers, physical therapist and students, all of them members of the research team. We have followed for this studio the principles of the Design Based Research. The main results are that the students have been more motivated in the accomplishment of activities of rehabilitation based on the music and on the dance. Also, these games have been motivating and very useful resource for the acceptance of conventional the therapies.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Libro o Monografía (Book)

RkNN Query Processing in Distributed Spatial Infrastructures: A Performance Study

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakipoulos, Michael
The Reverse k-Nearest Neighbor (RkNN) problem, i.e. finding all objects in a dataset that have a given query point among their corresponding k-nearest neighbors, has received increasing attention in the past years. RkNN queries are of particular interest in a wide range of applications such as decision support systems, resource allocation, profile-based marketing, location-based services, etc. With the current increasing volume of spatial data, it is difficult to perform RkNN queries efficiently in spatial data-intensive applications, because of the limited computational capability and storage resources. In this paper, we investigate how to design and implement distributed RkNN query algorithms using shared-nothing spatial cloud infrastructures as SpatialHadoop and LocationSpark. SpatialHadoop is a framework that inherently supports spatial indexing on top of Hadoop to perform efficiently spatial queries. LocationSpark is a recent spatial data processing system built on top of Spark. We have evaluated the performance of the distributed RkNN query algorithms on both SpatialHadoop and LocationSpark with big real-world datasets. The experiments have demonstrated the efficiency and scalability of our proposal in both distributed spatial data management systems, showing the performance advantages of LocationSpark.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Una Aproximación MDA para la Construcción de Componentes COTSgets en Aplicaciones Web

  • Asensio, José Andrés
  • Padilla Soriano, Nicolás
  • Criado Rodríguez, Javier
  • Iribarne Martínez, Luis Fernando
Actualmente, existe una tendencia al desarrollo de aplicaciones web. Muchas de estas aplicaciones se construyen en base a componentes reutilizables, lo que influye considerablemente en el tiempo de desarrollo. En este contexto se enmarca nuestra propuesta. El artı́culo presenta una solución basada en la ingenierı́a dirigida por modelos (MDE) para agilizar y facilitar a los desarrolladores la implementación de un tipo de componentes web (llamados COTSgets). Nuestra propuesta consiste en la generación automática de la implementación de estos componentes, en lo que a su estructura y funcionalidad básica se refiere, a partir de un modelo que describe su especificación y mediante la utilización de una transformación modelo-a-texto (M2T). Para dicha implementación se ha seleccionado la incipiente tecnologı́a Polymer.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A Collaborative testbed Web Tool for Learning Model Transformation in Software Engineering Education

  • Rodríguez-Gracia, Diego
  • Criado Rodríguez, Javier
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
Software Engineering provides mechanisms to design, develop, manage and maintain social and collaborative software systems. At present, the Software Engineering Curricula includes teaching Model-Driven Engineering (MDE) as a new paradigm that enables higher productivity, attempting to maximize compatibility between systems. Modern learning methods MDE require the use of practical approaches to analyze new model-transformation techniques. Model transformations are carried out by using very high-level languages, like the ATL language. This model transformation language is built as a plugin for the Eclipse framework, and users who want to collaborate and develop software with it, have some difficulties executing ATL transformations outside this platform. To handle models at runtime, it is interesting to perform the transformations in a standalone way. In this context, we have developed a testbed web tool which aims to be useful for learning model transformation techniques. The tool offers a Graphical User Interface to test and verify the involved model transformations.The proposal is useful as a collaborative scenario for learning MDE and model transformation issues and techniques in Software Engineering education.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Libro o Monografía (Book)

Evolving Mashup Interfaces using a Distributed Machine Learning and Model Transformation Methodology

  • Fernández García, Antonio Jesús
  • Iribarne Martínez, Luis Fernando
  • Corral Liria, Antonio Leopoldo
  • Wang, James Z.
Nowadays users access information services at any time and in any place. Providing an intelligent user interface which adapts dynamically to the users’ requirements is essential in information systems. Conventionally, systems are constructed at the design time according to an initial structure and requirements. The effect of the passage of time and changes in users, applications and environment is that the systems cannot always satisfy the user’s requirements. In this paper a methodology is proposed to allow mashup user interfaces to be intelligent and evolve over time by using computational techniques like machine learning over huge amounts of heterogeneous data, known as big data, and model-driven engineering techniques as model transformations. The aim is to generate new ways of adapting the interface to the user’s needs, using information about user’s interaction and the environment.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

A Component-based User Interface Approach for Smart TV

  • Vallecillos Ruiz, Jesús
  • Criado Rodríguez, Javier
  • Padilla Soriano, Nicolás
  • Iribarne Martínez, Luis Fernando
The fast growth and diversity of technological devices currently being produced is benefiting areas such as “ambient intelligence”. This area attempts to integrate information technology in any personal environment. However, to construct service/application software that adapts to different environments, there must be techniques available that favor this type of development. Component based software Engineering (CBSE) is a discipline of the software engineering that integrates (previously constructed) components to build new software systems. This paper presents a CBSE approach to build Graphical User Interfaces (GUI) at run-time. Both a component-based perspective of the user interface and a set of component relationships are presented in the paper. As a case study, this paper also describes an application built for an emerging computation environment, Smart TV. A running example is also presented through the paper putting some Web-based solutions to build User Interfaces together (e.g., Wookie, W3C Widgets, Node.js).
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Enabling the reuse of stored model transformations through annotations

  • Criado Rodríguez, Javier
  • Martínez, Salvador
  • Iribarne Martínez, Luis Fernando
  • Cabot, Jordi
With the increasing adoption of MDE, model transformations, one of its core concepts together with metamodeling, stand out as a valuable asset. Therefore, a mechanism to annotate and store existing model transformations appears as a critical need for their efficient exploitation and reuse. Unfortunately, although several reuse mechanisms have been proposed for software artifacts in general and models in particular, none of them is specially tailored to the domain of model transformations. In order to fill this gap, we present here such a mechanism. Our approach is composed by two elements 1) a new DSL specially conceived for describing model transformations in terms of their functional and non-functional properties 2) a semi-automatic process for annotating and querying (repositories of) model transformations using as criteria the properties of our DSL. We validate the feasibility of our approach through a prototype implementation that integrates our approach in a GitHub repository.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Enhancing SpatialHadoop with Closest Pair Queries

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakipoulos, Michael
  • Manolopoulos, Yannis
Given two datasets P and Q, the K Closest Pair Query (KCPQ) finds the K closest pairs of objects from P ×Q. It is an operation widely adopted by many spatial and GIS applications. As a combination of the K Nearest Neighbor (KNN) and the spatial join queries, KCPQ is an expensive operation. Given the increasing volume of spatial data, it is difficult to perform a KCPQ on a centralized machine efficiently. For this reason, this paper addresses the problem of computing the KCPQ on big spatial datasets in SpatialHadoop, an extension of Hadoop that supports spatial operations efficiently, and proposes a novel algorithm in SpatialHadoop to perform efficient parallel KCPQ on large-scale spatial datasets. We have evaluated the performance of the algorithm in several situations with big synthetic and real-world datasets. The experiments have demonstrated the efficiency and scalability of our proposal.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Adaptive Domotic System in Green Buildings

  • Rodríguez-Gracia, Diego
  • Piedra Fernández, José Antonio
  • Iribarne Martínez, Luis Fernando
This paper presents an adaptive domotic system in green buildings. In our case, the data of sensor and devices were controlled in CIESOL center. The adaptive domotic system uses a Fuzzy Lattice Reasoning classifier for predicting building energy performance depending on the user condition. Training and testing of classifiers were carried out with temperature condition data acquired for 4 months (February, May, July and November) in the case building called CIESOL. The results show a hihg accuracy rates with a mean absolute error between 0% and 0.21%.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Libro o Monografía (Book)

Optimally Storing the User Interaction in Mashup Interfaces within a Relational Database

  • Fernández García, Antonio Jesús
  • Iribarne Martínez, Luis Fernando
  • Corral Liria, Antonio Leopoldo
  • Criado Rodríguez, Javier
  • Wang, James Z.
Cross-device applications that have user interfaces managed in multiple forms of interaction are prevalent. In particular, component-based (or mashup) applications are growing in popularity due to their easiness to build customized user interfaces with pieces of information from different sources. Since the user interaction on mashup interfaces can generate a large quantity of data, which can be useful to improving the interaction and usefulness of the application, it may involve the creation of cloud infrastructures to manage the dynamic distributed user interfaces within this context. Storing the generated data from the interaction performed over the user interface can be challenging. To achieve these goals, in this paper, a relational database for storing this interaction information generated on distributed user interfaces is proposed. Thus, user interaction over heterogeneous interfaces and devices described in detail, will be easily accessible for further analysis using machine learning and data mining techniques to offer a better user experience.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Aplicación del ABP y aprendizaje-servicio en las asignaturas del grado y máster en Ingeniería Informática desde la semipresencialidad

  • Piedra Fernández, José Antonio
  • Fernández Martínez, Antonio
  • Peralta, Mercedes
  • Iribarne Martínez, Luis Fernando
El aprendizaje basado en problemas (ABP) se implantó hace varios años en las asignaturas del Grado, así como en el reciente máster en Ingeniería Informática de la UAL. La puesta en marcha de un enfoque empresarial integrando proyectos con clientes reales y otras metodologías activas como el aprendizaje-servicio, un aprendizaje colaborativo ha propiciado un entorno motivador y empresarial para el alumnado. El carácter semipresencial ha potenciado el trabajo autónomo y la tutorización del alumno. Los resultados de los alumnos en las asignaturas son muy positivos fomentando un aprendizaje duradero y facilitando la incorporación a un entorno empresarial.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

OBIA System for Identifying Mesoscale Oceanic Structures in SeaWiFS and MODIS-Aqua Images

  • Vidal-Fernández, Eva
  • Piedra Fernández, José Antonio
  • Almendros Jiménez, Jesús Manuel
  • Cantón Garbín, Manuel
The ocean covers over 70% of the surface of our planet and plays a key role in the global climate. Most ocean circulation is mesoscale (scales of 50–500 km and 10–100 days), and the energy in mesoscale circulation is at least one order of magnitude greater than general circulation; therefore, the study of mesoscale oceanic structures (MOS) is crucial to ocean dynamics, making it especially useful for analyzing global changes. The detection of MOS, such as upwellings or eddies, from satellites images is significant for marine environmental studies and coastal resource management. In this paper, we present an object-based image analysis (OBIA) system which segments and classifies regions contained in sea-viewing field-of-view sensor (SeaWiFS) and Moderate Resolution Imaging Spectro-radiometer (MODIS)-Aqua sensor satellite images into MOS. After color clustering and hierarchical data format (HDF) file processing, the OBIA system segments images and extracts image descriptors, producing primary regions. Then, it merges regions, recalculating image descriptors for MOS identification and definition. First, regions are labeled by a human-expert, who identifies MOS: upwellings, eddies, cool, and warm eddies. Labeled regions are then classified by learning algorithms (i.e., decision tree, Bayesian network, artificial neural network, genetic algorithm, and near neighbor algorithm) from selected features. Finally, the OBIA system enables images to be queried from the user interface and retrieved by means of fuzzy descriptors and oceanic structures. We tested our system with images from the Canary Islands and the North West African coast.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Extraction of Knowledge Rules for the Retrieval of Mesoscale Oceanic Structures in Ocean Satellite Images

  • Vidal-Fernández, Eva
  • Almendros Jiménez, Jesús Manuel
  • Piedra Fernández, José Antonio
  • Cantón Garbín, Manuel
The processing of ocean satellite images has as goal the detection of phenomena related with ocean dynamics. In this context, Mesoscale Oceanic Structures (MOS) play an essential role. In this chapter we will present the tool developed in our group in order to extract knowledge rules for the retrieval of MOS in ocean satellite images. We will describe the implementation of the tool: the workflow associated with the tool, the user interface, the class structure, and the database of the tool. Additionally, the experimental results obtained with the tool in terms of fuzzy knowledge rules as well as labeled structures with these rules are shown. These results have been obtained with the tool analyzing chlorophyll and temperature images of the Canary Islands and North West African coast captured by the SeaWiFS and MODIS-Aqua sensors.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Efficient Distance Join Query Processing in Distributed Spatial Data Management Systems

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakipoulos, Michael
  • Manolopoulos, Yannis
Due to the ubiquitous use of spatial data applications and the large amounts of such data these applications use, the processing of large-scale distance joins in distributed systems is becoming increasingly popular. Distance Join Queries (DJQs) are important and frequently used operations in numerous applications, including data mining, multimedia and spatial databases. DJQs (e.g., k Nearest Neighbor Join Query, k Closest Pair Query, ε Distance Join Query, etc.) are costly operations, since they involve both the join and distance-based search, and performing DJQs efficiently is a challenging task. Recent Big Data developments have motivated the emergence of novel technologies for distributed processing of large-scale spatial data in clusters of computers, leading to Distributed Spatial Data Management Systems (DSDMSs). Distributed cluster-based computing systems can be classified as Hadoop-based or Spark-based systems. Based on this classification, in this paper, we compare two of the most recent and leading DSDMSs, SpatialHadoop and LocationSpark, by evaluating the performance of several existing and newly proposed parallel and distributed DJQ algorithms under various settings with large spatial real-world datasets. A general conclusion arising from the execution of the distributed DJQ algorithms studied is that, while SpatialHadoop is a robust and efficient system when large spatial datasets are joined (since it is built on top of the mature Hadoop platform), LocationSpark is the clear winner in total execution time efficiency when medium spatial datasets are combined (due to in-memory processing provided by Spark). However, LocationSpark requires higher memory allocation when large spatial datasets are involved in DJQs (even more so when k and ε are large). Finally, this detailed performance study has demonstrated that the new distributed DJQ algorithms we have proposed are efficient, robust and scalable with respect to different parameters, such as dataset sizes, k, ε and number of computing nodes.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Exploring quality-aware architectural transformations at run-time: the ENIA case

  • Criado Rodríguez, Javier
  • Martínez Fernández, Silverio Juan
  • Ameller, David
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
Adapting software systems at run-time is a key issue, especially when these systems consist of components used as intermediary for human-computer interaction. In this sense, model transformation techniques have a widespread acceptance as a mechanism for adapting and evolving the software architecture of such systems. However, existing model transformations often focus on functional requirements, and quality attributes are only manually considered after the transformations are done. This paper aims to improve the quality of adaptations and evolutions in component-based software systems by taking into account quality attributes within the model transformation process. To this end, we present a quality-aware transformation process using software architecture metrics to select among many alternative model transformations. Such metrics evaluate the quality attributes of an architecture. We validate the presented quality-aware transformation process in ENIA, a geographic information system whose user interfaces are based on coarsegrained components and need to be adapted at run-time.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Mediación semántica A* basada en MDE para la generación de arquitecturas en tiempo de ejecución

  • Criado Rodríguez, Javier
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
Existen aplicaciones software que necesitan ser adaptadas en tiempo de ejecución debido a que los componentes que conforma su arquitectura no representan la configuración óptima. En estos casos, las arquitecturas deben ser reconfiguradas, por ejemplo, añadiendo y eliminando componentes, o modificando las relaciones entre ellos. Este artı́culo presenta una propuesta para la generación de arquitecturas en tiempo de ejecución. Está enfocado en la descripción del proceso que ocurre desde que existe una definición de arquitectura que hay que resolver, hasta que se genera la mejor configuración que da solución a dicha arquitectura. Para construir dicha configuración, se utilizan técnicas de modelado, mecanismos de trading y un algoritmo de búsqueda A*. Dicho algoritmo hace uso de una heurı́stica basada en la información sintáctica y semántica de los componentes. Como dominio de aplicación, se muestra un caso estudio para la generación de interfaces de usuario.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A location-based approach to the classification of mesoscale oceanic structures in SeaWiFS and Aqua-MODIS images of Northwest Africa

  • Vidal-Fernández, Eva
  • Piedra Fernández, José Antonio
  • Almendros Jiménez, Jesús Manuel
  • Cantón Garbín, Manuel
This study presents a different approach to the classification of Mesoscale Oceanic Structures (MOS) present in the Northwest African area, based on their location. The main improvement stems from the partition of this area in four large zones perfectly differentiated by their morphological characteristics, with attention to seafloor topography and coastal relief. This decomposition makes it easier to recognize structures under adverse conditions, basically the presence of clouds partly hiding them. This is observed particularly well in upwellings, which are usually very large structures with a different morphology and genesis in each zone. This approach not only improves the classification of the upwellings, but also makes it possible to analyse changes in the MOS over time, thereby improving the prediction of its morphological evolution. To identify and label the MOS classified in the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) and Aqua-MODIS (Moderate Resolution Imaging Spectroradiometer) chlorophyll-a and temperature images, we used a tool specifically designed by our group for this purpose and which has again shown its validity in this new proposal.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A microservice-based architecture for enhancing the user experience in cross-device distributed mashup UIs with multiple forms of interaction

  • Fernández García, Antonio Jesús
  • Iribarne Martínez, Luis Fernando
  • Corral Liria, Antonio Leopoldo
  • Criado Rodríguez, Javier
  • Wang, James Z.
Mobility and continuous connection entail the emergence of heterogeneous devices with multiple forms of interaction. However, it is challenging for developers and corporations to keep up with the devices and provide applications adapted to them. Besides, better user experiences attuned to users’ needs and desires are increasingly in demand. User interfaces play a major role because they must be distributed through different devices and offer a customized experience for each user–device combination. We take advantage of the component-based applications easiness to build customized interfaces that can give optimal solutions to fulfill the requirements for adapting themselves to cross-device applications with multiple forms of interaction. User interaction on mashup interfaces can generate a great deal of data, which can be analyzed for improving the interaction and usefulness of the applications. In our paper, we have created a microservice-based architecture that generates datasets which contain the user behavior for further analysis. Therefore, the user experience and usability in distributed user interfaces may be improved through prediction models generated from the data. Each microservice autonomously fetches its own data and performs consistently so that it can transform datasets optimally by using feature engineering techniques. Thus, data analysis and algorithms can create accurate yet simple prediction models that provide useful knowledge to enhance the user experience. A REST API web service is added to each microservice to facilitate their communication with other microservices and/or third-party clients. The entire microservice architecture, including feature engineering and RESTful API web services for each microservice, offers an infrastructure to handle and process data interaction of cross-devices applications with multiple forms of interaction. This approach has been deployed in a real mashup application where new datasets have been created, processed and validated.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Sign Communication for People with Disabilities Using Kinect Technology at Home

  • Ojeda Castelo, Juan Jesús
  • Piedra Fernández, José Antonio
  • Bernal Bravo, César
  • Iribarne Martínez, Luis Fernando
Communication with other people and their environment, is an essential skill for people with special needs. In this study we present a communicator which interprets a series of commands by means of corporal expressions. These body expressions are learned by a gesture recognition system according to the requirements and disability of the user. Each of the commands adapt themselves to daily tasks. The system learn gestures and associates them with concrete actions that the user wants to do or needs at that moment.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Virtual Environment for the Training of the Hands in Minimally Invasive Thoracic Surgery

  • Piedra Fernández, José Antonio
  • Ojeda Castelo, Juan Jesús
  • Quero Valenzuela, Florencio
  • Piedra-Fdez, Inmaculada
The hand and eye coordination of the surgeon is one of the most important factor minimally invasive thoracic surgery. Virtual Simulation is a powerful training tool in surgery. At present, the main problems of the learning process are to reduce the learning time and to improve specific skills by the simulation. There are different options to perform tests: working with animals, with artificial tissues to simulate the pressure, and even simulators through joystick. The main disadvantage is the high cost of this systems and the complexity to replicate the situation during a real operations. In this paper, a virtual reality system is presented. This system allows to reduce the learning time and to improve the hand and eye coodination of the surgeon. Moreover, it is a low cost, portable and easy-to-use solution for future surgeons.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Dynamic Mashup Interfaces for Information Systems using Widgets-as-a-Service

  • Vallecillos Ruiz, Jesús
  • Criado Rodríguez, Javier
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
Web Information Systems intend to adapt to the users’ preferences as new data available on the network. In this regard, the composition and reuse of services which are involved in a web application is an interesting research topic, since these techniques pursue the dynamic construction of applications that can be adapted at design or run time. As for the visualization of these applications, web user interfaces play a key role, serving as a connection point between users and the rest of the system. This article proposes an architecture for specification, storage, management and visualization of components, built from widgets complying with the W3C recommendation, for making web user interfaces. We follow a service-based approach for the interface deployment and communication management, introducing the concept of Widgets-as-a-Service (WaaS). To illustrate this proposal, an example of widget-based Web Information System is shown.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Libro o Monografía (Book)

Bulk Insertions into xBR+ -trees

  • Roumelis, George
  • Vassilakipoulos, Michael
  • Corral Liria, Antonio Leopoldo
  • Manolopoulos, Yannis
Bulk insertion refers to the process of updating an existing index by inserting a large batch of new data, treating the items of this batch as a whole and not by inserting these items one-by-one. Bulk insertion is related to bulk loading, which refers to the process of creating a non-existing index from scratch, when the dataset to be indexed is available beforehand. The xBR + -tree is a balanced, disk-resident, Quadtree-based index for point data, which is very efficient for processing spatial queries. In this paper, we present the first algorithm for bulk insertion into xBR+ -trees. This algorithm incorporates extensions of techniques that we have recently developed for bulk loading xBR+ -trees. Moreover, using real and artificial datasets of various cardinalities, we present an experimental comparison of this algorithm vs. inserting items one-by-one for updating xBR+ -trees, regarding performance (I/O and execution time) and the characteristics of the resulting trees. We also present experimental results regarding the query-processing efficiency of xBR+ -trees built by bulk insertions vs. xBR+ -trees built by inserting items one-by-one.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query

  • Roumelis, George
  • Vassilakipoulos, Michael
  • Corral Liria, Antonio Leopoldo
  • Manolopoulos, Yannis
One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications is the (K) Group Nearest Neighbor Query (GNNQ), that discovers the (K) nearest neighbor(s) to a group of query points (considering the sum of distances to all the members of the query group). This query has been studied during the recent years, considering data sets indexed by efficient spatial data structures. We study (K) GNNQs, considering non-indexed data sets, since this case is frequent in practical applications. And we present two (RAM-based) Plane Sweep algorithms, that apply optimizations emerging from the geometric properties of the problem. By extensive experimentation, using real and synthetic data sets, we highlight the most efficient algorithm.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Improving Distance-Join Query Processing with Voronoi-Diagram based Partitioning in SpatialHadoop

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakipoulos, Michael
SpatialHadoop is an extended MapReduce framework supporting global indexing techniques that partition spatial datasets across several machines and improve spatial query processing performance compared to traditional Hadoop systems. SpatialHadoop supports several spatial operations (e.g., Nearest Neighbor search, range query, spatial intersection join, etc.) and seven spatial partitioning techniques (Grid, Quadtree, STR, STR+, -d tree, Z-curve and Hilbert-curve). Distance-Join Queries (DJQs), like the Nearest Neighbors Join Query (NNJQ) and Closest Pairs Query (CPQ), are common operations used in numerous spatial applications. DJQs are costly operations, since they combine spatial joins with distance-based search. Data partitioning improves the management of large datasets and speeds up query performance. Therefore, performing DJQs efficiently with new partitioning methods in SpatialHadoop is a challenging task. In this paper, a new data partitioning technique based on Voronoi-Diagrams is designed and implemented in SpatialHadoop. Moreover, improved NNJQ and CPQ MapReduce algorithms, using the new partitioning mechanism, are also designed and developed for SpatialHadoop. Finally, the results of an extensive set of experiments with real-world datasets are presented, demonstrating that the new partitioning technique and the improved DJQ MapReduce algorithms are efficient, scalable and robust in SpatialHadoop.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Libro o Monografía (Book)

A Comparison of Distributed Spatial Data Management Systems for Processing Distance Join Queries

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Mavrommatis, George
  • Vassilakipoulos, Michael
Due to the ubiquitous use of spatial data applications and the large amounts of spatial data that these applications generate, the processing of large-scale distance joins in distributed systems is becoming increasingly popular. Two of the most studied distance join queries are the K Closest Pair Query (KCPQ) and the ε Distance Join Query (εDJQ). The KCPQ finds the K closest pairs of points from two datasets and the εDJQ finds all the possible pairs of points from two datasets, that are within a distance threshold ε of each other. Distributed cluster-based computing systems can be classified in Hadoop-based and Spark-based systems. Based on this classification, in this paper, we compare two of the most current and leading distributed spatial data management systems, namely SpatialHadoop and LocationSpark, by evaluating the performance of existing and newly proposed parallel and distributed distance join query algorithms in different situations with big real-world datasets. As a general conclusion, while SpatialHadoop is more mature and robust system, LocationSpark is the winner with respect to the total execution time.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Efficient Large-scale Distance-Based Join Queries in SpatialHadoop

  • García García, Francisco José
  • Corral Liria, Antonio Leopoldo
  • Iribarne Martínez, Luis Fernando
  • Vassilakipoulos, Michael
  • Manolopoulos, Yannis
Efficient processing of Distance-Based Join Queries (DBJQs) in spatial databases is of paramount importance in many application domains. The most representative and known DBJQs are the K Closest Pairs Query (KCPQ) and the ε Distance Join Query (εDJQ). These types of join queries are characterized by a number of desired pairs (K) or a distance threshold (ε) between the components of the pairs in the final result, over two spatial datasets. Both are expensive operations, since two spatial datasets are combined with additional constraints. Given the increasing volume of spatial data originating from multiple sources and stored in distributed servers, it is not always efficient to perform DBJQs on a centralized server. For this reason, this paper addresses the problem of computing DBJQs on big spatial datasets in SpatialHadoop, an extension of Hadoop that supports efficient processing of spatial queries in a cloud-based setting. We propose novel algorithms, based on plane-sweep, to perform efficient parallel DBJQs on large-scale spatial datasets in Spatial Hadoop. We evaluate the performance of the proposed algorithms in several situations with large real-world as well as synthetic datasets. The experiments demonstrate the efficiency and scalability of our proposed methodologies.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Simulating Rainfall, Water Evaporation and Groundwater Flow in Three-Dimensional Satellite Images with Cellular Automata

  • Espínola, Antonio Moises
  • Piedra Fernández, José Antonio
  • Ayala Palenzuela, Rosa María
  • Iribarne Martínez, Luis Fernando
  • Leguizamón, Saturnino
  • Wang, James Z.
Remote sensing has been used in numerous environmental simulations with the aim of solving and improving many different kinds of problems, e.g., meteorology applications, soil quality studies, water resource exploration, and environmental protection. Besides, cellular automata have been widely used in the field of remote sensing for simulating natural phenomena over two-dimensional satellite images. However, simulations on Digital Elevation Models (DEM), or three-dimensional (3D) satellite images, are scarce. This paper presents a study of modeling and simulation of the weather phenomena of rainfall, water evaporation and groundwater flow in 3D satellite images through a new algorithm, developed by the authors, named RACA (Rainfall with Cellular Automata). The purpose of RACA is to obtain, from the simulation, numerical and 3D results related to the total cumulative flow and maximum level of water that allow us to make decisions on important issues such as analyzing how climate change will affect the water level in a particular area, estimating the future water supply of a population, establishing future construction projects and urban planning away from locations with high probability of flooding, or preventing the destruction of property and human life from future natural disasters in urban areas with probability of flooding.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Heuristics-based mediation for building smart architectures at run-time

  • Criado Rodríguez, Javier
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
Smart architectures are increasingly being used in current software development. Smart user interfaces, smart homes, or smart buildings are becoming common examples in the new era of smart cities. Software architectures usually related to these domains need to be adapted and reconfigured at run-time, for example, to provide new services, react to user interaction, or due to changes decided from the business logic of the application. Component-based techniques are a suitable way to carry out this kind of adaptation, as dynamic reconfiguration operations can be applied to the architecture. In this paper, we address run-time generation of component-based applications, taking the abstract definitions of their architecture as a reference, in addition to a set of available components. The process calculates the best configuration of components from the abstract definition by applying a trading approach based on an adapted A* algorithm. This algorithm uses heuristics based on syntactic and semantic information obtained from the component definitions. A case study related to mashup user interfaces formed by coarse-grained components is also explained. In short, the results show the usefulness of heuristics and suitable execution times for building the best configurations.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A microservice architecture for real-time IoT data processing: A reusable Web of things approach for smart ports

  • Ortiz, Guadalupe
  • Boubeta-Puig, Juan
  • Criado, Javier
  • Corral-Plaza, David
  • Garcia-de-Prado, Alfonso
  • Medina-Bulo, Inmaculada
  • Iribarne Martínez, Luis Fernando
Major advances in telecommunications and the Internet of Things have given rise to numerous smart city scenarios in which smart services are provided. What was once a dream for the future has now become reality. However, the need to provide these smart services quickly, efficiently, in an interoperable manner and in real time is a cutting-edge technological challenge. Although some software architectures offer solutions in this area, these are often limited in terms of reusability and maintenance by independent modules —involving the need for system downtime when maintaining or evolving, as well as by a lack of standards in terms of the interoperability of their interface. In this paper, we propose a fully reusable microservice architecture, standardized through the use of the Web of things paradigm, and with high efficiency in real-time data processing, supported by complex event processing techniques. To illustrate the proposal, we present a fully reusable implementation of the microservices necessary for the deployment of the architecture in the field of air quality monitoring and alerting in smart ports. The performance evaluation of this architecture shows excellent results.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A Recommender System for Component-based Applications using Machine Learning Techniques

  • Fernández García, Antonio Jesús
  • Iribarne Martínez, Luis Fernando
  • Corral Liria, Antonio Leopoldo
  • Criado Rodríguez, Javier
  • Wang, James Z.
Software designers are striving to create software that adapts to their users’ requirements. To this end, the development of component-based interfaces that users can compound and customize according to their needs is increasing. However, the success of these applications is highly dependent on the users’ ability to locate the components useful for them, because there are often too many to choose from. We propose an approach to address the problem of suggesting the most suitable components for each user at each moment, by creating a recommender system using intelligent data analysis methods. Once we have gathered the interaction data and built a dataset, we address the problem of transforming an original dataset from a real component-based application to an optimized dataset to apply machine learning algorithms through the application of feature engineering techniques and feature selection methods. Moreover, many aspects, such as contextual information, the use of the application across several devices with many forms of interaction, or the passage of time (components are added or removed over time), are taken into consideration. Once the dataset is optimized, several machine learning algorithms are applied to create recommendation systems. A series of experiments that create recommendation models are conducted applying several machine learning algorithms to the optimized dataset (before and after applying feature selection methods) to determine which recommender model obtains a higher accuracy. Thus, through the deployment of the recommendation system that has better results, the likelihood of success of a component-based application is increased by allowing users to find the most suitable components for them, enhancing their user experience and the application engagement.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Emulating Home Automation Installations through Component-based Web Technology

  • Asensio, José Andrés
  • Criado Rodríguez, Javier
  • Padilla Soriano, Nicolás
  • Iribarne Martínez, Luis Fernando
The Internet of Things mechanisms enable the management of home environments since they can be developed as IoT based information systems. From standard smart homes to automated buildings, including other kind of domotics and inmotics solutions, every system must be tested and validated before its installation. The current tools offered by IoT and home automation vendors lack in emulation features close to the real behavior of the devices. In many cases, delaying the verification actions until the hardware is acquired and installed may cause some drawbacks, for example, from the economic point of view. This paper presents a solution for emulating home automation environments which are based on the KNX standard and can be represented by architectures of devices. The emulation consist of developing virtual implementations of real devices which operate and communicate through web technology. The technology implementing these virtual devices allows us to develop components which can provide different type of data related to the installation (audio, video, text, animations, images, etc.). The architectures can be managed using web services and their behavior can be tested through web user interfaces showing the mentioned data. Furthermore, virtual and physical devices are connected to validate the interoperability between the real installation and the emulation.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

An XQuery-based Model Transformation Language

  • Almendros Jiménez, Jesús Manuel
  • Iribarne Martínez, Luis Fernando
  • López Fernández, Jesús J.
  • Mora-Segura, Ángel
In this paper we propose a framework for model transformation in XQuery. Our proposal aims to provide the elements for using XQuery as a transformation language. With this aim, our framework provides a mechanism for automatically obtaining an XQuery library for a given meta-model. Meta-models are defined as XML schemas, and the XQuery library serves to query and create elements of an XML Schema. Transformations abstract from XML representation, in the sense of, elements from meta-models are encapsulated by XQuery functions. We have also studied how to use our framework for model validation. Source and target models and transformations are validated by considering constraints. The framework has been tested with a case study of transformation in UML, where the XML-based representation of models is achieved by the standardized language XMI.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

New Plane-Sweep Algorithms for Distance-Based Join Queries in Spatial Databases

  • Roumelis, George
  • Corral Liria, Antonio Leopoldo
  • Vassilakipoulos, Michael
  • Manolopoulos, Yannis
Efficient and effective processing of the distance-based join query (DJQ) is of great importance in spatial databases due to the wide area of applications that may address such queries (mapping, urban planning, transportation planning, resource management, etc.). The most representative and studied DJQs are the K Closest Pairs Query (KCPQ) and εDistance Join Query (εDJQ). These spatial queries involve two spatial data sets and a distance function to measure the degree of closeness, along with a given number of pairs in the final result (K) or a distance threshold (ε). In this paper, we propose four new plane-sweep-based algorithms for KCPQs and their extensions for εDJQs in the context of spatial databases, without the use of an index for any of the two disk-resident data sets (since, building and using indexes is not always in favor of processing performance). They employ a combination of plane-sweep algorithms and space partitioning techniques to join the data sets. Finally, we present results of an extensive experimental study, that compares the efficiency and effectiveness of the proposed algorithms for KCPQs and εDJQs. This performance study, conducted on medium and big spatial data sets (real and synthetic) validates that the proposed plane-sweep-based algorithms are very promising in terms of both efficient and effective measures, when neither inputs are indexed. Moreover, the best of the new algorithms is experimentally compared to the best algorithm that is based on the R-tree (a widely accepted access method), for KCPQs and εDJQs, using the same data sets. This comparison shows that the new algorithms outperform R-tree based algorithms, in most cases.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Measuring the quality of transformation alternatives in software architectures evolution

  • Criado Rodríguez, Javier
  • Martínez Fernández, Silverio Juan
  • Ameller, David
  • Iribarne Martínez, Luis Fernando
Many today’s software systems need to be self-adapted at run-time. Model transformation is a good approach to adapt the component-based architecture of such software systems. However, existing model transformation processes focus on the functionalities of systems, giving less importance to the quality attributes. The goal of this study is to improve model transformation processes by also considering quality attributes in the generation and adaptation of component-based architectures (i.e., driving the selection among many alternative model transformations by software architecture metrics). Such metrics evaluate the qualities of an architecture, such as flexibility and modifiability. This paper provides some measures of quality for different transformation alternatives and an example in the ENIA software.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

Semantic Matching of Components at run-time in Distributed Environments

  • Criado Rodríguez, Javier
  • Iribarne Martínez, Luis Fernando
  • Padilla Soriano, Nicolás
  • Ayala Palenzuela, Rosa María
Software factories are a key element in Component-Based Software Engineering due to the common space provided for software reuse through repositories of components. These repositories can be developed by third parties in order to be inspected and used by different organizations, and they can also be distributed in different locations. Therefore, there is a need for a trading service that manages all available components. In this paper, we describe a matching process based on syntactic and semantic information of software components. This matching operation is part of a trading service which is in charge of generating configurations of components from architectural definitions. With this aim, the proposed matching allows us to evaluate and score the possible configurations, thus guiding a search process to build the architectural solution which best fulfills an input definition.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

An Efficient Algorithm for Bulk-Loading xBR+ -trees

  • Roumelis, George
  • Vassilakipoulos, Michael
  • Corral Liria, Antonio Leopoldo
  • Manolopoulos, Yannis
A major part of the interface to a database is made up of the queries that can be addressed to this database and answered (processed) in an efficient way, contributing to the quality of the developed software. Efficiently processed spatial queries constitute a fundamental part of the interface to spatial databases due to the wide area of applications that may address such queries, like geographical information systems (GIS), location-based services, computer visualization, automated mapping, facilities management, etc. Another important capability of the interface to a spatial database is to offer the creation of efficient index structures to speed up spatial query processing. The xBR + -tree is a balanced disk-resident quadtree-based index structure for point data, which is very efficient for processing such queries. Bulk-loading refers to the process of creating an index from scratch, when the dataset to be indexed is available beforehand, instead of creating the index gradually (and more slowly), when the dataset elements are inserted one-by-one. In this paper, we present an algorithm for bulk-loading xBR + -trees for big datasets residing on disk, using a limited amount of main memory. The resulting tree is not only built fast, but exhibits high performance in processing a broad range of spatial queries, where one or two datasets are involved. To justify these characteristics, using real and artificial datasets of various cardinalities, first, we present an experimental comparison of this algorithm vs. a previous version of the same algorithm and STR, a popular algorithm of bulk-loading R-trees, regarding tree creation time and the characteristics of the trees created, and second, we experimentally compare the query efficiency of bulk-loaded xBR + -trees vs. bulk-loaded R-trees, regarding I/O and execution time. Thus, this paper contributes to the implementation of spatial database interfaces and the efficient storage organization for big spatial data management.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Artículo científico (JournalArticle)

A Web Services Infrastructure for the Management of Mashup Interfaces

  • Vallecillos Ruiz, Jesús
  • Criado Rodríguez, Javier
  • Fernández García, Antonio Jesús
  • Padilla Soriano, Nicolás
  • Iribarne Martínez, Luis Fernando
In the technological world of today, user interfaces (as an essential part of many software applications) are constantly changing in order to meet the needs of different users and adapt to their environment. Accordingly, there is a need for mechanisms to carry out these change processes. This article describes a structure of web services which support the adaptation which constructs mashup type web user interfaces. These interfaces are constructed using third party component architectures, called COTSgets.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

Hand Posture Recognition with standard webcam for Natural Interaction

  • Osimani, César
  • Piedra Fernández, José Antonio
  • Ojeda Castelo, Juan Jesús
  • Iribarne Martínez, Luis Fernando
This paper presents an experimental prototype designed for natural human-computer interaction in an environmental intelligence system. Using computer vision resources, it analyzes the images captured by a webcam to recognize a person’s hand movements. There is now a strong trend in interpreting these hand and body movements in general, with computer vision, which is a very attractive field of research. In this study, a mechanism for natural interaction was implemented by analyzing images captured by a webcam based on hand geometry and posture, to show its movements in our model. A camera is installed in such a manner that it can discriminate the movements a person makes using Background Subtraction. Then hands are searched for assisted by segmentation by skin color detection and a series of classifiers. Finally, the geometric characteristics of the hands are extracted to distinguish defined control action positions.
riUAL. Repositorio Institucional de la Universidad de Almería
Publicación Estudio, informe, memoria (Report)

The K Group Nearest-Neighbor Query on Non-indexed RAM-Resident Data

  • Roumelis, George
  • Vassilakipoulos, Michael
  • Corral Liria, Antonio Leopoldo
  • Manolopoulos, Yannis
Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query processing would not be repaid for such data sets. We consider an extension of the popular (K) Nearest-Neighbor Query, called the (K) Group Nearest Neighbor Query (GNNQ). This query discovers the (K) nearest neighbor(s) to a group of query points (considering the sum of distances to all the members of the query group) and has been studied during recent years, considering data sets indexed by efficient spatial data structures. We study (K) GNNQs, considering non-indexed RAM-resident data sets and present an existing algorithm adapted to such data sets and two Plane-Sweep algorithms, that apply optimizations emerging from the geometric properties of the problem. By extensive experimentation, using real and synthetic data sets, we highlight the most efficient algorithm.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Aplicación del ABP y aprendizaje-servicio en las asignaturas del grado y máster en Ingeniería Informática desde la semipresencialidad

  • Piedra, José A.
  • Fernández, Antonio
  • Peralta, Mercedes
  • Iribarne, Luis
El aprendizaje basado en problemas (ABP) se implantó hace varios años en las asignaturas del Grado, así como en el reciente máster en Ingeniería Informática de la UAL. La puesta en marcha de un enfoque empresarial integrando proyectos con clientes reales y otras metodologías activas como el aprendizaje-servicio, un aprendizaje colaborativo ha propiciado un entorno motivador y empresarial para el alumnado. El carácter semipresencial ha potenciado el trabajo autónomo y la tutorización del alumno. Los resultados de los alumnos en las asignaturas son muy positivos fomentando un aprendizaje duradero y facilitando la incorporación a un entorno empresarial.