Examinando por Autor "Martín-Santamaría, Raúl"

Mostrando 1 - 9 de 9

A Scatter Search approach for the Parallel Row Ordering Problem
(Springer Nature, 2023-02-23) Martín-Santamaría, Raúl; Colmenar Verdugo, Jose Manuel; Duarte Muñoz, Abraham
In this work, we present a new approach for the Parallel Row Ordering Problem (PROP), based on the Scatter Search metaheuristic. The PROP focuses on minimizing the total weighted sum of all distances between each pair of facility centers in a linear layout. The proposed method is able to obtain all known optimal values in a fraction of the time required by the previous exact methods for the set of smaller instances, and it outperforms the current state of the art metaheuristic for the set of larger instances, spending a comparable computing time.
Changeover minimization in the production of metal parts for car seats
(Elsevier, 2024-10-16) Colmenar, J. Manuel; Laguna, Manuel; Martín-Santamaría, Raúl
We tackle a capacitated lot-sizing and scheduling problem (CLSP) with the main objective of minimizing changeover time in the production of metal parts for car seats. Changeovers occur when a machine (or production line) is reconfigured to produce a different product or part, leading to production downtime and loss of efficiency. In this study, we first provide a mixed-integer programming (MIP) formulation of the problem. We test the limits of solving the problem with commercial mathematical programming software. We also propose two approaches to tackle instances found in practice for which the mathematical programming model is not a viable solution method. Both approaches are based on partitioning the entire production of a part into production runs (or work slots). In the first approach, the work slots are assigned to machines and sequenced by a metaheuristic that follows the search principles of the GRASP (greedy randomized adaptive procedure) and VNS (variable neighborhood search) methodologies. In the second approach, we develop a Hexaly Optimizer (formerly known as LocalSolver) model to assign and sequence work slots. The study provides insights into how to minimize changeovers and improve production efficiency in metal parts manufacturing for car seats. The findings of this study have practical implications for the auto-part manufacturing industry, where efficient and cost-effective production is critical to meet the demands of the market
Diapositivas de la asignatura Técnicas de Hacking
(2024) Pérez-Peló, Sergio; Martín-Santamaría, Raúl
Diapositivas de la asignatura Técnicas de Hacking, del Grado en Ingeniería en Ciberseguridad de la Universidad Rey Juan Carlos. El temario es el siguiente: Bloque I: Técnicas de recogida de información Tema 1: Introducción Seguridad ofensiva: conceptos básicos. Anatomía de un ataque y kill chain. TTPs, estándares y clasificaciones. Hacking ético. Tema 2: Footprinting y OSINT Hacking con buscadores. Metadatos. Otras fuentes abiertas de inteligencia. Tema 3: Fingerprinting Reconocimiento y enumeración. Análisis de tráfico. Escaneo de puertos y de vulnerabilidades. Fuzzing. Anonimato. Tema 4: Ingeniería Social Técnicas que atacan el factor humano: no invasivas e invasivas. Phising y diseño de campañas. Hacking en el lado del cliente. Bloque II: Hacking de sistemas Tema 5: Técnicas básicas de explotación en Windows Particularidades de los sistemas operativos de Microsoft (registro, WMI, APIs, PowerShell, etc.). Autenticación, autorización y escalada de privilegios en Windows. Tema 6: Técnicas básicas de explotación en Linux Particularidades de los sistemas operativos de tipo Linux. Escalada de privilegios, ataques a contraseñas. Bloque III: Hacking de aplicaciones tradicionales y web Tema 7: Ingeniería inversa y desbordamientos Ingeniería inversa y análisis de código en Windows y en Linux. Funcionamiento de la pila. Buffer overflow. Otros desbordamientos. Tema 8: Inyecciones y forgeries Inyección de comandos. Inyección SQL. Otras inyecciones. XSS y XSRF. Bloque IV: Hacking de redes y comunicaciones Tema 9: Envenenamientos, MitM, suplantaciones y secuestros. ARP poisoning y Man in the Middle. Spoofing a diferentes niveles. Secuestros de sesión (UDP y TCP hijacking). Tema 10: Denegación de servicio Denegaciones de servicio volumétricas. Ataques en la capa de infraestructura: inundaciones y reflejos. Ataques en la capa de aplicación.
Ejercicios y preguntas de la asignatura Técnicas de Hacking
(2024) Pérez-Peló, Sergio; Martín-Santamaría, Raúl
Ejercicios y preguntas de la asignatura Técnicas de Hacking, para cada uno de los temas de la asignatura.
Guía de estudio de la asignatura Técnicas de Hacking
(2024) Pérez-Peló, Sergio; Martín-Santamaría, Raúl
Guía de estudio de la asignatura Técnicas de Hacking del Grado en Ingeniería de la Ciberseguridad
On the automatic generation of metaheuristic algorithms for combinatorial optimization problems
(Elsevier, 2024) Martín-Santamaría, Raúl; López-Ibáñez, Manuel; Stützle, Thomas; Colmenar, J. Manuel
Metaheuristic algorithms have become one of the preferred approaches for solving optimization problems. Finding the best metaheuristic for a given problem is often difficult due to the large number of available approaches and possible algorithmic designs. Moreover, high-performing metaheuristics often combine general-purpose and problem-specific algorithmic components. We propose here an approach for automatically designing metaheuristics using a flexible framework of algorithmic components, from which algorithms are instantiated and evaluated by an automatic configuration method. The rules for composing algorithmic components are defined implicitly by the properties of each algorithmic component, in contrast to previous proposals, which require a handwritten algorithmic template or grammar. As a result, extending our framework with additional components, even problem-specific or user-defined ones, automatically updates the design space. Furthermore, since the generated algorithms are made up of components, they can be easily interpreted. We provide an implementation of our proposal and demonstrate its benefits by outperforming previous research in three distinct problems from completely different families: a facility layout problem, a vehicle routing problem and a clustering problem.
Prácticas de la asignatura Técnicas de Hacking
(2024) Pérez-Peló, Sergio; Martín-Santamaría, Raúl
Prácticas de la asignatura de Técnicas de Hacking del Grado en Ingeniería de la Ciberseguridad
Software de la asignatura Técnicas de Hacking
(2024) Pérez-Peló, Sergio; Martín-Santamaría, Raúl
Software que hemos desarrollado para ayudar en la evaluación de la asignatura, disponible de forma pública en https://github.com/rmartinsanta/themis
WebGE: An Open-Source Tool for Symbolic Regression Using Grammatical Evolution
(Springer Nature, 2022-04-15) Manuel Colmenar, Jose Manuel; Martín-Santamaría, Raúl; Hidalgo Pérez, José Ignacio
Many frameworks and libraries are available for researchers working on optimization. However, the majority of them require programming knowledge, lack of a friendly user interface and cannot be run on different operating systems. WebGE is a new optimization tool which provides a web-based graphical user interface allowing any researcher to use Grammatical Evolution and Differential Evolution on symbolic regression problems. In addition, the fact that it can be deployed on any server as a web service also incorporating user authentication, makes it a versatile and portable tool that can be shared by multiple researchers. Finally, the modular software architecture allows to easily extend WebGE to other algorithms and types of problems.