17 results on '"Fajardo-Delgado, Daniel"'
Search Results
2. Agent coalitions for load balancing in cloud data centers
- Author
-
Gutierrez-Garcia, J. Octavio, Trejo-Sánchez, Joel Antonio, and Fajardo-Delgado, Daniel
- Published
- 2023
- Full Text
- View/download PDF
3. Natural language processing applied to tourism research: A systematic review and future research directions
- Author
-
Álvarez-Carmona, Miguel Á., Aranda, Ramón, Rodríguez-Gonzalez, Ansel Y., Fajardo-Delgado, Daniel, Sánchez, María Guadalupe, Pérez-Espinosa, Humberto, Martínez-Miranda, Juan, Guerrero-Rodríguez, Rafael, Bustio-Martínez, Lázaro, and Díaz-Pacheco, Ángel
- Published
- 2022
- Full Text
- View/download PDF
4. Electrical Characterization of the Clamping Behavior on CMOS Quasi-Floating-Gate Circuits.
- Author
-
Molinar-Solis, Jesus E., Sanchez-Arias, Daniel, Fajardo-Delgado, Daniel, Ocampo-Hidalgo, Juan J., and Padilla-Cantoya, Ivan
- Subjects
CIRCUIT complexity ,CLAMPING circuits ,ANALOG integrated circuits - Abstract
In this paper, the clamping effect introduced by several diode-based configurations used for the implementation of the high-value resistors in quasi-floating-gate circuits is analyzed and characterized. In contrast to previous approaches where a parasitic diode is treated as a simple high-value resistor reducing the circuit complexity, in this case the analysis considers the diode behavior which leads to a clamping circuit. This clamping circuit introduces an unwanted amplitude-dependent offset voltage, which affects the performance moving the quiescent point at the quasi-floating-gate transistors. A new anti-parallel diode configuration for quasi-floating-gate applications is proposed in this work, which eliminates this unwanted offset voltage. The proposed design is validated using simulations and experimental data in a CMOS 0.35- μ m technology. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. A Genetic Algorithm for the Maximum 2–Packing Set Problem
- Author
-
Trejo-Sánchez Joel Antonio, Fajardo-Delgado Daniel, and Gutierrez-Garcia J. Octavio
- Subjects
maximum 2-packing set ,genetic algorithms ,graph algorithms ,Mathematics ,QA1-939 ,Electronic computers. Computer science ,QA75.5-76.95 - Abstract
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem. We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.
- Published
- 2020
- Full Text
- View/download PDF
6. Genetic Programming to Remove Impulse Noise in Color Images.
- Author
-
Fajardo-Delgado, Daniel, Rodríguez-González, Ansel Y., Sandoval-Pérez, Sergio, Molinar-Solís, Jesús Ezequiel, and Sánchez-Cervantes, María Guadalupe
- Subjects
DEEP learning ,BURST noise ,GENETIC programming ,IMAGE denoising ,ADAPTIVE filters ,NOISE ,DIGITAL image processing - Abstract
This paper presents a new filter to remove impulse noise in digital color images. The filter is adaptive in the sense that it uses a detection stage to only correct noisy pixels. Detecting noisy pixels is performed by a binary classification model generated via genetic programming, a paradigm of evolutionary computing based on natural biological selection. The classification model training considers three impulse noise models in color images: salt and pepper, uniform, and correlated. This is the first filter generated by genetic programming exploiting the correlation among the color image channels. The correction stage consists of a vector median filter version that modifies color channel values if some are noisy. An experimental study was performed to compare the proposed filter with others in the state-of-the-art related to color image denoising. Their performance was measured objectively through the image quality metrics PSNR, MAE, SSIM, and FSIM. Experimental findings reveal substantial variability among filters based on noise model and image characteristics. The findings also indicate that, on average, the proposed filter consistently exhibited top-tier performance values for the three impulse noise models, surpassed only by a filter employing a deep learning-based approach. Unlike deep learning filters, which are black boxes with internal workings invisible to the user, the proposed filter has a high interpretability with a performance close to an equilibrium point for all images and noise models used in the experiment. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
7. A cascade evolutionary algorithm for the bodyguard allocation problem
- Author
-
Zatarain-Aceves, Héctor, Fernández-Zepeda, José Alberto, Brizuela, Carlos A., and Fajardo-Delgado, Daniel
- Published
- 2015
- Full Text
- View/download PDF
8. Resumen de la tarea Rest-Mex en IberLEF 2021: Sistemas de recomendación para textos turísticos mexicanos
- Author
-
Álvarez-Carmona, Miguel Á., Aranda, Ramón, Arce-Cardenas, Samuel, Fajardo-Delgado, Daniel, Guerrero-Rodríguez, Rafael, López-Monroy, A. Pastor, Martínez-Miranda, Juan, Pérez-Espinosa, Humberto, and Rodríguez-González, Ansel Y.
- Subjects
Mexican Tourist Text ,Análisis de sentimientos ,Lenguajes y Sistemas Informáticos ,Sentiment Analysis ,Recommendation System ,Rest-Mex 2021 ,Sistemas de recomendación ,Textos Turísticos Mexicanos - Abstract
This paper presents the framework and results from the Rest-Mex track at IberLEF 2021. This track considered two tasks: Recommendation System and Sentiment Analysis, using texts from Mexican touristic places. The Recommendation System task consists in predicting the degree of satisfaction that a tourist may have when recommending a destination of Nayarit, Mexico, based on places visited by the tourists and their opinions. On the other hand, the Sentiment Analysis task predicts the polarity of an opinion issued by a tourist who traveled to the most representative places in Guanajuato, Mexico. For both tasks, we have built new corpora considering Spanish opinions from the TripAdvisor website. This paper compares and discusses the results of the participants for both tasks. Este artículo presenta los resultados de la tarea del Rest-Mex en IberLEF 2021. Este evento consideró dos sub tareas, Sistema de Recomendación y Análisis de Sentimientos, ambas utilizando textos turísticos de lugares con interés turístico en México. La tarea del Sistema de Recomendación consiste en predecir el grado de satisfacción que tendrá un turista al recomendar un destino de Nayarit, México, a partir del historial de los lugares visitados por el turista y las opiniones que se le dan a cada uno de ellos. Por otro lado, la tarea de Análisis de Sentimiento consiste en predecir la polaridad de una opinión emitida por un turista que viajó a los lugares más representativos de Guanajuato, México. Para ambas tareas, se han construido dos nuevas colecciones utilizando las opiniones en español del sitio web TripAdvisor. Este artículo compara y analiza los resultados de los participantes para ambas tareas.
- Published
- 2021
9. Overview of Rest-Mex at IberLEF 2022: Recommendation System, Sentiment Analysis and Covid Semaphore Prediction for Mexican Tourist Texts.
- Author
-
Álvarez-Carmona, Miguel Á., Díaz-Pacheco, Ángel, Aranda, Ramón, Rodríguez-González, Ansel Y., Fajardo-Delgado, Daniel, Guerrero-Rodríguez, Rafael, and Bustio-Martínez, Lázaro
- Subjects
RECOMMENDER systems ,SENTIMENT analysis ,COVID-19 ,TASK analysis ,SATISFACTION - Abstract
Copyright of Procesamiento del Lenguaje Natural is the property of Sociedad Espanola para el Procesamiento del Lenguaje Natural and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2022
- Full Text
- View/download PDF
10. Stable Matching of Users in a Ridesharing Model.
- Author
-
Fajardo-Delgado, Daniel, Hernández-Bernal, Carlos, Sánchez-Cervantes, María Guadalupe, Trejo-Sánchez, Joel Antonio, Espinosa-Curiel, Ismael Edrein, and Molinar-Solis, Jesús Ezequiel
- Subjects
CHOICE of transportation ,RIDESHARING ,SUSTAINABLE transportation - Abstract
A ridesharing system is a transport mode where two or more users share the same vehicle and divide the trip's expenses based on similar routes and itineraries. Popular ridesharing systems, such as Uber, Flinc, and Lyft, define a matching among users based only on the coincidence of routes. However, these systems do not guarantee a stable matching (i.e., a matching in which no user prefers another different from the assigned one). In this work, a new ridesharing system model is proposed, including three types of trips: identical, inclusive, and partial. This model is used to introduce a new algorithm to address the stable matching problem for ridesharing systems. Finally, a set of experimental simulations of the proposed algorithm is conducted. Experimental results show that the proposed algorithm always produces a stable matching. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. Overview of Rest-Mex at IberLEF 2021: Recommendation System for Text Mexican Tourism.
- Author
-
Álvarez-Carmona, Miguel Á., Aranda, Ramón, Arce-Cardenas, Samuel, Fajardo-Delgado, Daniel, Guerrero-Rodríguez, Rafael, López-Monroy, A. Pastor, Martínez-Miranda, Juan, Pérez-Espinosa, Humberto, and Rodríguez-González, Ansel Y.
- Subjects
RECOMMENDER systems ,SENTIMENT analysis ,TASK analysis ,TOURISM - Abstract
Copyright of Procesamiento del Lenguaje Natural is the property of Sociedad Espanola para el Procesamiento del Lenguaje Natural and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2021
- Full Text
- View/download PDF
12. Analysis of the changes in communication and social interactions during the transformation of a traditional team into an agile team.
- Author
-
Espinosa‐Curiel, Ismael Edrein, Rodríguez‐Jacobo, Josefina, Vázquez‐Alfaro, Erika, Fernández‐Zepeda, José Alberto, and Fajardo‐Delgado, Daniel
- Subjects
AGILE software development ,COMMUNICATION ,SOCIAL interaction ,SOCIAL network analysis ,COMPUTER software developers ,SOFTWARE engineering - Abstract
Abstract: Traditional software teams that implement agile methodologies frequently experience difficulty working efficiently as agile teams. While agile methodologies support and promote social activities and behaviors, the understanding of the social phenomena and challenges that arise during the transformation of traditional teams into agile teams is limited. We conducted an extensive 10‐month case study in a software enterprise to analyze the changes in the communication and social interactions of employees during the transformation process, and to delineate the social challenges that arise during this process. Using social interaction registers, we collected data on the communication and social interactions of employees, first when they worked as a traditional team and then as an agile team. Then, we processed the data using social network analysis methods to identify the differences between these 2 types of teams and to create graphs of communication and social interaction networks. We identified that the transformation process influences formal, informal, oral, and written communication and increases conjunctive and disjunctive social interactions. Further, from the results of interviews conducted with all the enterprise members, we identified 5 social challenges to transforming a traditional team into an agile one. The results of this research suggest that the transformation process requires broad changes in the relationships and interactions among employees. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
13. A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem.
- Author
-
Fernández-Zepeda, José Alberto, Brubeck-Salcedo, Daniel, Fajardo-Delgado, Daniel, and Zatarain-Aceves, Héctor
- Subjects
ASSIGNMENT problems (Programming) ,SOCIAL services ,SPANNING trees ,COMPUTER algorithms ,NASH equilibrium - Abstract
We address the bodyguard allocation problem (BAP), an optimization problem that illustrates the conflict of interest between two classes of processes with contradictory preferences within a distributed system. While a class of processes prefers to minimize its distance to a particular process called the root, the other class prefers to maximize it; at the same time, all the processes seek to build a communication spanning tree with the maximum social welfare. The two state-of-the-art algorithms for this problem always guarantee the generation of a spanning tree that satisfies a condition of Nash equilibrium in the system; however, such a tree does not necessarily produce the maximum social welfare. In this paper, we propose a two-player coalition cooperative scheme for BAP, which allows some processes to perturb or break a Nash equilibrium to find another one with a better social welfare. By using this cooperative scheme, we propose a new algorithm called FFC-BAP
S for BAP. We present both theoretical and empirical analyses which show that this algorithm produces better quality approximate solutions than former algorithms for BAP. [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
14. A hybrid genetic algorithm for color image denoising.
- Author
-
Fajardo-Delgado, Daniel, Sanchez, Maria Guadalupe, Molinar-Solis, Jesus Ezequiel, Fernandez-Zepeda, Jose Alberto, Vidal, Vicente, and Verdiu, Gumersindo
- Published
- 2016
- Full Text
- View/download PDF
15. The Bodyguard Allocation Problem.
- Author
-
Fajardo-Delgado, Daniel, Fernandez-Zepeda, Jose Alberto, and Bourgeois, Anu G.
- Subjects
- *
GAME theory , *APPROXIMATION algorithms , *APPLICATION software , *COMPUTER simulation , *COMBINATORIAL optimization , *RESOURCE management - Abstract
In this paper, we introduce the Bodyguard Allocation Problem (BAP) game, that illustrates the behavior of processes with contradictory individual goals in distributed systems. In particular, the game deals with the conflict of interest between two classes of processes that maximize/minimize their distance to a special process called the root. A solution of the BAP game represents a rooted spanning tree in which there exists a condition of equilibrium with maximum social welfare. We analyze the inefficiency of equilibria of the game based on both a completely cooperative and noncooperative approach. Additionally, we design two algorithms, CBAP and DBAP, that provide approximated solutions for the BAP game. We prove that both algorithms always terminate in a configuration with equilibrium and we analyze their running time based on the approach of cooperation used. We perform experimental simulations to compare the overall quality of equilibria obtained by the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
16. RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES.
- Author
-
FAJARDO-DELGADO, DANIEL, FERNÁNDEZ-ZEPEDA, JOSÉ ALBERTO, BOURGEOIS, ANU G., and Bordim, Jacir L.
- Subjects
- *
SELF-stabilization (Computer science) , *COMPUTER performance , *PARAMETER estimation , *BANDWIDTHS , *PERFORMANCE of distributed shared memory , *DISTRIBUTED algorithms , *QUALITY of service - Abstract
The performance of processors in a distributed system can be measured by parameters such as bandwidth, storage capacity, work capability, reliability, power limitations, years of usage, among others. Each processor defines its preference based on these parameters. The preference represents an indicator of the quality of service that a processor can provide. An algorithm that follows a preference-based approach uses the preference of the processors to make decisions. In this paper we introduce a randomized self-stabilizing leader election algorithm for preference-based anonymous trees. Our algorithm assures that the processor with the highest preference in the system is always selected as the leader; moreover, it is able to solve symmetric configurations where each preference is the same. We prove that our algorithm has an optimal average time complexity and we also performed simulations to illustrate the average performance of the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
17. EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL.
- Author
-
FERNÁNDEZ-ZEPEDA, JOSÉ ALBERTO, FAJARDO-DELGADO, DANIEL, CÁRDENAS-HARO, JOSÉ ANTONIO, BOURGEOIS, ANU G., and Nakano, Koji
- Subjects
- *
ACYCLIC model , *HOMOLOGICAL algebra , *ALGEBRAIC topology , *MATHEMATICS , *SCIENCE , *MATHEMATICAL models - Abstract
In this paper we present a simulation of an acyclic n×n DR-Mesh on an n×n LR-Mesh. The simulation is efficient in regards to size since both models use the same number of processors. The worst execution time for this simulation is O(n2) time, but we demonstrate that its average execution time is O(logn). The fastest existing simulation takes O(logn) time, but it uses an extremely large number of processors. On the other hand, the most efficient simulation in terms of size takes O(log2n) time with O(n4/log2n) processors. Both of the existing simulations are for the unrestricted DR-Mesh. This paper provides an important step towards efficiently simulating the unrestricted DR-Mesh on weaker models such as the R-Mesh and the LR-Mesh. [ABSTRACT FROM AUTHOR]
- Published
- 2005
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.