Publications

There are alternative publication lists (perhaps incomplete) on Google Citations, Mendeley, DBLP, Orcid and Academia.

2021

H. Álvarez-Chaves, D. F. Barrero, H. H. Martínez, and M. I. P. Benito, “An Analysis of the Time Aggregation Influence on Patients Forecasting in Emergency Services,” in 2021 XLVII Latin American Computing Conference (CLEI), 2021, pp. 1–10. DOI. BibTeX.

@inproceedings{Alvarez-Chaves2021b,
  author = {Álvarez-Chaves, Hugo and Barrero, David F. and Martínez, Helena Hernández and Benito, M. Isabel Pascual},
  booktitle = {2021 XLVII Latin American Computing Conference (CLEI)},
  title = {An Analysis of the Time Aggregation Influence on Patients Forecasting in Emergency Services},
  year = {2021},
  volume = {},
  number = {},
  pages = {1-10},
  doi = {10.1109/CLEI53233.2021.9640117}
}

H. Álvarez-Chaves, D. F. Barrero, M. Cobos, and M. D. R-Moreno, “Patients Forecasting in Emergency Services by Using Machine Learning and Exogenous Variables,” in Artificial Intelligence XXXVIII, Cham, 2021, pp. 167–180. Publisher. Abstract. BibTeX.
Emergency Departments (ED) in hospitals around the world are a critical service in medical care of patients. Being able to predict the number of patients every day, week or month could be of great help to the healthcare system, and especially in the current situation. In this paper we present some results in forecasting the admissions, the inpatients and the discharges series in EDs by using Machine Learning algorithms. We have considered different time aggregations (specifically: eight hours, twelve hours, one day and the official shifts of the workers) and exogenous variables (in particular, the Spanish public holiday calendar, the academic calendar, the phase of the lunar cycle and national football matches). Results show that the best performance is obtained for the admissions series using eight hours aggregations and the biggest improvement is with the daily aggregation in the admission series. The academic calendar and public holidays were the most selected variables.

C. J. Hernández-Castro, D. F. Barrero, and M. D. R-Moreno, “BASECASS: A methodology for CAPTCHAs security assurance,” Journal of Information Security and Applications, vol. 63, p. 103018, 2021. Publisher. DOI. BibTeX.

@article{HernandezCastro2021,
  title = {BASECASS: A methodology for CAPTCHAs security assurance},
  journal = {Journal of Information Security and Applications},
  volume = {63},
  pages = {103018},
  year = {2021},
  issn = {2214-2126},
  doi = {https://doi.org/10.1016/j.jisa.2021.103018},
  url = {https://www.sciencedirect.com/science/article/pii/S2214212621001927},
  author = {Hernández-Castro, Carlos Javier and Barrero, David F. and R-Moreno, Maria D.},
  keywords = {CAPTCHA, Methodology, Machine Learning, Statistical analysis, Security assurance}
}

“Transición digital por la COVID-19: perspectiva de los alumnos de la docencia semipresencial,” In XIII Encuentro de Innovación en Docencia Universitaria. 2021. BibTeX.

D. F. Barrero, O. Fontenla-Romero, F. Lamas-López, D. Novoa-Paradela, M. D. R-Moreno, and D. Sanz, “SOPRENE: Assessment of the Spanish Armada’s Predictive Maintenance Tool for Naval Assets,” Applied Sciences, vol. 11, no. 16, 2021. Publisher. DOI. BibTeX.

@article{Barrero2021,
  author = {Barrero, David F. and Fontenla-Romero, Oscar and Lamas-López, Francisco and Novoa-Paradela, David and R-Moreno, María D. and Sanz, David},
  title = {SOPRENE: Assessment of the Spanish Armada’s Predictive Maintenance Tool for Naval Assets},
  journal = {Applied Sciences},
  volume = {11},
  year = {2021},
  number = {16},
  article-number = {7322},
  url = {https://www.mdpi.com/2076-3417/11/16/7322},
  issn = {2076-3417},
  webpdf = {https://www.mdpi.com/2076-3417/11/16/7322/pdf},
  doi = {10.3390/app11167322}
}

→ PDF

D. Vaquerizo-Hdez, P. Muñoz, D. F. Barrero, and M. D. R-Moreno, “Continuous energy consumption measure approach using a DMA double-buffering technique,” EURASIP Journal on Wireless Communications and Networking, no. 1, p. 172, 2021. Publisher. DOI. BibTeX.

@article{Vaquerizo-Hdez2021,
  author = {Vaquerizo-Hdez, Daniel and Mu{\~{n}}oz, Pablo and Barrero, David F. and R-Moreno, Maria D.},
  title = {Continuous energy consumption measure approach using a DMA double-buffering technique},
  journal = {EURASIP Journal on Wireless Communications and Networking},
  year = {2021},
  number = {1},
  pages = {172},
  issn = {1687-1499},
  doi = {10.1186/s13638-021-02043-w},
  url = {https://jwcn-eurasipjournals.springeropen.com/articles/10.1186/s13638-021-02043-w},
  webpdf = {https://jwcn-eurasipjournals.springeropen.com/track/pdf/10.1186/s13638-021-02043-w.pdf}
}

→ PDF

2020

A. Collado-Villaverde, M. Cobos, P. Muñoz, and D. F. Barrero, “A Simulator to Support Machine Learning-Based Wearable Fall Detection Systems,” Electronics, vol. 9, no. 11, p. 1831, Nov. 2020. Publisher. DOI. BibTeX.

@article{Collado2020-b,
  doi = {10.3390/electronics9111831},
  url = {https://doi.org/10.3390/electronics9111831},
  year = {2020},
  month = nov,
  publisher = {{MDPI} {AG}},
  volume = {9},
  number = {11},
  pages = {1831},
  author = {Collado-Villaverde, Armando and Cobos, Mario and Mu{\~{n}}oz, Pablo and Barrero, David F.},
  title = {A Simulator to Support Machine Learning-Based Wearable Fall Detection Systems},
  journal = {Electronics},
  dataset = {https://github.com/ISG-UAH/ISG_FallSimulator},
  webpdf = {https://www.mdpi.com/2079-9292/9/11/1831/pdf}
}

→ PDF

→ Dataset

M. Cobos, M. D. R-Moreno, and D. F. Barrero, “R2P2: Un simulador robótico para la enseñanza de Inteligencia Artificial,” in XXVI Jornadas sobre la Enseñanza Universitaria de la Informática (JENUI), 2020, vol. 5, pp. 285–292. BibTeX.

2019

M. Cobos, A. Collado-Villaverde, D. Rodriguez, and D. F. Barrero, “Principal Component Analysis of data complexity measures for breast cancer prediction,” in 4th Bilbao Data Science Workshop, Bilbao, Spain, 2019, p. 16. Publisher. BibTeX.

@inproceedings{Cobos2019,
  author = {Cobos, Mario and Collado-Villaverde, Armando and Rodriguez, Daniel and Barrero, David F.},
  title = {Principal Component Analysis of data complexity measures for breast cancer prediction},
  booktitle = {4th Bilbao Data Science Workshop},
  year = {2019},
  pages = {16},
  address = {Bilbao, Spain},
  month = nov,
  url = {https://wp.bcamath.org/bidas4/posters/},
  poster = {assets/pdfs/bidas-measures2019.pdf}
}

→ Poster

F. Ropero, D. Vaquerizo-Hdez, P. Muñoz, D. F. Barrero, and M. D. R-Moreno, “LARES: An AI-based teleassistance system for emergency home monitoring,” Cognitive Systems Research, vol. 56, pp. 213–222, 2019. Publisher. DOI. Abstract. BibTeX.
The latest progresses in medicine are helping people live longer and better. An ageing population is a sign of a developed society with an advanced health care system. Improved life expectancy should be welcomed as a major achievement, but it should not cause a financial or social burden. In this scenario, it is critical to support older and handicap adults to continue living independently and retaining their current lifestyle. New technological advances in Wireless Sensors Networks (WSN) and Artificial Intelligence (AI) can facilitate this task. In this direction we present lares, an AI-based system that integrates a (i) WSN for receiving information of the environment and the dependent person, (ii) an autonomous robot able to take decisions based on the received information, and (iii) a Web-based system to provide telecare assistance. lares has been tried in two dependent elderly home environments during several weeks, and the experiments show that is able to detect anomalies and generate alarms in abnormal situations.
P. Muñoz, M. D. R-Moreno, D. F. Barrero, and F. Ropero, “MoBAr: a Hierarchical Action-Oriented Autonomous Control Architecture,” Journal of Intelligent & Robotic Systems, vol. 94, no. 3, pp. 745–760, Jun. 2019. Publisher. DOI. Abstract. BibTeX.
Autonomous control in robotics hold promising solutions for a broad number of applications. However, autonomous controllers require highly expertise on heterogeneous technologies, such as Artificial Intelligence Planning & Scheduling, behaviour modelling, intelligent execution and the hardware to control. Connecting these technologies entails several challenges to properly synchronize and verify the robot behaviours to deal with real scenarios. In this article, we present an autonomous controller based on high level modelling to easily enable adaptation of the controller to different robotics platforms and application domains. This controller, called MoBAr, allows on-board planning and replanning for goal oriented autonomy. It relies on technologies such as PLEXIL to model the execution behaviours, or the action oriented planning language PDDL for the domain definition and the planning process. Based on these technologies MoBAr enables an easier deployment of the autonomous controller for different robotics platforms. Moreover, MoBAr enables researching in planning systems applied to robotics domains, as it is possible to replace the PDDL planner and/or domain used without much effort. This fact is demonstrated in the experimental section, in which we demonstrate the adaptability and effectiveness of the controller in three different scenarios, i.e., a robotic arm, an office surveillance robot and an exploration rover while exploiting different planning systems.

2017

F. Ropero, P. Muñoz, M. D. R-Moreno, and D. F. Barrero, “A Virtual Reality Mission Planner for Mars Rovers,” in 2017 6th International Conference on Space Mission Challenges for Information Technology (SMC-IT), Alcalá de Henares, Spain, 2017, pp. 142–146. DOI. Abstract. BibTeX.
For the operation of Mars rovers the ground team has a set of utilities to generate safe mission planning. A relevant aspect of such planning are the paths that the rover has to to follow to reach the scientific objectives. For path planning, operators use a combination of orbital and surface imagery to analyze the terrain topography to generate a cost map. Applying path planning algorithms over the cost map it is possible to obtain (sub)optimal solutions to safely drive the rover through different waypoints. As well, the paths obtained can be assessed using simulators and handmade improved by means of Virtual Reality techniques. In this paper we present an integrated planner for the mission planning and its evaluation using the recent technological advances in Virtual Reality. We have developed a low cost application to provide a three-dimensional view of the path generated exploiting real Mars surfaces with the aim of helping operators in deciding the best paths to follow.
A. Collado-Villaverde, M. D. R-Moreno, D. F. Barrero, and D. Rodriguez, “Machine Learning Approach to Detect Falls on Elderly People Using Sound,” in 30th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2017), S. Benferhat, K. Tabia, and M. Ali, Eds. Arras, France: Springer, 2017, pp. 149–159. Publisher. DOI. Abstract. BibTeX.
One of the most notable consequences of aging is the loss of motor function abilities, making elderly people specially susceptible to falls, which is of the most remarkable concerns in elder care. Thus, several solutions have been proposed to detect falls, however, none of them achieved a great success mainly because of the need of wearing a recording device. In this paper, we study the use of sound to detect fall events. The advantage of this approach over the traditional ones is that the subject does not require to wear additional devices to monitor his or her activities. Here, we apply machine learning techniques to process sound simulated the most common type of fall for the elderly, i.e., when the foot collides with an obstacle and the trunk hits the ground before using his/her hands to absorb the fall. The results show that high levels of accuracy can be achieved using only a few signal processing techniques.

D. Vaquerizo-Hernández, P. Muñoz, M. D. R. Moreno, and D. F. Barrero, “A Low Power Consumption Algorithm for Efficient Energy Consumption in ZigBee Motes,” Sensors Special Issue Energy Harvesting Sensors for Long Term Applications in the IoT Era, vol. 17, no. 10, pp. 2179–2201, Oct. 2017. Publisher. BibTeX.

@article{Vaquerizo2017,
  author = {Vaquerizo-Hernández, Daniel and Muñoz, Pablo and Moreno, María D. Rodríguez and Barrero, David F.},
  title = {A Low Power Consumption Algorithm for Efficient Energy Consumption
      in ZigBee Motes},
  journal = {Sensors Special Issue Energy Harvesting Sensors for Long Term Applications in the IoT Era},
  year = {2017},
  volume = {17},
  pages = {2179--2201},
  number = {10},
  month = oct,
  webpdf = {http://www.mdpi.com/1424-8220/17/10/2179/pdf},
  url = {http://www.mdpi.com/1424-8220/17/10/2179}
}

→ PDF

J. Hernandez-Castro and D. F. Barrero, “Evolutionary generation and degeneration of randomness to assess the independence of the Ent test battery,” in 2017 IEEE Congress on Evolutionary Computation (CEC 2017), San Sebastián, Spain, 2017, pp. 1420–1427. Publisher. DOI. Abstract. BibTeX.
Randomness tests are a key tool to assess the quality of pseudo-random and true random (physical) number generators. They exploit some properties of random numbers to quantify to what extent the observed behavior of the tested sequence approximates the expected one. Given the many sides of randomness, there is not an unique test providing the whole picture, instead a suite of tests assessing different aspects randomness. A robust test suite must include independent tests, otherwise tests would assess the same property, providing redundant information. This paper addresses the independence assessment of a popular test suite named Ent. To this end we generate a large number of pseudo-random numbers with different degrees of randomness by evolving them with a Genetic Algorithm. The numbers are generated to maximize their diversity attending different criteria based on Ent output, used as fitness. We encourage diversity by maximizing and minimizing randomness measures. Once a diverse set of pseudo-random numbers is generated, the Ent test suite is run on them, and their statistics studied by means of a classical correlation analysis. The results show high correlation among some statistics used in the literature, which could be overestimating the quality of their randomness source.
C. J. Hernández-Castro, M. D. R-Moreno, D. F. Barrero, and S. Gibson, “Using Machine Learning to identify common flaws in CAPTCHA design: FunCAPTCHA case analysis ,” Computers & Security , vol. 70, pp. 744–756, 2017. Publisher. DOI. Abstract. BibTeX.
Human Interactive Proofs (HIPs or CAPTCHAs) have become a first-level security measure on the Internet to avoid automatic attacks or minimize their effects. All the most widespread, successful or interesting CAPTCHA designs put to scrutiny have been successfully broken. Many of these attacks have been side-channel attacks. New designs are proposed to tackle these security problems while improving the human interface. FunCAPTCHA is the first commercial implementation of a gender classification CAPTCHA, with reported improvements in conversion rates. This article finds weaknesses in the security of FunCAPTCHA and uses simple machine learning (ML) analysis to test them. It shows a side-channel attack that leverages these flaws and successfully solves FunCAPTCHA on 90% of occasions without using meaningful image analysis. This simple yet effective security analysis can be applied with minor modifications to other HIPs proposals, allowing to check whether they leak enough information that would in turn allow for simple side-channel attacks.
D. F. Barrero, M. D. R-Moreno, and D. Camacho, “Improving experimental methods on success rates in evolutionary computation,” Journal of Experimental & Theoretical Artificial Intelligence, vol. 29, no. 4, pp. 695–716, 2017. Publisher. Abstract. BibTeX.
Due to the complexity of theoretical approaches in evolutionary computation (EC), research has being largely performed on experimental basis. One popular measure used by the EC community is the success rate (SR), which is used alone or as part of more complex measures such as Koza’s computational effort in genetic programming. A common practice in EC is to report just a punctual estimation of the SR, without additional information about its associated uncertainty. We aim to motivate EC researchers to adopt more rigorous practices when working with SRs. In particular, we introduce the importance of correctly reporting this measure and highlight its binomial nature. Unfortunately, this fact is usually overlooked in the literature. Considering the binomiality of the SR opens the whole corpus of binomial statistics to EA research and practice. In particular, we focus on studying several methods to compute SR confidence intervals, the factors that determine their quality in terms of coverage probability and interval length. Due to its practical interest, we also briefly discuss the number of required runs to build confidence intervals with a certain quality, providing a sound method to set the number of runs, one of the most important experimental settings in EC. Evidence suggests that Wilson is, on average, a reliable and simple method to bound an estimation of SR with confidence intervals, while the standard method, which is quite popular because of its conceptual simplicity, should be avoided in any case. However, other methods can also be of interest under certain circumstances. We encourage to report the number of trials and successes, as well as the interval, to ease further comparability of the results.

2016

P. Muñoz, R-Moreno Marı́a D., and D. F. Barrero, “Unified Framework for Path-planning and Task-planning for Autonomous Robots,” Robotics and Autonomous Systems, vol. 82, no. C, pp. 1–14, Aug. 2016. Publisher. DOI. Abstract. BibTeX.
Most of the robotic systems are designed to move and perform tasks in a variety of environments. Some of these environments are controllable and well-defined, and the tasks to be performed are generally everyday ones. However, exploration missions also enclose hard constraints such as driving vehicles to many locations in a surface of several kilometres to collect and/or analyse interesting samples. Therefore, a critical aspect for the mission is to optimally (or sub-optimally) plan the path that a robot should follow while performing scientific tasks. In this paper, we present up2ta, a new AI planner that interleaves path-planning and task-planning for mobile robotics applications. The planner is the result of integrating a modified PDDL planner with a path-planning algorithm, combining domain-independent heuristics and a domain-specific heuristic for path-planning. Then, up2ta can exploit capabilities of both planners to generate shorter paths while performing scientific tasks in an efficient ordered way. The planner has been tested in two domains: an exploration mission consisting of pictures acquisition, and a more challenging one that includes samples delivering. Also, up2ta has been integrated and tested in a real robotic platform for both domains.
C. J. Hernández-Castro, D. F. Barrero, and M. D. R-Moreno, “Machine learning and empathy: the Civil Rights CAPTCHA,” Concurrency and Computation: Practice and Experience, vol. 28, no. 4, pp. 1310–1323, Mar. 2016. Publisher. DOI. Abstract. BibTeX.
Human interactive proofs (HIPs) are a basic security measure on the Internet to avoid automatic attacks. There is an ongoing effort to find a HIP that is secure enough yet easy for humans. Recently, a new HIP has been designed aiming at higher security: the Civil Rights Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA). It employs the empathy capacity of humans to further strengthen Securimage, a well-known text CAPTCHA. In this paper, we analyze it from a security perspective, finding fundamental design flaws. Using several well-known machine learning (ML) algorithms, we analyze to what extent these flaws affect its security. We discover that thanks to them, we can create a successful side-channel attack. This attack is able to correctly solve the HIP on 20.7% of occasions, much more than enough to consider it broken. Thus, we show that there is no need to solve the problem of optical character recognition nor empathy analysis for computers to break this particular HIP. ML can be successfully used to break a HIP that uses both with a side-channel attack. This security analysis can be applied to other HIPs. It will allow to test whether they are leaking too much information by unexpected ways, given non-evident design flaws.
A. Collado Villaverde, M. D. R-Moreno, D. F. Barrero, and D. Rodríguez, “Triaxial Accelerometer Located on the Wrist for Elderly People’s Fall Detection,” in Intelligent Data Engineering and Automated Learning (IDEAL 2016), Yangzhou, China, 2016, pp. 523–532. Publisher. Abstract. BibTeX.
The loss of motor function in the elderly makes this population group prone to accidental falls. Actually, falls are one of the most notable concerns in elder care. Not surprisingly, there are several technical solutions to detect falls, however, none of them has achieved great acceptance. The popularization of smartwatches provides a promising tool to address this problem. In this work, we present a solution that applies machine learning techniques to process the output of a smartwatch accelerometer, being able to detect a fall event with high accuracy. To this end, we simulated the two most common types of falls in elders, gathering acceleration data from the wrist, then applied that data to train two classifiers. The results show high accuracy and robust classifiers able to detect falls.

A. Collado Villaverde, M. D. R-Moreno, D. F. Barrero, and D. Rodríguez, “Detección de caídas mediante un acelerómetro de tres ejes ubicado en la muñeca en personas de tercera edad,” in Actas de la XVII Conferencia de la Asociación Española para la Inteligencia Artificial (CAEPIA 2016), Salamanca, Spain, 2016, pp. 29–38. Publisher. BibTeX.

@inproceedings{caepia2016,
  author = {Collado Villaverde, Armando and R-Moreno, Mar\'{i}a D. and Barrero, David F. and Rodr\'{i}guez, Daniel},
  title = {Detecci\'{o}n de ca\'{i}das mediante un aceler\'{o}metro de tres ejes ubicado en la mu\~{n}eca en personas de tercera edad},
  booktitle = {Actas de la XVII Conferencia de la Asociaci\'{o}n Espa\~{n}ola para la Inteligencia Artificial (CAEPIA 2016)},
  series = {CAEPIA 2016},
  year = {2016},
  address = {Salamanca, Spain},
  pages = {29-38},
  month = sep,
  publisher = {Ediciones Universidad Salamanca},
  url = {https://citius.usc.es/sites/default/files/publicacions_publicaciones/2016CEDI_CAEPIA_LODISCO.pdf},
  webpdf = {/assets/pdfs/caepia2016falls.pdf}
}

→ PDF

2015

S. Luengo, S. Winkler, D. F. Barrero, and B. Castaño, “Optimization of Trading Rules for the Spanish Stock Market by Genetic Programming,” in Current Approaches in Applied Artificial Intelligence: 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Seoul, South Korea, June 10-12, 2015, Proceedings, M. Ali, Y. S. Kwon, C.-H. Lee, J. Kim, and Y. Kim, Eds. Cham: Springer International Publishing, 2015, pp. 623–634. Publisher. DOI. BibTeX.

@inbook{ieaaie2015,
  author = {Luengo, Sergio and Winkler, Stephan and Barrero, David F. and Casta{\~{n}}o, Bonifacio},
  editor = {Ali, Moonis and Kwon, Young Sig and Lee, Chang-Hwan and Kim, Juntae and Kim, Yongdai},
  title = {Optimization of Trading Rules for the Spanish Stock Market by Genetic Programming},
  booktitle = {Current Approaches in Applied Artificial Intelligence: 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2015, Seoul, South Korea, June 10-12, 2015, Proceedings},
  year = {2015},
  publisher = {Springer International Publishing},
  address = {Cham},
  pages = {623--634},
  isbn = {978-3-319-19066-2},
  doi = {10.1007/978-3-319-19066-2_60},
  url = {http://link.springer.com/chapter/10.1007\%2F978-3-319-19066-2_60}
}

C. J. Hernández-Castro, D. F. Barrero, and M. D. R-Moreno, “A Machine Learning Attack against the Civil Rights CAPTCHA,” in Intelligent Distributed Computing VIII, Madrid, España, 2015, pp. 239–248. Publisher. Abstract. BibTeX.
Human Interactive Proofs (HIPs) are a basic security measure on the Internet to avoid several types of automatic attacks. Recently, a new HIP has been designed to increase security: the Civil Rights CAPTCHA. It employs the empathy capacity of humans to further strengthen the security of a well known OCR CAPTCHA, Securimage. In this paper, we analyse it from a security perspective, pointing out its design flaws. Then, we create a successful side-channel attack, leveraging some well-known machine learning algorithms.
C. J. Hernandez-Castro, M. D. R-Moreno, and D. F. Barrero, “Using JPEG to Measure Image Continuity and Break Capy and Other Puzzle CAPTCHAs,” IEEE Internet Computing, vol. 19, no. 6, pp. 46–53, Nov. 2015. Publisher. DOI. Abstract. BibTeX.
Human interactive proofs (HIPs) are a basic security measure on the Internet to avoid several types of automatic attacks. A variety of designs have been proposed. Here, the authors focus on a new type of HIP, based on a puzzle completion scheme that has been created to increase security and usability: the Capy CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart). Analyzing its design, the authors find important flaws and weaknesses, and propose a low-cost, side-channel attack, using JPEG to measure the image’s continuity. Their attack has a 65 percent success rate. After analyzing experimental results, they extended their approach to other puzzle CAPTCHAs, breaking them at 20 percent (KeyCAPTCHA) and 98 percent (Garb) success ratios.
G. B. Orgaz, D. F. Barrero, M. D. R-Moreno, and D. Camacho, “Acquisition of business intelligence from human experience in route planning,” Enterprise Information Systems, vol. 9, no. 3, pp. 303–323, 2015. Publisher. DOI. Abstract. BibTeX.
The logistic sector raises a number of highly challenging problems. Probably one of the most important ones is the shipping planning, i.e. plan the routes that the shippers have to follow to deliver the goods. In this article, we present an artificial intelligence-based solution that has been designed to help a logistic company to improve its routes planning process. In order to achieve this goal, the solution uses the knowledge acquired by the company drivers to propose optimised routes. Hence, the proposed solution gathers the experience of the drivers, processes it and optimises the delivery process. The solution uses data mining to extract knowledge from the company information systems and prepares it for analysis with a case-based reasoning (CBR) algorithm. The CBR obtains critical business intelligence knowledge from the drivers experience that is needed by the planner. The design of the routes is done by a genetic algorithm that, given the processed information, optimises the routes following several objectives, such as minimise the distance or time. Experimentation shows that the proposed approach is able to find routes that improve, on average, the routes made by the human experts.
D. F. Barrero, P. Muñoz, D. Camacho, and M. D. R-Moreno, “On the Statistical Distribution of the expected Run-Time in Population-Based Search Algorithms,” Soft Computing, vol. 19, no. 10, pp. 2717–2734, 2015. Publisher. Abstract. BibTeX.
Run-time analysis is a method that characterizes the run-time behaviour of an algorithm. It has been successfully used to analyse metaheuristics and stochastic local search algorithms. Some studies on genetic programming and related stochastic search algorithms suggested the existence of a rationale behind the run-time behaviour which could be exploited to better understand the algorithm looking at its run-time response. Under that hypothesis, this paper presents empirical evidence suggesting common statistical properties in the run-time of several types of population-based search algorithms, including genetic algorithms, genetic programming, grammatical evolution, differential evolution or particle swarm optimization. In this analysis, only the run-time of runs that were able to find a solution are considered; unsuccessful runs are not included in the analysis. The run-time to find a solution, measured by the number of evaluations, of some well-known evolutionary algorithms is empirically obtained, finding that it usually can be approximated using a lognormal distribution, with the exception of some difficult problems, which are better approximated by an exponential. We also show that the algorithm parameter settings might influence the yielding run-time statistical distribution; in particular, when there is no selective pressure, the run-time, measured as the number of evaluations to find a solution, follows a Weibull distribution instead of a lognormal one. Finally, we outline a framework using a simple theoretical discrete-time model, showing that the geometrically distributed run-time is a consequence of the lack of memory in the algorithm.
D. F. Barrero, B. Castaño, M. D. R-Moreno, and D. Camacho, “A study on Koza’s performance measures,” Genetic Programming and Evolvable Machines, vol. 16, no. 3, pp. 327–349, 2015. Publisher. Abstract. BibTeX.
John R. Koza defined several metrics to measure the performance of an Evolutionary Algorithm that have been widely used by the Genetic Programming community. Despite the importance of these metrics, and the doubts that they have generated in many authors, their reliability has attracted little research attention, and is still not well understood. The lack of knowledge about these metrics has likely contributed to the decline in their usage in the last years. This paper is an attempt to increase the knowledge about these measures, exploring in which circumstances they are more reliable, providing some clues to improve how they are used, and eventually making their use more justifiable. Specifically, we investigate the amount of uncertainty associated with the measures, taking an analytical and empirical approach and reaching theoretical boundaries to the error. Additionally, a new method to calculate Koza’s performance measures is presented. It is shown that these metrics, under common experimental configurations, have an unacceptable error, which can be arbitrary large in certain conditions.
P. Muñoz, D. F. Barrero, and M. D. R-Moreno, “A Statistically Rigorous Analysis of 2D Path-Planning Algorithms,” The Computer Journal, vol. 58, no. 11, pp. 2876–2891, 2015. Publisher. DOI. Abstract. BibTeX.
Path-planning is a well-known studied problem in Artificial Intelligence. Given two points in a map, path-planning algorithms search for a path that joins those two points, avoiding obstacles. It is a challenging problem with important practical applications in a wide range of applications: autonomous mobile robotics, logistics or video games, just to mention some of them. Given its importance, it has attracted much research, resulting in a large number of algorithms, some classical, such as A*, other more specialized, such as swarms. However, despite all the literature dedicated to this problem, the statistics used to analyze experimental results in most cases are naïve. In this paper, we position in favor of the need of incorporating stronger statistical methods in path-planning empirical research and promote a debate in the research community. To this end, we analyze some 2D-grid classical path-planning algorithms in discrete domains (i.e. A* and A* with post-processing) and more recent algorithms in continuous domains (i.e. Theta* and S-Theta*). Given the differences of these algorithms, we study them under different criteria: Run-time, number of heading changes, number of expanded vertices and path-length.

2014

C. J. Hernández-Castro, M. D. R-Moreno, and D. F. Barrero, “Side-Channel Attack Against the Capy HIP,” in 2014 International Conference on Emergent Security Technologies (EST 2014), Alcalá de Henares, Spain, 2014, pp. 99–104. Publisher. Abstract. BibTeX.
One of the first approaches to proposed to prevent automated attacks on Internet were the Human Interactive Proofs(HIPs). Since their invention, a variety of designs have been proposed, yet most of them have been successfully attacked. In this paper we focus on a new HIP, based on a puzzle solving scheme, created to increase both security and usability: the Capy CAPTCHA. We have analyzed its design, finding some important flaws. Based on them, we propose a low-cost, side-channel attack. Initial results show that the attack is able to break Capy with a 61% success ratio.
H. D. Menéndez, D. F. Barrero, and D. Camacho, “A Co-Evolutionary Multi-Objective approach for a K-adaptive graph-based clustering algorithm,” in 2014 IEEE Congress on Evolutionary Computation (CEC 2014), Beijing, China, 2014, pp. 2724–2731. Publisher. DOI. Abstract. BibTeX.
Clustering is a field of Data Mining that deals with the problem of extract knowledge from data blindly. Basically, clustering identifies similar data in a dataset and groups them in sets named clusters. The high number of clustering practical applications has made it a fertile research topic with several approaches. One recent method that is gaining popularity in the research community is Spectral Clustering (SC). It is a clustering method that builds a similarity graph and applies spectral analysis to preserve the data continuity in the cluster. This work presents a new algorithm inspired by SC algorithm, the Co-Evolutionary Multi-Objective Genetic Graph-based Clustering (CEMOG) algorithm, which is based on the Multi-Objective Genetic Graph-based Clustering (MOGGC) algorithm and extends it by introducing an adaptative number of clusters. CEMOG takes an island-model approach where each island keeps a population of candidate solutions for ki clusters. Individuals in the islands can migrate to encourage genetic diversity and the propagation of individuals around promising search regions. This new approach shows its competitive performance, compared to several classical clustering algorithms (EM, SC and K-means), through a set of experiments involving synthetic and real datasets.

H. D. Menéndez, D. F. Barrero, and D. Camacho, “A genetic graph-based approach for partitional clustering,” International Journal of Neural Systems, vol. 24, no. 03, p. 1430008, 2014. Publisher. BibTeX.

@article{Menendez2014,
  title = {A genetic graph-based approach for partitional clustering},
  author = {Menéndez, Héctor D and Barrero, David F and Camacho, David},
  journal = {International Journal of Neural Systems},
  volume = {24},
  number = {03},
  pages = {1430008},
  year = {2014},
  url = {http://www.worldscientific.com/doi/abs/10.1142/S0129065714300083},
  publisher = {World Scientific}
}

D. F. Barrero, J. C. Hernández-Castro, P. Peris-Lopez, D. Camacho, and M. D. R-Moreno, “A genetic tango attack against the David-Prasad RFID ultra-lightweight authentication protocol,” Expert Systems, vol. 31, no. 1, pp. 9–19, 2014. Publisher. DOI. Abstract. BibTeX.
Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra-lightweight) RFID environments. One of these proposals is the David-Prasad ultra-lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.

Á. Cuesta, B. F. David, and R-Moreno Marı́a D., “A Framework for massive Twitter data extraction and analysis,” Malaysian Journal of Computer Science, vol. 27, no. 1, pp. 50–67, 2014. Publisher. BibTeX.

@article{Cuesta2014,
  title = {A Framework for massive Twitter data extraction and analysis},
  author = {Cuesta, {\'A}lvaro and David, Barrero F. and R-Moreno, Mar{\'\i}a D.},
  journal = {Malaysian Journal of Computer Science},
  volume = {27},
  number = {1},
  pages = {50--67},
  webpdf = {http://ejum.fsktm.um.edu.my/article/1472.pdf},
  url = {http://mjcs.fsktm.um.edu.my/detail.asp?AID=1472},
  year = {2014}
}

→ PDF

M. D. R-Moreno, B. Castaño, D. F. Barrero, and A. M. Hellín, “Efficient Services Management in Libraries using AI and Wireless techniques,” Expert Systems with Applications, vol. 41, no. 17, pp. 7904–7913, 2014. Publisher. DOI. BibTeX.

@article{R-Moreno2014eswa,
  title = {{Efficient Services Management in Libraries using AI and Wireless techniques}},
  journal = {{Expert Systems with Applications}},
  volume = {41},
  number = {17},
  pages = {7904 - 7913},
  year = {2014},
  issn = {0957-4174},
  doi = {http://dx.doi.org/10.1016/j.eswa.2014.06.047},
  url = {http://www.sciencedirect.com/science/article/pii/S0957417414004035},
  author = {R-Moreno, Mar\'ia D. and Casta\~no, Bonifacio and Barrero, David F. and Hell\'in, Agust\'in M.}
}

J. I. Criado and D. F. Barrero, “Measuring E-government Efficiency. The Opinions of Public Administrators and Other Stakeholders,” M. P. Rodríguez-Bolívar, Ed. Springer-Verlag, 2014, pp. 213–232. Publisher. BibTeX.

@inbook{Criado2014,
  chapter = {{Digital Divide and the Study of Electronic Government Demand. An Empirical Analysis of Spain}},
  pages = {213-232},
  title = {{Measuring E-government Efficiency. The Opinions of Public Administrators and Other Stakeholders}},
  publisher = {Springer-Verlag},
  year = {2014},
  editor = {Rodr\'iguez-Bol\'ivar, Manuel Pedro},
  author = {Criado, J. Ignacio and Barrero, David F.},
  url = {http://www.springer.com/us/book/9781461499817}
}

2013

P. Muñoz, D. F. Barrero, and M. D. R-Moreno, “Statistic Methods for Path-Planning Algorithms Comparison,” KI - Künstliche Intelligenz, vol. 27, no. 3, pp. 201–211, 2013. Publisher. DOI. Abstract. BibTeX.
The path-planning problem for autonomous mobile robots has been addressed by classical search techniques such as A* or, more recently, Theta* or S-Theta*. However, research usually focuses on reducing the length of the path or the processing time. The common practice in the literature is to report the run-time/length of the algorithm with means and, sometimes, some dispersion measure. However, this practice has several drawbacks, mainly due to the loose of valuable information that this reporting practice involves such as asymmetries in the run-time, or the shape of its distribution. Run-time analysis is a type of empirical tool that studies the time consumed by running an algorithm. This paper is an attempt to bring this tool to the path-planning community. To this end the paper reports an analysis of the run-time of the path-planning algorithms with a variety of problems of different degrees of complexity, indoors, outdoors and Mars surfaces. We conclude that the time required by these algorithms follows a lognormal distribution.

R-Moreno Marı́a D., Á. Cuesta, and D. F. Barrero, “Twitter stream analysis in Spanish,” in Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics (WIMS 2013), Madrid, Spain, 2013, pp. 34:1–34:6. Publisher. DOI. BibTeX.

@inproceedings{R-Moreno2013wims,
  author = {R-Moreno, Mar\'{\i}a D. and Cuesta, \'{A}lvaro and Barrero, David F.},
  title = {Twitter stream analysis in Spanish},
  booktitle = {Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics (WIMS 2013)},
  series = {WIMS '13},
  year = {2013},
  isbn = {978-1-4503-1850-1},
  location = {Madrid, Spain},
  pages = {34:1--34:6},
  articleno = {34},
  numpages = {6},
  url = {https://dl.acm.org/citation.cfm?id=2479819},
  doi = {10.1145/2479787.2479819},
  acmid = {2479819},
  publisher = {ACM},
  address = {Madrid, Spain},
  webpdf = {/assets/pdfs/wims2013.pdf},
  keywords = {Twitter, sentiment analysis, social networks, stream analysis, tweets}
}

→ PDF

D. F. Barrero, M. R. R-Moreno, B. Castano, and D. Camacho, “Effects of the Lack of Selective Pressure on the Expected Run-Time Distribution in Genetic Programming,” in 2013 IEEE Congress on Evolutionary Computation (CEC 2013), Cancún, México, 2013, vol. 1, pp. 1748–1755. Publisher. Abstract. BibTeX.
Run-time analysis is a powerful tool to analyze algorithms. It is focused on studying the time required by an algorithm to find a solution, the expected run-time, which is one of the most relevant algorithm attributes. Previous research has associated the expected run-time in GP with the lognormal distribution. In this paper we provide additional evidence in that regard and show how the algorithm parametrization may change the resulting run-time distribution. In particular, we explore the influence of the selective pressure on the run-time distribution in tree-based GP, finding that, at least in two problem instances, the lack of selective pressure generates an expected run-time distribution well described by the Weibull probability distribution.
H. Menéndez, D. F. Barrero, and D. Camacho, “A Multi-Objective Genetic Graph-based Clustering Algorithm with Memory Optimization,” in 2013 IEEE Congress on Evolutionary Computation (CEC 2013), Cancún, México, 2013, vol. 1, pp. 3174–3181. Publisher. Abstract. BibTeX.
Clustering is one of the most versatile tools for data analysis. Over the last few years, clustering that seeks the continuity of data (in opposition to classical centroid-based approaches) has attracted an increasing research interest. It is a challenging problem with a remarkable practical interest. The most popular continuity clustering method is the Spectral Clustering algorithm, which is based on graph cut: it initially generates a Similarity Graph using a distance measure and then uses its Graph Spectrum to find the best cut. Memory consuption is a serious limitation in that algorithm: The Similarity Graph representation usually requires a very large matrix with a high memory cost. This work proposes a new algorithm, based on a previous implementation named Genetic Graph-based Clustering (GGC), that improves the memory usage while maintaining the quality of the solution. The new algorithm, called Multi-Objective Genetic Graph-based Clustering (MOGGC), uses an evolutionary approach introducing a Multi-Objective Genetic Algorithm to manage a reduced version of the Similarity Graph. The experimental validation shows that MOGGC increases the memory efficiency, maintaining and improving the GGC results in the synthetic and real datasets used in the experiments. An experimental comparison with several classical clustering methods (EM, SC and K-means) has been included to show the efficiency of the proposed algorithm.
A. Stoica, D. F. Barrero, and K. McDonald-Maier, “Improved Targeting though Collaborative Decision-Making and Brain Computer Interfaces,” in 2013 4th International Conference on Collaboration Technologies and Systems (CTS 2013), San Diego, CA, USA, 2013, pp. 435–442. Publisher. Abstract. BibTeX.
This paper reports a first step toward a brain-computer interface (BCI) for collaborative targeting. Specifically, we explore, from a broad perspective, how the collaboration of a group of people can increase the performance on a simple target identification task. To this end, we requested a group of people to identify the location and color of a sequence of targets appearing on the screen, and measured the time and the accuracy of the response. The individual results are compared to a collective identification result determined by simple majority voting, with random choice in case of drawn. The results are promising, as the identification becomes significantly more reliable even with this simple voting, and with a small number of people (either odd or even) involved in the decision. In addition, the paper briefly analyzes the role of brain-computer interfaces in collaborative targeting, extending the targeting task by using a BCI instead of a mechanical response.
A. Stoica, T. Theodoridis, H. Hu, K. McDonald-Maier, and D. F. Barrero, “Towards Human-Friendly Efficient Control of Multi-Robot Teams,” in 2013 4th International Workshop on Collaborative Robots and Human Robot Interaction (CTS 2013), San Diego, CA, USA, 2013, pp. 226–231. Publisher. Abstract. BibTeX.
This paper explores means to increase efficiency in performing tasks with multi-robot teams, in the context of natural Human-Multi-Robot Interfaces (HMRI) for command and control. The motivating scenario is an emergency evacuation by a transport convoy of unmanned ground vehicles (UGVs) that have to traverse, in shortest time, an unknown terrain. In the experiments the operator commands, in minimal time, a group of rovers through a maze. The efficiency of performing such tasks depends on both, the levels of robots’ autonomy, and the ability of the operator to command and control the team. The paper extends the classic framework of levels of autonomy (LOA), to levels/hierarchy of autonomy characteristic of Groups (G-LOA), and uses it to determine new strategies for control. An UGVoriented command language (UGVL) is defined, and a mapping is performed from the human-friendly gesture-based HMRI into the UGVL. The UGVL is used to control a team of 3 robots, exploring the efficiency of different G-LOA; specifically, by (a) controlling each robot individually through the maze, (b) controlling a leader and cloning its controls to followers, and (c) controlling the entire group. Not surprisingly, commands at increased G-LOA lead to a faster traverse, yet a number of aspects are worth discussing in this context.

2012

P. Muñoz, D. F. Barrero, and M. D. R-Moreno, “Run-Time Analysis of Classical Path-Planning Algorithms,” in Procs. of the Thirty-second SGAI International Conference on Artificial Intelligence (SGAI 2012), M. Bramer and M. Petridis, Eds. Springer London, 2012, pp. 137–148. Publisher. Abstract. BibTeX.
Run-time analysis is a type of empirical tool that studies the time consumed by running an algorithm. This type of analysis has been successfully used in some Artificial Intelligence (AI) fields, in paticular in Metaheuristics. This paper is an attempt to bring this tool to the path-planning community. In particular, we analyse the statistical properties of the run-time of the A*, Theta* and S-Theta* algorithms with a variety of problems of different degrees of complexity. Traditionally, the path-planning literature has compared run-times just comparing their mean values. This practice, which unfortunately is quite common in the literature, raises serious concerns from a methodological and statistical point of view. Simple mean comparison provides poorly supported conclusions, and, in general, it can be said that this practice should be avoided. After our analysis, we conclude that the time required by these three algorithms follows a lognormal distribution. In low complexity problems, the lognormal distribution looses some accuracy to describe the algorithm run-times. The lognormality of the run-times opens the use of powerful parametric statistics to compare execution times, which could lead to stronger empirical methods.

G. B. Orgaz, R-Moreno Marı́a D., D. Camacho, and D. F. Barrero, “Clustering avatars behaviours from virtual worlds interactions,” in Proceedings of the 4th International Workshop on Web Intelligence & Communities (WIC 2012), Lyon, France, 2012, pp. 4:1–4:7. Publisher. DOI. BibTeX.

@inproceedings{Orgaz2012wic,
  author = {Orgaz, Gema Bello and R-Moreno, Mar\'{\i}a D. and Camacho, David and Barrero, David F.},
  title = {Clustering avatars behaviours from virtual worlds interactions},
  booktitle = {Proceedings of the 4th International Workshop on Web Intelligence \& Communities (WIC 2012)},
  organization = {WI\&C '12},
  year = {2012},
  isbn = {978-1-4503-1189-2},
  address = {Lyon, France},
  pages = {4:1--4:7},
  articleno = {4},
  numpages = {7},
  url = {http://doi.acm.org/10.1145/2189736.2189743},
  doi = {10.1145/2189736.2189743},
  acmid = {2189743},
  publisher = {ACM},
  webpdf = {/assets/pdfs/wic2012-vw.pdf},
  keywords = {behavioral patterns, clustering techniques, data processing, graph and overlapping clustering, hierarchical clustering, virtual worlds}
}

→ PDF

D. F. Barrero, M. D. R-Moreno, and D. Camacho, “Adapting Searchy to extract data using evolved wrappers,” Expert Systems with Applications, vol. 39, no. 3, pp. 3061–3070, 2012. Publisher. DOI. BibTeX.

@article{Barrero2012eswa,
  title = {Adapting Searchy to extract data using evolved wrappers},
  journal = {Expert Systems with Applications},
  volume = {39},
  number = {3},
  pages = {3061 - 3070},
  year = {2012},
  note = {},
  issn = {0957-4174},
  doi = {10.1016/j.eswa.2011.08.168},
  url = {http://www.sciencedirect.com/science/article/pii/S0957417411012991},
  author = {Barrero, David F. and R-Moreno, Mar\'ia D. and Camacho, David},
  impacto = {1.924 (33/108: Comp. Science \& Art. Int.; 48/247: Operations Research \& Management Science; 15/74: Engineering, Electrical \& Electronic) (2010)},
  keywords = {Information extraction}
}

2011

M. D. R-Moreno, D. Camacho, D. F. Barrero, and B. Castaño, “Human Drivers Knowledge Integration in a Logistics Decision Support Tool,” in Intelligent Distributed Computing (IDC 2011), Ámsterdam, Países Bajos, 2011, vol. 382, pp. 227–236. Publisher. BibTeX.

@inproceedings{Moreno2011idc,
  author = {R-Moreno, Mar\'ia Dolores and Camacho, David and Barrero, David F. and Casta{\~n}o, Bonifacio},
  booktitle = {Intelligent Distributed Computing (IDC 2011)},
  crossref = {conf/idc/2011},
  editor = {Brazier, Frances M. T. and Nieuwenhuis, Kees and Pavlin, Gregor and Warnier, Martijn and Badica, Costin},
  isbn = {978-3-642-24012-6},
  pages = {227-236},
  publisher = {Springer-Verlag},
  organization = {{IDC 2011}},
  address = {\'Amsterdam, Pa\'ises Bajos},
  series = {Studies in Computational Intelligence},
  title = {{Human Drivers Knowledge Integration in a Logistics Decision Support Tool}},
  url = {https://link.springer.com/chapter/10.1007/978-3-642-24013-3_23},
  webpdf = {/assets/pdfs/idc2011.pdf},
  volume = {382},
  year = {2011}
}

→ PDF

D. F. Barrero, M. R-Moreno, B. Castano, and D. Camacho, “An Empirical Study on the Accuracy of Computational Effort in Genetic Programming,” in Proceedings of the 2011 IEEE Congress on Evolutionary Computation (CEC 2011), New Orleans, LA, USA, 2011, pp. 1169–1176. Publisher. Abstract. BibTeX.
Some commonly used performance measures in Genetic Programming are those defined by John Koza in his first book. These measures, mainly computational effort and number of individuals to be processed, estimate the performance of the algorithm as well as the difficulty of a problem. Although Koza’s performance measures have been widely used in the literature, their behaviour is not well known. In this paper we study the accuracy of these measures and advance in the understanding of the factors that influence them. In order to achieve this goal, we report an empirical study that attempts to systematically measure the effects of two variability sources in the estimation of the number of individuals to be processed and the computational effort. The results obtained in those experiments suggests that these measures, in common experimental setups, and under certain circumstances, might have a high relative error.
D. F. Barrero, B. Castaño, M. D. R-Moreno, and D. Camacho, “Statistical Distribution of Generation-to-Success in GP: Application to Model Accumulated Success Probability,” in Proceedings of the 14th European Conference on Genetic Programming (EuroGP 2011), Turín, Italy, 2011, vol. 6621, pp. 155–166. Publisher. Abstract. BibTeX.
Many different metrics have been defined in Genetic Programming. Depending on the experiment requirements and objectives, a collection of measures are selected in order to achieve an understanding of the algorithm behaviour. One of the most common metrics is the accumulated success probability, which evaluates the probability of an algorithm to achieve a solution in a certain generation. We propose a model of accumulated success probability composed by two parts, a binomial distribution that models the total number of success, and a lognormal approximation to the generation-to-success, that models the variation of the success probability with the generation.

D. F. Barrero, “Reliability of Performance Measures in Tree-Based Genetic Programming: A study on Koza’s Computational Effort,” PhD thesis, Universidad de Alcalá, Alcalá de Henares, Madrid, Spain, 2011. BibTeX.

@phdthesis{Barrero2011,
  author = {Barrero, David F.},
  title = {{Reliability of Performance Measures in Tree-Based Genetic Programming:
          A study on Koza's Computational Effort}},
  school = {Universidad de Alcalá},
  year = {2011},
  address = {Alcalá de Henares, Madrid, Spain},
  month = dec,
  webpdf = {/assets/pdfs/thesisDFBarrero.pdf},
  slides = {https://www.slideshare.net/dfbarrero/presentacin-tesis-doctoral-10969530}
}

→ PDF

→ Slides

M. D. R-Moreno, B. Castaño, M. Carbajo, Á. Moreno, D. F. Barrero, and P. Muñoz, “Multi-agent intelligent planning architecture for people location and orientation using RFID,” Cybernetics and Systems, vol. 42, no. 1, pp. 16–32, Jan. 2011. Publisher. Abstract. BibTeX.
The new advances in information communications technology (ICT) allow expanding the electronic communication networks into an objective environment. These techniques can be used to help users who have to go to a building with several floors, corridors, and departments to get its right location and orientation. The problem gets more complicated when there are a high number of visitors with temporal constraints. Typically the lack of information and signs to guide the user complicates this task. A typical example is a hospital, where patients have scheduled doctor’s appointments and in some cases movement problems (handicaps). A possibility for solving this problem is to equip the building with an intelligent system for user detection and orientation. In this article we present a solution that uses a detection and a location system based on wireless technology and artificial intelligence techniques to plan and inform about the paths the user can follow.

2010

M. D. R-Moreno, D. Camacho, D. F. Barrero, and M. Gutiérrez, “A Decision Support System for Logistics Operations,” in Proceedings of International Workshop on Soft Computing Models in Industrial Applications (SOCO 2010), Guimarães, Portugal, 2010, vol. 73, pp. 103–110. Publisher. Abstract. BibTeX.
This paper describes an Artificial Intelligence based application for a logistic company that solves the problem of grouping by zones the packages that have to be delivered and propose the routes that the drivers should follow. The tool combines from the one hand, Case-Based Reasoning techniques to separate and learn the most frequent areas or zones that the experienced logistic operators do. These techniques allow the company to separate the daily incidents that generate noise in the routes, from the decision made based on the knowledge of the route. From the other hand, we have used Evolutionary Computation to plan optimal routes from the learning areas and evaluate those routes. The application allows the users to decide under what parameters (i.e. distance, time, etc) the route should be optimized.
D. F. Barrero, A. González, M. D. R-Moreno, and D. Camacho, “Variable Length-Based Genetic Representation to Automatically Evolve Wrappers,” in Proceedings of 8th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2010). Special Session on Bio-Inspired and Multi-Agents Systems: Applications to Languages, Salamanca, Spain, 2010, vol. 2, pp. 371–379. Publisher. DOI. Abstract. BibTeX.
The Web has been the star service on the Internet, however the outsized information available and its decentralized nature has originated an intrinsic difficulty to locate, extract and compose information. An automatic approach is required to handle with this huge amount of data. In this paper we present a machine learning algorithm based on Genetic Algorithms which generates a set of complex wrappers, able to extract information from theWeb. The paper presents the experimental evaluation of these wrappers over a set of basic data sets.
A. González, D. F. Barrero, M. D. R-Moreno, and D. Camacho, “A Case Study on Grammatical-based Representation for Regular Expression Evolution,” in Proceedings of 8th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2010). Special Session on Bio-Inspired and Multi-Agents Systems: Applications to Languages, Salamanca, Spain, 2010, vol. 2, pp. 379–386. Publisher. DOI. Abstract. BibTeX.
Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and flexible notation to define and retrieve patterns from text, the syntax and the grammatical rules of these regex notations are not easy to use, and even to understand. Any regex can be represented as a Deterministic or Non-Deterministic Finite Automata; so it is possible to design a representation to automatically build a regex, and a optimization algorithm able to find the best regex in terms of complexity. This paper introduces both, a graph-based representation for regex, and a particular heuristic-based evolutionary computing algorithm based on grammatical features from this language in a particular data extraction problem.

D. F. Barrero, D. Camacho, and M. D. R-Moreno, “Confidence Intervals of Success Rates in Evolutionary Computation,” in Proceedings of Genetic and Evolutionary Computation Conference (GECCO-2010)., Portland, OR, USA, 2010, pp. 975–976. BibTeX.

@inproceedings{Barrero2010gecco,
  author = {Barrero, David F. and Camacho, David and R-Moreno, M. Dolores},
  title = {Confidence Intervals of Success Rates in Evolutionary Computation},
  booktitle = {Proceedings of Genetic and Evolutionary Computation Conference (GECCO-2010).},
  year = {2010},
  address = {Portland, OR, USA},
  month = {7-11 julio},
  organization = {Genetic and Evolutionary Computation Conference (GECCO-2010).},
  publisher = {ACM},
  poster = {/assets/pdfs/cec2010Poster.pdf},
  webpdf = {/assets/pdfs/gecco2010.pdf},
  pages = {975-976}
}

→ PDF

→ Poster

D. F. Barrero, A. González-Pardo, D. Camacho, and M. D. R-Moreno, “Distributed Parameter Tuning for Genetic Algorithms,” Computer Science and Information Systems (ComSIS), vol. 7, no. 3, pp. 661–677, Jun. 2010. Publisher. Abstract. BibTeX.
Genetic Algorithms (GA) is a family of search algorithms based on the mechanics of natural selection and biological evolution. They are able to efficiently exploit historical information in the evolution process to look for optimal solutions or approximate themfor a given problem, achieving excellent performance in optimization problems that involve a large set of dependent variables. Despite the excellent results of GAs, their use may generate new problems. One of them is how to provide a good fitting in the usually large number of parameters that must be tuned to allow a good performance. This paper describes a new platform that is able to extract the Regular Expression that matches a set of examples, using a supervised learning and agent-based framework. In order to do that, GA-based agents decompose the GA execution in a distributed sequence of operations performed by them. The platform has been applied to Language induction problem, for that reason the experiments are focused on the extraction of the regular expression that matches a set of examples. Finally, the paper shows the efficiency of the proposed platform (in terms of fitness value) applied to three case studies: emails, phone numbers and URLs. Moreover, it is described how the codification of the alphabet affects to the performance of the platform.

D. F. Barrero, M. D. R-Moreno, and D. R. López, “Information Integration in Searchy: an Ontology and Web Services Approach,” International Journal of Computer Science and Applications (IJCSA), vol. 7, no. 2, pp. 14–29, 2010. Publisher. BibTeX.

@article{Barrero2010ijcsa,
  author = {Barrero, David F. and R-Moreno, Mar{\'i}a D. and L{\'o}pez, Diego R.},
  title = {{Information Integration in Searchy: an Ontology and Web Services Approach}},
  journal = {International Journal of Computer Science and Applications (IJCSA)},
  year = {2010},
  volume = {7},
  pages = {14-29},
  number = {2},
  url = {http://www.tmrfindia.org/ijcsa/v72.html},
  webpdf = {http://www.tmrfindia.org/ijcsa/v7i22.pdf},
  issn = {0972-9038}
}

→ PDF

2009

D. F. Barrero, D. Camacho, and M. D. R-Moreno, “Data Mining and Multiagent Integration,” L. Cao, Ed. University of Technology Sydney, Australia: Springer-Verlag, 2009, pp. 143–154. Publisher. Abstract. BibTeX.
Data Extraction from the World Wide Web is a well known, unsolved, and critical problem when complex information systems are designed. These problems are related to the extraction, management and reuse of the huge amount ofWeb data available. These data usually has a high heterogeneity, volatility and low quality (i.e. format and content mistakes), so it is quite hard to build reliable systems. This chapter proposes an Evolutionary Computation approach to the problem of automatically learn software entities based on Genetic Algorithms and regular expressions. These entities, also called wrappers, will be able to extract some kind of Web data structures from examples.
D. F. Barrero, D. Camacho, and M. D. R-Moreno, “A Framework for Agent-Based Evaluation of Genetic Algorithms,” in Proceedings of the 3rd International Symposium on Intelligent Distributed Computing (IDC 2009), Ayia Napa, Chipre, 2009, vol. 237, pp. 31–41. Publisher. DOI. Abstract. BibTeX.
Genetic Algorithms (GA) are a set of algorithms that use biological evolution as inspiration to solve search problems. One of the difficulties found when working with GA are the several parameters that have to be set and the many details that can be tunned in the GA. Usually it leads to the execution of several experiments in order to study how the GA behaves under different circumstances. In general it requires several computational resources and time to code the same algorithm with slight differences several times. In this paper we propose a framework based on agent technology able to parallelize the experiment and to split it into several components. It is complemented with a description of how this framework can be used in the evolution of regular expressions.

2008

D. Camacho, M. D. R-Moreno, D. F. Barrero, and R. Akerkar, “Semantic Wrappers for Semi-Structured Data,” Computing Letters (Cole), vol. 4, no. 1-4, pp. 21–34, Dec. 2008. Abstract. BibTeX.
In this paper, we propose an approach to extract information from HTML pages and to add semantic (XML) tags to them. Wrapping is an essential technique used to automatically extract information from Web sources. This paper describes both, a general approach based on rules, which can be used to automatically generate wrappers, and an assistant generator wrapper called WebMantic. We also provide some experimental results to show that both the rule generation process and the preprocessing task are fast and reliable.

2007

D. F. Barrero and J. I. Criado, “Investigando la Web Semántica, los servicios web y la integración organizacional en el sector público,” De Auditu, vol. 1, pp. 122–136, 2007. BibTeX.

D. F. Barrero, J. I. Criado, and M. C. Ramilo, “Hizuntza, komunikazioaren eta teknologiaren garaian,” Vitoria, Spain: Instituto Vasco de Adminitración Pública, 2007, pp. 49–60. BibTeX.

@inbook{Barrero2007a,
  chapter = {{Lankidetza-tresnak I: Web 2.0, Web Semantikoa eta wiki-ak}},
  pages = {49--60},
  title = {Hizuntza, komunikazioaren eta teknologiaren garaian},
  publisher = {Instituto Vasco de Adminitraci{\'o}n P{\'u}blica},
  year = {2007},
  author = {Barrero, David F. and Criado, J. Ignacio and Ramilo, M. Carmen},
  address = {Vitoria, Spain},
  month = {49-60}
}

D. F. Barrero, M. C. Ramilo, and J. I. Criado, “Hizuntza, komunikazioaren eta teknologiaren garaian,” Vitoria, Spain: Instituto Vasco de Adminitración Pública, 2007, pp. 61–74. BibTeX.

@inbook{Barrero2007b,
  chapter = {{Lankidetza-tresnak II: Blogak, herritarrak, gobernuak eta administrazio
  	publikoak}},
  pages = {61-74},
  title = {Hizuntza, komunikazioaren eta teknologiaren garaian},
  publisher = {Instituto Vasco de Adminitraci{\'o}n P{\'u}blica},
  year = {2007},
  author = {Barrero, David F. and Ramilo, M. Carmen and Criado, J. Ignacio},
  address = {Vitoria, Spain},
  month = {61-74}
}

2006

D. F. Barrero and J. I. Criado, “Ingestigando la Web Semántica, los Servicios Web y la Integración Organizacional en el Sector Público: Searchy como Aplicación para la Gestión del Conocimiento en Entornos Complejos,” in I Congreso Internacional de investigación y Posgrado en el Siglo XXI, Caracas, Venezuela, 2006. BibTeX.

J. I. Criado and D. F. Barrero, “Barreras para la Integración de la Calidad de los Servicios Públicos en la eAdministración,” in IX Jornadas sobre Tecnologías de la Información para la Modernización de las Administraciones Públicas (TECNIMAP 2006), Seville, Spain, 2006. BibTeX.

@inproceedings{Criado2006,
  author = {Criado, J. Ignacio and Barrero, David F.},
  title = {Barreras para la Integraci{\'o}n de la Calidad de los Servicios P{\'u}blicos
  	en la eAdministraci{\'o}n},
  booktitle = {IX Jornadas sobre Tecnolog{\'i}as de la Informaci{\'o}n para la Modernizaci{\'o}n
  	de las Administraciones P{\'u}blicas (TECNIMAP 2006)},
  year = {2006},
  address = {Seville, Spain},
  organization = {IX Jornadas sobre Tecnolog{\'i}as de la Informaci{\'o}n para la Modernizaci{\'o}n
  	de las Administraciones P{\'u}blicas (TECNIMAP 2006)},
  month = {30 mayo - 2 junio}
}

J. I. Criado, D. F. Barrero, and M. C. Ramilo, “Política y Web 2.0,” in III Congreso Online del Observatorio de la Cibersociedad, En línea, 2006. Publisher. BibTeX.

@inproceedings{Criado2006ooc,
  author = {Criado, J. Ignacio and Barrero, David F. and Ramilo, M. Carmen},
  title = {Pol{\'i}tica y Web 2.0},
  booktitle = {III Congreso Online del Observatorio de la Cibersociedad},
  address = {En l\'inea},
  year = {2006},
  organization = {III Congreso Online del Observatorio de la Cibersociedad},
  url = {http://www.cibersociedad.net/congres2006/gts/comunicacio.php?id=963}
}

2005

D. F. Barrero, D. R. López, M. D. R-Moreno, and O. García, “Federación distribuida de fuentes de información heterogéneas basadas en servicios web y ontologías,” in I Jornadas Cientifico-Técnicas de Servicios Web, Granade, Spain, 2005, pp. 205–212. BibTeX.

@inproceedings{Barrero2005jsweb,
  author = {Barrero, David F. and L{\'o}pez, Diego R. and R-Moreno, M. Dolores and Garc\'ia, Oscar},
  title = {Federaci{\'o}n distribuida de fuentes de informaci{\'o}n heterog{\'e}neas
  	basadas en servicios web y ontolog{\'i}as},
  booktitle = {I Jornadas Cientifico-T{\'e}cnicas de Servicios Web},
  year = {2005},
  pages = {205--212},
  address = {Granade, Spain},
  month = {13-14 Septiembre},
  organization = {I Jornadas Cientifico-T{\'e}cnicas de Servicios Web}
}

D. F. Barrero, M. D. R-Moreno, O. García, and A. Moreno, “SEARCHY: a metasearch engine for heterogeneous sources in distributed environments,” in DCMI ’05: Proceedings of the 2005 International Conference on Dublin Core and Metadata Applications, Madrid, Spain, 2005, pp. 261–268. Publisher. BibTeX.

@inproceedings{Barrero2005dcmi,
  author = {Barrero, David F. and R-Moreno, M. Dolores and Garc\'ia, Oscar and Moreno, Angel},
  title = {{SEARCHY: a metasearch engine for heterogeneous sources in distributed
  	environments}},
  booktitle = {DCMI '05: Proceedings of the 2005 International Conference on Dublin
  	Core and Metadata Applications},
  year = {2005},
  pages = {261--268},
  month = {12-15 septiembre},
  organization = {2005 International Conference on Dublin Core and Metadata Applications},
  publisher = {Dublin Core Metadata Initiative},
  isbn = {8489315442, 9788489315440},
  location = {Madrid, Spain},
  address = {Madrid, Spain},
  url = {http://portal.acm.org/citation.cfm?id=1383505},
  webpdf = {/assets/pdfs/dcmi2005.pdf}
}

→ PDF

2004

D. F. Barrero, D. R. López, and O. García, “Federación de servicios de búsqueda mediante un sistema semántico multiagente,” Boletín RedIRIS, vol. 43, pp. 52–56, Dec. 2004. BibTeX.
D. F. Barrero, D. R. López, and Garcı́a Población, “Distributed Metainformation Searching: An Approach to Information Retrieval in the Age of the Semantic Web,” in VII Trans-European Research and Education Networking Association Networking Conference (TNC 2004), Rodas, Grecia, 2004. Abstract. BibTeX.
Semantic representation of information has some evident advantages from an integration point of view, but there are many situations in which this approach is not directly applicable, as information is stored in several formats without (implicit or explicit) knowledge of its semantics. We present a distributed middleware able to unify the access to any arbitrary information source by doing a semantic translation of its contents.

D. F. Barrero and J. I. Criado, “Integrando la Información de las Administraciones Públicas en la Gestión del Conocimiento. Una solución desde la Web Semántica y los Servicios Web,” in VIII Jornadas sobre Tecnoloías de la Información para la Modernización de las Administraciones Públicas (TECNIMAP 2004), Murcia, España, 2004. BibTeX.

@inproceedings{BarreroTECNIMAP2004,
  author = {Barrero, David F. and Criado, J. Ignacio},
  title = {Integrando la Informaci{\'o}n de las Administraciones P{\'u}blicas
  	en la Gesti{\'o}n del Conocimiento. Una soluci{\'o}n desde la Web
  	Sem{\'a}ntica y los Servicios Web},
  booktitle = {VIII Jornadas sobre Tecnolo{\'i}as de la Informaci{\'o}n para la
  	Modernizaci{\'o}n de las Administraciones P{\'u}blicas (TECNIMAP
  	2004)},
  year = {2004},
  address = {Murcia, Espa\~na},
  month = {28 septiembre - 1 octubre},
  tipo = {Presentaci\'on},
  owner = {david},
  timestamp = {2010.03.25},
  weburl = {www.csi.map.es/csi/tecnimap/tecnimap_2004/comunicaciones/tema_06/6_019.pdf}
}

D. F. Barrero and M. C. Ramilo, “Mitos y Realidades del Software Libre en la Administración Pública,” in II Congreso Internacional Online del Observatorio para la Cibersociedad, En línea, 2004. BibTeX.

@inproceedings{Barrero2004a,
  author = {Barrero, David F. and Ramilo, M. Carmen},
  title = {Mitos y Realidades del Software Libre en la Administraci{\'o}n P{\'u}blica},
  booktitle = {II Congreso Internacional Online del Observatorio para la Cibersociedad},
  year = {2004},
  organization = {II Congreso Internacional Online del Observatorio para la Cibersociedad},
  address = {En l\'inea}
}

J. I. Criado and D. F. Barrero, Construyendo la Administración Electrónica Local. Las Tecnologías de la Información y la Comunicación e Internet en los Ayuntamientos de la Comunidad de Madrid. Madrid, Spain: EuroGestión Pública, 2004. BibTeX.

2002

D. F. Barrero and J. I. Criado, “Internet y Unix: 30 años de vidas paralelas,” Mundo Linux, vol. 43, pp. 60–64, 2002. BibTeX.

2001

J. I. Criado and D. F. Barrero, “Internet en los municipios de la Comunidad de Madrid: Un estudio comparativo.” Internal Report of the Comunidad de Madrid, 2001. BibTeX.
D. F. Barrero, “Internacionalización con Gettext,” Sólo Programadores Mundo Linux, vol. 36, 2001. BibTeX.

Publications

David F. Barrero

2021

2020

2019

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2002

2001