Sosa-Gómez, Guillermo
Main Affiliation
Preferred name
Sosa-Gómez, Guillermo
Official Name
Sosa Gómez, Guillermo
ORCID
0000-0001-7793-896X 
Researcher ID
ABA-2857-2020
Scopus Author ID
57202400202
46 results
Now showing 1 - 10 of 46
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Study of Parameters in the Genetic Algorithm for the Attack on Block Ciphers(2021) ;Osmani Tito-Corrioso ;Miguel Angel Borges-Trenard ;Mijail Borges-Quintana; <jats:p>In recent years, the use of Genetic Algorithms (GAs) in symmetric cryptography, in particular in the cryptanalysis of block ciphers, has increased. In this work, the study of certain parameters that intervene in GAs was carried out, such as the time it takes to execute a certain number of iterations, so that a number of generations to be carried out in an available time can be estimated. Accordingly, the size of the set of individuals that constitute admissible solutions for GAs can be chosen. On the other hand, several fitness functions were introduced, and which ones led to better results was analyzed. The experiments were performed with the block ciphers AES(t), for t∈{3,4,7}.</jats:p>Scopus© Citations 2 1 5 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, 1 20 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, The relevance of lead prioritization: a B2B lead scoring model based on machine learning(Frontiers Media SA, 2025-03-07) ;González-flores Laura ;Jessica Rubiano-Moreno<jats:p>In business-to-business (B2B) companies, marketing and sales teams face significant challenges in identifying, qualifying, and prioritizing a large number of leads. Lead prioritization is a critical task for B2B organizations because it allows them to allocate resources more effectively, focus their sales force on the most viable and valuable opportunities, optimize their time spent qualifying leads, and maximize their B2B digital marketing strategies. This article addresses the topic by presenting a case study of a B2B software company's development of a lead scoring model based on data analytics and machine learning under the consumer theory approach. The model was developed using real lead data generated between January 2020 and April 2024, extracted from the company's CRM, which were analyzed and evaluated by fifteen classification algorithms, where the results in terms of accuracy and ROC AUC showed a superior performance of the Gradient Boosting Classifier over the other classifiers. At the same time, the feature importance analysis allowed the identification of features such as “source” and “lead status,” which increased the accuracy of the conversion prediction. The developed model significantly improved the company's ability to identify high quality leads compared to the traditional methods used. This research confirms and complements existing theories related to understanding the application of consumer behavior theory and the application of machine learning in the development of B2B lead scoring models. This study also contributes to bridging the gap between marketers and data scientists in jointly understanding lead scoring as a critical activity because of its impact on overall marketing strategy performance and sales revenue performance in B2B organizations.</jats:p>16Scopus© Citations 12 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Optimization models and techniques applied to transportation problems(2024-04-01) ;Calabrese, Bernardo ;Suarez, Alejandro Rosete ;Luis Angel Suarez Gonzalez ;Perez, Ana Camila PérezHumberto Díaz-pando23 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport<jats:p>Supply-chain network design is a complex task because there are many decisions involved, and presently, global networks involve many actors and variables, for example, in the automotive, pharmaceutical, and electronics industries. This research addresses a supply-chain network design problem with four levels: suppliers, factories, warehouses, and customers. The problem considered decides on the number, locations, and capacities of factories and warehouses and the transportation between levels in the supply chain. The problem is modeled as a mixed-integer linear program. The main contribution of this work is the proposal of two matheuristic algorithms to solve the problem. Matheuristics are algorithms that combine exact methods and heuristics, attracting interest in the literature because of their fast execution and high-quality solutions. The matheuristics proposed to select the warehouses and their capacities following heuristic rules. Once the warehouses and their capacities are fixed, the algorithms solve reduced models using commercial optimization software. Medium and large instances were generated based on a procedure described in the literature. A comparison is made between the algorithms and the results obtained, solving the model with a time limit. The algorithms proposed are successful in obtaining better results for the largest instances in shorter execution times.</jats:p>Scopus© Citations 4 3 7 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Correction: Assessment of the environmental effect of carbon taxation in Chile using a bayesian difference-in-differences approach(Springer Science and Business Media LLC, 2025-12-12) ;Reinier Fernández-López ;Cristian Mardones; Jean Paul Navarrete21 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Test for Detection of Weak Graphic Passwords in Passpoint Based on the Mean Distance between Points(2021) ;Joaquín Alberto Herrera-Macías ;Carlos Miguel Legón-Pérez ;Lisset Suárez-Plasencia ;Luis Ramiro Piñeiro-Díaz<jats:p>This work demonstrates the ineffectiveness of the Ripley’s K function tests, the distance to the nearest neighbor, and the empty space function in the Graphical Authentication scenario with Passpoint for the detection of non-random graphical passwords. The results obtained show that none of these tests effectively detect non-random graphical passwords; the reason for their failure is attributed to the small sample of the spatial pattern in question, where only the five points of the graphical password are analyzed. Consequently, a test based on mean distances is proposed, whose experiments show that it detects with good efficiency non-random graphical passwords in Passpoint. The test was designed to be included in the Graphical Authentication systems with Passpoint to warn the user about a possibly weak password during the registration phase, and in this way, the security of the system is increased.</jats:p>1 10Scopus© Citations 4 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, An Heuristic Algorithm to Calculate the Minimum Amount of Anesthesia Using MRI(2020) ;Enrique González-Martín; 1 10 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance(2022) ;Eduardo Sánchez-Ansola ;Ana C. Pérez-Pérez ;Alejandro Rosete ;Isis Torres-Pérez<jats:p>Combinatorial optimization problems allow for modeling multiple situations in which proper allocation of resources is needed. For some real-world problems, the use of fuzzy elements in the models allows for incorporating certain levels of uncertainty to better approximate such real-world situations. One way to solve combinatorial optimization problems with fuzzy elements is the parametric approach, where it is necessary to define how to explore different relaxation levels using alpha-cuts. Researchers tend to select such alpha-cuts uniformly. The current investigation proposes a novel strategy for selecting alpha-cuts in the School Bus Routing Problem with fuzzy students’ maximum walking distance. This proposal bases its foundations on the number of student-bus stop pairs available according to the different levels of relaxations allowed. Results demonstrate how the proposed strategy gives attractive solutions with more diverse trade-offs, contrasted with other methods in the literature. Furthermore, it decreases the computational cost for those instances where the maximum relaxation does not provide new pairs of students-bus stops.</jats:p>1 8Scopus© Citations 3 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, On Tabu Search for Block Cyphers Cryptanalysis(MDPI AG, 2026-01-27) ;Donatien-Charon, Adrian ;Borges-Quintana, Mijail ;Borges-Trenard, Miguel A.; 16
