Search

Recopilación de resúmenes de trabajos publicados en 2022 en las revistas Journal of Technology Education & Education in Technology y Revista Iberoamericana de Tecnología en Educación & Educación en Tecnología, editadas por la Facultad de Informática (UNLP)., Facultad de Informática

Compilación de los short papers presentados en las 10mas Jornadas de Cloud Computing, Big Data & Emerging Topics (JCC-BD&ET2022), llevadas a cabo en modalidad híbrida durante junio de 2021 y organizadas por el Instituto de Investigación en Informática LIDI (III-LIDI) y la Secretaría de Posgrado de la Facultad de Informática de la UNLP, en colaboración con universidades de Argentina y del exterior., Facultad de Informática

Special issue: Novel optical networking architectures and open interfaces for 5G and future 6G networks, edited by Marco Ruffini, Shan Wey, Raul Munoz, Moises Ribeiro, Marija Furdek, Valerio Frascolla 5G network slicing allows operators to deploy virtual connectivity services tailored for specific purposes on top of the same underlying physical infrastructure. For some 5G services, the telecommunication operator needs to provide the customer with real-time information of the end-to-end Quality of Service for a particular slice. This paper focuses on the challenges behind this target, how per-layer per-segment monitoring can be performed based on common open interfaces to standard OAM protocols, and provides practical rules to plan end-to-end latency for slices. Then it reviews a few latency engineering approaches for fronthaul traffic from work carried out in this research area. This work has been partially funded by the EU H2020 project Int5Gent (grant no. 957403), as well as the NextGenerationEU project 6G-Xtreme (grant no. AEI/10.13039/501100011033), TAPIR-CM (grant no. P2018 /TCS-4496) and ACHILLES (grant no. PID2019-104207RB-I00). Funding for APC: Universidad Carlos III de Madrid (Read & Publish Agreement CRUE-CSIC 2022)

El análisis facial es una de las áreas más activas y desafiantes de la visión por computador, que tiene como objetivo extraer información relevante de las imágenes de rostros humanos. El rendimiento de los modelos desarrollados para extraer esta información depende enormemente de los conjuntos de datos utilizados para su entrenamiento. En este trabajo se estudia la influencia de los conjuntos de datos en el entrenamiento de modelos profundos para la detección de landmarks faciales. Los conjuntos de datos actualmente disponibles para el entrenamiento en la tarea de la detección de landmarks faciales está limitada en cuanto al número de imágenes disponibles y la calidad de las anotaciones y las representaciones de distintas poses, iluminaciones, identidades y expresiones faciales. Como posible solución a estos problemas los datos sintéticos ofrecen control sobre la diversidad de las representaciones en los conjuntos de datos, además de etiquetas precisas y consistentes. En este trabajo se realiza una comparación de dos modelos de detección de landmarks faciales mediante mapas de calor entrenados en un conjunto de datos sintéticos completamente artificial y en otro conjunto de datos sintético generado a partir de imágenes reales. Tras la comparación, se propone un método de adaptación de dominio para lidiar con el problema del domain gap acercando las representaciones de ambos dominios. Por último, se realiza una discusión sobre los resultados obtenidos y se proponen líneas de trabajo futuras. ABSTRACT Face analysis is one of the most active and challenging areas of computer vision, which aims to extract relevant information from images of human faces. The performance of the models developed to extract this information is highly dependent on the datasets used for their training. In this paper we study the influence of datasets on the training of deep models for facial landmark detection. The datasets currently available for training in the task of facial landmark detection are limited in terms of the number of images available and the quality of annotations and representations of different poses, illuminations, identities, and facial expressions. As a possible solution to these problems synthetic data offer control over the diversity of representations in the datasets, in addition to accurate and consistent labels. In this paper, a comparison of two models of facial landmark detection using heat maps trained on a fully artificial synthetic dataset and on another synthetic dataset generated from real images is performed. Following the comparison, a domain adaptation method is proposed to deal with the domain gap problem by bringing the representations of the two domains closer together. Finally, a discussion of the obtained results is made, and future lines of work are proposed.

En este trabajo se propone el diseño y desarrollo de una solución al problema de reconocimiento de mesas de póker y cálculo de probabilidad de victoria para dos jugadores a partir de imágenes mediante el uso de técnicas de visión computacional y simulaciones. Para ello, se introducen nuevos enfoques en la arquitectura de redes neuronales profundas y en la simulación de juegos. Al comienzo de este documento se explican los fundamentos teóricos necesarios, así como, el estado de la cuestión en la actualidad. Para comprender la totalidad del trabajo, se presenta un sistema secuencial de tres módulos que obtiene imágenes de una cámara para analizarlas. Esta imagen pasa al segundo módulo que usa técnicas de preprocesamiento para eliminar el ruido de la imagen y entregar cada carta a un modelo convolucional basado en la arquitectura VGG16 que ha sido entrenado previamente con un conjunto de datos generado y clasificado explícitamente para este trabajo. Una vez reconocidas las cartas estas se dividen en las distintas manos de los jugadores o cartas comunitarias y se realizan una simulación de Montecarlo para analizar el estado del juego, basándose de la etapa del juego en la que se encuentre. Toda esta información se muestra por pantalla al finalizar el proceso de análisis y se guarda para futuras inspecciones. En cuanto a la arquitectura, se logra obtener una precisión de entrenamiento de aproximadamente el 99% tras 10 epochs superando por un amplio margen los métodos más punteros, así como una precisión realista en el apartado de la simulación. Finalmente se realiza un análisis del trabajo realizado y las posibles vías futuras que este podría tomar. ABSTRACT In this paper is purposed the design and development of a solution to the problem of poker table recognition and victory probability calculus for two players through images by the use of computer vision techniques and simulations. For this, are introduced, new focuses on neural network architectures and game simulations. At the beginning of the document is explained the needed theoric knowledge, as well as the state of art. To fully understand the paper, is presented a sequential system composed of three modules, which obtains images through a camera to analyze them. This image is given to the second module which uses preprocessing techniques to remove the noise from the image and input the card to a convolutional model based on the VGG16 architecture. This model has been previously trained with a dataset generated and classified, especially for this project. Once recognised, the cards are divided into the different hands of the players or community cards and is done a Montecarlo simulation to analyze the state of the game, based on the stage of the game where the image is. All this information is displayed on the screen when the process is finished and is saved for future inspections. Regarding the architecture, is achieved a training accuracy of approximately 99% after 10 epochs overcoming by a wide range, leading methods, as well as a realistic accuracy over the simulation side. Finally, is done a reasoning of the job done and the possible path forward.

El presente trabajo estudia y sintetiza el estado del arte y el uso que se le da a la simulación de poblaciones y sobre ello, proponer un modelo para la simulación de población global. Para el estado del arte, un repaso de las técnicas, describiendo la esencia de su funcionamiento y ejemplos de usos reales, que permitan comprender la importancia y especialidad de cada modalidad y los posibles caminos por los que evolucionan. El modelo por su parte está basado en el cohort-component method[1], específicamente, relacionado con el utilizado por las Naciones Unidas para sus proyecciones, con la peculiaridad de agregarle en este caso la dimensión de la ruralidad en el cálculo de los parámetros y ratios que modelan el cambio. Se ha realizado una implementación del modelo y, si bien con ciertas limitaciones, se proponen unas conclusiones tanto positivas como negativas de la utilidad de esta dimensión a largo plazo. ABSTRACT This paper studies and synthesizes the state of the art and the use of population simulation, and proposes a model for global population simulation. Regarding the state of the art, it provides an overview of techniques, describing the essence of their functioning and providing examples of real-world applications. This helps to understand the importance and specialization of each method and the possible paths of their evolution. As for the model, it is based on the cohort-component method[1], specifically related to the one used by the United Nations for its projections. However, in this case, the model incorporates the dimension of rurality in the calculation of parameters and ratios that shape the change. An implementation of the model has been conducted, although with certain limitations. The paper presents both positive and negative conclusions regarding the long-term usefulness of this dimension.

Este documento aborda el uso de la inteligencia artificial aplicada a imágenes médicas para la detección de tumores cerebrales. El objetivo es investigar y aplicar el mejor modelo de CNN para detectar y clasificar diversos tumores cerebrales con mayor precisión consiguiendo la mayor probabilidad de acierto por parte del modelo. En este documento se muestra el proceso completo de obtención de datos, desarrollo de modelos y análisis de resultados. Además, se explican conceptos sobre las CNN para el entendimiento del desarrollo del sistema. La detección y clasificación de estos tumores no es trivial, y se hace complejo incluso para expertos de esta rama de la medicina. Permite la detección temprana y la ayuda en caso de intervención quirúrgica si esta fuera necesaria. Abstract: This paper addresses the use of artificial intelligence applied to medical imaging for brain tumor detection. The objective is to investigate and apply the best CNN model to detect and classify various brain tumors more accurately by achieving the highest probability of accuracy by the model. This paper shows the complete process of data collection, model development and analysis of results. In addition, concepts about CNNs are explained to understand the development of the system. The detection and classification of these tumors is not trivial and becomes complex even for experts in this branch of medicine. It allows for early detection and assistance in case of surgical intervention if necessary. The following is a brief overview of the system.

In this paper, we focus on developing automatic assessment (AA) for a topic that has some difficulties in its practical assessment: object oriented programming (OOP). For evaluating that the OOP principles have been correctly applied to a real application, we use unit testing. In this paper, we focus on prioritizing that the students understand and apply correctly complex OOP principles and that they design properly the classes (including their relationships). In addition, we focus on the Python programming language rather than the typical previous works' focus in this area. Thus, we present a real case study of a practical assignment, in which the students have to implement characters for a video game. This assignment has the particularities and advantages that it is incremental and that it applies all four OOP principles within a single assignment. We also present its solution with the UML class diagram description. Furthermore, we provide unit testing for this case study and give general advice for generalizing the unit tests to other real case scenarios. Finally, we corroborate the effectiveness of our approach with positive student evaluations

Modelling the biology behind animal behaviour has attracted great interest in recent years. Nevertheless, neuroscience and artificial intelligence face the challenge of representing and emulating animal behaviour in robots. Consequently, this paper presents a biologically inspired motivational model to control the biological functions of autonomous robots that interact with and emulate human behaviour. The model is intended to produce fully autonomous, natural, and behaviour that can adapt to both familiar and unexpected situations in human–robot interactions. The primary contribution of this paper is to present novel methods for modelling the robot’s internal state to generate deliberative and reactive behaviour, how it perceives and evaluates the stimuli from the environment, and the role of emotional responses. Our architecture emulates essential animal biological functions such as neuroendocrine responses, circadian and ultradian rhythms, motivation, and affection, to generate biologically inspired behaviour in social robots. Neuroendocrinal substances control biological functions such as sleep, wakefulness, and emotion. Deficits in these processes regulate the robot’s motivational and affective states, significantly influencing the robot’s decision-making and, therefore, its behaviour. We evaluated the model by observing the long-term behaviour of the social robot Mini while interacting with people. The experiment assessed how the robot’s behaviour varied and evolved depending on its internal variables and external situations, adapting to different conditions. The outcomes show that an autonomous robot with appropriate decision-making can cope with its internal deficits and unexpected situations, controlling its sleep–wake cycle, social behaviour, affective states, and stress, when acting in human–robot interactions. The research leading to these results has received funding from the projects: Robots Sociales para Estimulación Física, Cognitiva y Afectiva de Mayores (ROSES), RTI2018-096338-B-I00, funded by the Ministerio de Ciencia, Innovación y Universidades; Robots sociales para mitigar la soledad y el aislamiento en mayores (SOROLI), PID2021-123941OA-I00, funded by Agencia Estatal de Investigación (AEI), Spanish Ministerio de Ciencia e Innovación. This publication is part of the R&D&I project PLEC2021-007819 funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR.

The most challenging application of post-quantum cryptography (PQC) is the distribution of provably secure cryptographic keys and quantum-safe algorithms. Public-key Encryption (PKE), Key-establishment Mechanisms (KEM), and Digital Signature Algorithms (DSA) are necessary cryptographic mechanisms to use common encryption communication through insecure or untrusted networks. This paper proposes a provably quantum-resilient secure key agreement mechanism based on the most promising lattice-based cryptographic scheme and the Module Learning-with-Rounding (MLWR) problem. The main contribution of this paper is to construct a modified framework on classical computers for study and test-bed purposes.

Achieving maximum parallel performance on multi-core CPUs and many-core GPUs is a challenging task depending on multiple factors. These include, for example, the number and granularity of the computations or the use of the memories of the devices. In this paper, we assess those factors by evaluating and comparing different parallelizations of the same problem on a multiprocessor containing a CPU with 40 cores and four P100 GPUs with Pascal architecture. We use, as study case, the convolutional operation behind a non-standard finite element mesh truncation technique in the context of open region electromagnetic wave propagation problems. A total of six parallel algorithms implemented using OpenMP and CUDA have been used to carry out the comparison by leveraging the same levels of parallelism on both types of platforms. Three of the algorithms are presented for the first time in this paper, including a multi-GPU method, and two others are improved versions of algorithms previously developed by some of the authors. This paper presents a thorough experimental evaluation of the parallel algorithms on a radar cross-sectional prediction problem. Results show that performance obtained on the GPU clearly overcomes those obtained in the CPU, much more so if we use multiple GPUs to distribute both data and computations. Accelerations close to 30 have been obtained on the CPU, while with the multi-GPU version accelerations larger than 250 have been achieved. Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work has been supported by the Spanish Government PID2020-113656RB-C21, PID2019-106455GB-C21 and by the Valencian Regional Government through PROMETEO/2019/109, as well as the Regional Government of Madrid throughout the project MIMACUHSPACE-CM-UC3M.

Este documento se enfoca en la importancia de la ciberseguridad en la industria automotriz, la cual está experimentando un período de cambio y transformación debido a la introducción de nuevas tecnologías y tendencias, como los vehículos eléctricos, la conectividad, la automatización y la sostenibilidad. A medida que los vehículos se vuelven más conectados y autónomos, también aumenta su vulnerabilidad a las amenazas de ciberseguridad, por lo tanto, la ingeniería de la ciberseguridad se vuelve fundamental para garantizar la seguridad de los ocupantes del vehículo, otros usuarios de la carretera e incluso la infraestructura del transporte. El escrito comienza describiendo la importancia de la ciberseguridad en la industria automotriz y las amenazas a la seguridad en este sector. También se exploran algunas de las normativas y estándares más relevantes que ayudan a establecer pautas y buenas prácticas para garantizar la seguridad de los sistemas automotrices. Una parte fundamental del trabajo es la aplicación de la metodología TARA (Threat Assessment & Remediation Analysis). Esta metodología se utiliza para llevar a cabo un análisis exhaustivo de un producto software real para automoción: producto software de diagnóstico, conocido como Diagnostic Client Library. Mediante la aplicación de la metodología TARA, se identifican posibles amenazas y riesgos asociados al software. Este trabajo también propone medidas de mitigación para hacer este software más ciberseguro, y plantea las mitigaciones propuestas para abordar las amenazas identificadas. Se presentan soluciones específicas para diferentes tipos de vulnerabilidades y amenazas, como por ejemplo, algunas vulnerabilidades típicas: desbordamiento de memoria, denegación de servicio, o explotación de servicios remotos. Se concluye que las medidas de mitigación propuestas son efectivas para abordar las amenazas identificadas en el software de diagnóstico y que los resultados y conclusiones del estudio son relevantes para garantizar la seguridad de los sistemas automotrices y proteger a los usuarios de posibles ataques cibernéticos. ABSTRACT This paper focuses on the importance of cybersecurity in the automotive industry, which is undergoing a period of change and transformation due to the introduction of new technologies and trends, such as electric vehicles, connectivity, automation and sustainability. As vehicles become more connected and autonomous, their vulnerability to cybersecurity threats also increases, therefore, cybersecurity engineering becomes critical to ensure the safety of vehicle occupants, other road users and even transport infrastructure. The paper begins by describing the importance of cybersecurity in the automotive industry and the security threats in this sector. It also explores some of the most relevant regulations and standards that help establish guidelines and best practices to ensure the security of automotive systems. A fundamental part of the work is the application of the TARA (Threat Assessment & Remediation Analysis) methodology. This methodology is used to carry out a comprehensive analysis of a real automotive software product: a diagnostic software product, known as Diagnostic Client Library. By applying the TARA methodology, potential threats and risks associated with the software are identified. This work also proposes mitigation measures to make this software more cybersafe, and sets out the proposed mitigations to address the identified threats. Specific solutions are presented for different types of vulnerabilities and threats, such as some typical vulnerabilities: memory overflow, denial of service, or exploitation of remote services. It is concluded that the proposed mitigation measures are effective in addressing the threats identified in the diagnostic software and that the results and conclusions of the study are relevant to ensure the security of automotive systems and protect users from possible cyber attacks.

En el mundo en que vivimos, los sistemas distribuidos son cada vez más comunes debidos a sus enormes ventajas. Su uso se extiende en cualquier ámbito desde la comunicación o la medicina hasta el ámbito recreativo. Los sistemas distribuidos son sistemas compuestos por múltiples nodos que trabajan en conjunto por lograr un mismo fin. Sin embargo, para su correcto funcionamiento se han de resolver diversas problemáticas como son: actuación del sistema cuando uno o varios nodos fallan, actuación cuando se unen nuevos nodos o antiguos nodos caídos al sistema, compartir la información de cada nodo con los demás… La mayoría de estos problemas pueden ser solucionados mediante el uso de un tipo de algoritmo: los algoritmos de consenso distribuido. El consenso distribuido es un área muy compleja y poco conocida de los sistemas distribuidos informáticos. Los algoritmos de consenso distribuido existentes pese a ser simples, su comprensión no lo es tanto. Este trabajo tiene como fin principal la divulgación e inspiración. Busca divulgar información sobre la materia que abarca el consenso distribuido a un público muy amplio (personas con pocos conocimientos informáticos), desarrollando un algoritmo de consenso distribuido nuevo que inspire al lector a investigar y realizar sus propios avances en este campo tan poco conocido. Para lograr estos dos fines, el trabajo se divide en varios apartados, teóricos y prácticos. La primera parte del trabajo consiste en una breve introducción a los sistemas distribuidos, su origen, características y beneficios. Para complementar esta base, en la segunda parte del trabajo investigaremos en profundidad el consenso distribuido partiendo desde cero. En esta investigación abordaremos tres algoritmos de consenso distribuido que destacan en la materia, sintetizando sus características más relevantes y sus aportes a este campo. Los conocimientos teóricos adquiridos en las dos primeras partes del trabajo nos brindarán una base generosa de la que partir. Llegados a este punto, la mejor forma de continuar con el aprendizaje es mediante la puesta en práctica de lo aprendido, complementándolo con nuevos contenidos. En esto consistirán los apartados siguientes. En la tercera parte del trabajo, desarrollaremos un algoritmo de consenso distribuido propio que recoja las características más destacadas de los algoritmos estudiados a la vez que implementamos elementos nuevos. Este algoritmo será implementado desde cero y justificado en cada elemento. Para terminar, el trabajo concluirá con un caso práctico que muestre el fruto de nuestro estudio. En este caso práctico se planteará un caso hipotético (un controlador de un aeropuerto simplificado) que será implementado como un sistema distribuido que haga uso del algoritmo de consenso desarrollado en el trabajo. “En un mundo cada vez más complejo, la sencillez es un lujo” ABSTRACT In the world we live in, distributed systems are becoming more and more common due to their enormous advantages. Their use extends in any field from communication or medicine to recreation. Distributed systems are systems composed of multiple nodes that work together to achieve the same goal. However, for their correct operation, several problems have to be solved, such as: system performance when one or more nodes fail, performance when new nodes or old nodes join the system, sharing the information of each node with the others... Most of these problems can be solved through the use of a type of algorithm: distributed consensus algorithms. Distributed consensus is a very complex and little-known area of distributed computing systems. The existing distributed consensus algorithms, although simple, are not so simple to understand. The main purpose of this paper is to disseminate and inspire. It seeks to disseminate information about the subject matter of distributed consensus to a very wide audience (people with little computer science knowledge) by developing a novel distributed consensus algorithm that inspires the reader to investigate and make their own advances in this little-known field. To achieve these two aims, the paper is divided into several theoretical and practical sections. The first part of the paper consists of a brief introduction to distributed systems, their origin, characteristics, and benefits. To complement this base, in the second part of the paper we will investigate in depth the distributed consensus from scratch. In this research we will address three distributed consensus algorithms that stand out in the field, synthesizing their most relevant characteristics and their contributions to this field. The theoretical knowledge acquired in the first two parts of the paper will provide us with a generous base from which to start. At this point, the best way to continue learning is by putting into practice what has been learned, complementing it with new contents. This is what the following sections will consist of. In the third part of the work, we will develop our own distributed consensus algorithm that includes the most important features of the studied algorithms while implementing new elements. This algorithm will be implemented from scratch and justified for each element. Finally, the work will conclude with a case study that shows the fruit of our study. In this case study, a hypothetical case (a simplified airport controller) will be implemented as a distributed system using the consensus algorithm developed in this work. “In an increasingly complex world, simplicity is a luxury”

Precision agriculture in the realm of the Internet of Things is characterized by the collection of data from multiple sensors deployed on the farm. These data present a spatial, temporal, and semantic characterization, which further complicates the performance in the management and implementation of models and repositories. In turn, the lack of standards is reflected in insufficient interoperability between management solutions and other non-native services in the framework. In this paper, an innovative system for spatio-temporal semantic data management is proposed. It includes a data query system that allows farmers and users to solve queries daily, as well as feed decision-making, monitoring, and task automation solutions. In the proposal, a solution is provided to ensure service interoperability and is validated against two European smart farming platforms, namely AFarCloud and DEMETER. For the evaluation and validation of the proposed framework, a neural network is implemented, fed through STSDaMaS for training and validation, to provide accurate forecasts for the harvest and baling of forage legume crops for livestock feeding. As a result of the evaluation for the training and execution of neural networks, high performance on complex spatio-temporal semantic queries is exposed. The paper concludes with a distributed framework for managing complex spatio-temporal semantic data by offering service interoperability through data integration to external agricultural data models. Graphical Abstract

This paper presents a new approach for geometrically constrained path planning applied to the field of robotic grasping. The method proposed in this paper is based on the Fast Marching Square (FM $\, ^2$ ) and a path calculation approach based on an optimization evolutionary filter named Differential Evolution (DE). The geometric restrictions caused by the link lengths of the kinematic chain composed by the robot arm and hand are introduced in the path calculation phase. This phase uses both the funnel potential of the surroundings created with FM $\, ^2$ and the kinematic constraints of the robot as cost functions to be minimized by the evolutionary filter. The use of an optimization filter allows for a near-optimal solution that satisfies the kinematic restrictions, while preserving the characteristics of a path computed with FM $\, ^2$ . The proposed method is tested in a simulation using a robot composed by a mobile base with two arms.

The Quantum Key Distribution (QKD) is a well-researched secure communication method for exchanging cryptographic keys only known by the shared participants. The vulnerable problem of a secret key distribution is the negotiation and the transfer over an insecure or untrusted channel. Novel further developments of the QKD communication method are part of in-field technologies and applications in communication devices, such as satellites. However, expensive physical test setups are necessary to improve new application possibilities of cryptographic protocol involving components of quantum mechanics and quantum laws of physics. Therefore, optical simulation software can play a part in essential QKD simulating and further developing quantum-based cryptosystems. In the paper, the authors consider a feasible QKD setup based on the BB84 protocol to create a symmetric key material based on achieving a linear key rate via optical simulation software. The paper still provides two experimental architecture designs to use the QKD for a cryptosystem.

La idea para esta obra nació a raíz del encuentro de los tres autores mientras cursaban sus estudios del Máster de Dirección de Sistemas y TIC para la Salud y en Digitalización Sanitaria, cursado en el Instituto Nacional de Salud Carlos III y organizado por la SEIS. Durante las intensas conversaciones de pasillo, nos dimos cuenta de que, a pesar de las grandes diferencias en nuestras organizaciones en cuanto a tamaño, extensión y estrategias, los problemas básicos para los servicios TIC en nuestros hospitales eran los mismos. Ese descubrimiento, unido a los conocimientos adquiridos durante en la evolución del Máster, nos llevó a plantear este trabajo, con la idea de intentar plasmar, cuáles son los problemas a los que, a nuestro humilde entender, se debe enfrentar cualquier servicio TIC en una organización sanitaria, centrando especialmente nuestro análisis en los Servicios de Salud Públicos de nuestro país, los cuales, como miembros activos, mejor conocemos., {"references": ["Frederick W. (2002). Explaining Managing Morality: Complexity Theories Unfinished Agenda. Business and Society Review. 2002;107(3):283\u2013308.", "Kauffman S. (1995). At Home in the Universe The Search for the Laws of Self-Organization and Complexity. Oxford University Press.", "Erazo A. (2015) Un enfoque sist\u00e9mico para comprender y mejorar los sistemas de salud. Rev Panam Salud Publica. 2015;38(3):248\u201353. Obtenido de https://www.scielosp.org/pdf/rpsp/2015.v38n3/248-253", "Monteagudo Pe\u00f1a, J. (2021-2022). Tema 1.2. El Sector TIC para la Salud. M\u00e1ster en Direcci\u00f3n de Sistemas y TIC para la Salud.", "Camarena Mart\u00ednez, JL (2016). La organizaci\u00f3n como sistema: el modelo organizacional contempor\u00e1neo. Obtenido de http://www.scielo.org.bo/scielo.php?pid=S2415-22502016000100005&script=sci_arttext", "Savigny D, Taghreed A. (2009). Aplicaci\u00f3n del pensamiento sist\u00e9mico al fortalecimiento de los servicios de salud. Alianza para la Investigaci\u00f3n en Pol\u00edticas y Sistemas de Salud. Gibebra: OMS.", "Checkland PB. (1981) Systems thinking, system practice. Chichester: John Wiley and Sons.", "Atun R, Menabde N. (2008). Health systems and systems thinking. Health systems and the challenge of communicable diseases: experiences from Europe and Latin Amer-ica. Maidenhead: Open University Press (European Observatory on Health Systems and Policies Series); 2008:121-40.", "Blaauw D, Gilson L, Penn-Kekana L, Schneider H. (2003). Organizational relationships and the \"software\" of health sector reform. Background paper prepared for the Disease Control Priorities Project, Capacity Strengthening and Management Reform. Johannesburgo: Centre for Health Policy School of Public Health, University of the Witwatersrand.", "Cummings KM. (1980). Bringing the Models Together: An Empirical Approach to Combining Variables Used to Explain Health Actions. Journal of Behavioral Medicine.;3(2).", "Sharp LF, Priesmeyer HR. (1995). Tutorial: Chaos Theory, a primer for health care. Qual Manage Health Care.; 3(4):71\u201386.", "Glouberman S, Zimmerman B. (2002). Complicated and Complex Systems: What Would Successful Reform of Medicare Look Like? Commission on the Future of Health Care in Canada, Discussion Paper 8. Critical Public Health; 11(1):19-38.", "Segredo P\u00e9rez AM, Garc\u00eda Milian AJ, L\u00f3pez Puig P, Le\u00f3n Cabrera P, Perdomo Victoria I. (2015). Enfoque sist\u00e9mico del clima organizacional y su aplicaci\u00f3n en salud p\u00fablica. Revista Cubana de Salud P\u00fablica;41 (1): 115-129. Obtenido de https://www.scielosp.org/article/ssm/content/raw/?resource_ssm_path=/media/assets/rcsp/v41n1/spu10115.pdf", "El enfoque hol\u00edstico y su impacto en las organizaciones. Disponible en https://www.linkedin.com/pulse/el-enfoque-hol%C3%ADstico-y-su-impacto-en-las-organizaciones-/", "ISACA. (2018). Marco de referencia COBIT 2019: Introducci\u00f3n y Metodolog\u00eda.", "Rivero M. (2018). Matriz FODA herramienta para la estrategia. Universidad La Salle. Obtenido de https://www.researchgate.net/publication/324991460_Matriz_FODA_herramienta_para_la_estrategia_Dra_Magda_Rivero_mayo_2018/link/5af05c830f7e9b01d3e33c6c/download", "Diaz Olivera AP, Matamoros Hern\u00e1ndez IB. (2011). El an\u00e1lisis DAFO y los objetivos estrat\u00e9gicos. Contribuciones a la Econom\u00eda, Servicios Acad\u00e9micos Intercontinentales SL, issue 2011-03, March. Obtenido de https://ideas.repec.org/a/erv/contri/y2010i2011-0315.html", "Fundaci\u00f3n Caja Rural Burgos (2017). El an\u00e1lisis DAFO: la importancia de utilizar esta herramienta para una empresa. Obtenido de https://fundacioncajaruralburgos.es/el-analisis-dafo/", "Jos\u00e9 Facchin. (2022) \u00bfQu\u00e9 es un An\u00e1lisis PESTEL y c\u00f3mo hacerlo paso a paso?. https://josefacchin.com/analisis-pestel/", "Blanco, A. (2017). \u00bfCambio social, cambio tecnol\u00f3gico?: Resistencia, miedo, ignorancia... I+S: Revista de la Sociedad Espa\u00f1ola de Inform\u00e1tica y Salud(121), 6. Obtenido de https://seis.es/revista-n-121/", "Escobar, A. . (12 de Julio de 2021). Levantar el muro: la salud digital ante un marco legislativo insuficiente. Diario Planta Doce. Obtenido de https://www.plantadoce.com/entorno/levantar-el-muro-la-salud-digital-ante-un-marco-legislativo-insuficiente.html", "Garc\u00eda Palomo, A. (2018). Cl\u00ednicos ante las Tics: la transformaci\u00f3n digital desde la perspectiva del onc\u00f3logo m\u00e9dico. I+S: Revista de la Sociedad Espa\u00f1ola de Inform\u00e1tica y Salud(130), 69-75. Obtenido de https://www.semg.es/images/documentos/2018/monografico_TICS.pdf", "JMARK. (2018). Analysis of I.T. in the Healthcare Industry. Obtenido de https://www.jmark.com/wp-content/uploads/2019/09/JMARK-HEALTHCARE-ANALYSIS-lo.pdf", "Monteagudo Pe\u00f1a, J. (2021-2022). Tema 1.2. El Sector TIC para la Salud. M\u00e1ster en Direcci\u00f3n de Sistemas y TIC para la Salud., 8-13.", "Montero Delgado, J.A., Merino Alonso, F.J., Monte Bosquet, E., \u00c1vila de Tom\u00e1s, J.F., & Cepeda D\u00edez, J.M. (1 de 9 de 2020). Competencias digitales clave de los profesionales sanitarios. Educaci\u00f3n M\u00e9dica, 21(5), 338-344. doi:10.1016/J.EDUMED.2019.02.010", "Nadal, J. (Jun-Jul de 2007). Las TIC y la sanidad del futuro. BIT(163), 36-40. Obtenido de https://www.coit.es/sites/default/files/archivobit/pdf/36-40.pdf", "Oleaga, M. B. (2017). Osakidetza y los nuevos canales de relaci\u00f3n con el paciente. I+S: Revista de la Sociedad Espa\u00f1ola de Inform\u00e1tica y Salud(121), 15-18. Obtenido de https://seis.es/revista-n-121/", "ONU CEPAL; SEIS; CE. (2012). Manual de salud electr\u00f3nica para directivos de servicios y sistemas de salud. Santiago de Chile: CEPAL. Obtenido de https://www.cepal.org/es/publicaciones/3023-manual-salud-electronica-directivos-servicios-sistemas-salud", "P\u00e9rez de la C\u00e1mara, S. (2021-2022). Tema 4.5. Sistemas, servicios y aplicaciones orientadas a la ciudadan\u00eda. M\u00e1ster en Direcci\u00f3n de Sistemas y TIC para la Salud., 15-17.", "Ray\u00f3n, A. (2016). La Medicina 5P: Sanidad y Big Data. Obtenido de https://blogs.deusto.es/bigdata/la-medicina-5p-sanidad-y-big-data/", "Regaira Mart\u00ednez, E., & V\u00e1zquez Calatayud, M. (2020). Uso de las tecnolog\u00edas de la informaci\u00f3n y la comunicaci\u00f3n en enfermer\u00eda. Index de Enfermer\u00eda. Index de Enfermer\u00eda, 29(4). Obtenido de https://scielo.isciii.es/scielo.php?script=sci_arttext&pid=S1132-12962020000300007", "Ruano Ravi\u00f1a A, V. G. (2010). Identificaci\u00f3n, priorizaci\u00f3n y evaluaci\u00f3n de tecnolog\u00edas obsoletas. Gu\u00eda metodol\u00f3gica. Madrid : Plan de Calidad para el Sistema Nacional de Salud del Ministerio de Sanidad y Pol\u00edtica Social; Santiago de Compostela: Axencia de Avaliaci\u00f3n de Tecnolox\u00edas Sanitarias de Galicia. Obtenido de https://www.sergas.es/Docs/Avalia-t/Identificacion-obsoletas/portada.html", "Ruiz Iglesias, D. (2021-2022). Tema 3.7. Las TIC y la Continuidad Asistencial. M\u00e1ster en Direcci\u00f3n de Sistemas y TIC para la Salud, 19-23.", "SEIS. (2012-2020). \u00cdndice SEIS. Obtenido de https://seis.es/category/indices-asociacion-espanola-de-informatica-de-la-salud-seis/", "Telef\u00f3nica. (2022). An\u00e1lisis del impacto de las TIC en la sanidad. Fundaci\u00f3n Signo. Obtenido de https://www.fundacionsigno.com/bazar/5/LAS TIC EN LA SANIDAD DEL FUTURO. PARTE 2. ANALISIS DEL IMPACTO DE LAS TIC EN LA SANIDAD..pdf", "V\u00e1zquez Gonz\u00e1lez, G. (2021-2022). Tema 3.5. Entorno y habilidades del CIO sanitario. M\u00e1ster en Direcci\u00f3n de Sistemas y TIC para la Salud, 23-36.", "Mart\u00edn, J., Cort\u00e9s, J. A., Morente, M., Caboblanco, M., Garijo, J., & Rodr\u00edguez, A. (2004). Caracter\u00edsticas m\u00e9tricas del cuestionario de calidad de vida profesional (CVP-35). Gaceta Sanitaria, 18(2),129-136. https://scielo.isciii.es/scielo.php?pid=S0213-91112004000200008&script=sci_arttext&tlng=en", "Rivera-\u00c1vila, D. A., Rivera-Hermosillo, J. C., & Gonz\u00e1lez-Galindo, C. (2017). Validaci\u00f3n de los cuestionarios CVP-35 y MBI-HSS para calidad de vida profesional y burnout en residentes. Investigaci\u00f3n en educaci\u00f3n m\u00e9dica, 6(21), 25-34. https://www.sciencedirect.com/science/article/pii/S2007505716300345", "World Health Organization. (2016). Global strategy on human resources for health: workforce 2030.https://apps.who.int/iris/bitstream/handle/10665/250368/?sequence=1", "Klomp, J. y De Haan, J. (2008). \"Effects of Governance Health: a Cross-NationalAnalysisof 101 Countries\". En: KYKLOS, 61(4): 599-614. https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-6435.2008.00415.x", "Brown, T. M., Cueto, M., & Fee, E. (2006). TheWorldHealthOrganization and thetransitionfrom \"international\" to \"global\" public health. American journal of public health, 96(1), 62-72.https://ajph.aphapublications.org/doi/full/10.2105/AJPH.2004.050831", "Hufty, M. (2010). Gobernanza en salud p\u00fablica: hacia un marco anal\u00edtico. Revista de Salud p\u00fablica, 12, 39-61.https://www.scielosp.org/article/ssm/content/raw/?resource_ssm_path=/media/assets/rsap/v12s1/v12s1a04.pdf", "Kirigia, J. M., & Kirigia, D. G. (2011). The Essence Of Governance in health development. International archives of medicine, 4(1), 1-13.http://www.intarchmed.com/content/4/1/11", "Chiavenato, I. (2011). Administraci\u00f3n de recursos humanos. El capital humano de las organizaciones. Mc Graw Hill.http://repositorio.uasb.edu.bo:8080/handle/54000/1145", "Quintana, P. E. B. (2000). Impacto de las reformas del sector de la salud sobre los recursos humanos y la gesti\u00f3n laboral. Revista Panamericana de Salud P\u00fablica, 8(1-2), 43-54.https://www.scielosp.org/pdf/rpsp/v8n1-2/3003.pdf", "Irigoin, M., & Vargas, F. (2002). Competencia laboral: manual de conceptos, m\u00e9todos y aplicaciones en el sector salud. In Competencia laboral: manual de conceptos, m\u00e9todos y aplicaciones en el sector salud.https://pesquisa.bvsalud.org/portal/resource/pt/pah-226726", "Mu\u00f1oz, I., Higuita, Y., Molina, G., & G\u00f3mez, L. (2014). Caracter\u00edsticas de la gesti\u00f3n del talento humano en salud p\u00fablica. Tensiones en las decisiones en salud p\u00fablica en el sistema de salud colombiano: el bien com\u00fan en confrontaci\u00f3n con los intereses y pr\u00e1cticas particulares, 265-291.https://www.academia.edu/download/43989889/Tensiones_en_las_decisiones_en_salud_publica.pdf#page=265", "Nigenda, G., Ruiz, J. A., Gonz\u00e1lez-Robledo, L. M., Wirtz, V., Gonz\u00e1lez-Robledo, M. C., Aguilar, M. E., & Bejarano, R. (2010). Formaci\u00f3n, empleo y regulaci\u00f3n de los recursos humanos para la salud: bases para su planeaci\u00f3n estrat\u00e9gica. Informaci\u00f3n, empleo y regulaci\u00f3n de los recursos humanos para la salud: bases para su planeaci\u00f3n estrat\u00e9gica (pp. 272-272) https://pesquisa.bvsalud.org/portal/resource/pt/biblio-964751", "Mu\u00f1oz, I., Higuita, Y., Molina, G., & G\u00f3mez, L. (2014). Caracter\u00edsticas de la gesti\u00f3n del talento humano en salud p\u00fablica. Tensiones en las decisiones en salud p\u00fablica en el sistema de salud colombiano: el bien com\u00fan en confrontaci\u00f3n con los intereses y pr\u00e1cticas particulares, 265-291. https://www.academia.edu/download/43989889/Tensiones_en_las_decisiones_en_salud_publica.pdf#page=265", "Monterrubio, E. R., & Garc\u00eda-Pardo, I. P. (2018). An\u00e1lisis de la relaci\u00f3n entre los sistemas de recursos humanos de alto rendimiento y el resultado empresarial: la gesti\u00f3n de calidad total y el capital intelectual. Estudios financieros. Revista de trabajo y seguridad social: Comentarios, casos pr\u00e1cticos: recursos humanos, (418), 187-228 https://ruidera.uclm.es/xmlui/bitstream/handle/10578/9024/TESIS%20Ruiz%20Monterrubio.pdf?sequence=1&isAllowed=y", "Quintana, P. E. B. (2000). Impacto de las reformas del sector de la salud sobre los recursos humanos y la gesti\u00f3n laboral. Revista Panamericana de Salud P\u00fablica, 8(1-2), 43-54. https://www.scielosp.org/pdf/rpsp/v8n1-2/3003.pdf", "Dussault, G., & Dubois, C. A. (2003). Human resources for health policies: a critical component in health policies. Human resources for health, 1(1), 1-16.https://human-resources-health.biomedcentral.com/articles/10.1186/1478-4491-1-1", "Beaglehole, R., & Davis, P. (1992). Setting national health goals and targets in the context of a fiscal crisis: the politics of social choice in New Zealand. International Journal of Health Services, 22(3), 417-428. https://journals.sagepub.com/doi/abs/10.2190/G6H0-8JAK-J238-9LQW", "Kabene, S. M., Orchard, C., Howard, J. M., Soriano, M. A., & Leduc, R. (2006). The Importance Of human resources management in health care: a global context. Human resources for health, 4(1), 1-17.https://human-resources-health.biomedcentral.com/articles/10.1186/1478-4491-4-20", "Ministerio de Sanidad Espa\u00f1ol (2019) web de indicadores clave del Sistema Nacional de Salud. http://inclasns.msssi.es/main.html?permalink=fd5f8cfc505aeaaff99b3b04b490ee13", "Hersh, W. R., Boone, K. W., &Totten, A. M. (2018). Characteristicsofthehealthcareinformationtechnologyworkforce in the HITECH era: underestimated in size, still growing, and adapting to advanced uses. JAMIA open, 1(2), 188-194. https://academic.oup.com/jamiaopen/article/1/2/188/5056817?login=false", "SEIS (2020-2021). \u00cdndice SEIS. https://seis.es/category/indices-asociacion-espanola-de-informatica-de-la-salud-seis/", "Carnicero, J., Rojas, D., & Blanco, O. (2014). La gesti\u00f3n de la funci\u00f3n TIC en los servicios de salud: algunos errores frecuentes de los equipos de direcci\u00f3n. Manual de salud electr\u00f3nica para directivos de servicios y sistemas de salud. Volumen II: Aplicaciones de las TIC a la atenci\u00f3n primaria de salud. Santiago: CEPAL, 2014. LC/L. 3626. p. 55-78. https://repositorio.cepal.org/bitstream/handle/11362/39805/S2013311_es.pdf", "Bonilla-Fabela, I., Tavizon-Salazar, A., Morales-Escobar, M., Guajardo-Mu\u00f1oz, T., & Laines-Alamina, C. I. (2016). IoT, el internet de las cosas y la innovaci\u00f3n de sus aplicaciones. Vinculat\u00e9gica efan, 2(1), 2313-2340. http://www.track2iot.com/documentos/iot_el_internet_de_las_cosas.pdf", "Cuzme Rodr\u00edguez, F. G. (2015). El Internet de las Cosas y las Consideraciones de Seguridad (Master's thesis, Quito/PUCE/2015). http://repositorio.puce.edu.ec/handle/22000/8492", "Al\u00f3s-Moner Vila, R., Ib\u00e1\u00f1ez Rojo, R., & L\u00f3pez Calle, P. (2008). Deslocalizaci\u00f3n y externalizaci\u00f3n en el sector TIC y la p\u00e9rdida de competencias. https://eprints.ucm.es/58908/1/1DESLOCALIZACION_Y_EXTERNALIZACION_EN_EL.pdf", "Ross, J. W., & Weill, P. (2002). Six IT decisions your IT people shouldn't make. Harvard business review, 80(11), 84-95. https://www.researchgate.net/profile/Peter-Weill/publication/11043243_Six_IT_decisions_your_IT_people_shouldn't_make/links/00b49518ae03f7653a000000/Six-IT-decisions-your-IT-people-shouldnt-make.pdf", "Carnicero, J., Rojas, D., & Blanco, O. (2014). La gesti\u00f3n de la funci\u00f3n TIC en los servicios de salud: algunos errores frecuentes de los equipos de direcci\u00f3n. Manual de salud electr\u00f3nica para directivos de servicios y sistemas de salud. Volumen II: Aplicaciones de las TIC a la atenci\u00f3n primaria de salud. Santiago: CEPAL, 2014. LC/L. 3626. p. 55-78. https://repositorio.cepal.org/bitstream/handle/11362/39805/S2013311_es.pdf", "Larr\u00e1n Jorge, M., & Muriel de los Reyes, M. J. (2007). Labanca por Internet como innovaci\u00f3n tecnol\u00f3gica en el sector bancario. Investigaciones Europeas de Direcci\u00f3n y Econom\u00eda de la Empresa (IEDEE), 13(2), 145-153. ttps://www.econstor.eu/bitstream/10419/54403/1/663887798.pdf", "Adamini, M. (2022). Segmentaci\u00f3n y degradaci\u00f3n laboral detr\u00e1s del crecimiento productivo del sector de software. Un abordaje a partir del caso de los trabajadores inform\u00e1ticos de Tandil. Trabajo y sociedad, 23(38), 291-311. http://www.scielo.org.ar/scielo.php?pid=S1514-68712022000100291&script=sci_abstract&tlng=en", "Applegate, L. M., Austin, R. D., & McFarlan, F. W. (2006). Corporate information strategy and management. McGraw-Hill/Irwin Custom Publishing. https://www.academia.edu/download/37349773/Corporate_Information_Strategy_and_Management02_2.pdf", "Viedma, C. A. (2013). Gesti\u00f3n de la Sanidad P\u00fablica: unas reflexiones. Raz\u00f3n y fe, 267(1372), 147-157. https://revistas.comillas.edu/index.php/razonyfe/article/view/10103/9502", "Resinas, M., Fern\u00e1ndez, P., & Corchuelo, R. (2012). A bargaining-specific architecture for supporting automated service agreement negotiation systems. Science of Computer Programming, 77(1), 4-28. https://www.sciencedirect.com/science/article/pii/S0167642310001851del\u2013R\u00edo\u2013Ortega, A., Guti\u00e9rrez, A. M., Dur\u00e1n, A., Resinas, M., & Ruiz\u2013Cort\u00e9s, A. (2015, June). Modelling service level agreements for business process outsourcing services. In International Conference on Advanced Information Systems Engineering (pp. 485-500). Springer, Cham. https://link.springer.com/content/pdf/10.1007/978-3-319-19069-3_30.pdf", "BOE. (9 de noviembre de 2017) Ley 9/2017, de 8 de noviembre, de Contratos del Sector P\u00fablico. Obtenido de https://www.boe.es/buscar/act.php?id=BOE-A-2017-12902", "BOE. (29 de diciembre de 2021) Ley 22/2021, de 28 de diciembre. Obtenido de https://www.boe.es/buscar/doc.php?id=BOE-A-2021-21653", "Cuenca, G. M., & Oliv\u00e1n, J. A. S. (2018). Del CMBD al Big Data en salud: un sistema de informaci\u00f3n hospitalaria para el siglo XXI. Scire: representaci\u00f3n y organizaci\u00f3n del conocimiento, 77-89. http://www.ibersid.eu/ojs/index.php/scire/article/view/4506", "Wang, L., & Alexander, C. A. (2019). Big data analytics in healthcare systems. International Journal of Mathematical, Engineering and Management Sciences, 4(1), 17. https://search.proquest.com/openview/a75c13b74732a1db17d8e0a4f2dc1fe7/1?pq-origsite=gscholar&cbl=5363605", "Andreu-Perez, J., Poon, C. C., Merrifield, R. D., Wong, S. T., & Yang, G. Z. (2015). Big data for health. IEEE journal of biomedical and health informatics, 19(4), 1193-1208. https://ieeexplore.ieee.org/abstract/document/7154395", "Ta, V. D., Liu, C. M., & Nkabinde, G. W. (2016, July). Big data stream computing in healthcare real-time analytics. In 2016 IEEE international conference on cloud computing and big data analysis (ICCCBDA) (pp. 37-42). IEEE. https://ieeexplore.ieee.org/abstract/document/7529531/", "Sukumar, R., Ramachandran, N., & Ferrell, R. K. (2015). Big Data'in health care: How good is it?. International Journal of Health Care Quality Assurance, 28(6), 621-34. https://www.researchgate.net/profile/Sreenivas-Rangan-Sukumar/publication/279990724_Quality_of_Big_Data_in_health_care/links/5614806408ae983c1b4095d7/Quality-of-Big-Data-in-health-care.pdf", "Adler-Milstein J, Jha AK. Healthcare's \"big data\" challenge. Am J Manag Care. 2013 Jul;19(7):537-8. PMID: 23919417. https://blogs.ischool.berkeley.edu/i290a-hcie-f13/files/2013/09/AJMC_AdlerMilstein_07_13_537to38.pdf", "Snee, R. D., DeVeaux, R. D., & Hoerl, R. W. (2014). Follow the fundamentals. Quality Progress, 47(1), 24-28. https://www.researchgate.net/profile/Ron-Snee/publication/282943912_Follow_the_Fundamentals_-_Four_Data_Analysis_Basics_Will_Help_You_Do_Big_Data_Projects_the_Right_Way/links/564daa3608ae1ef9296abf1e/Follow-the-Fundamentals-Four-Data-Analysis-Basics-Will-Help-You-Do-Big-Data-Projects-the-Right-Way.pdf", "Taylor, F. (1970). Management cient\u00edfico. Barcelona: Oikos-Tau.", "G\u00f3mez Bahillo, C. (2001). Burocracia y administraci\u00f3n p\u00fablica. Recuperado el 14 de 4 de 2022, de http://www.5campus.com/leccion/burocracia", "Mayntz, R. (1994). Sociolog\u00eda de la Administraci\u00f3n P\u00fablica. Madrid: Alianza Universidad", "BOE. (27 de febrero de 1852). Real Decreto.

En este trabajo trataremos la teoría juegos combinatorios. En primer lugar, realizaremos una introducción acerca de qué son los juegos combinatorios y sus características (2 jugadores involucrados, información perfecta, suma cero...) Seguidamente pasaremos a centrarnos en un tipo concreto de juegos combinatorios, los juegos combinatorios imparciales, aquellos en los que ambos jugadores tienen las mismas restricciones de movimientos en sus respectivos turnos. Más adelante pasaremos a la modelización de dichos juegos, la cual se llevará a cabo mediante digrafos que representen las posiciones de dichos juegos. A partir de estos digrafos se procederá al etiquetado de sus vértices con el objetivo de asignarlos a diferentes conjuntos y de esta forma elaborar una estrategia no perdedora (empate o victoria), para uno de los 2 jugadores. Una vez expuesta la modelización mediante digrafos, hablaremos de la Función de Sprague-Grundy, la cual nos facilitará la tarea de etiquetado de vértices para, a continuación, proceder a su asignación a los diferentes conjuntos. Profundizando en el estudio de juegos combinatorios, haremos mención a los juegos intratables, los cuales o bien por la complejidad computación de movimientos, o bien por la imposibilidad de alcanzar una victoria, no se pueden resolver computacionalmente. Además trataremos conceptos como la suma de juegos, juegos combinatorios compuestos a su vez de otros subjuegos. Veremos cómo modelizarlos mediante el Teorema de Sprague-Grundy y la suma digital, tal y como haremos con otros tipos de juegos que implican la suma de vértices. Asimismo, trataremos otras variantes de los juegos combinatorios como los juegos de voltear monedas de 1 y 2 dimensiones, con los que introduciremos conceptos como el producto digital y el Teorema de Grundy, con el fin de modelizarlos. Además también hablaremos de los juegos combinatorios imparciales con empates. En el desarrollo del trabajo se hablará de los juegos combinatorios imparciales asumiendo la imposibilidad de empate, sin embargo, se dedicará una sección para hablar acerca de juegos combinatorios imparciales con empates, exponiendo conceptos como la Función Sprague-Grundy generalizada para el etiquetado de vértices, como parte de la modelización de dichos juegos. Finalmente, se programará un juego combinatorio imparcial sin opción a empates, una variantes del NIM tradicional. En este juego se trabajan conceptos como la suma de vértices, la suma digital o el Teorema de Sprague-Grundy y se i trasladan a un ámbito práctico (computacional). ABSTRACT In this paper we will deal with the theory of combinatorial games. First, we will make an introduction about what combinatorial games are and their characteristics (2 players involved, perfect information, zero sum...). Then we will focus on a specific type of combinatorial games, the unbiased combinatorial games, those in which both players have the same restrictions of moves in their respective turns. Later we will move on to the modeling of these games, which will be carried out by means of digraphs representing the positions of these games. From these digraphs we will proceed to the labeling of their edges in order to assign them to different sets and thus develop a non-losing strategy (draw or win), for one of the 2 players. Once the modeling by means of digraphs has been explained, we will talk about the Sprague-Grundy Function, which will facilitate the task of labeling the vertices and then proceed to their assignment to the different sets. Delving into the study of combinatorial games, we will mention the intractable games, which either by the computational complexity of moves, or by the impossibility of achieving a victory, cannot be solved computationally. We will also deal with concepts such as the sum of games, combinatorial games composed in turn of other subgames. We will see how to model them by means of the SpragueGrundy Theorem and the digital sum, as we will do with other types of games involving the sum of edges. We will also discuss other variants of combinatorial games such as 1-D and 2-D coin flipping games, with which we will introduce concepts such as the digital product and Grundy’s Theorem, in order to model them. In addition, we will also talk about unbiased combinatorial games with ties. In the development of the paper we will talk about unbiased combinatorial games assuming the impossibility of ties, however, a section will be dedicated to talk about unbiased combinatorial games with ties, exposing concepts such as the generalized Sprague-Grundy Function for labeling of vertices, as part of the modeling of such games. Finally, an unbiased combinatorial game without the option of ties, a variant of the traditional NIM, will be programmed. In this game, concepts such as the sum of vertices, the digital sum or the Sprague-Grundy Theorem are worked on and transferred to a practical (computational) environment.

Researchers have studied political ideology and polarization in many different contexts since their effects are usually closely related to aspects and actions of individuals and societies. Hence, being able to estimate and measure the changes in political ideology and polarization is crucial for researchers, stakeholders, and the general public. In this paper, we model the ideology and polarization of 28 countries (the 27 EU member states plus the UK) using Facebook public posts from political parties’ Facebook pages. We collected a three-year dataset from 2019 to 2021 with information from 234 political parties’ Facebook pages and took advantage of the EU parliament elections of May 2019 to create our models. Our methodology works across 28 countries and benefits from being a low-cost running process that measures ideology and polarization at a high-resolution time scale. The results show our models are pretty accurate when validating them against 19 individual countries’ elections as ground truth. Moreover, to make our results available to the research community, stakeholders, and individuals interested in politics, the last contribution of our paper is a website including detailed information about the political parties in our dataset. It also includes the temporal evolution of our ideology and polarization estimations. Therefore, our work delivers a novel tool that uses Facebook public data to create country metrics useful for different purposes. To the best of our knowledge, there is no prior work in the literature offering a solution that measures the ideology and polarization of all EU + UK countries. This research received funding from the Madrid Government (Comunidad de Madrid-Spain) under the Multiannual Agreement with UC3M ("Fostering Young Doctors Research", UE-MEASURE-CM-UC3M) the agreement between the Community of Madrid and the Universidad Carlos III de Madrid. The Community of Madrid and Universidad Carlos III de Madrid for the funding of research projects on SARS-CoV-2 and COVID-19 disease, project name "Multi-source and multi-method prediction to support COVID-19 policy decision making", which was supported with REACT-EU funds from the European regional development fund "a way of making Europe". The European Union's Horizon 2020 programme under TESTABLE project (Grant 101019206). The Agencia the Estatal de Investigación (AEI) under the ENTRUDIT project (Grant TED2021-130118B-I00). The Fundación BBVA under the project AERIS.

Quite often a machine learning problem lends itself to be split in several well-defined subproblems, or tasks. The goal of Multi-Task Learning (MTL) is to leverage the joint learning of the problem from two different perspectives: on the one hand, a single, overall model, and on the other hand task-specific models. In this way, the found solution by MTL may be better than those of either the common or the task-specific models. Starting with the work of Evgeniou et al., support vector machines (SVMs) have lent themselves naturally to this approach. This paper proposes a convex formulation of MTL for the L1-, L2- and LS-SVM models that results in dual problems quite similar to the single-task ones, but with multi-task kernels; in turn, this makes possible to train the convex MTL models using standard solvers. As an alternative approach, the direct optimal combination of the already trained common and task-specific models can also be considered. In this paper, a procedure to compute the optimal combining parameter with respect to four different error functions is derived. As shown experimentally, the proposed convex MTL approach performs generally better than the alternative optimal convex combination, and both of them are better than the straight use of either common or task-specific models, With partial support from Spain’s grant TIN2016-76406-P. Work supported also by the UAM–ADIC Chair for Data Science and Machine Learning.

Recommender systems are information filtering systems used in many online applications like music and video broadcasting and e-commerce platforms. They are also increasingly being applied to facilitate software engineering activities. Following this trend, we are witnessing a growing research interest on recommendation approaches that assist with modelling tasks and model-based development processes. In this paper, we report on a systematic mapping review (based on the analysis of 66 papers) that classifies the existing research work on recommender systems for model-driven engineering (MDE). This study aims to serve as a guide for tool builders and researchers in understanding the MDE tasks that might be subject to recommendations, the applicable recommendation techniques and evaluation methods, and the open challenges and opportunities in this field of research, This work has been funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 813884 (Lowcomote [134]), by the Spanish Ministry of Science (projects MASSIVE, RTI2018-095255-B-I00, and FIT, PID2019-108965GB-I00) and by the R&D programme of Madrid (Project FORTE, P2018/TCS-4314

Este proyecto permite conocer la tecnología actual que se está usando para el aprovisionamiento de unas redes de alto rendimiento, seguras, flexibles y escalables. Muchas empresas necesitan almacenar sus recursos o alojar sus aplicaciones en la nube, con lo que el tráfico en Internet ha crecido considerablemente en los últimos años. Además, con la llegada de IoT a los domicilios, el tráfico que producen estos dispositivos puede afectar negativamente al rendimiento de la red. Por ello, en este trabajo se plantea una solución SD-WAN. SD-WAN permite modernizar las tradicionales redes WAN mediante la virtualización de software de red. Esto permite aumentar la escalabilidad de las telecomunicaciones. Además, SD-WAN provee redes seguras y dinámicas mediante la solución DMVPN. Este trabajo se centra alrededor de este concepto. DMVPN permite utilizar protocolos bien conocidos, como mGRE, IPSec y NHRP para realizar un establecimiento dinámico de túneles entre los extremos de una topología Hub and Spoke. Este escenario es la infraestructura por excelencia usada en el mundo empresarial. Para la resolución de DMVPN, se pretende dar uso y apoyar a una herramienta open source como Click. Click es una tecnología que implementa funciones de red mediante la conexión de módulos de red, los cuales realizan pequeñas acciones. Esto permite abstraerse de la complejidad que conlleva el diseño de redes. Este trabajo propone la implementación de túneles dinámicos con cifrado de la información transmitida, entre dos sitios remotos, utilizando una overlay network. Para ello, se realiza un estudio en profundidad de los protocolos IPSec y NHRP. IPSec aporta la parte de seguridad y tunelización. NHRP aporta la parte de dinamización. Para el establecimiento de túneles seguros, se empleará una herramienta externa de código abierto que da soporte al protocolo IPSec. Para NHRP, se implementarán unos módulos de Click que permiten la resolución de rutas entre dos spokes mediante el hub.---ABSTRACT---This project allows to learn about the current technology for deploying highperformance, secure, flexible, and scalable networks. Many businesses require cloud storage or application hosting, which is why Internet traffic has increased in recent years. Furthermore, if IoT devices become more common in households, the traffic generated by these devices may have a negative impact on network performance. As a result, an SD-WAN solution is provided in this paper. Through the virtualization of network software, SD-WAN allows classic WAN networks to be modernized. This provides for greater telecoms scalability. Additionally, SDDMVPN WAN's technology delivers secure and dynamic networks. This principle is at the heart of this work. DMVPN enables you to dynamically build tunnels between the endpoints of a Hub and Spoke topology using well-known protocols such as mGRE, IPSec, and NHRP. In the business world, this scenario is the infrastructure par excellence. It is designed to use and support an open-source tool such as Click for DMVPN resolution. Click is a networking technology that connects network modules that perform little operations to perform network functions. This allows for a level of abstraction from the complexities of network design. This paper proposes the use of an overlay network to build dynamic tunnels with encryption of transmitted data between two remote sites. An in-depth examination of the IPSec and NHRP protocols is conducted for this purpose. IPSec is in charge of security and tunneling. The dynamization is handled by NHRP. An external open source program that supports the IPSec protocol will be utilized to create secure tunnels. For NHRP, some Click modules will be implemented, allowing the hub to resolve routes between two spokes.

El uso de modelos de Inteligencia Artificial está ampliamente extendido para la resolución de problemas en multitud de campos, y sin embargo, no llegamos a comprender su comportamiento debido a la enorme complejidad asociada. Por ello, diferentes técnicas han sido desarrolladas con el objetivo de solventar esta falta de información conformando el campo de la Inteligencia Artificial Explicable (XAI). Mientras que existe una fuerte investigación en XAI, la evaluación de las explicaciones sobre el razonamiento de los modelos no tiene tanta actividad. En este trabajo, se aplicarán dos métodos de XAI (LIME y SHAP) a un problema de clasificación multi etiqueta englobado en el Procesamiento de Lenguaje Natural (NLP). El problema abordado trabaja con códigos CPV (Common Procurement Vocabulary codes) que son usados en los procesos de contratación pública en los países de la Unión Europea. La principal dificultad para asignar a un texto el código correcto es la gran cantidad de estos disponibles. Por ello, en este trabajo se planteará clasificar las 45 clases más generales. Debido a que la aplicación de estas técnicas de XAI a este tipo de problemas resulta algo poco habitual, se realiza un análisis de los resultados siendo esto el principal objetivo del trabajo. Se detallan los resultados obtenidos para varios modelos evaluados realizando una serie de pruebas. Además, se plantean ciertas cuestiones sobre la coherencia de los resultados y el valor añadido aportado por las explicaciones.---ABSTRACT---The use of Artificial Intelligence models is widely extended for problem solving in many fields, and yet, we do not understand their behavior due to the enormous associated complexity. Therefore, different techniques have been developed with the aim of solving this lack of information forming the field of Explainable Artificial Intelligence (XAI). While there is strong research in XAI, the evaluation of explanations on the reasoning of models is not so active. In this paper, two XAI methods (LIME and SHAP) will be applied to a multi-label classification problem encompassed in Natural Language Processing (NLP). The problem addressed works with CPV codes (Common Procurement Vocabulary codes) that are used in public procurement processes in the European Union countries. The major difficulty in assigning the correct code to a text is the large number of codes available. Therefore, this paper will attempt to classify the 45 most general classes. Since the application of these XAI techniques to this type of problem is somewhat unusual, an analysis of the results is carried out, this being the main objective of the work. The results obtained for several models evaluated by performing a series of tests are detailed. In addition, certain questions are raised about the consistency of the results and the added value provided by the explanations.

The proof that a program works according to a previously established behavior is known as formal verification. The use of formal verification techniques is increasing in recent years and in areas of the software industry. In this paper, the behavior of some greedy algorithms will be formally verified in Dafny. This will involve carrying out rigorous mathematical proofs in Dafny. In this paper, Dafny will be introduced first. It is a programming language that allows the user to check the correctness of his/her code. This will require a detailed specification of the expected behavior of the code. Secondly, greedy algorithms will be explained in detail, different problems where the greedy method is applied will be presented, and the strategy they follow to obtain an optimal solution will be studied. The specification of the code of each problem will be developed in Dafny and then the implementation of the greedy algorithm that solves it will be carried out in order to finally verify it. In addition, a generic methodology will be designed with the idea of being able to establish some steps to follow in the verification of these greedy algorithms for specific problems.

2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), 18/07/2022-23/07/2022, Italia., Currently, there is a high rate of generation of new information about the Energy Consumption of customers. It is important the traceability of its consumption pattern evolution to determine in real-time the services of a smart energy management system. This paper analyses the evolution of the Energy Consumption Pattern of customers using the Learning Algorithm for Multivariable Data Analysis (LAMDA). LAMDA is a fuzzy approach for supervised and unsupervised learning, based on the calculation of the Global Adequacy Degree (GAD) of one individual to a class/cluster, through the contributions of all its descriptors. LAMDA can create new classes/clusters after the training stage (online learning). If an individual does not have enough similarity to the preexisting classes/clusters, it is evaluated with respect to a threshold called the Non-Informative Class (NIC) to define if it is a new class/cluster. Particularly, the algorithm of the LAMDA family used in this paper is LAMDA-RD (Robust Distance). In the paper is analyzed the patterns of the initial grouping of the data, as well as, the patterns through their evolution (traceability). For the analysis of the patterns different metrics are considers: Calinski- Harabasz Index and Silhouette Score., European Commission, Agencia Estatal de Investigación, Junta de Comunidades de Castilla-La Mancha

Actualmente la cantidad de publicaciones diarias en las diferentes áreas del Aprendizaje Automático imposibilita a investigadores el estar al día e incluso encontrar lo que están buscando en un límite razonable de tiempo. Este problema también se puede aplicar al desarrollo del software, puesto que la reutilización de código previamente desarrollado también les podría ahorrar mucho tiempo de investigación. En este trabajo se proponen diferentes métodos para procesar grandes cantidades de publicaciones junto con su software, basados en los resúmenes obtenidos de Papers With Code y sus correspondientes archivos README; con el objetivo de ahorrar trabajo a los investigadores y facilitarles la adopción de software. Este enfoque se basa en el modelado de tópicos para extraer los principales temas presentes y asignarlos a las distintas publicaciones sin tener que leerlas todas. Utilizamos tres algoritmos para encontrar los temas más coherentes. LDA es el algoritmo más utilizado para modelización de tópicos en un conjunto de textos y ha demostrado ser muy eficaz. A pesar de esto, también presenta ciertas limitaciones. Para cubrir su limitación a la hora de trabajar con documentos de poca longitud, proponemos aplicar también BTM, que fue diseñado específicamente para este tipo de textos. LDA también puede encontrar problemas para manejar las relaciones semánticas. Para ello utilizamos BERTopic, que utiliza la habilidad de modelos del lenguaje preentrenados para encontrar representaciones mejores y contextualizadas del texto. Los resultados corroboran la supuesta eficacia del algoritmo LDA, a la vez que enfatizan la influencia del ajuste de hiperparámetros. BERTopic también proporciona tópicos coherentes e interpretables. En general, concluimos que nuestros modelos identifican efectivamente la mayoría de los tópicos y podrían ser útiles para futuras implementaciones de búsqueda de temas o sistemas de recomendaciones.---ABSTRACT---Currently, the amount of daily publications in different fields of Machine Learning makes it impossible for researchers to be up to date and even to find what they’re looking for in a reasonable amount of time. This problem can be extended also for software developing, where reusing already developed code could save them up much research time. In this thesis, we propose different methods for processing a large number of papers along with their software, based on abstracts obtained from Papers With Code and their corresponding README files, in order to save researchers time and facilitate software adoption . This approach relies on topic modeling to extract the main topics present and assign them to the different publications without having to read them all. We use three different algorithms to find the most coherent topics. LDA is the algorithm most used when modelling topics within text, and has proven to be effective although it also has some limitations . To cover its limitation on working with documents of short length we also propose applying BTM, which was specifically designed for these types of text . LDA can also find problems to handle semantic relationships. For this we used BERTopic, which uses the hability of pretained language models to find better and contextualized text representations. Results corroborate the assumed effectiveness of LDA, while highlighting the influence of hyperparameter tuning. BERTopic also provided coherent and interpretable topics. Generally, we conclude that our models effectively identify most of the topics and could be useful for future topic search implementations or recommendation systems.

En este trabajo se documenta la herramienta de “reporting1 ” digital [m]report, junto con su ecosistema de negocio. Además, se muestra la creación y desarrollo de un “data warehouse2 ” de métricas y dimensiones, junto con el desarrollo de un módulo de visualización para mostrarlo. Este “data warehouse” consiste en un conjunto de tablas y vistas integradas dentro del propio esquema de datos de la herramienta con el fin de poder visualizarlo en la interfaz de Datorama. [m]report es una herramienta perteneciente a la empresa GroupM, del grupo de publicidad WPP, implementada en el caso de España en 2018. Esta herramienta es una implementación basada en Datorama, plataforma de inteligencia de Marketing. Datorama permite extraer datos recogidos en las diferentes campañas publicitarias en tiempo real y manipular esos datos con las herramientas que te proporciona. Su software permite crear flujos de datos o “data stream3 “provenientes de todo tipo de “Ad servers4 ”, plataformas de publicidad, DSPs5 y cualquier herramienta o plataforma web que permita recoger datos de impacto de la campaña. Además, permite reorganizar la información en un entorno muy personalizable y automatizar esta carga y distribución de los datos, mediante informes o “dashboards6 ”. Por otro lado, [m]report también ofrece una pestaña de visualizaciones, donde se pueden crear páginas con “dashboards” en su interior para visualizar la información. Existen decenas de tipos de gráficos con los que se puede mostrar la información bajo la segmentación deseada (Grupo de anuncios, anuncio, campaña…) y el dato se actualiza de manera automatizada conforme llegan nuevos informes a través del canal correspondiente. Todas estas funcionalidades se explicarán con más detalle a lo largo del trabajo [1].---ABSTRACT---This paper documents the digital reporting tool [m]report, as well as the business ecosystem where is working. Also, shows the creation and development of a data warehouse of measurements and dimensions, together with a visualization module that enables to show the data in a much more significant way. This data warehouse consists of a group of tables and views integrated into the [m]report schema in their data base, with the objective of visualizing this data in the interface of the tool. [m]report is a tool that belongs to the company GroupM, of the advertising group WPP, implemented in the case of Spain in 2018. This tool is an implementation based on Datorama, a Marketing Intelligence platform. Datorama allows you to extract data collected from different advertising campaigns in real time and manipulate that data with the tools it provides you. Its software allows you to create data streams from all types of Ad servers, advertising platforms, DSPs and any tool or web platform that allows you to collect campaign impact data. In addition, it allows to reorganize the information in a highly customizable environment and to automate the load and transfer of data through reports or dashboards. On the other hand, [m]report also offers a visualization tab, where the user can create pages with dashboards inside them to visualize the information. There are dozens of types of graphs with which the information can be displayed under the desired segmentation (ad group, ad, campaign...) and the data is updated automatically as new reports arrive through the corresponding channel. All these functionalities will be explained in more detail throughout the paper [1].

This paper focuses on the objective a Machine Learning model to classify the advancement of Parkinson´s Disease on a patient given some audio recordings and general information, such as age and gender. For this we will utilize a dataset extracted from synapse to train the several proposed models and finally extract conclusions on the outcomes. This project focuses on the implementation of CNN models based of the VGG-16 architecture. The results ranges from a 30% accuracy to around a 60% on all three datasets (train, validation and test) depending on the model and its hyper parameters, as well as the processes applied on the data. In conclusion the project was lacking more instances of reliable data but shows the possibilities of implementing such models on bigger datasets with rather significant results. The final results of this paper allow us to define rules and procedures to be implemented in similar future projects.

En este Trabajo de Fin de Grado se ha realizado el diseño de la interacción de un sistema para dar solución a un problema actual durante el período de matriculación de la escuela, en relación con la elección de asignaturas optativas en el Grado de Ingeniería Informática. Un gran número de estudiantes de Ingeniería Informática pierden la oportunidad de elegir las asignaturas optativas de tercer y cuarto curso que quieren, debido al método de selección de matriculación existente. Este sistema hace que en el momento en el que se matriculan dependan de una fecha de cita asignada de forma automática, lo que provoca que, en la mayoría de las ocasiones, las optativas ya hayan alcanzado su cupo máximo de matrícula en esa fecha prevista. Además, este hecho supone un trabajo adicional para los profesores ya que reciben múltiples peticiones para gestionar el aumento de los cupos de optativas. Para hacer frente a este problema, este Trabajo propone un sistema de preinscripción que consiste en lo siguiente. En primer lugar, permitirá que los coordinadores de las asignaturas optativas determinen en sus fichas de asignaturas unos criterios de selección de matriculación necesarios. En segundo lugar, los estudiantes podrán visualizar el contenido de las fichas mencionadas y, posteriormente, en función de los criterios de selección, podrán seleccionar sus preferencias. Y, por último, el coordinador de titulación tendrá la posibilidad de ver y gestionar las preinscripciones en tiempo real y, en el caso de que una asignatura optativa obtenga un elevado número de preinscripciones, se podrá aumentar el cupo de la optativa en cuestión de si se establece un acuerdo entre el coordinador de titulación y el propio coordinador de la asignatura. Para realizar el diseño de la interacción se ha aplicado el proceso de diseño centrado en el usuario. Para este Trabajo se ha realizado un análisis del contexto de uso, se ha diseñado un prototipo de baja fidelidad, se ha evaluado la usabilidad de ese prototipo, y se ha diseñado un prototipo de alta fidelidad, teniendo en cuenta y corrigiendo los problemas de usabilidad encontrados en el proceso. Finalmente se proporcionan indicaciones para el posterior desarrollo del sistema completo.---ABSTRACT---In Computer Engineering Degree the choice of elective subjects has been an issue that needs to be addressed. In order to deal with this current problem, an interactive interaction system has been designed which will be thoroughly explained in this paper. A great number of students miss their chance to choose third- and fourth-year elective subjects because of the current subject selection method. This system makes students’ selection depend on an automatically assigned appointment date which, most of the times causes that, at the time they enrol, the electives have already reached their maximum enrolment quota on that scheduled date. Moreover, this fact gives rise to an additional challenge for the professional staff as they receive huge numbers of requests to increase quotas for elective courses. In order to cope with this issue, this Final Degree Project proposes a multifunctional pre-enrolment system which consists of the following. Firstly, it will allow professors coordinating elective courses to determine the compulsory selection criteria needed to enrol in their subjects, which would reduce the massive requests they receive each year. Secondly, students will be able to visualize the elective subjects’ cards contents and, subsequently, depending on the selection criteria, they will be able to select their preferences. And, finally, the main degree coordinator will have the possibility to see and manage the preregistrations in real time and, in the case a subject obtains a high number of pre-enrolments, the system will allow him/her to increase the elective subject’s quota only if there is a pre-agreement between the degree coordinator and the subject elective coordinator him/herself. A user-centred design process was applied to design the interaction. For this Final Degree Project, an analysis of the context of use has been carried out, the usability of a low-fidelity prototype has been designed and evaluated, taking into account and correcting (if needed) the usability problems found in the process and, moreover, a high-fidelity prototype was also designed. Finally, this research paper will conclude with some indications for a further development of the complete system.

El presente trabajo expone una investigación exhaustiva del ecosistema de FinTech, desde el punto de vista de ciberseguridad. En primer lugar, se realiza un breve análisis del ecosistema de FinTech y las diferentes entidades que lo conforman, así como las relaciones entre dichas entidades. A continuación, se exponen las diversas ciberamenazas y vulnerabilidades existentes, se clasifican y se explican los diferentes tipos de orquestadores de ciberataques. Una vez realizado el análisis de las diversas ciberamenazas y vulnerabilidades, se procede a explicar en detalle los diversos mecanismos de ciberseguridad que conforman los modelos, empezando por el modelado de amenazas, siguiendo con los mecanismos de autenticación y control de acceso, y las políticas de resiliencia y mitigación. Dentro de cada mecanismo se explican los diferentes métodos o sistemas más utilizados, y se analizan brevemente sus capacidades y niveles de seguridad, relacionándolo en todo momento con el contexto de tecnologías financieras. Después, se procede a exponer los diferentes modelos de ciberseguridad más utilizados en FinTech a día de hoy, y se definen ciertas características y funcionalidades que todo buen modelo de ciberseguridad debería tener. Dentro de cada modelo se exponen las diversas funcionalidades que implementan, realizándose una explicación de todas y cada una de las funcionalidades. Tras la exposición de los modelos disponibles, se realiza una comparativa de los distintos modelos utilizando una media ponderada simple, comparando el avance de los modelos viendo el número de funcionalidades que implementan después de asignar un peso a cada funcionalidad. A continuación, se realiza otra comparativa de los modelos, pero esta vez teniendo en cuenta no solo las funcionalidades sino además las sub-funciones dentro de cada una de ellas. Finalmente, se escogen los dos modelos considerados más avanzados después de realizar la comparativa, y en las conclusiones se propone una posible continuación y mejora del presente trabajo. Por último, se realiza un breve análisis del impacto en varios ámbitos, incluyendo una relación con los objetivos de desarrollo sostenible.---ABSTRACT---The following paper shows an exhaustive investigation of the FinTech ecosystem from the cyber-security point of view. Firstly, a brief analysis of the FinTech ecosystem is conducted, exposing the several entities that form it as well as the relationships amongst them. After that, the paper explains and classifies the most important cyber-threats and vulnerabilities which are present in the ecosystem. Also, the different cyber-attack orchestrators are explained. After the cyber-threat and vulnerabilities analysis, the paper takes a look into the different cyber-security mechanisms, starting with threat modeling, followed by authentication and access control systems, and finally mitigation and resilience policies. For each mechanism, several different methods and systems are explained and their capabilities and security levels are analyzed, relating them with the context of FinTech when possible. After that, the most important cyber-security frameworks used in FinTech are explained. A generic cyber-security framework is also explained including the main characteristics and functionalities it should implement. For each model the functionalities they implement are shown and explained. After explaining all the available models, a comparison between them is done using a weighted average. The sophistication of each model is determined by the amount of functionalities they implement, after assigning a weight to each functionality. After that a more in depth comparison is done but this time not only functionalities are taken into account, but also sub-functionalities for each functionality. Finally, two models are chosen as the most advanced ones after the comparison, and a future work proposal is made that could improve the current paper. Lastly, a brief impact analysis is explained, including the impact related to the 2030 sustainable development goals.

As code complexity continues to increase, software development methods must support the handling of this complexity and reduce development failures. Model-based systems engineering (MBSE) is a modeling-centered development method that provides support to maintain consistency of different phases of the life cycle. Automatic code generation tools were created to reuse software solutions and design patterns and reduce development errors in the software development process, based on automatic model transformations and code generators. However, the use of these tools requires their adaptation to specific platforms and domains since tools only support certain functionalities. What determines how to approach the design of the system are the functionalities provided by the tools available rather than the user needs. In this paper, we propose a way to extend the elements supported by modelling tool suites for real-time embedded systems for the space domain. This enables developers to have greater flexibility by allowing them to modify their tool suite to fit their needs.

In this paper, we use an evolutionary swarm intelligence approach to build an automatic electric dispatch controller for an offshore wind power plant (WPP). The optimal power flow (OPF) problem for this WPP is solved by the Canonical Differential Evolutionary Particle Swarm Optimization algorithm (C-DEEPSO). In this paper, C-DEEPSO works as a control system for reactive sources in energy production. The control operation takes place in a daily energy dispatch, scheduled into 15 min intervals and resulting in 96 operating test scenarios. As the nature of the optimization problem is dynamic, a fine-tuning of the initialization parameters of the optimization algorithm is performed at each dispatch interval. Therefore, a version of the C-DEEPSO algorithm has been built to automatically learn the best set of initialization parameters for each scenario. For this, we have coupled C-DEEPSO with the irace tool (an extension of the iterated F-race (I/F-Race)) by using inferential statistic techniques. The experiments carried out showed that the methodology employed here is robust and able to tackle this OPF-like modeling. Moreover, the methodology works as an automatic control system for a dynamic schedule operation., European Commission, Agencia Estatal de Investigación, Comunidad de Madrid

The increasing number of Android malware forced antivirus (AV) companies to rely on automated classification techniques to determine the family and class of suspicious samples. The research community relies heavily on such labels to carry out prevalence studies of the threat ecosystem and to build datasets that are used to validate and benchmark novel detection and classification methods. In this work, we carry out an extensive study of the Android malware ecosystem by surveying white papers and reports from 6 key players in the industry, as well as 81 papers from 8 top security conferences, to understand how malware datasets are used by both. We, then, explore the limitations associated with the use of available malware classification services, namely VirusTotal (VT) engines, for determining the family of an Android sample. Using a dataset of 2.47 M Android malware samples, we find that the detection coverage of VT's AVs is generally very low, that the percentage of samples flagged by any 2 AV engines does not go beyond 52%, and that common families between any pair of AV engines is at best 29%. We rely on clustering to determine the extent to which different AV engine pairs agree upon which samples belong to the same family (regardless of the actual family name) and find that there are discrepancies that can introduce noise in automatic label unification schemes. We also observe the usage of generic labels and inconsistencies within the labels of top AV engines, suggesting that their efforts are directed towards accurate detection rather than classification. Our results contribute to a better understanding of the limitations of using Android malware family labels as supplied by common AV engines. This work has been supported by the “Ramon y Cajal” Fellowship RYC-2020-029401.

Data sketches are widely used to accelerate operations in big data analytics. For example, algorithms use sketches to compute the cardinality of a set, or the similarity between two sets. Sketches achieve significant reductions in computing time and storage requirements by providing probabilistic estimates rather than exact values. In many applications, an estimate is sufficient and thus, it is possible to trade accuracy for computational complexity; this enables the use of probabilistic sketches. However, the use of probabilistic data structures may create security issues because an attacker may manipulate the data in such a way that the sketches produce an incorrect estimate. For example, an attacker could potentially inflate the estimate of the number of distinct users to increase its revenues or popularity. Recent works have shown that an attacker can manipulate Hyperloglog, a sketch widely used for cardinality estimate, with no knowledge of its implementation details. This paper considers the security of K Minimum Values (KMV), a sketch that is also widely used to implement both cardinality and similarity estimates. Next sections characterize vulnerabilities at an implementationindependent level, with attacks formulated as part of a novel adversary model that manipulates the similarity estimate. Therefore, the paper pursues an analysis and simulation; the results suggest that as vulnerable to attacks, an increase or reduction of the estimate may occur. The execution of the attacks against the KMV implementation in the Apache DataSketches library validates these scenarios. Experiments show an excellent agreement between theory and experimental results. Pedro Reviriego acknowledges the support of the ACHILLES project PID2019-104207RB-I00 and the Go2Edge network RED2018-102585-T funded by the Spanish Ministry of Economy and Competitivity and of the Madrid Community research project TAPIR-CM under Grant P2018/TCS-4496.

Over the next thirty years, the population of the world will increase by more than 2 billion. This growth will focus on urban areas and will translate in an urgent need to build more housing and develop the infrastructure. The architecture, engineering, and construction (AEC) industry will be faced with both opportunities and challenges. They will get to design and build more, but they will have to take into consideration the already stressed resources of the planet. To this, the recent investments in the Build-to-Rent (BTR) sector add up. With house prices only rising, it is becoming harder for young people to afford a house especially in urban areas. Moreover, due to the pandemics, the high levels of unemployment and wage cuts will make it impossible for many people to save to put together a deposit for a house. Thus, it is estimated that in the near future, more houses will be used for rent, highlighting a shift from home ownership. Within this context, Lurtis is developing a buildability estimator, which will enable developers and architects to maximize the potential of a plot and of an investment. This tool reduces the time of pre-design and can create dozens of design solutions based on user preferences and governmental regulations. Users can easily compare which project is more profitable, without the need to build anything, saving resources and time. The objective of this Master Thesis is to design the user experience for the buildability tool, in order to facilitate its adoption. The paper discusses the recent trends in the real-estate industry and explains the concept of buildability. It explores the strongest competitors in the industry focusing on their design strengths and weaknesses. It then analyzes the needs of potential users and provides different design solutions for the tool. The evaluation of these solutions is presented, culminating with details about the technical implementation of the buildability estimator. The paper concludes with a reflection on the entire design process and with future ideas to be tackled.

The Google's Loon[TM] initiative aims at covering rural or underdeveloped areas via fleets of high-altitude balloons supporting LTE connectivity. But how effective and stable can be the coverage provided by a network deployed via propulsion-free balloons, floating in the sky, and only loosely controllable through altitude variations? To provide some insights on the relevant performance and trade-offs, in this paper we gather real-world data from publicly available flight tracking services, and we analyze coverage and service stability in three past deployment scenarios. Besides employing a variety of metrics related to spatial and temporal coverage, we also assess service continuity, by also leveraging recently proposed “meaningful availability” metrics. While our analyses show that balloons are certainly a cost-effective way to provide a better-than-nothing and delay-tolerant service, there is yet no empirical evidence that an increase in the number of overlapping balloons may be rewarded with a substantial performance increase - in other words, we suspect that guaranteeing coverage and service stability levels comparable to that of a terrestrial cellular network is a challenging goal. Publicado

This paper proposes the minimization of α-divergences for approximate inference in the context of deep Gaussian processes (DGPs). The proposed method can be considered as a generalization of variational inference (VI) and expectation propagation (EP), two previously used methods for approximate inference in DGPs. Both VI and EP are based on the minimization of the Kullback-Leibler divergence. The proposed method is based on a scalable version of power expectation propagation, a method that introduces an extra parameter α that specifies the targeted α-divergence to be optimized. In particular, such a method can recover the VI solution when α → 0 and the EP solution when α → 1. An exhaustive experimental evaluation shows that the minimization of α-divergences via the proposed method is feasible in DGPs and that choosing intermediate values of the α parameter between 0 and 1 can give better results in some problems. This means that one can improve the results of VI and EP when training DGPs. Importantly, the proposed method allows for stochastic optimization techniques, making it able to address datasets with several millions of instances, The authors gratefully acknowledge the use of the facilities of Centro de Computación Científica (CCC) at Universidad Autónoma de Madrid. The authors also acknowledge financial support from Spanish Plan Nacional I+D+i, Ministerio de Ciencia e Innovación, grant PID2019-106827GB-I00 / AEI / 10.13039/501100011033

The wholesale electricity markets in Europe are undergoing major changes. The pursuit of a major integration for the development of the Internal Energy market is the main driver of this transformation. In this context, the Central Western Europe region implemented for the first time in May 2015 a new and complex mechanism to manage cross-border capacity allocation in the frame of the day-ahead market: the Flow-Based Market Coupling. This paper is the first to consider recent data of the electricity market to develop a predictive model for identifying convergence and congestion situations in the Central Western Europe region. The occurrence of convergence or not is considered as a binary outcome to build a probit model. This model combines meaningful information about the electricity market features of the interconnected countries between 2016 and 2018, including for the first time data on renewable energy sources forecasts for this type of studies. The results of this study identify the major role that Germany and France play in the integration process. The estimated coefficients of the model show that the strong development of solar and wind power in Germany appears as an important driver of congestion in the Central Western Europe. In order to improve the benefits of market integration and the further development of the Internal Energy market, the results of this study encourage policy-makers to promote cooperation and coordination among all the actors involved in the electricity market and to pursue the expansion of the power grid to minimize the occurrence of congestion situations. This project has been funded by the National Distance Education University (UNED), Spain, Applied Economic and Economic History department for open access publishing.

Esta memoria explora los fundamentos teóricos y el estado del arte de las Physical Unclonable Functions (PUFs) y describe el proceso de diseñar e implementar una PUF unida a un algoritmo criptográficamente ligero. Las PUFs son objetos los cuales se pueden identificar de forma inequívoca de otros objetos utilizando las propiedades físicas que lo componen. En este proyecto se implementa la Arbiter PUF que utiliza los retardos de propagación de los circuitos multiplexores para autenticar dispositivos electrónicos. El dispositivo implementado está compuesto por circuitos integrados que contienen multiplexores y otros que contienen biestables tipo D. Los multiplexores se ponen en filas de a dos conectados a la entrada D y a la de reloj del biestable. A cada entrada de selección del multiplexor hay que ponerle un valor para generar un camino de retardos por dentro de los multiplexores. Al conjunto de esos valores se le conoce como challenge. Al introducir en las entradas de los primeros multiplexores una señal de reloj, ésta se propagará hasta llegar al biestable y según a qué entrada llegue primero la señal el bistable devolverá un cero o un uno. El sistema implementado tiene el circuito mencionado previamente repetido tres veces y junto al algoritmo trifork, que está compuesto por tres Perturbed Lagged Fibonacci Generators (PLFG), genera números aleatorios. El dispositivo se consigue implementar con éxito, aunque los resultados son muy inestables, ya que las mismas entradas devuelven valores muy distintos en cada ocasión. Abstract: This paper explores the theoretical foundations and state-of-the-art of Physical Unclonable Functions (PUFs) and describes the process of designing and implementing a PUF combined with a cryptographically lightweight algorithm. PUFs are objects that can be uniquely identified from other objects using their physical properties. In this project, the Arbiter PUF is implemented, which uses the propagation delays of multiplexer circuits to authenticate electronic devices. The implemented device is composed of integrated circuits that contain multiplexers and others that contain D-type flip-flops. The multiplexers are arranged in pairs, connected to the D input and the clock input of the flip-flop. Each selection input of the multiplexer must be given a value to generate a delay path through the multiplexers. The set of these values is known as the challenge. By inputting a clock signal into the first multiplexers’ inputs, it will propagate until it reaches the flip-flop, and depending on which input the signal arrives first, the flip-flop will return a zero or a one. The implemented system has the aforementioned circuit repeated three times and, along with the trifork algorithm, which consists of three Perturbed Lagged Fibonacci Generators (PLFG), it generates random numbers. The device is successfully implemented, although the results are very unstable, as the same inputs return very different values on each occasion.

This paper presents a framework for the efficient management of renewable energies to charge a fleet of electric buses (eBuses). Our framework starts with the prediction of clean energy time windows, i.e., periods of time when the production of clean energy exceeds the demand of the country. Then, the optimization phase schedules charging events to reduce the use of non-clean energy to recharge eBuses while passengers are embarking or disembarking. The proposed framework is capable of overcoming the unstable and chaotic nature of wind power generation to operate the fleet without perturbing the quality of service. Our extensive empirical validation with real instances from Ireland suggests that our solutions can significantly reduce non-clean energy consumed on large data sets, This work received funding from the Sustainable Energy Authority of Ireland (SEAI) Research, Development and Demonstration (RDD) 2019 programme under the grant number 19/ RDD/519

Este trabajo tiene como objetivo conocer y analizar la evolución del sistema financiero, estudiando uno de los principales protagonistas de la innovación en el sector, como son las Fintech. Se trata de un tema de gran relevancia y actualidad, ya que estamos viendo como están cambiando los procedimientos y formas de ofrecer productos financieros, tanto por parte de las Fintech, como por parte de la banca tradicional. Por ello se estudiará el impacto y sinergias que surgen entre estas empresas, siempre en beneficio de los usuarios finales, los cuales ven como cada vez tienen más información sobre sus activos financieros. Por otra parte, este trabajo también tiene por objetivo, presentar y realizar la propuesta de una nueva aplicación para móvil en el mundo de las Fintech, que ayude a las personas a crear y conseguir planes de ahorro de forma eficiente. Esta aplicación se llama FINANT y a lo largo del apartado 8 encontraremos toda la información para poder entender la idea de negocio, el plan tecnológico y lo que es más importante, qué busca y cómo puede ayudar a la sociedad. El trabajo está dividido en ocho apartados principales, que se pueden agrupar en cuatro partes. En primer lugar, se introducirá el trabajo, junto con los objetivos y metodología utilizada para realizar el mismo. En segundo lugar, se llevará a cabo el marco teórico, en el que se explicarán en detalle distintos conceptos necesarios para entender a fondo el trabajo. En tercer lugar, se realizará un análisis exhaustivo de la situación que viven actualmente las Fintech, tanto a nivel internacional como en España, analizando distintos factores como son el crecimiento, inversión y regulación, entre otros. A continuación, se presentará FINANT, exponiendo sus características, objetivos y razón de ser; para finalizar con la tecnología necesaria para en un futuro poder desarrollarla de forma fácil y segura. Por último, estarán los apartados finales en los que podremos encontrar los resultados, conclusiones del trabajo e impacto social del mismo. En estos apartados veremos cómo, tras realizar el trabajo, podemos concluir que la innovación en el sector financiero seguirá apareciendo, necesitando la banca tradicional adaptarse a estos movimientos para poder sobrevivir. También podremos deducir el problema que existe con el ahorro y como FINANT puede ayudar a minimizarlo. ABSTRACT: The aim of this paper is to understand and analyze the evolution of the financial system, studying one of the main protagonists of innovation in the sector, such as Fintech. This is a highly relevant and topical issue, as we see how the procedures and ways of offering financial products are changing, both by Fintechs and by traditional banks. Therefore, the impact and synergies that arise between these companies will be studied, always for the benefit of end users, who see how they have more and more information about their financial assets. On the other hand, this work also aims to present and make a proposal for a new Fintech, in the form of a mobile application, which helps people to create and achieve savings plans efficiently. This application is called FINANT and throughout section 8 we will find all the information to be able to understand the business idea, the technological plan and what is more important, what it seeks and how it can help society. The work is divided into eight main sections, which can be grouped into four parts. Firstly, the work will be introduced, together with the objectives and methodology used to carry it out. Secondly, the theoretical framework will be presented, explaining in detail the different concepts necessary for a thorough understanding of the work. Thirdly, an exhaustive analysis of the current situation of Fintech, both internationally and in Spain, will be carried out, analyzing different factors such as growth, investment and regulation, among others. Then, FINANT will be presented, explaining its characteristics, and objectives; finishing with the necessary technology to be able to develop it easily and securely in the future. Finally, there will be the final sections in which we will find the conclusions, results of the work and its social impact. In these sections, we will see how, after carrying out the work, we can conclude that innovation in the financial sector will continue to appear, with traditional banking needing to adapt to these movements in order to survive. We will also be able to deduce the problem with savings and how FINANT can help minimize it.

Recommender systems are widely adopted as an increasing research and development area, since they provide users with diverse and useful information tailored to their needs. Several strategies have been proposed, and in most of them some concept of similarity is used as a core part of the approach, either between items or between users. At the same time, Siamese Neural Networks are being used to capture the similarity of items in the image domain, as they are defined as a subtype of Artificial Neural Networks built with (at least two) identical networks that share their weights. In this review, we study the proposals done in the intersection of these two fields, that is, how Siamese Networks are being used for recommendation. We propose a classification that considers different recommendation problems and algorithmic approaches. Some research directions are pointed out to encourage future research. To the best of our knowledge, this paper is the first comprehensive survey that focuses on the usage of Siamese Neural Networks for Recommender Systems, This work has been funded by the Ministerio de Ciencia e Innovación (reference PID2019-108965GB-I00). The authors thank the reviewers for their thoughtful comments and suggestions