Rafael Rivera-LopezInstituto Tecnológico de Veracruz · Departamento de Ingeniería en Sistemas Computacionales
Rafael Rivera-Lopez
Doctor of Computer Science
Professor-Researcher in the area of Computer Science
About
51
Publications
47,067
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
250
Citations
Introduction
Rafael Rivera-Lopez received the B.S. degree in Computer Systems Engineering from the Instituto Tecnológico de Veracruz, in México in 1989, the M.S. degree in Computer Sciences from the ITESM, in Morelos, México, in 2000, and the Doctoral degree in Computer Sciences from the Universidad Juárez Autónoma de Tabasco, also in México, in 2018.
Since 1992, he has been a Research Professor with the Computer and Systems Department in the Instituto Tecnológico de Veracruz, in México. His research interests include the study and application of meta-heuristics to solve complex problems and the implementation of object-oriented models in machine learning procedures.
Additional affiliations
September 1992 - present
September 1992 - present
Position
- Professor
Description
- Professor of undergraduate and graduate courses of Computer Systems and Computer Sciences: - Oriented Object Programming with Java - Artificial Intelligence - Computer Graphics
Education
August 2014 - December 2017
January 1999 - May 2000
August 1985 - June 1989
Publications
Publications (51)
This paper presents an object oriented model for solving the chemical equation balancing problem. This model consists of a group of classes that apply algebraic methods based on matrix computations to find the stoichiometric coefficients needed for balancing a chemical equation. A context-free grammar for validating chemical equations is defined an...
Wrapper approaches for feature subset selection are computationally intensive because they require training and evaluation of a machine learning algorithm to assess the goodness of a subset of features. This proposal combines the permutational-based differential evolution for feature selection (DE-FSPM) algorithm as a wrapper approach with three in...
This study describes the application of four adaptive differential evolution algorithms to generate oblique decision trees. A population of decision trees encoded as real-valued vectors evolves through a global search strategy. Three schemes to create the initial population of the algorithms are applied to reduce the number of redundant nodes (whos...
Bacterial Vaginosis is a common disease and recurring public health problem. Additionally, this infection can trigger other sexually transmitted diseases. In the medical field, not all possible combinations among the pathogens of a possible case of Bacterial Vaginosis are known to allow a diagnosis at the onset of the disease. It is important to co...
This paper presents a comparative study of the performance of an unsupervised feature selection method using three evaluation metrics. In the existing literature, various metrics are used to guide the search for a better feature subset and evaluate the resulting data clusterization. Still, there is no well-established path for the unsupervised wrap...
Bacterial vaginosis (BV) is a disease affecting women in reproductive age. This condition is associated with pelvic inflammatory, preterm births, and increases the susceptibility to Sexually Transmitted Diseases (STD) as the Human Immunodeficiency Virus (HIV). Previous studies have demonstrated high precision in the classification between BV catego...
Bacterial Vaginosis (BV) is a dysbiosis of the normal flora residing in the patient's vaginal mucosa. Objective: Running the apriori algorithm to mine association rules in a dataset that holds records of patients diagnosed with BV+. Method: To select the rules created with statistical significance the functions is.redundant, is.significant, and is....
In this paper, a hybrid genetic algorithm implemented in a grid environment to solve hard instances of the flexible flow shop scheduling problem with sequence-dependent setup times is introduced. The genetic algorithm takes advantage of the distributed computing power on the grid to apply a hybrid local search to each individual in the population a...
The induction of decision trees is a widely-used approach to build classification models that guarantee high performance and expressiveness. Since a recursive-partitioning strategy guided for some splitting criterion is commonly used to induce these classifiers, overfitting, attribute selection bias, and instability to small training set changes ar...
This paper presents a methodological scheme to obtain the maximum benefit in occupational health by attending to psychosocial risk factors in a company. This scheme is based on selecting an optimal subset of psychosocial risk factors, considering the departments’ budget in a company as problem constraints. This methodology can be summarized in thre...
Paper waste in the mockup design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local...
![Figure 1. Heat convection-conduction problem (physical model) [13].](profile/Marco-Cruz-Chavez/publication/350537013/figure/fig1/AS:1008590752067584@1617478182438/Heat-convection-conduction-problem-physical-model-13_Q320.jpg)
![Figure 2. Hydrodynamic problem, Driven-Cavity (physical model) [13].](profile/Marco-Cruz-Chavez/publication/350537013/figure/fig2/AS:1008590756274177@1617478183283/Hydrodynamic-problem-Driven-Cavity-physical-model-13_Q320.jpg)
This work presents an optimization proposal to better the computational convergence time in convection-diffusion and driven-cavity problems by applying a simulated annealing (SA) metaheuristic, obtaining optimal values in relaxation factors (RF) that optimize the problem convergence during its numerical execution. These relaxation factors are teste...
Resumen. La Vaginosis Bacteriana (VB) es una enfermedad común entre mujeres sexualmente activas que en su mayoría son asintomáticas. Sus causas son desconocidas, pero estudios previos sugieren que algunos microorganismos biomarcadores como Gardnerella Vaginallis, Prevotella y Mycoplasma son agentes asociados a VB. En este trabajo se utilizan método...
Planning corridors for new facilities such as pipeline or transmission lines through geographical spaces is a topographical constraint optimization problem. The corridor planning problem requires finding an optimal route or a set of alternative paths between two locations. This article presents a simulated-annealing-based (SA) approach applying a v...
In this paper, a computational methodology combining the simulated annealing algorithm with two machine learning techniques to select a near-optimal safeguard set for business risk response is presented. First, a mathematical model with four types of risk factor responses (avoid, mitigate, transfer, and accept) is constructed. Then, the simulated a...
This paper describes a permutational-based Differential Evolution algorithm implemented in a wrapper scheme to find a feature subset to be applied in the construction of a near-optimal classifier. In this approach, the relevance of a feature chosen to build a better classifier is represented through its relative position in an integer-valued vector...
This paper describes one grid-based genetic algorithm approach to solve the vehicle routing
problem with time windows in one experimental cluster MiniGrid. Clusters used in this approach
are located in two Mexican cities (Cuernavaca and Jiutepec, Morelos) securely communicating with
each other since they are configured as one virtual private networ...
This research proposes a genetic algorithm that provides a solution to the problem of deficient distribution of drinking water via the current hydraulic network in the neighborhood “Fraccionamiento Real Montecasino” (FRM), in Huitzilac, Morelos, Mexico. The proposed solution is the addition of new elements to the FRM network. The new elements inclu...
En este artículo se describe una Metodología Ágil de Desarrollo de Software Incremental e Iterativa para la migración de Sistemas Heredados (MADIISH) que permitirá organizar el proceso de migración por fases desde un análisis modular del sistema heredado a migrar, el establecimiento de procesos de negocio e implementación de modelos de datos, así c...
In this chapter, the application of a differential evolution-based approach to induce oblique decision trees (DTs) is described. This type of decision trees uses a linear combination of attributes to build oblique hyperplanes dividing the instance space. Oblique decision trees are more compact and accurate than the traditional univariate decision t...
In this paper, a differential-evolution-based approach implementing a global search strategy to find a near-optimal axis-parallel decision tree is introduced. In this approach, the internal nodes of a decision tree are encoded in a real-valued chromosome, and a population of them evolves using the training accuracy of each one as its fitness value....
Los Sistemas Tutores Inteligentes son sistemas informáticos que se utilizan para facilitar el proceso de enseñanza, ya que se adaptan al conocimiento de la materia del aprendiz y minimizan las intervenciones de instructores humanos. El Pensamiento Computacional (PC) es un proceso de pensamiento que ayuda a las personas a resolver problemas, diseñar...
This paper describes the application of a Differential Evolution based approach for inducing oblique decision trees in a recursive partitioning strategy. Considering that: (1) the task of finding an optimal hyperplane with real-valued coefficients is a complex optimization problem in a continuous space, and (2) metaheuristics have been successfully...
This paper describes the application of a Differential Evolution based approach for inducing oblique decision trees in a global search strategy. By using both the number of attributes and the number of class labels in a dataset, this approach determines the size of the real-valued vector utilized for encoding the set of hyperplanes used as test con...
![Figure 1: Flowchart of VNS method proposed in [17].](profile/Rafael-Rivera-Lopez/publication/311680595/figure/fig1/AS:616358748360724@1523962785479/Flowchart-of-VNS-method-proposed-in-17_Q320.jpg)
This paper presents a parallel Variable Neighborhood Search (pVNS) algorithm for solving instances of the Traveling Salesman Problem (TSP). pVSN uses two parallelization levels in order to reach near-optimal solutions for TSP instances. This parallel approach is evaluated by means of an experimental multi-clusters of computers in which the nodes in...
This paper describes the implementation of a cooperative genetic algorithm for computing fingers trajectories of a configurable robotic hand in order to grasping 2D objects. From a common goal, a set of coordinated movements are established, in order to achieve the goal. The characteristics of the grasped object, which involves both the determinati...
El comercio electrónico es un campo en constante evolución que involucra un con-junto complejo de redes, bases de datos, tecnologías de información y procesos. Con la presencia de internet, las empresas requieren aplicaciones que brinden se-guridad, administración confiable, integración, automatización y estandarización de procesos e información, a...
This article shows the results obtained from the parallelization of the H.264/AVC encoder
for HD video. This parallelization produces a real-time encoding using an input resolution of
640x400 pixels for the production of three output resolutions (640x400, 720x480 and 1280x720
pixels). Our approach reduces the storage space needed for the encoding,...
Around the world there have recently been new and more powerful computing platforms created that can be used to work with computer science problems. Some of these problems that are dealt with are real problems of the industry; most are classified by complexity theory as hard problems. One such problem is the vehicle routing problem with time window...
En este artículo se muestran los resultados obtenidos de la paraleli-zación por datos del codificador H.264/AVC versión 16.0 para video de alta de-finición. Con esta paralelización se logra codificación en tiempo real redimen-sionando una resolución de entrada de 640x400 pixeles en tres resoluciones de salida (640x400, 720x480 y 1280x720 pixeles),...
En este artículo se describen los elementos que se utilizaron para la implementación de un grupo de clusters de computadoras que se integraron para formar una grid de cómputo de alto desempeño entre el Instituto Tecnológico de Veracruz (ITVer), la Universidad Autónoma del Estado de Morelos (UAEM) y la Universidad Politécnica del Estado de Morelos (...
Creating a common way of evaluating in energy efficiency among university students is one of the main aims of the European USE EFFICIENCY project. During this project university buildings have been classified with the national tools currently in force in each country that is participating in the project. The official tool for energy certification i...
This paper shows a comparison of two parallel algorithms for video compression that use predictive load balancing. One algorithm uses an exhaustive estimation of movements and the other one has an adaptive scheme. These algorithms are based on the H.264 standard of video compression and they are constructed using a Group of Pictures (GOP) level of...
In this work is defined a scheme of two stages for sending population segments of one Parallel Genetic Algorithm (PGA) to the nodes of an experimental grid called “Tarántula miniGrid”. The technique used to link the clusters and to configure the Tarántula mini Grid is described and the effects of latency in the communications between these clusters...
This paper addresses the Job Shop Scheduling Problem (JSSP). Basic constraints are established and it is modeled by a disjunctive graph. The model was mapped to Unrelated Parallel Machines Problem through a bipartite graph. An analysis of constraints is made in both problems to perform a relaxation of the manufacturing problem. Conducting the relax...
Este artículo muestra una descripción de dos algoritmos paralelos para la codificación de video con balanceo predictivo de carga: Uno basado en la estimación de movimiento exhaustivo y el otro adaptivo. Ambos se basan en el estándar H264 que incluye una paralelización a nivel de GOPs, haciendo una distribución de los mismos en un cluster por medio...
Este artículo presenta una propuesta para el modelado de un grupo de agentes de software que se utilizan en la determinación de la resolución del video transmitido por un sistema de videoconferencia en tiempo real sobre Internet 2. La transmisión de video se ajusta a las condiciones de tráfico de la red, permitiendo al sistema reproducir el vídeo e...
This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment. The algorithm executes local
searches using simulated annealing within a Genetic Algorithm to solve the job shop scheduling problem. Experimental results
of the algorithm obtained in the “Tarantula MiniGrid” are shown. Tarantula was implemented by linking t...
![Figure. 2. Simulated Annealing with Restart Procedure, taken from [9]](profile/Rafael-Rivera-Lopez/publication/322354282/figure/fig1/AS:581071029719040@1515549537203/Simulated-Annealing-with-Restart-Procedure-taken-from-9_Q320.jpg)
This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment. The algorithm executes local searches using Simulated Annealing within a Genetic Algorithm to solve the Job Shop Scheduling Problem. Experimental results of the algorithm obtained in the "Tarantula MiniGrid" are shown. Tarantula was implemented by linking t...
En el presente artículo se describe la arquitectura modular requerida para la construcción de una herramienta de software que aplica la metodología de seis pasos para la enseñanza de los fundamentos de la programación orientada a objetos (POO) en una institución de educación superior (IES). Esta herramienta
es un entorno de desarrollo integrado (ID...
This paper presents one proposal for teaching the foundations of object oriented programming using the Unified Modeling Language (UML) as one modeling language and Java as one object oriented programming language. Unlike other approaches where only two types of UML diagrams are used with the intention of transferring them to a codification (class d...
This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment. The algorithm executes local searches using simulated annealing within a Genetic Algorithm to solve the job shop scheduling problem. Experimental results of the algorithm obtained in the "Tarantula MiniGrid" are shown. Tarantula was implemented by linking t...
This paper presents the application of a local search algorithm for a logical representation of the Job Shop Scheduling Problem
(JSSP). This logical representation represents the JSSP transformed as a satisfiability problem (SAT). The proposed algorithm
uses a local search in a wide neighborhood. This algorithm, called Walk Wide Search - SAT, is a...
Se describe la aplicación de la metodología GAIA y su implementación usando RUP para modelar un sistema inteligente de mesa de ayuda vía web
In this paper a new rule applicable to the process of resolution of satisfiability (SAT) problems is presented. This approach, called the n-literals rule (nLR), is an extension of the one-literal rule (1LR) proposed by Davis, Logemann and Loveland that eliminates a set of literals in each step of one iterative resolution process of a SAT problem. T...
In this paper a new method for linear problems resolution is presented. This method named Simplex Cosine Method (SCM) is based on the analysis of the angles between the gradient of the objective function and the gradient of each constraint; these angles are found by the application of the simple cosine function. As the traditional Simplex Method (S...
Although the Simplex Method (SM) developed for Dantzig is efficient for solving many linear programming problems (LPs), there are constructions of hard linear programs as the Klee-Minty cubes and another deformed products, where this method has an exponential behavior. This work presents the integration of
genetic algorithms (GA) and SM to fastly r...
This paper introduces a new procedure named Simplex Simulated Annealing Method (SSAM) for solving hard linear problems: First, Simulated Annealing is applied and a solution near the optimum is reached with a fast convergence rate, then Simplex method is used for finding the optimum in few iterations. Since all deterministic pivot rules used in Simp...
Questions
Questions (6)
Many papers have been published in recent years, where authors propose a machine-learning method. When they explain their experimental study, they commonly describe the datasets used to carry out their comparisons. Usually, these datasets are from the UCI repository, such as sonar, glass, and ionosphere.
I have noticed that some of these datasets' names use an EW suffix (ionosphere EW, Breast EW, Spect EW), but other datasets do not use them.
I don't understand the difference between the ionosphere dataset and the ionosphere EW dataset, since this suffix is not used in the UCI repository.
Does EW indicate some preprocessing tasks over the dataset? Or is it a mistake that, having appeared in one paper, have been reproduced by others?
Since currently the focus on intelligent agents to solve tasks specific to AI is well studied, how important is to study the foundations of the Expert Systems in an Artificial Intelligence undergraduate course? In this course the classic search techniques are analyzed, the most common schemes of knowledge representation and several approaches such as the use of artificial neural networks for various problems are also explained.
How do you consider the use of JavaFX as a development platform in a Computer Graphics course?
I have read about several types of crossover operators to preserve the feasibility of a candidate route to solve TSP instances, but I not have clear would be the most effective to improve the convergence of the genetic algorithm.
