Jose M. Chaves-González

• PhD
• University of Extremadura

The automatic semantic similarity assessment field has attracted much attention due to its impact on multiple areas of study. In addition, it is also relevant that recent advances in neural computation have taken the solutions to a higher stage. However, some inherent problems persist. For example, large amounts of data are still needed to train so...

Ontology meta-matching techniques have been consolidated as one of the best approaches to face the problem of discovering semantic relationships between knowledge models that belong to the same domain but have been developed independently. After more than a decade of research, the community has reached a stage of maturity characterized by increasin...

In recent times, we have seen an explosion in the number of new solutions to address the problem of semantic similarity. In this context, solutions of a neuronal nature seem to obtain the best results. However, there are some problems related to their low interpretability as well as the large number of resources needed for their training. In this w...

The problem of automatically measuring the degree of semantic similarity between textual expressions is a challenge that consists of calculating the degree of likeness between two text fragments that have none or few features in common according to human judgment. In recent times, several machine learning methods have been able to establish a new s...

Recent advances in machine learning have been able to make improvements over the state-of-the-art regarding semantic similarity measurement techniques. In fact, we have all seen how classical techniques have given way to promising neural techniques. Nonetheless, these new techniques have a weak point: they are hardly interpretable. For this reason,...

The design of reliable DNA libraries that can be used for bio-molecular computing involves several heterogeneous conflicting design criteria that traditional optimization approaches do not fit properly. As it is well known, evolutionary algorithms are very appropriate for solving complex NP-hard optimization problems. However, these approaches take...

The generation of DNA strands which can produce predictable reactions is crucial for any bio-intelligent system which uses DNA molecules as information processing units. DNA molecules have certain unique properties, e.g., self-assembly and self-complementary in hybridization, which are important in many DNA-based technologies. However, DNA interact...

One of the most challenging problems in the semantic web field consists of computing the semantic similarity between different terms. The problem here is the lack of accurate domain-specific dictionaries, such as biomedical, financial or any other particular and dynamic field. In this article we propose a new approach which uses different existing...

Software requirements selection is a problem which consists of choosing the set of new requirements which will be included in the next release of a software package. This NP-hard problem is an important issue involving several contradictory objectives which have to be tackled by software companies when developing new releases of software packages....

DNA-based technologies, such as nanotechnology, DNA sequencing or DNA computing, have grown significantly in recent years. The inherent properties presented in DNA molecules (storage density, parallelism possibilities, energy efficiency, etc) make these particles unique computational elements. However, DNA libraries used for computation have to ful...

The selection of the new requirements which should be included in the development of the release of a software product is an important issue for software companies. This problem is known in the literature as the Next Release Problem (NRP). It is an NP-hard problem which simultaneously addresses two apparently contradictory objectives: the total cos...

Software requirements selection is the engineering process in which the set of new requirements which will be included in the next release of a software product are chosen. This NP-hard problem is an important issue involving several contradictory objectives that have to be tackled by software companies when developing new releases of software pack...

Purpose – The purpose of this paper is to study the use of a heterogeneous and evolutionary team approach based on different sources of knowledge to address a real-world problem within the telecommunication domain: the frequency assignment problem (FAP). Evolutionary algorithms have been proved as very suitable strategies when they are used to solv...

The reliability of artificially generated DNA molecules is a key factor for applications which depend on DNA-based technologies, such as DNA computing or nanotechnology. In those cases, interactions between sequences have to be controlled to avoid undesirable reactions. In the specific case of molecular computing, the design of robust sets of seque...

In this paper, we use an adapted multi-objective version of the differential evolution (DE) metaheuristics for the design and generation of reliable DNA libraries that can be used for computation. DNA sequence design is a very relevant task in many recent research fields, e.g. nanotechnology or DNA computing. Specifically, DNA computing is a new co...

The design of reliable DNA sequences is crucial in many engineering applications which depend on DNA-based technologies, such as nanotechnology or DNA computing. In these cases, two of the most important properties that must be controlled to obtain reliable sequences are self-assembly and self-complementary hybridization. These processes have to be...

Artificially generated DNA strands have to meet several complex bio-chemical constraints when they are used to solve any computational problem. In this context, DNA sequences have to satisfy several design criteria to prevent DNA strands from producing undesirable reactions which usually lead to incorrect computations. This study is focused on six...

This work presents a novel security platform for industrial communications using a nine-MicroBlaze MPSoC. This platform has low power consumption and cost, therefore, it is very appropriate for embedded systems, where restrictions on cost and power consumption have to be fulfilled. This system uses the RSA asymmetric algorithm combined with the AES...

The design of DNA strands suitable for bio-molecular computing involves several complex constraints which have to be fulfilled to ensure the reliability of operations. Two of the most important properties which have to be controlled to obtain reliable sequences are self-assembly and self-complementary hybridizations. These processes have to be rest...

One of the most challenging problems in the semantic web field consists of computing the semantic similarity between different terms. The problem here is the lack of accurate domain-specific dictionaries, such as biomedical, financial or any other particular and dynamic field. In this article we propose a new approach which uses different existing...

In DNA computing, the design of reliable DNA sequences is one of the most important tasks, because sequences used for that purpose have to fulfill several biochemical restrictions to avoid undesirable reactions. These reactions usually cause incorrect computations, so it is necessary to avoid this circumstance by generating robust and reliable sets...

This article analyses the use of a novel parallel evolutionary strategy to solve complex optimization problems. The work developed here has been focused on a relevant real-world problem from the telecommunication domain to verify the effectiveness of the approach. The problem, known as frequency assignment problem (FAP), basically consists of assig...

This paper elaborates a complete study about the application of different heuristic searches applied to the resolution of a relevant optimization problem from the telecommunications domain. Specifically, we have tackled a real-world frequency assignment problem (FAP) in GSM networks. There are many versions of this crucial problem, but most of them...

This chapter explains the process which involves building a simple but fast face recognition system using computer vision and image processing techniques. Face recognition is included in biometrical identification methods, which are based on the study and evaluation of biometrical features, such as fingerprints, iris, voice, handprint, DNA... or as...

Skin colour detection is a technique very used in most of face detectors to find faces in images or videos. However, there is not a common opinion about which colour space is the best choice to do this task. Therefore, the motivation for our study is to discover which colour model is the best option to build an efficient face detector which can be...

Nowadays, mobile communications are experiencing a strong growth, being more and more indispensable. One of the key issues in the design of mobile networks is the frequency assignment problem (FAP). This problem is crucial at present and will remain important in the foreseeable future. Real-world instances of FAP typically involve very large networ...

This paper describes three different approaches based on complex heuristic searches to deal with a relevant telecommunication problem. Specifically, we have tackled a real-world version of the FAP –Frequency Assignment Problem by using three very relevant and efficient metaheuristics. Realistic versions of the FAP are NP-hard problems because the n...

Frequency planning, also known as frequency assignment problem (FAP), is a very important task for current GSM operators. FAP basically tries to minimise the number of interferences (or conflicts in the communications) caused when a limited number of frequencies has to be assigned to a quite high number of transceivers (and there are much more tran...

In this work we describe the methodology and results obtained when grid computing is applied to resolve a real-world frequency assignment problem (FAP) in GSM networks. We havJose used a precise mathematical formulation for this problem, which was developed in previous work, where the frequency plans are evaluated using accurate interference inform...

Frequency planning is a very important task in the design and operation of current GSM networks. For this reason, the frequency assignment problem (FAP) is a well-known problem in the Operations Research which includes different mathematical models depending on the specific conditions of the application which is being designed. However, most of the...

In this paper we study different versions of the PBIL (population-based incremental learning) algorithm to evaluate and try to improve the results obtained by the standard version of the algorithm when it is used to solve a realistic-sized frequency assignment problem (FAP). PBIL is based on genetic algorithms and competitive learning, being a popu...

Frequency assignment problem (FAP) is a very important issue in the field of telecommunications (especially in GSM-Global System for Mobile-Networks). In this work, we present the Population-Based Incremental Learning (PBIL) algorithm to solve a particular branch of the FAP problem (MS-FAP). MS-FAP (Minimum Span Frequency Assignment Problem) tries...

In this work we study and compare hybrid versions of two different metaheuristics to solve a real-world frequency assignment problem (FAP) in GSM networks. We have used a precise mathematical formulation, developed in published work, in which the frequency plans are evaluated using accurate interference information coming from a real GSM network. T...

In this paper we study two different meta-heuristics to solve a real-word frequency assignment problem (FAP) in GSM networks. We have used a precise mathematical formulation in which the frequency plans are evaluated using accurate interference information coming from a real GSM network. We have developed an improved version of the scatter search (...

The frequency assignment problem (FAP) is a well-known problem in Operations Research which includes different mathematical models. This importance comes from the relevance of frequency planning in current GSM operators. The FAP problem basically tries to minimize the number of interferences caused when a limited number of frequencies has to be ass...

Frequency planning (also known as frequency assignment problem -FAP-) is a very important task for current GSM operators. The problem consists in trying to minimize the number of interferences caused when a limited number of frequencies has to be assigned to a quite high number of transceivers. In this work we focus on solving this problem for a re...

The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeable future. There are many versions of FAP, most of them benchmarking-like problems. We use a formulation of FAP, developed in published work, that focuses on aspects which...

This chapter captures the experience acquired in the development of applications based on genetic algorithms. Specifically, we implemented two games that show an intelligent behaviour by executing genetic algorithms. They both show good results as well, because they are able to play successfully against human players. Moreover, the genetic algorith...

This paper presents a project that provides both, to professors and to students, a tool that is useful for studying, teaching and learning how pipelines work and how they can be scheduled in an easy and widespread way. The project is called PipeSim, and features static and dynamic pipelines with a very attractive, dynamic and intuitive interface. I...

In this paper we show the results of a work where a comparison among different colour spaces is done in order to know which one is better for human skin colour detection in face detection systems. Our motivation to do this study is that there is not a common opinion about which colour space is the best choice to find skin colour in an image. This i...

Nowadays pipelining, pipelines and pipeline-scheduling are very important topics in the current computer architecture. All present processors use pipelining to improve their performance; in fact, the usage of the computer resources has important influences on its final performance. So, speaking in general, pipeline and pipeline-scheduling topics ar...

Resumen La segmentación, los procesadores segmentados y la planificación de los mismos son conceptos muy importantes en las arquitecturas de computadores de hoy día. Todos los procesadores actuales utilizan la segmentación para mejorar el rendimiento; de hecho, la eficiencia con la que se planifique el uso de los recursos de un procesador va a infl...