2024-03-29T12:59:02Zhttps://ebuah.uah.es/oai/requestoai:ebuah.uah.es:10017/599632024-01-27T01:16:44Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-26T09:51:43Z
urn:hdl:10017/59963
Competencias digitales de los ingresantes universitarios: acceso a la educación superior
Campo Montalvo, Elena
Sánchez , Sabrina Nair
Guzmán , Claudia Alejandra
Carro Pérez, Magalí
Fernández De Sevilla Vellón, María De Los Ángeles
Pérez Díaz, Sonia
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Universidad de Alcalá. Departamento de Física y Matemáticas
Educación superior virtual
Competencias digitales
Marco europeo
Transformación tecnológica
E-learning
Este artículo refleja los resultados
obtenidos tras aplicar una encuesta a muestra
de 741 estudiantes de nuevo ingreso en dos
universidades, una europea, Universidad de
Alcalá en España, y otra latinoamericana,
Universidad Nacional de Córdoba en
Argentina. Esta encuesta fue diseñada
con el objetivo de analizar las habilidades
digitales de los estudiantes que acceden a las
titulaciones de ingeniería, considerando las
cinco áreas clave de competencias digitales
definidas en el marco europeo DigComp
2.1 para la ciudadanía, adaptándolo a las
necesidades de la educación superior.
Los resultados extraídos han permitido
caracterizar el nivel de competencias
digitales adquiridas por los estudiantes de
dos regiones claramente identificadas por su
diversidad económica, social y cultural. Se
han observado distintos comportamientos
entre los sujetos experimentales, dado
que los estudiantes españoles presentan
un mayor nivel de competencias digitales,
frente a los argentinos. Esta tendencia
se mantiene en la mayoría de las áreas
particulares de las competencias evaluadas,
siendo de mayor significación el área de
resolución de problemas y la de creación
de contenidos digitales. En todo caso, los
hallazgos encontrados en esta investigación
han determinado que los estudiantes
ingresantes en ambas universidades, reúnen
las habilidades digitales necesarias para
adaptarse a las necesidades académicas,
administrativas y de gestión con las que han
innovado ambos sistemas universitarios,
consecuencia de la pandemia de COVID-19.
Como consecuencia del análisis realizado,
es posible afirmar que los estudiantes de
ingeniería de ambas instituciones cuentan
con las competencias requeridas por la actual
transformación tecnológica.
2024-01-26T09:51:43Z
2024-01-26T09:51:43Z
2022
2024-01-25T10:38:36Z
info:eu-repo/semantics/article
International Journal of Human Sciences Research, 2022, v. 2, n. 16, p. 1-7
2319-7064
http://hdl.handle.net/10017/59963
10.22533/at.ed.5582162220067
AR/0000042802
International Journal of Human Sciences Research
2
7
16
1
spa
https://doi.org/10.22533/at.ed.5582162220067
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2022 IJHS
oai:ebuah.uah.es:10017/596312024-02-22T09:41:37Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-18T13:34:28Z
urn:hdl:10017/59631
The road to BOFUSS: The basic OpenFlow userspace software switch
Leão Fernandes, Eder
Rojas Sánchez, Elisa
Álvarez Horcajo, Joaquín
Lajos Kis, Zoltàn
Sanvito , Davide
Bonelli , Nicola
Cascone , Carmelo
Esteve Rothenberg, Christian
Universidad de Alcalá. Departamento de Automática
Software-defined networking, Data plane programmability
Software switches
OpenFlow
Open source
Data plane programmability
Software switches are pivotal in the Software-Defined Networking (SDN) paradigm, particularly in the early phases of development, deployment and testing. Currently, the most popular one is Open vSwitch (OVS), leveraged in many production-based environments. However, due to its kernel-based nature, OVS is typically complex to modify when additional features or adaptation is required. To this regard, a simpler user-space is key to perform these modifications. In this article, we present a rich overview of BOFUSS, the basic OpenFlow user-space software switch. BOFUSS has been widely used in the research community for diverse reasons, but it lacked a proper reference document. For this purpose, we describe the switch, its history, architecture, uses cases and evaluation, together with a survey of works that leverage this switch. The main goal is to provide a comprehensive overview of the switch and its characteristics. Although the original BOFUSS is not expected to surpass the high performance of OVS, it is a useful complementary artefact that provides some OpenFlow features missing in OVS and it can be easily modified for extended functionality. Moreover, enhancements provided by the BEBA project brought the performance from BOFUSS close to OVS. In any case, this paper sheds light to researchers looking for the trade-offs between performance and customization of BOFUSS.
2024-01-18T13:34:28Z
2024-01-18T13:34:28Z
2020-09-01
2024-01-12T10:29:34Z
info:eu-repo/semantics/article
Fernandes,Eder Leão; Rojas,Elisa; Alvarez-Horcajo,Joaquin; Kis,Zoltàn Lajos; Sanvito,Davide; Bonelli,Nicola; Cascone,Carmelo and Rothenberg,Christian Esteve, 2020, "The road to BOFUSS: The basic OpenFlow userspace software switch", Journal of Network and Computer Applications, vol.165, 102685
1084-8045
http://hdl.handle.net/10017/59631
10.1016/j.jnca.2020.102685
AR/0000034180
Journal of Network and Computer Applications
165
eng
https://doi.org/10.1016/j.jnca.2020.102685
info:eu-repo/grantAgreement/CAM//S2018%2FTCS-4496%2FTAPIR-CM/ES/Técnicas Avanzadas para Potenciar la Inteligencia de las Redes 5G/TAPIR-CM
info:eu-repo/grantAgreement/UAH//CCGP2017-EXP%2F001/ES/SIMPSONS: SDN INTELLIGENT MANAGEMENT, PROVISIONING AND OPTMIZATION OF NETWORKS
info:eu-repo/grantAgreement/CNPq//310317%2F2013-4/BR
info:eu-repo/grantAgreement/CNPq//310930%2F2016-2/BR
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2020 Elsevier
Elsevier
oai:ebuah.uah.es:10017/599832024-02-19T13:03:07Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-26T12:22:24Z
urn:hdl:10017/59983
Educational Technology in Flipped Course Design
Estriégana Valdehita, Rosa María
Barchino Plata, Roberto
Medina Merodio, José Amelio
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Online learning environment
Educational technology
Game-based learning
Videos
Mobile devices
Virtual laboratories
The use of technology to engage students and to provide them with tools to study autonomously is increasingly frequent in higher education. This paper outlines an experimental study that analyzes the effectiveness of flipped classroom design, and argues how the use of technological, educational resources such as videos of educators teaching, interactive materials, simulators, virtual labs and game-based learning have facilitated the use of class time for active learning and discussion. The study was conducted in several academic years with groups studying Fundamentals of Computer Technology, a core subject in the first year of the Computer Engineering and Information Systems degree courses. We analyzed data collected from online activities on a learning platform created from scratch, from classroom activities and from attitudinal and satisfaction surveys. We compared the evolution of outcomes between the 2009-2010 and 2015-2016 academic years. The methodology followed a quantitative design with control and experimental groups, and descriptive statistical techniques were used. The results obtained show that learning achievement and performance in terms of qualifications were higher in the experimental groups, where the flipped classroom approach using technological resources was adopted, than in the control groups, where the traditional lecture approach was used. A significant positive effect on participation, engagement and student satisfaction was also identified.
2024-01-26T12:22:24Z
2024-01-26T12:22:24Z
2017-09-17
2024-01-25T13:00:12Z
info:eu-repo/semantics/article
Estriégana, Rosa & Barchino, Roberto & Medina, Jose. (2017). Educational technology in flipped course design. International Journal of Engineering Education. 33. n.4, p. 1199-1212.
0949-149X
http://hdl.handle.net/10017/59983
07_ijee3471ns 1199.1212
AR/0000027986
International Journal of Engineering Education
33
1212
4
1199
eng
https://doi.org/07_ijee3471ns 1199..1212
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2017 TEMPUS
TEMPUS
oai:ebuah.uah.es:10017/595742024-01-24T14:11:06Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-17T15:00:53Z
urn:hdl:10017/59574
Reconfiguration Algorithm to Reduce Power Losses in Offshore HVDC Transmission Lines
Sanz Alonso, Inés
Moranchel Pérez, Miguel
Moriano Martín, Javier
Rodríguez Sánchez, Francisco Javier
Fernández Melián, Susel
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Electrónica
The race to increase the efficiency and reduce the
power losses in transmission systems has resulted in the substantial
growth of high-voltage direct current (HVDC) transmission
systems. Moreover, the interconnection of these transmission systems
significantly increases their reliability. However, the control
of these meshed grids is a key problem that usually is managed
through the control of the VSCs in those grids, but the control of
the VSC can be complemented with a reconfiguration algorithm.
This paper proposes the use of the particle swarm optimization
algorithm, in order to reconfigure meshed HVDC transmission
systems and reduce losses. The proposed algorithm has been tested
in the CIGRE benchmark grid, which comprises of several offshore
wind farms that generate energy sent to the grid through
several HVDC transmission lines. The results show that as the energy
generation changes due to wind changes, the grid topology
must be reconfigured in order to achieve the maximum efficiency.
Doing this reconfiguration, power savings around 18–19% could be achieved
2024-01-17T15:00:53Z
2024-01-17T15:00:53Z
2017-05-26
2024-01-15T14:19:59Z
info:eu-repo/semantics/article
I. Sanz, M. Moranchel, J. Moriano, F. J. Rodríguez and S. Fernández, "Reconfiguration Algorithm to Reduce Power Losses in Offshore HVDC Transmission Lines," in IEEE Transactions on Power Electronics, vol. 33, no. 4, pp. 3034-3043, April 2018
0885-8993
http://hdl.handle.net/10017/59574
10.1109/TPEL.2017.2709259
AR/0000026623
I. Sanz, M. Moranchel, J. Moriano, F. J. Rodríguez and S. Fernández, "Reconfiguration Algorithm to Reduce Power Losses in Offshore HVDC Transmission Lines," in IEEE Transactions on Power Electronics, vol. 33, no. 4, pp. 3034-3043, April 2018
33
3043
4
3034
eng
https://doi.org/10.1109/TPEL.2017.2709259
CONPOSITE (ENE2014-57760-C2-2-R Ministerio de Economía y Competitividad) y PRICAM (S2013/ICE-2933 Consejería de Educación, Juventud y Deporte. Comunidad de Madrid)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© The Authors
IEEE
oai:ebuah.uah.es:10017/603622024-02-05T09:26:49Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-04T19:01:49Z
urn:hdl:10017/60362
Multiple-Input-Single-Output prediction models of crowd dynamics for Model Predictive Control (MPC) of crowd evacuations
Paricio García, Álvaro
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Controlled evacuation
Pedestrian flow
Crowd dynamics
System identification
State-space model
Input¿output model
Prediction model
Predicting crowd dynamics in real-time may allow the design of adaptive pedestrian flow control mechanisms that prioritize attendees? safety and overall experience. Single-Input-SingleOutput (SISO) AutoRegresive eXogenous (ARX) prediction models of crowd dynamics have been effectively used in Linear Model Predictive Controllers (MPC) that adaptively regulate the movement of people to avoid overcrowding. However, an open research question is whether Multiple-Input, State-space, and Nonlinear modeling approaches may improve MPC control performance through better prediction capabilities. This paper considers a simulated controlled evacuation scenario, where evacuees in a long corridor dynamically receive speed instructions to modulate congestion at the exits. We aim to investigate Multiple-Input-Single-Output (MISO) prediction models such that the inputs are the control action (speed recommendation) and pedestrian flow measurement, and the output is the local density of the pedestrian outflow. State-space and Input?output MISO models, linear and neural, are identified using a datadriven approach in which input?output datasets are generated from strategically designed microscopic evacuation simulations. Different estimation algorithms, including the subspace method, prediction error minimization, and regularized AutoRegressive eXogenous (ARX) model reduction, are evaluated and compared. Finally, to investigate the importance of measuring and modeling the pedestrian inflow, the case in which the models? structure is defined as a Single-Input-Single-Output (SISO) system has been explored, where the pedestrian inflow is considered an unmeasured input disturbance. This study has important implications for the design of more effective MPC controllers for regulating pedestrian flows. We found that the prediction error minimization algorithm performs best and that nonlinear state-space modeling does not improve prediction performance. The study suggests that modeling the inner state of the evacuation process through a state-space model positively influences predicting system dynamics. Also, modeling pedestrian inflow improves prediction performance from a predefined prediction horizon value. Overall, linear state-space models have been deemed the most suitable option in corridor-type scenarios
2024-02-04T19:01:49Z
2024-02-04T19:01:49Z
2023-09-04
2024-02-02T11:55:04Z
info:eu-repo/semantics/article
Miguel A. Lopez-Carmona, Alvaro Paricio Garcia,
Multiple-Input-Single-Output prediction models of crowd dynamics for Model Predictive Control (MPC) of crowd evacuations, Transportation Research Part C: Emerging Technologies, Volume 154, 2023, 104268
0968-090X
http://hdl.handle.net/10017/60362
10.1016/j.trc.2023.104268
AR/0000046217
Transportation Research Part C: Emerging Technologies
154
104268
eng
https://doi.org/10.1016/j.trc.2023.104268
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2023 The Author(s)
Elsevier
oai:ebuah.uah.es:10017/597712024-03-22T17:23:28Zcom_10017_149com_10017_17761com_10017_17741com_10017_8415col_10017_150col_10017_49348
urn:hdl:10017/59771
Testing predictive automated driving systems: lessons learned and future recommendations
Fernández Llorca, David
Sotelo Vázquez, Miguel Ángel
Parra Alonso, Ignacio
Izquierdo Gonzalo, Rubén
Salinas Maldonado, Carlota
Alonso Ruiz, Javier
Universidad de Alcalá. Departamento de Automática
Testing
Vehicle safety
Road traffic
Complexity theory
Behavioral sciences
Certification
Autonomous vehicles
Advanced driver assistance systems
Conventional vehicles are certified through classical approaches, where different physical certification tests are set up on test tracks to assess the required safety levels. These approaches are well suited for vehicles with limited complexity and limited interactions with other entities as last-second resources. However, these approaches do not allow the evaluation of safety with real behaviors for critical and edge cases nor the evaluation of the ability to anticipate them in the mid or long term. This is particularly relevant for automated and autonomous driving functions that make use of advanced predictive systems to anticipate future actions and motions to be considered in the path planning layer. In this article, we present and analyze the results of physical tests on the proving grounds of several predictive systems in automated driving functions developed within the framework of the BRidging Gaps for the Adoption of Automated VEhicles (BRAVE) project. Based on our experience in testing predictive automated driving functions, we identify the main limitations of current physical testing approaches when dealing with predictive systems, analyze the main challenges ahead, and provide a set of practical actions and recommendations to consider in future physical testing procedures for automated and autonomous driving functions.
2024-01-23T09:13:11Z
2022-05-20
2024-01-22T08:42:17Z
2024-05-25
info:eu-repo/semantics/article
R. I. Gonzalo, C. S. Maldonado, J. A. Ruiz, I. P. Alonso, D. F. Llorca and M. Á. Sotelo, "Testing Predictive Automated Driving Systems: Lessons Learned and Future Recommendations," in IEEE Intelligent Transportation Systems Magazine, vol. 14, no. 6, pp. 77-93, Nov.-Dec. 2022.
1939-1390
http://hdl.handle.net/10017/59771
10.1109/MITS.2022.3170649
AR/0000042606
IEEE Intelligent Transportation Systems Magazine
14
93
77
eng
https://doi.org/10.1109/MITS.2022.3170649
info:eu-repo/grantAgreement/CAM//S2018%2FEMT-4362/SEGURIDAD DE VEHÍCULOS PARA UNA MOVILIDAD INTELIGENTE, SOSTENIBLE, SEGURA E INTEGRADORA/SEGVAUTO 4.0-CM
info:eu-repo/grantAgreement/EC/H2020/723021/BRIDGING GAPS FOR THE ADOPTION OF AUTOMATED VEHICLES/BRAVE
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2022 IEEE
oai:ebuah.uah.es:10017/592192024-01-10T01:16:28Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-09T18:36:21Z
urn:hdl:10017/59219
Unfolding using deep learning and its application on pulse height analysis and pile-up management
Regadío Carretero, Alberto
Esteban, Luis
Sánchez Prieto, Sebastián
Universidad de Alcalá. Departamento de Automática
Digital pulse processing
Instrumentation
Unfolding
Pile-up
Deep learning
Neural networks
Traditionally, electronics for pulse processing can be modeled as linear transfer functions. In contrast, due to the fact that artificial Neural Networks (NNs) are generally non-linear systems, their behavior against noise is significantly different as in linear systems. We take advantage of this non-linearity to achieve acceptable Signal-to-Noise Ratios (SNR) with a extremely short shaping time. This article shows an approach to a concrete NN named U-net as pulse shaper. It filters the pulses and return them unfolded solving the pile-up problem, and even estimates the height of the pulses when there has been saturation in the detector. In this article, the NN architecture and results using simulated pulses and real pulses from scintillators are shown. The results clearly show the effectiveness of the approach.
2024-01-09T18:36:21Z
2024-01-09T18:36:21Z
2021-07-21
2024-01-09T18:36:04Z
info:eu-repo/semantics/article
Regadío Carretero, A., Esteban, L. & Sánchez Prieto, S. 2021, “Unfolding using deep learning and its application on pulse height analysis and pile-up management”, Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, vol. 1005, art. no. 165403.
0168-9002
http://hdl.handle.net/10017/59219
10.1016/j.nima.2021.165403
AR/0000044339
Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
1005
eng
https://doi.org/10.1016/j.nima.2021.165403
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 Elsevier
Elsevier
oai:ebuah.uah.es:10017/602032024-02-01T01:16:22Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-31T17:52:40Z
urn:hdl:10017/60203
Extended floating car data system: experimental results and application for a hybrid route level of service
Vinagre Díaz, Juan José
Fernández Llorca, David
Rodriguez Gonzalez, Ana Belen
Quintero Mínguez, Raúl
Llamazares Llamazares, Ángel
Sotelo Vázquez, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Controller are network (CAN) bus
Extended floating car data (FCD)
Global Positioning System (GPS)
Level of service
Stereo vision
This paper presents the results of a set of extensive experiments carried out under both daytime and nighttime real traffic conditions. The data were captured using an enhanced or extended Floating Car Data system (xFCD) that includes a stereo vision sensor for detecting the local traffic ahead. The collected information is then used to propose a novel approach to the level-of-service (LOS) calculation. This calculation uses information from both the xFCD and the magnetic loops deployed in the infrastructure to construct a speed/occupancy hybrid plane that characterizes the traffic state of a continuous route. In the xFCD system, the detection component implies the use of previously developed monocular approaches in combination with new stereo vision algorithms that add robustness to the detection and increase the accuracy of the measurements corresponding to relative distance and speed. In addition to the stereo pair of cameras, the vehicle is equipped with a low-cost Global Positioning System (GPS) and an electronic device for controller-area-network bus interfacing. The xFCD system has been tested in a 198-min sequence recorded in real traffic scenarios under different weather and illumination conditions. The results are promising and demonstrate that the xFCD system is ready for being used as a source of traffic status information. As an indicative example of the developed xFCD system, we construct a novel route LOS calculation that combines hybrid information about speed and occupancy from both the xFCD system and the magnetic loops in the infrastructure.
2024-01-31T17:52:40Z
2024-01-31T17:52:40Z
2012-03-01
2024-01-31T17:52:02Z
info:eu-repo/semantics/article
Vinagre Díaz, J.J., Fernández Llorca, D., Rodríguez González, A.B., Quintero Mínguez, R., Llamazares Llamazares, A. & Sotelo Vázquez, M.A. 2012, “Extended floating car data system: experimental results and application for a hybrid route level of service”, IEEE Transactions on Intelligent Transportation Systems, vol. 13, no. 1, pp. 25-35.
1524-9050
http://hdl.handle.net/10017/60203
10.1109/TITS.2011.2178834
AR/0000014723
IEEE Transactions on Intelligent Transportation Systems
13
35
1
25
eng
https://doi.org/10.1109/TITS.2011.2178834
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2012 IEEE
IEEE
oai:ebuah.uah.es:10017/596762024-02-22T12:22:51Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-19T11:16:04Z
urn:hdl:10017/59676
Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management
Cruz Piris, Luis De La
Rivera Pinto, Diego
Fernández Melián, Susel
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
One of the biggest challenges in modern societies is to solve vehicular traffic problems.
Sensor networks in traffic environments have contributed to improving the decision-making process
of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness
of these systems is in the deployment of sensors to provide accurate information about the traffic.
Our proposal is using the centrality measurement of a graph as a base to locate the best locations for
sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we
define a Multi-Agent Systems composed of three types of agents: traffic light management agents,
traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal
of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate
our solution, we have developed the needed elements for modelling the sensors and agents in the
simulation environment. We have carried out experiments using the Simulation of Urban MObility
(SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic
scenario. The obtained results show that our proposal allows to reduce the sensor network while
still obtaining relevant information to have a global view of the environment. Finally, regarding the
Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve
other existing solutions such as conventional traffic light management systems (static or dynamic) in
terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the
sensor network.
2024-01-19T11:16:04Z
2024-01-19T11:16:04Z
2018-02-02
2024-01-15T14:27:25Z
info:eu-repo/semantics/article
Cruz-Piris, L.; Rivera, D.; Fernandez, S.; Marsa-Maestre, I. Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management. Sensors 2018, 18, 435.
1424-8220
http://hdl.handle.net/10017/59676
10.3390/s18020435
AR/0000027480
Sensors
18
2
eng
https://doi.org/10.3390/s18020435
info:eu-repo/grantAgreement/UAH//UAH-AE-2017-3/ES
info:eu-repo/grantAgreement/MINECO//TIN2016-80622-P/ES/DYNAMIC NETWORK AGREEMENT: NEGOCIACIONES ESTRUCTURALES EN REDES COMPLEJAS
info:eu-repo/grantAgreement/AEI//TIN2014-61627-EXP/ES/DIVIDE AND NOT CONQUER - COMPORTAMIENTOS EMERGENTES EN REDES COMPLEJAS EGOISTAS
info:eu-repo/grantAgreement/MINECO//TEC2013-45183-R/ES/INTELIGENCIA COLECTIVA PARA LA NAVEGACION INTELIGENTE DE TRAFICO VEHICULAR
info:eu-repo/grantAgreement/UAH//CCG2016%2FEXP-048/ES/RESILIENCIA EMERGENTE ADAPTATIVA EN INFRAESTRUCTURAS CRÍTICAS DE RED/REACT
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2018 The authors
oai:ebuah.uah.es:10017/592162024-01-10T01:16:27Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964col_10017_150col_10017_292
2024-01-09T17:19:07Z
urn:hdl:10017/59216
MITO: a new directional muon telescope
Ayuso de Gregorio, Sindulfo
Blanco Ávalos, Juan José
García Tejedor, Juan Ignacio
Gómez Herrero, Raúl
Vrublevskyy, Ivan
García Población, Óscar
Medina Doctor, José
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
Cosmic ray
Instrumentation
Muon telesope
Muon telescopes are instruments devoted to the observation of muons. They are produced in the atmosphere by means of the interaction of cosmic ray and solar energetic particles with atmospheric nuclei. Muons, as cosmic rays that produce them, present non uniform arrival directions and temporal variations at ground level and, along certain observation directions, could forecast the arrival of interplanetary coronal mass ejections (ICMEs) at the Earth, even earlier than neutron monitors. However, multidirectional muon telescopes are not easily affordable because of their complexity, size and cost. In this work, we present the muon impact tracer and observer (MITO) design concept. It is composed of only two stacked scintillators (1 m2) with an optional lead layer that allows the filtering of unwanted particles depending on the type of application. In the case presented here, a 10 cm lead layer corresponding to the lead of a 3NM64 neutron monitor around which MITO has been built. Eight photomultipliers (PMTs) gather the light emerging from the four lateral sides of the scintillators. MITO has been conceived not only to achieve muon flux registering, but also to register muon arrival directions through the capture and analysis of multiple PMT pulse height data. The number of scintillators and electronic components is reduced, simplifying its design and construction and reducing complexity, volume, weight, power consumption and cost, and thus, achieving a reasonable performance-cost ratio in comparison to other directional telescopes based on two-layer matrices. The first prototype was shipped from Spain to Antarctica where it is now recording data. Some preliminary results are also presented.
2024-01-09T17:19:07Z
2024-01-09T17:19:07Z
2021-02-12
2024-01-09T17:18:48Z
info:eu-repo/semantics/article
Ayuso de Gregorio, S. [et al.] 2021, "MITO: a new directional muon telescope", Journal of Space Weather and Space Climate, vol. 11, pp. 1-16.
http://hdl.handle.net/10017/59216
10.1051/swsc/2020079
AR/0000037047
Journal of Space Weather and Space Climate
11
16
1
2115-7251
eng
https://doi.org/10.1051/swsc/2020079
info:eu-repo/grantAgreement/AEI//CTM2016-77325-C2-1-P/ES/OBSERVATORIO DE RAYOS COSMICOS ANTARTICOS/ORCA
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-107806GB-I00/ES/ORCA, ORCT, MINICALMA Y CALMA. OBSERVANDO DE LA INTERACCION SOL-TIERRA Y EL ENTORNO TERRESTRE. CONTRIBUCION ESPAÑOLA A LA NEUTRON MONITOR DATA BASE/
http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
Attribution 4.0 International (CC BY 4.0)
EDP Sciences
oai:ebuah.uah.es:10017/596102024-02-28T06:50:23Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-18T09:47:26Z
urn:hdl:10017/59610
Scalable and Reliable Data Center Networks by Combining Source Routing and Automatic Labelling
Rojas Sánchez, Elisa
Álvarez Horcajo, Joaquín
Martinez Yelmo, Isaias
Arco Rodríguez, José Manuel
Briso-Montiano Marco, Miguel
Universidad de Alcalá. Departamento de Automática
Today, most user services are based on cloud computing, which leverages data center networks (DCNs) to efficiently route its communications. These networks process high volumes of traffic and require exhaustive failure management. Furthermore, expanding these networks is usually costly due to their constraint designs. In this article, we present enhanced Torii (eTorii), an automatic, scalable, reliable and flexible multipath routing protocol that aims to accomplish the demanding requirements of DCNs. We prove that eTorii is, by definition, applicable to a wide range of DCNs or any other type of hierarchical network and able to route with minimum forwarding table size and capable of rerouting around failed links on-the-fly with almost zero cost. A proof of concept of the eTorii protocol has been implemented using the Ryu SDN controller and the Mininet framework. Its evaluation shows that eTorii balances the load and preserves high-bandwidth utilization. Thus, it optimizes the use of DCN resources in comparison to other approaches, such as Equal-Cost Multi-Path (ECMP).
2024-01-18T09:47:26Z
2024-01-18T09:47:26Z
2021-06-18
2024-01-12T11:37:48Z
info:eu-repo/semantics/article
Rojas, E.; Alvarez-Horcajo, J.; Martinez-Yelmo, I.; Arco, J.M.; Briso-Montiano, M. Scalable and Reliable Data Center Networks by Combining Source Routing and Automatic Labelling. Network 2021, 1, 11-27.
2673-8732
http://hdl.handle.net/10017/59610
https://doi.org/10.3390/network1010003
AR/0000037448
Network
27
2021
11
en
https:/doi.org/10.3390/network1010003
SBPLY/19/180501/000324/IRIS-JCCM (Junta de Comunidades de Castilla-La Mancha), CM/JIN/2019-039/IRIS-CM (Comunidad de Madrid), S2018/TCS-4496/TAPIR-CM (Comunidad de Madrid)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
MDPI
oai:ebuah.uah.es:10017/600722024-01-31T01:16:21Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-30T11:05:43Z
urn:hdl:10017/60072
Analysis of competence acquisition in a flipped classroom approach
Estriégana Valdehita, Rosa María
Medina Merodio, José Amelio
Barchino Plata, Roberto
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Flipped classroom
Generic competences
Learning outcomes
Online learning environments
Structural equation modeling
Higher Education Institutions are interested in describing qualifications in terms of competences and abilities that prepare graduates best for their future professional and social life. This study aims to analyze students? acquisition of competences, on one hand, inside the classroom using a flipped learning approach, on the other hand, outside the classroom through students? self-study using information and communication technology resources such as teaching videos, virtual labs, simulations, or game-based learning. The study also wants to shed light on the relationship between the achieved competences and the learning outcomes. The analysis was based on the data collected from a core subject in the first year of the Computer Engineering and Information Systems degree courses. The answers to an online survey (n?=?285) were examined by using a structural equation model with 13 observed and seven latent variables. The results obtained show that the learning environment created inside and outside the classroom plays a key role in the acquisition and development of the three competences analyzed: systematic, personal, and cooperative. Our findings also suggest that competence or skills acquisition, despite being considered one of the main issues in the higher education qualifications framework, does not exactly match the academic results measured during the assessment process.
2024-01-30T11:05:43Z
2024-01-30T11:05:43Z
2018-09-10
2024-01-30T09:56:13Z
info:eu-repo/semantics/article
Estriegana R, Medina-Merodio J-A, Barchino R. Analysis of competence acquisition in a flipped classroom approach. Comput Appl Eng Educ. 2019; 27: 49–64.
1061-3773
http://hdl.handle.net/10017/60072
10.1002/cae.22056
AR/0000030158
Computer Applications in Engineering Education
27
64
1
49
eng
https://doi.org/10.1002/cae.22056
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2018 Wiley Periodicals
Wiley
oai:ebuah.uah.es:10017/595472024-01-18T01:15:46Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
urn:hdl:10017/59547
Analyzing larger sample sets with rapid methods: Incomplete-block designs with free-sorting and free-linking tasks
Ac-Pangan , Marlon
Tejedor Romero, Marino
Swatko , Kyra
Orden Martín, David
Lahne , Jacob
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas
As rapid, holistic methods for similarity and description?such as sorting and projective mapping?have grown in popularity, a limiting factor is the number of samples that can be presented to subjects: more than 25 food samples decreases the quality and stability of results. While incomplete-block designs could address this, their use has not been developed for these holistic methods. In this paper we present an empirical investigation into the use of incomplete block designs with free sorting and the newer free linking. We compare these two methods because while their results are comparable, the cognitive tasks are different, and thus their suitability for incomplete-block designs may differ. We evaluated the effects of incomplete-block designs in two studies. In Study 1, 20 subjects evaluated 6/10 chocolate bars by free linking in an incomplete-block design, with each subject completing 2 blocks; results were compared to a complete-block evaluation of the 10 bars by free sorting and free linking. In Study 2, a total of subjects evaluated 62 terms from a chocolate flavor-wheel in 3 conditions (between subjects): free sorting with complete blocks (N = 30, all 62 terms) and free sorting (N = 30) or free linking (N = 30) with 3 incomplete blocks of 16/62 terms. We introduce a novel method to evaluate stability for the incomplete-block designs that we call ?pairwise simulation.? From Study 1, we find that pairwise simulation provides adequate stability estimates and that, with sufficient pairwise cooccurrences, free linking with incomplete blocks produces results that are comparable to free sorting or linking with complete blocks. From Study 2, we demonstrate that free linking with incomplete blocks can produce high quality results from a large sample set, maintaining the increased discrimination capacity that marks free linking in general, and that with incomplete blocks, free linking is likely to be more stable than free sorting. This research demonstrates that incomplete-block designs can be used with free linking, and also provides a new, effective method through pairwise simulation for evaluating stability with incomplete-block designs, which cannot be resampled using standard bootstrapping approaches.
2024-01-17T11:34:49Z
2023-12-28
2024-01-16T10:44:05Z
2024-12-28
info:eu-repo/semantics/article
Food Quality and Preference, 2023, v. 113, n. , p. 105083-
0950-3293
http://hdl.handle.net/10017/59547
10.1016/j.foodqual.2023.105083
AR/0000045738
Food Quality and Preference
113
105083
eng
https://doi.org/10.1016/j.foodqual.2023.105083
PID2019-104129GB-I00
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/embargoedAccess
Elsevier
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/605942024-02-09T01:16:49Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-08T09:15:53Z
urn:hdl:10017/60594
LED Wristbands for Cell-Based Crowd Evacuation: An Adaptive Exit-Choice Guidance System Architecture
Paricio García, Álvaro
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Crowd evacuation
LED wristbands
Behavioral optimization
Exit-choice decisions
Simulation-optimization modeling
Cell-based evacuation
Cell-based crowd evacuation systems provide adaptive or static exit-choice indications that favor a coordinated group dynamic, improving evacuation time and safety. While a great effort has been made to modeling its control logic by assuming an ideal communication and positioning infrastructure, the architectural dimension and the influence of pedestrian positioning uncertainty have been largely overlooked. In our previous research, a cell-based crowd evacuation system (CellEVAC) was proposed that dynamically allocates exit gates to pedestrians in a cell-based pedestrian positioning infrastructure. This system provides optimal exit-choice indications through color-based indications and a control logic module built upon an optimized discrete-choice model. Here, we investigate how location-aware technologies and wearable devices can be used for a realistic deployment of CellEVAC. We consider a simulated real evacuation scenario (Madrid Arena) and propose a system architecture for CellEVAC that includes: a controller node, a radio-controlled light-emitting diode (LED) wristband subsystem, and a cell-node network equipped with active Radio Frequency Identification (RFID) devices. These subsystems coordinate to provide control, display, and positioning capabilities. We quantitatively study the sensitivity of evacuation time and safety to uncertainty in the positioning system. Results showed that CellEVAC was operational within a limited range of positioning uncertainty. Further analyses revealed that reprogramming the control logic module through a simulation optimization process, simulating the positioning system?s expected uncertainty level, improved the CellEVAC performance in scenarios with poor positioning systems.
2024-02-08T09:15:53Z
2024-02-08T09:15:53Z
2020-10-23
2024-02-07T12:55:55Z
info:eu-repo/semantics/article
Lopez-Carmona, M.A.; Paricio-Garcia, A. LED Wristbands for Cell-Based Crowd Evacuation: An Adaptive Exit-Choice Guidance System Architecture. Sensors 2020, 20, 6038.
1424-8220
http://hdl.handle.net/10017/60594
10.3390/s20216038
AR/0000046276
Sensors
20
eng
https://doi.org/10.3390/s20216038
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2019 The authors
MDPI
oai:ebuah.uah.es:10017/551452023-12-14T15:41:50Zcom_10017_149com_10017_17761com_10017_17741com_10017_248com_10017_281com_10017_17964col_10017_150col_10017_304col_10017_282
2023-01-10T14:48:47Z
urn:hdl:10017/55145
Determining the asymptotic family of an implicit curve
Campo Montalvo, Elena
Fernández De Sevilla Vellón, María De Los Ángeles
Magdalena Benedicto, Rafael
Pérez Díaz, Sonia
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Matemáticas
Implicit algebraic plane curve
Parametric plane curve
Infinity branches
Asymptotes
Perfect curves
Approaching curves
In this paper we deal with the following problem: given an algebraic plane curve C,
implicitly defined, we determine its “asymptotic family”, that is, the set of algebraic curves
that have the same asymptotic behavior as C.
2023-01-10T14:48:47Z
2023-01-10T14:48:47Z
2022-10-01
2023-01-10T14:48:28Z
info:eu-repo/semantics/article
Campo Montalvo, E., Fernández de Sevilla, M., Magdaleno Benedicto, R. & Pérez Díaz, S. 2022, "Determining the asymptotic family of an implicit curve", Computer Aided Geometric Design, vol. 98, art. no. 102146.
0167-8396
http://hdl.handle.net/10017/55145
10.1016/j.cagd.2022.102146
AR/0000042014
Computer Aided Geometric Design
98
eng
https://doi.org/10.1016/j.cagd.2022.102146
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-113192GB-I00/ES/VISUALIZACION MATEMATICA: FUNDAMENTOS, ALGORITMOS Y APLICACIONES/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica, Técnica y de Innovación 2021-2023/PID2021-127946OB-100
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/603472024-02-29T18:55:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_8415col_10017_150col_10017_49348
2024-02-02T18:47:44Z
urn:hdl:10017/60347
CAPformer: pedestrian crossing action prediction using transformer
Lorenzo Diaz, Javier
Parra Alonso, Ignacio
Izquierdo Gonzalo, Rubén
Ballardini , Augusto Luis
Hernández Saz, Álvaro
Fernández Llorca, David
Sotelo Vázquez, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Pedestrian
Prediction
Action classification
Transformer
Deep learning
Autonomous vehicles
Anticipating pedestrian crossing behavior in urban scenarios is a challenging task for autonomous vehicles. Early this year, a benchmark comprising JAAD and PIE datasets have been released. In the benchmark, several state-of-the-art methods have been ranked. However, most of the ranked temporal models rely on recurrent architectures. In our case, we propose, as far as we are concerned, the first self-attention alternative, based on transformer architecture, which has had enormous success in natural language processing (NLP) and recently in computer vision. Our architecture is composed of various branches which fuse video and kinematic data. The video branch is based on two possible architectures: RubiksNet and TimeSformer. The kinematic branch is based on different configurations of transformer encoder. Several experiments have been performed mainly focusing on pre-processing input data, highlighting problems with two kinematic data sources: pose keypoints and ego-vehicle speed. Our proposed model results are comparable to PCPA, the best performing model in the benchmark reaching an F1 Score of nearly 0.78 against 0.77. Furthermore, by using only bounding box coordinates and image data, our model surpasses PCPA by a larger margin (F1=0.75 vs. F1=0.72). Our model has proven to be a valid alternative to recurrent architectures, providing advantages such as parallelization and whole sequence processing, learning relationships between samples not possible with recurrent architectures.
2024-02-02T18:47:44Z
2024-02-02T18:47:44Z
2021-08-24
2024-02-02T18:47:21Z
info:eu-repo/semantics/article
Lorenzo Díaz, J. [et al.], 2021, "CAPformer: pedestrian crossing action prediction using transformer", Sensors, vol. 21, no. 17, pp. 1-22.
1424-8220
http://hdl.handle.net/10017/60347
10.3390/s21175694
AR/0000037594
Sensors
21
22
17
1
eng
https://doi.org/10.3390/s21175694
info:eu-repo/grantAgreement/EC/H2020/754382/EU/GOT Energy Talent/GET
DPI2017-90035-R
S2018/EMT-4362 SEGVAUTO 4.0-CM
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
MDPI
oai:ebuah.uah.es:10017/592102024-01-10T01:16:26Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964col_10017_150col_10017_292
2024-01-09T15:38:07Z
urn:hdl:10017/59210
Trajectory determination of muons using scintillators and a novel self-organizative map
Regadío Carretero, Alberto
García Tejedor, Juan Ignacio
Ayuso de Gregorio, Sindulfo
García Población, Óscar
Blanco Ávalos, Juan José
Sánchez Prieto, Sebastián
Rodríguez Polo, Óscar
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
Digital pulse processing
Instrumentation
Muon detector
Scintillator
Self-organizative mapNeural network
Neural network
In this work we propose a method for the determination of the impact point of muons in scintillators using a novel type of self-organizative maps called Self-Equalizing Map (SEM) and comparing the relative pulse height obtained by four photomultipliers (PMTs) at each scintillator. Using two 1 m${^2}$ scintillators and calculating the impact point in both of them, we can also estimate the angle of incidence of these particles. This method has been specifically designed for a muon telescope called MITO (Muon Impact Tracer and Observer) which is part of the ORCA (Antarctic Cosmic Ray Observatory). Data from tests using MITO in Livingston Island, Antarctica have been used to evaluate the feasibility of this method. The obtained directions have been found to be consistent with the expected incident directions of atmospheric muons produced by the interaction between CRs and atmospheric atoms.
2024-01-09T15:38:07Z
2024-01-09T15:38:07Z
2020-09-01
2024-01-09T15:37:22Z
info:eu-repo/semantics/article
Regadío Carretero, A. [et al.]. 2020, “Trajectory determination of muons using scintillators and a novel self-organizative map”, Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, vol. 973, art. no. 164166.
0168-9002
http://hdl.handle.net/10017/59210
10.1016/j.nima.2020.164166
AR/0000034470
Nuclear Instruments & Methods in Physics Research. Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
973
eng
https://doi.org/10.1016/j.nima.2020.164166
info:eu-repo/grantAgreement/AEI//CTM2016-77325-C2-1-P/ES/OBSERVATORIO DE RAYOS COSMICOS ANTARTICOS/ORCA
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2020 Elsevier
Elsevier
oai:ebuah.uah.es:10017/599792024-01-27T01:16:50Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-26T11:55:11Z
urn:hdl:10017/59979
E-learning Acceptance in Face-to-Face Universities due to COVID-19
Estriégana Valdehita, Rosa María
Medina Merodio, José Amelio
Robina Ramírez, Rafael
Barchino Plata, Roberto
De Pablos Heredero, Carmen
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Online learning
Uncertainty
Satisfaction
Technology acceptance
COVID-19
The Covid-19 pandemic has led unprecedented shifts to higher education worldwide. This sudden educational change could accelerate the acceptance of online learning, or conversely, increase its rejection. The purpose of this experimental study is to examine students? acceptance and intention for continued use of online learning, which were abruptly adopted in face-to-face universities due to Covid-19. To this end, the responses of students of 3 face-to-face universities (N = 194) to an online questionnaire were analyzed using structural equation modeling. The study was based on the technology acceptance model (TAM) but included other relevant factors, such as the emotional factor, feelings of uncertainty, security in the e-learning system and satisfaction with educational technology. The results indicate that uncertainty due to Covid-19, the emotional factor and security do not significantly affect the students? intention to use e-learning systems. However, these factors have a significant impact on students' perception of satisfaction, which is a decisive factor that positively influences the process of the adoption of e-learning systems. This study discusses noteworthy theoretical and practical implications for education that will help teachers and universities in their decision making towards the digital transformation process.
2024-01-26T11:55:11Z
2024-01-26T11:55:11Z
2023-12-08
2024-01-25T12:01:39Z
info:eu-repo/semantics/article
Estriegana, R., Medina-Merodio, J.-A., Robina-Ramírez, R., Barchino, R., & De-Pablos-Heredero, C. (2023). E-learning Acceptance in Face-to-Face Universities due to COVID-19. SAGE Open, 13(4)
2158-2440
http://hdl.handle.net/10017/59979
10.1177/21582440231214873
AR/0000046210
SAGE Open
13
4
eng
https://doi.org/doi.org/10.1177/21582440231214873
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2023 The Authors
Sage
oai:ebuah.uah.es:10017/605952024-02-09T01:16:50Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-08T09:19:38Z
urn:hdl:10017/60595
Urban traffic routing using weighted multi-map strategies
Paricio García, Álvaro
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Dynamic traffic assignment
Traffic control
Vehicle routing
Traffic big data
Decision making
Multi-agent systems
Multi-map routing
TWM
Traffic simulationen
Urban traffic routing has to deal with individual mobility and collective wellness considering citizens, multi-modal transport, and fleet traffic with conflicting interests such as electric vehicles, local distribution, public transport, and private vehicles. Different interests, goals, and regulations, suggest the development of new multi-objective routing mechanisms which may improve traffic flow. In this work, Traffic Weighted Multi-Maps (TWM) is presented as a novel traffic routing mechanism based on the strategical generation and distribution of complementary cost maps for traffic fleets, oriented towards the application of differentiated traffic planning and control policies. TWM is built upon a centralized control architecture, where a Traffic Management Center generates and distributes customized cost maps of the road network. These maps are used individually to calculate routes. In this research, we present the TWM theoretical model and experimental results based on microscopic simulations over a real city traffic network under multiple scenarios, including traffic incidents management. Experimental evaluation takes into account driver?s adherence to the system and considers a multi-objective analysis both for the global network parameters (congestion, travel time, and route length) and for the subjective driving experience. Experimental results deliver performance improvements from 20% to 50%. TWM is fully compatible with existing traffic routing systems and has promising future evolution applying new algorithms, policies and network profiles.
2024-02-08T09:19:38Z
2024-02-08T09:19:38Z
2019-10-31
2024-02-07T14:45:01Z
info:eu-repo/semantics/article
A. Paricio and M. A. Lopez-Carmona, "Urban Traffic Routing Using Weighted Multi-Map Strategies," in IEEE Access, vol. 7, pp. 153086-153101, 2019.
2169-3536
http://hdl.handle.net/10017/60595
10.1109/ACCESS.2019.2947699
AR/0000046277
IEEE Access
7
153101
153086
eng
https://doi.org/10.1109/ACCESS.2019.2947699
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2019 The authors
IEEE
oai:ebuah.uah.es:10017/596192024-03-22T16:26:46Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-18T11:30:34Z
urn:hdl:10017/59619
Fuzzy ontology-based system for driver behavior classification
Fernández Melián, Susel
Ito, Takayuki
Cruz Piris, Luis De La
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Intelligent transportation systems encompass a series of technologies and applications that exchange information to improve road traffic and avoid accidents. According to statistics, some studies argue that human mistakes cause most road accidents worldwide. For this reason, it is essential to model driver behavior to improve road safety. This paper presents a Fuzzy RuleBased System for driver classification into different profiles considering their behavior. The system?s knowledge base includes an ontology and a set of driving rules. The ontology models the main entities related to driver behavior and their relationships with the traffic environment. The driving rules help the inference system to make decisions in different situations according to traffic regulations. The classification system has been integrated on an intelligent transportation architecture. Considering the user's driving style, the driving assistance system sends them recommendations, such as adjusting speed or choosing alternative routes, allowing them to prevent or mitigate negative transportation events, such as road crashes or traffic jams. We carry out a set of experiments in order to test the expressiveness of the ontology along with the effectiveness of the overall classification system in different simulated traffic situations. The results of the experiments show that the ontology is expressive enough to model the knowledge of the proposed traffic scenarios, with an F1 score of 0.9. In addition, the system allows proper classification of the drivers? behavior, with an F1 score of 0.84, outperforming Random Forest and Naive Bayes classifiers. In the simulation experiments, we observe that most of the drivers who are recommended an alternative route experience an average time gain of 66.4%, showing the utility of the proposal.
2024-01-18T11:30:34Z
2024-01-18T11:30:34Z
2022-10-19
2024-01-15T15:09:13Z
info:eu-repo/semantics/article
Fernandez, S.; Ito, T.; Cruz-Piris, L.; Marsa-Maestre, I. Fuzzy Ontology-Based System for Driver Behavior Classification. Sensors 2022, v. 22, n. 20, 7954.
1424-8220
http://hdl.handle.net/10017/59619
10.3390/s22207954
AR/0000041957
Sensors
22
19
20
1
eng
https://doi.org/10.3390/s22207954
info:eu-repo/grantAgreement/UAH//CCG2020%2FIA-041
info:eu-repo/grantAgreement/UAH//PIUAH22%2FIA-062
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2022 The authors
MDPI
oai:ebuah.uah.es:10017/599772024-01-27T01:16:52Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-26T11:30:19Z
urn:hdl:10017/59977
Student acceptance of virtual laboratory and practical work: An extension of the technology acceptance model
Estriégana Valdehita, Rosa María
Medina Merodio, José Amelio
Barchino Plata, Roberto
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Virtual laboratories
Online practical work
Simulations
Online learning environments
Technology acceptance model
The development of Internet technologies and new ways of sharing information has facilitated the emergence of a variety of elearning scenarios. However, in technological areas such as engineering, where students must carry out hands-on exercises and laboratory work essential for their learning, it is not so easy to design online environments for practicals. The aim of this experimental study was to examine students' acceptance of technology and the process of adopting an online learning environment incorporating web-based resources, such as virtual laboratories, interactive activities, and educational videos, and a game-based learning methodology. To this end, their responses to an online questionnaire (n?=?223) were analyzed using structural equation modeling. The study was based on the technology acceptance model (TAM), but included and assessed other factors such as perceived efficiency, playfulness, and satisfaction, which are not explained by the TAM. Our results confirm that this extension of the TAM provides a useful theoretical model to help understand and explain users' acceptance of an online learning environment incorporating virtual laboratory and practical work. Our results also indicate that efficiency, playfulness, and students' degree of satisfaction are factors that positively influence the original TAM variables and students' acceptance of this technology. Here, we also discuss the significant theoretical and spractical implications for educational use of these web-based resources.
2024-01-26T11:30:19Z
2024-01-26T11:30:19Z
2019-02-02
2024-01-25T11:50:40Z
info:eu-repo/semantics/article
Rosa Estriegana, José-Amelio Medina-Merodio, Roberto Barchino, Student acceptance of virtual laboratory and practical work: An extension of the technology acceptance model, Computers & Education, Volume 135, 2019, Pages 1-14.
0360-1315
http://hdl.handle.net/10017/59977
10.1016/j.compedu.2019.02.010
AR/0000030159
Computers and Education
135
14
1
eng
https://doi.org/10.1016/j.compedu.2019.02.010
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2019 Elsevier
Elsevier
oai:ebuah.uah.es:10017/608892024-02-27T01:17:28Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-26T15:34:55Z
urn:hdl:10017/60889
A comprehensive latency profiling study of the Tofino P4 programmable ASIC-based hardware
Franco, David
Ollora Zaballa, Eder
Zang, Mingyuan
Atutxa, Asier
Sasiain, Jorge
Pruski, Aleksander
Rojas Sánchez, Elisa
Higuero, Marivi
Jacob, Eduardo
Universidad de Alcalá. Departamento de Automática
Software-defined networking
Network programmability
P4
Data plane latency
Machine learning
Network softwarization has significantly evolved since programmable data planes became topical in academia and industry. Programming Protocol-Independent Packet Processors (P4) is a language to define packet forwarding behavior. Forwarding devices that are programmed with the P4 language support a flexible way to define headers, parse graphs, and data plane logic. However, extending the data plane with additional functionalities has an impact on packet data plane latency. For this reason, this paper analyzes the key factors that affect data pane latency to packets processed by the Tofino-based target (Tofino Native Architecture (TNA)), which can be considered the de facto production-ready and P4-programmable Application-Specific Integrated Circuit (ASIC). Our work first provides an extensive set of latency measurements and, afterwards, it includes a set of data plane latency predictions using the model derived from the latency results and machine learning (ML) algorithms. We demonstrate that the PCA-lasso polynomial (PLP) obtains the best results among the algorithms tested. The best-case results show that PLP obtained an accuracy of 98.22% prediction accuracy when considering the parser, deparser, and the control block for traffic running at 10 G/s (SFP+) and 100 G/s (QSFP28). To the best of our knowledge, this is the first work that provides such a comprehensive profiling, including a method to predict data plane latency in production-grade Tofino ASIC-based switching hardware, which could be leveraged to yield accurate latency values prior to investment and deployment.
2024-02-26T15:34:55Z
2024-02-26T15:34:55Z
2024-03-15
2024-02-26T15:34:39Z
info:eu-repo/semantics/article
Franco, D. [et al.], 2024, "A comprehensive latency profiling study of the Tofino P4 programmable ASIC-based hardware", Computer Communications, vol. 218, pp. 14-30.
0140-3664
http://hdl.handle.net/10017/60889
10.1016/j.comcom.2024.01.010
AR/0000047418
Computer Communications
218
30
14
eng
https://doi.org/10.1016/j.comcom.2024.01.010
PID2019-108713RB-C54
PID2020-116361RA-I00
CM/JIN/2021-006
ELKARTEK21/14 KK-2021/00026
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2024 The authors
Elsevier
oai:ebuah.uah.es:10017/588762023-12-15T01:16:32Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964com_10017_36590com_10017_18241col_10017_150col_10017_292col_10017_36591
2023-12-14T17:37:40Z
urn:hdl:10017/58876
First near-relativistic solar electron events observed by EPD onboard Solar Orbiter
Gómez Herrero, Raúl
Espinosa Lara, Francisco
Cernuda Cangas, Ignacio Manuel
Rodríguez-Pacheco Martín, Javier
Prieto Mateo, Manuel
Sánchez Prieto, Sebastián
Carrasco Gallardo, Alberto
Blanco Ávalos, Juan José
Parra Espada, Pablo
Rodríguez Polo, Óscar
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
Acceleration of particles
Sun: particle emission
Sun: activity
Context. Solar Orbiter, launched in February 2020, started its cruise phase in June 2020, in coincidence with its first perihelion at 0.51 au from the Sun. The in situ instruments onboard, including the Energetic Particle Detector (EPD), operate continuously during the cruise phase enabling the observation of solar energetic particles.
Aims. In situ measurements of the first near-relativistic solar electron events observed in July 2020 by EPD are analyzed and the solar origins and the conditions for the interplanetary transport of these particles investigated.
Methods. Electron observations from keV energies to the near-relativistic range were combined with the detection of type III radio bursts and extreme ultraviolet (EUV) observations from multiple spacecraft in order to identify the solar origin of the electron events. Electron anisotropies and timing as well as the plasma and magnetic field environment were evaluated to characterize the interplanetary transport conditions.
Results. All electron events were clearly associated with type III radio bursts. EUV jets were also found in association with all of them except one. A diversity of time profiles and pitch-angle distributions was observed. Different source locations and different magnetic connectivity and transport conditions were likely involved. The July 11 event was also detected by Wind, separated 107 degrees in longitude from Solar Orbiter. For the July 22 event, the Suprathermal Electron and Proton sensor of EPD allowed for us to not only resolve multiple electron injections at low energies, but it also provided an exceptionally high pitch-angle resolution of a very anisotropic beam. This, together with radio observations of local Langmuir waves suggest a very good magnetic connection during the July 22 event. This scenario is challenged by a high-frequency occultation of the type III radio burst and a nominally non-direct connection to the source; therefore, magnetic connectivity requires further investigation.
2023-12-14T17:37:40Z
2023-12-14T17:37:40Z
2021-12-14
2023-12-14T17:37:22Z
info:eu-repo/semantics/article
Gómez Herrero, R. [et al.], 2021, “First near-relativistic solar electron events observed by EPD onboard Solar Orbiter”, Astronomy & Astrophysics, vol. 656, art. no. L3, pp. 1-8.
0004-6361
http://hdl.handle.net/10017/58876
10.1051/0004-6361/202039883
AR/0000040559
Astronomy & Astrophysics
656
8
1
eng
https://doi.org/10.1051/0004-6361/202039883
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/ESP2017-88436-R/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASES D Y E/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104863RB-I00/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASE E, CALIBRACION Y EXPLOTACION DE DATOS/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 ESO
The European Southern Observatory (ESO)
oai:ebuah.uah.es:10017/592482024-01-11T01:17:39Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964com_10017_36590com_10017_18241col_10017_150col_10017_292col_10017_36591
2024-01-10T16:22:25Z
urn:hdl:10017/59248
Cosmic ray observations from Livingston Island
Blanco Ávalos, Juan José
García Tejedor, Juan Ignacio
García Población, Óscar
Ayuso De Gregorio, Sindulfo
López Comazzi, Alejandro Francisco
Vrublevskyy, Ivan
Prieto Mateo, Manuel
Morozova, Anna
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
ORCA, from the Spanish name Observatorio de Rayos Cósmicos Antártico, is a cosmic ray detector devoted to the observation of secondary cosmic rays at Juan Carlos I Spanish Antarctic Base (62° 39′ 46″ S, 60° 23′ 20″ W, 12 m above sea level). ORCA was installed at the beginning of January 2019 after performing a latitudinal survey from Vigo (Spain) to Livingston Island aboard the Sarmiento de Gamboa Research Vessel. ORCA was in commissioning phase from January 2019 to March 2020, being in normal operation mode from March 2020. A vertical cutoff rigidity of 2.37GV has been computed at ORCA location and during the first year of operation, i. e. from March 2020 to March 2021.
ORCA consists of three detectors stacked in a shared structure that maintains the relative distances between the detectors. A muon telescope (ORCM), a neutron monitor without any shielding around (ORCB) and a 3NM64 neutron monitor (ORCA). This configuration allows the measurement of neutron count rates at two different energy thresholds, muon count rate and muon incident directions.
Measurements recorded during the first year of operation and ORCA potential capabilities are shown in this work.
2024-01-10T16:22:25Z
2024-01-10T16:22:25Z
2022-05-01
2024-01-10T16:22:05Z
info:eu-repo/semantics/article
Blanco, J.J. [et al.] 2022, "Cosmic ray observations from Livingston Island", Advances in Space Research, vol. 69, no. 9, pp. 3514-3524.
0273-1177
http://hdl.handle.net/10017/59248
10.1016/j.asr.2022.02.046
AR/0000041207
Advances in Space Research
69
3524
9
3514
eng
https://doi.org/10.1016/j.asr.2022.02.046
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-107806GB-I00/ES/ORCA, ORCT, MINICALMA Y CALMA. OBSERVANDO DE LA INTERACCION SOL-TIERRA Y EL ENTORNO TERRESTRE. CONTRIBUCION ESPAÑOLA A LA NEUTRON MONITOR DATA BASE/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/596622024-03-22T17:07:13Zcom_10017_149com_10017_17761com_10017_17741com_10017_8415col_10017_150col_10017_49348
2024-01-19T08:43:58Z
urn:hdl:10017/59662
Fail-aware LIDAR-based odometry for autonomous vehicles
García Daza, Iván
Rentero Alonso de Linaje, Mónica
Salinas Maldonado, Carlota
Izquierdo Gonzalo, Rubén
Hernández Parra, Noelia
Ballardini, Augusto Luis
Fernández Llorca, David
Universidad de Alcalá. Deparamento de Automática
LiDAR odometry
Fail-operational systems
Fail-aware
Automated driving
Autonomous driving systems are set to become a reality in transport systems and, so,
maximum acceptance is being sought among users. Currently, the most advanced architectures
require driver intervention when functional system failures or critical sensor operations take place,
presenting problems related to driver state, distractions, fatigue, and other factors that prevent safe
control. Therefore, this work presents a redundant, accurate, robust, and scalable LiDAR odometry
system with fail-aware system features that can allow other systems to perform a safe stop manoeuvre
without driver mediation. All odometry systems have drift error, making it difficult to use them
for localisation tasks over extended periods. For this reason, the paper presents an accurate LiDAR
odometry system with a fail-aware indicator. This indicator estimates a time window in which the
system manages the localisation tasks appropriately. The odometry error is minimised by applying a
dynamic 6-DoF model and fusing measures based on the Iterative Closest Points (ICP), environment
feature extraction, and Singular Value Decomposition (SVD) methods. The obtained results are
promising for two reasons: First, in the KITTI odometry data set, the ranking achieved by the
proposed method is twelfth, considering only LiDAR-based methods, where its translation and
rotation errors are 1.00% and 0.0041 deg/m, respectively. Second, the encouraging results of the
fail-aware indicator demonstrate the safety of the proposed LiDAR odometry system. The results
depict that, in order to achieve an accurate odometry system, complex models and measurement
fusion techniques must be used to improve its behaviour. Furthermore, if an odometry system is
to be used for redundant localisation features, it must integrate a fail-aware indicator for use in a safe manner.
2024-01-19T08:43:58Z
2024-01-19T08:43:58Z
2020-07-15
2024-01-12T10:12:07Z
info:eu-repo/semantics/article
García Daza, I. [et al.], 2020, "Fail-aware LIDAR-based odometry for autonomous vehicles", Sensors, vol. 20, no. 15, art. no. 4097, pp. 1-30.
1424-8220
http://hdl.handle.net/10017/59662
10.3390/s20154097
AR/0000034798
Sensors
20
30
15
1
eng
https://doi.org/10.3390/s20154097
info:eu-repo/grantAgreement/UAH//CCG2018%2FEXP-065
info:eu-repo/grantAgreement/CAM//S2018%2FEMT-4362/SEGURIDAD DE VEHÍCULOS PARA UNA MOVILIDAD INTELIGENTE, SOSTENIBLE, SEGURA E INTEGRADORA/SEGVAUTO 4.0-CM
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/DPI2017-90035-R/ES/INTERACCION PREDICTIVA ENTRE VEHICULOS AUTONOMOS COOPERATIVOS Y USUARIOS VULNERABLES DE CARRETERA ORIENTADA AL USUARIO FINAL/
info:eu-repo/grantAgreement/EC/H2020/723021/BRIDGING GAPS FOR THE ADOPTION OF AUTOMATED VEHICLES/BRAVE
info:eu-repo/grantAgreement/EC/H2020/737469//AutoDrive
TRA2017-90620-REDT
info:eu-repo/grantAgreement/EC/H2020/754382/EU/GOT Energy Talent/GET
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2020 The authors
MDPI
oai:ebuah.uah.es:10017/595582024-03-22T16:09:36Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-17T12:54:05Z
urn:hdl:10017/59558
A comprehensive survey of in-band control in SDN: challenges and opportunities
Carrascal Acebron, David
Rojas Sánchez, Elisa
Arco Rodríguez, José Manuel
López Pajares, Diego
Álvarez Horcajo, Joaquín
Carral Pelayo, Juan Antonio
Universidad de Alcalá. Departamento de Automática
Software-Defined Networking
In-band control
Survey
Network bootstrapping
Fault recovery
Routing
Distributed control
Software-Defined Networking (SDN) is a thriving networking architecture that has gained popularity in recent years, particularly as an enabling technology to foster paradigms like edge computing. SDN separates the control and data planes, which are later on synchronised via a control protocol such as OpenFlow. In-band control is a type of SDN control plane deployment in which the control and data planes share the same physical network. It poses several challenges, such as security vulnerabilities, network congestion, or data loss. Nevertheless, despite these challenges, in-band control also presents significant opportunities, including improved network flexibility and programmability, reduced costs, and increased reliability. Benefiting from the previous advantages, diverse in-band control designs exist in the literature, with the objective of improving the operation of SDN networks. This paper surveys the different approaches that have been proposed so far towards the advance in in-band SDN control, based on four main categories: automatic routing, fast failure recovery, network bootstrapping, and distributed control. Across these categories, detailed summary tables and comparisons are presented, followed by a discussion on current trends a challenges in the field. Our conclusion is that the use of in-band control in SDN networks is expected to drive innovation and growth in the networking industry, but efforts for holistic and full-fledged proposals are still needed.
2024-01-17T12:54:05Z
2024-01-17T12:54:05Z
2023-03-07
2024-01-16T10:04:39Z
info:eu-repo/semantics/article
Carrascal Acebrón, D., Rojas Sánchez, E., Arco Rodríguez, J.M., López Pajares, D., Álvarez Horcajo, J. & Carral Pelayo, J.A. 2023, "A comprehensive survey of in-band control in SDN: challenges and opportunities", Electronics, vol.12, n. 6, art. no. 1265, pp. 1-24.
2079-9292
http://hdl.handle.net/10017/59558
doi.org/10.3390/electronics12061265
AR/0000043700
Electronics
12
24
6
1
eng
https://doi.org/10.3390/electronics12061265
info:eu-repo/grantAgreement/CAM//S2018%2FTCS-4496/ES/TECNICAS AVANZADAS PARA POTENCIAR LA INTELIGENCIA DE LAS REDES 5G/TAPIR-CM
info:eu-repo/grantAgreement/UAH//CM-JIN-2021-006
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-116361RA-I00/ES/OPERACION Y GESTION DE REDES PROGRAMABLES PARA EL SOPORTE ACTIVO DE SERVICIOS CENTRADOS EN LOS USUARIOS/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2023 The Authors
MDPI
oai:ebuah.uah.es:10017/597692024-01-24T01:16:23Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-23T08:54:35Z
urn:hdl:10017/59769
An Experimental Platform for Autonomous Bus Development
Salinas Maldonado, Carlota
Montes , Héctor
Fernández , Roemi
Armada , Manuel
Universidad de Alcalá. Departamento de Automática
Intelligent Transportation Systems (ITS)
Bus Rapid Transit (BRT)
Autonomous driving
Autonomous bus
Automatic vehicle control
Lateral control
Longitudinal control
Obstacle detection
Human machine interface
Nowadays, with highly developed instrumentation, sensing and actuation technologies, it is possible to foresee an important advance in the field of autonomous and/or semi-autonomous transportation systems. Intelligent Transport Systems (ITS) have been subjected to very active research for many years, and Bus Rapid Transit (BRT) is one area of major interest. Among the most promising transport infrastructures, the articulated bus is an interesting, low cost, high occupancy capacity and friendly option. In this paper, an experimental platform for research on the automatic control of an articulated bus is presented. The aim of the platform is to allow full experimentation in real conditions for testing technological developments and control algorithms. The experimental platform consists of a mobile component (a commercial articulated bus) fully instrumented and a ground test area composed of asphalt roads inside the Consejo Superior de Investigaciones Científicas (CSIC) premises. This paper focuses also on the development of a human machine interface to ease progress in control system evaluation. Some experimental results are presented in order to show the potential of the proposed platform.
2024-01-23T08:54:35Z
2024-01-23T08:54:35Z
2017-11-02
2024-01-22T08:30:38Z
info:eu-repo/semantics/article
Montes, H.; Salinas, C.; Fernández, R.; Armada, M. An Experimental Platform for Autonomous Bus Development. Applied Sciences., 2017, v. 7, n. 11, p. 1131-1152
2076-3417
http://hdl.handle.net/10017/59769
10.3390/app7111131
AR/0000027902
Applied Sciences-Basel
7
1152
11
1131
eng
https://doi.org/10.3390/app7111131
PIE/62/2008 IMADE (Comunidad de Madrid); S-2013/MIT-2748 RoboCity2030 (Phase III) (Comunidad de Madrid); PI-2016-50E050 ROBSEN (Robotica y Sensores para los Retos Sociales) (Ministerio de Ciencia, Innovación y Universidades )
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2017 The authors
MDPI
oai:ebuah.uah.es:10017/593372024-01-12T01:16:32Zcom_10017_149com_10017_17761com_10017_17741com_10017_255col_10017_150col_10017_256
2024-01-11T18:42:17Z
urn:hdl:10017/59337
Continuous space estimation: increasing WiFi-based indoor localization resolution without increasing the site-survey effort
Hernández Parra, Noelia
Ocaña Miguel, Manuel
Alonso Moral, José María
Kim, Euntai
Universidad de Alcalá. Departamento de Electrónica
WiFi indoor localization
Fingerprinting
Continuous space estimation
Machine learning
Location-based services
Although much research has taken place in WiFi indoor localization systems, their accuracy can still be improved. When designing this kind of system, fingerprint-based methods are a common choice. The problem with fingerprint-based methods comes with the need of site surveying the environment, which is effort consuming. In this work, we propose an approach, based on support vector regression, to estimate the received signal strength at non-site-surveyed positions of the environment. Experiments, performed in a real environment, show that the proposed method could be used to improve the resolution of fingerprint-based indoor WiFi localization systems without increasing the site survey effort.
2024-01-11T18:42:17Z
2024-01-11T18:42:17Z
2017-01-13
2024-01-11T18:41:56Z
info:eu-repo/semantics/article
Hernández Parra, N., Ocaña Miguel, M., Alonso Moral, J.M. & Euntai, K. 2017, "Continuous space estimation: increasing WiFi-based indoor localization resolution without increasing the site-survey effort", Sensors, vol. 17, no. 1, art. no. 147, pp. 1-23.
1424-8220
http://hdl.handle.net/10017/59337
10.3390/s17010147
AR/0000025806
Sensors
17
23
1
1
eng
https://doi.org/10.3390/s17010147
info:eu-repo/grantAgreement/MINECO//TIN2014-56633-C3-3-R/ES/ABSTRACCION, SINTESIS E INTEGRACION DE INFORMACION MULTISENSORIAL PARA LA LOCALIZACION, SEGUIMIENTO Y RECONOCIMIENTO DEL COMPORTAMIENTO DE CONSUMIDORES EN CENTROS COMERCIALES/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
MDPI
oai:ebuah.uah.es:10017/592502024-01-11T01:17:39Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964com_10017_36590com_10017_18241col_10017_150col_10017_292col_10017_36591
2024-01-10T16:45:04Z
urn:hdl:10017/59250
Trajectory determination at Muon Impact Tracer and Observer (MITO) using artificial neural networks
Regadío Carretero, Alberto
Blanco Ávalos, Juan José
García Tejedor, Juan Ignacio
Ayuso de Gregorio, Sindulfo
Vrublevskyy, Ivan
Sánchez Prieto, Sebastián
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
Digital pulse processing
Instrumentation
Muon detector
Scintillator
Neural network
Cosmic rays
Space weather
We propose a method for the determination of the impact point of muons in each of the two detection planes of the Muon Impact Tracer and Observer (MITO) telescope, which is part of the ORCA (Antarctic Cosmic Ray Observatory). The method uses the relative pulse height obtained by the four photomultipliers associated to the scintillator with the Adaptable and Reconfigurable Acquisition Con- cept for Nuclear Electronics (ARACNE) data adquisition module. These pulses are processed with an Artificial Neural Network (ANN) previously trained with the GEANT4 model of the detector. With the impact point in both MITO planes, we estimate the angle of inci- dence of these particles with in order to evaluate the isotropy of the incident particles. To validate the method, real data from recorded by MITO in Livingston Island, Antarctica have been used to evaluate the feasibility of this method and its application to space weather.
2024-01-10T16:45:04Z
2024-01-10T16:45:04Z
2023-10-17
2024-01-10T16:44:36Z
info:eu-repo/semantics/article
Regadío, A. [et al.] 2023, "Trajectory determination at Muon Impact Tracer and Observer (MITO) using artificial neural networks", Advances in Space Research, vol. 8, no. 72, pp. 3428-3439.
0273-1177
http://hdl.handle.net/10017/59250
10.1016/j.asr.2023.07.046
AR/0000045818
Advances in Space Research
8
3439
72
3428
eng
https://doi.org/10.1016/j.asr.2023.07.046
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-107806GB-I00/ES/ORCA, ORCT, MINICALMA Y CALMA. OBSERVANDO DE LA INTERACCION SOL-TIERRA Y EL ENTORNO TERRESTRE. CONTRIBUCION ESPAÑOLA A LA NEUTRON MONITOR DATA BASE/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/596112024-02-23T09:33:36Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-18T10:03:58Z
urn:hdl:10017/59611
Stateless Flow-Zone Switching Using Software-Defined Addressing
Gonzalez-Diaz , Sergio
Marks , Roger
Rojas Sánchez, Elisa
De La Oliva , Antonio
Gazda , Robert
Universidad de Alcalá. Departamento de Automática
The trend toward cloudification of communication networks and services, with user data and applications stored and processed in data centers, pushes the limits of current Data Center Networks (DCNs), requiring improved scalability, resiliency, and performance. Here we consider a DCN forwarding approach based on software-defined addressing (SDA), which embeds semantics in the Medium Access Control (MAC) address and thereby enables new forwarding processes. This work presents Flow-Zone Switching (FZS), a loop-free location-based source-routing solution that eliminates the need for forwarding tables by embedding routing instructions and flow identifiers directly in the flow-zone software-defined address. FZS speeds the forwarding process, increasing the throughput and reducing the latency of QoS-sensitive flows while reducing the capital and operational costs of switching. This paper presents details of FZS and a performance evaluation within a complete DCN.
2024-01-18T10:03:58Z
2024-01-18T10:03:58Z
2021-05-06
2024-01-12T11:15:44Z
info:eu-repo/semantics/article
S. Gonzalez-Diaz, R. Marks, E. Rojas, A. de la Oliva and R. Gazda, "Stateless Flow-Zone Switching Using Software-Defined Addressing," in IEEE Access, vol. 9, pp. 68343-68365, 2021
2169-3536
http://hdl.handle.net/10017/59611
10.1109/ACCESS.2021.3077955
AR/0000037262
IEEE Access
9
68365
68343
eng
https://doi.org/10.1109/ACCESS.2021.3077955
PID2019-108713RB-C52/AEI/10.13039/501100011033/TRUE5G,
info:eu-repo/grantAgreement/CAM//S2018%2FTCS-4496%2FTAPIR-CM/ES/Técnicas Avanzadas para Potenciar la Inteligencia de las Redes 5G/TAPIR-CM
info:eu-repo/grantAgreement/EC/H2020/859881
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
IEEE
oai:ebuah.uah.es:10017/592522024-01-11T01:17:40Zcom_10017_149com_10017_17761com_10017_17741com_10017_36590com_10017_18241col_10017_150col_10017_36591
2024-01-10T17:27:52Z
urn:hdl:10017/59252
Memory management unit for hardware-assisted dynamic relocation in on-board satellite systems
Losa Cruz, Borja
Parra Espada, Pablo
Da Silva Fariña, Antonio
Rodríguez Polo, Óscar
García Tejedor, Juan Ignacio
Martínez Hellín, Agustín
Sánchez Sánchez, Jonatan
Sánchez Prieto, Sebastián
Guzmán García, David
Universidad de Alcalá. Departamento de Automática
Satellite on-board systems spend their lives in hostile environments, where radiation can cause critical hardware failures. One of the most radiation-sensitive elements is memory. The so-called single event effects (SEEs) can corrupt or even irretrievably damage the cells that store the data and program instructions. When one of these cells is corrupted, the program must not use it again during execution. In order to avoid rebuilding and uploading the code, a memory management unit can be used to transparently relocate the program to an error-free memory region. This article presents the design and implementation of a memory management unit that allows the dynamic relocation of on-board software. This unit provides a hardware mechanism that allows the automatic relocation of sections of code or data at run-time, only requiring software intervention for initialization and configuration. The unit has been implemented on the LEON architecture, a reference for the European Space Agency (ESA) missions. The proposed solution has been validated using the boot and application software (ASW) of the instrument control unit of the Energetic Particle Detector of the Solar Orbiter Mission as a base. Processor synthesis on different FPGAs has shown resource usage and power consumption similar to that of a conventional memory management unit. The results vary between ± 1?15% in resource usage and ± 1?7% in power consumption, depending on the number of inputs assigned to the unit and the FPGA used. When comparing performance, both the proposed and conventional memory management units show the same results.
2024-01-10T17:27:52Z
2024-01-10T17:27:52Z
2023-06-08
2024-01-10T17:26:49Z
info:eu-repo/semantics/article
Losa, B. [et al.], 2023, "Memory management unit for hardware-assisted dynamic relocation in on-board satellite systems", IEEE Transactions on Aerospace and Electronic Systems, vol. 59, no. 5, pp. 6923-6939.
0018-9251
http://hdl.handle.net/10017/59252
10.1109/TAES.2023.3284419
AR/0000044571
IEEE Transactions on Aerospace and Electronic Systems
59
6939
5
6923
eng
https://doi.org/10.1109/TAES.2023.3284419
info:eu-repo/grantAgreement/UAH//CM-JIN-2019-032
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2023 IEEE
IEEE
oai:ebuah.uah.es:10017/563722023-12-14T15:27:38Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2023-04-11T14:59:40Z
urn:hdl:10017/56372
GA3: scalable, distributed address assignment for dynamic data center networks
Rojas Sánchez, Elisa
Álvarez Horcajo, Joaquín
Martinez Yelmo, Isaias
Arco Rodríguez, José Manuel
Carral Pelayo, Juan Antonio
Universidad de Alcalá. Departamento de Automática
Data centers
Automatic address assignment
Misconfiguration detection
Shortest path bridges
Deployment and maintenance of current data center networks is costly and prone to errors. In order to avoid manual configuration, many of them require centralized administrators which constitute a clear bottleneck, while distributed approaches do not guarantee sufficient flexibility or robustness. This paper describes and evaluates GA3 (Generalized Automatic Address Assignment), a discovery protocol that assigns multiple unique labels to all the switches in a hierarchical network, without any modification of hosts or the standard Ethernet frames. Labeling is distributed and uses probes. These labels can be leveraged for shortest path routing without tables, as in the case of the Torii protocol, but GA3 also allows other label-based routing protocols (such as PortLand or ALIAS). Additionally, GA3 can detect miswirings in the network. Furthermore, control traffic is only necessary upon network deployment rather than periodically. Simulation results showed a reduced convergence time of less than 2 s and 100 kB/s of bandwidth (to send the GA3 frames) in the worst case for popular data center topologies, which outperforms other similar protocols.
2023-04-11T14:59:40Z
2023-04-11T14:59:40Z
2017-02-20
2023-04-11T14:58:52Z
info:eu-repo/semantics/article
Rojas, E., Álvarez Horcajo, J., Martínez Yelmo, I., Arco, J.M. & Carral, J.A. 2017, “GA3: scalable, distributed address assignment for dynamic data center networks”, Annals of Telecommunications, vol. 72, pp. 693-702.
0003-4347
http://hdl.handle.net/10017/56372
10.1007/s12243-017-0569-4
AR/0000025630
Annals of Telecommunications
72
702
693
eng
https://doi.org/10.1007/s12243-017-0569-4
info:eu-repo/grantAgreement/CAM//S2013%2FICE-2919/ES/TECNOLOGIAS INTEGRADAS DE GESTION Y OPERACIÓN DE RED 5G/TIGRE5-CM
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© Springer, 2017
Springer
oai:ebuah.uah.es:10017/596712024-02-23T09:53:05Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-19T10:03:47Z
urn:hdl:10017/59671
A novel method for automatic detection and classification of movement patterns in short duration playing activities
Rivera Pinto, Diego
Cruz Piris, Luis De La
Fernández Melián, Susel
Alarcos Alcázar, Bernardo
García Herraiz, Antonio
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Autonomous devices able to evaluate diverse situations without external help have become especially relevant in recent years because they can be used as an important source of relevant information about the activities performed by people (daily habits, sports performance, and health-related activities). Specifically, the use of this kind of device in childhood games might help in the early detection of developmental problems in children. In this paper, we propose a method for the detection and classification of movements performed with an object, based on an acceleration signal. This method can automatically generate patterns associated with a given movement using a set of reference signals, analyze sequences of acceleration trends, and classify the sequences according to the previously established patterns. This method has been implemented, and a series of experiments has been carried out using the data from a sensor-embedded toy. For the validation of the obtained results, we have, in parallel, developed two other classification systems based on popular techniques, i.e., a similarity search based on Euclidean distances and machine-learning techniques, specifically a support vector machine model. When comparing the results of each method, we show that our proposed method achieves a higher number of successes and higher accuracy in the detection and classification of isolated movement signals as well as in sequences of movements.
2024-01-19T10:03:47Z
2024-01-19T10:03:47Z
2018-09-17
2024-01-15T15:02:07Z
info:eu-repo/semantics/article
D. Rivera, Rivera, D., Cruz-Piris, L., Fernandez, S., Alarcos, B., García, A. and Velasco, J.R., "A Novel Method for Automatic Detection and Classification of Movement Patterns in Short Duration Playing Activities," 2018, IEEE Access, vol. 6, pp. 53409-53425
2169-3536
http://hdl.handle.net/10017/59671
10.1109/ACCESS.2018.2871732
AR/0000028742
IEEE Access
53425
53409
eng
https://doi.org/10.1109/ACCESS.2018.2871732
info:eu-repo/grantAgreement/UAH//UAH-GP2018-5/ES/SISTEMAS DE MONITORIZACIÓN DE ACTIVIDAD EN EL DESARROLLO INFANTIL Y LA VIDA COTIDIANA MEDIANTE JUGUETES Y OTROS OBJETOS DEL ENTORNO/SMARTY
info:eu-repo/grantAgreement/MINECO//BES-2014-067912/ES
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© The Authors
IEEE
oai:ebuah.uah.es:10017/592082024-01-10T01:16:26Zcom_10017_149com_10017_17761com_10017_17741com_10017_255col_10017_150col_10017_256
2024-01-09T14:31:04Z
urn:hdl:10017/59208
Hierarchical approach to enhancing topology-based WiFi indoor localization in large environments
Hernández Parra, Noelia
Alonso Moral, José María
Ocaña Miguel, Manuel
Universidad de Alcalá. Departamento de Electrónica
Universidad de Alcalá. Departamento de Automática
WiFi indoor localization
Large environments
Learning algorithms
Clustering
Classification
Traditionally, WiFi has been used for indoors localization purposes due to its important advantages. There are WiFi access points in most buildings and measuring WiFi signal is free of charge even for private WiFi networks. Unfortunately, it also has some disadvantages: when extending WiFi-based localization systems to large environments their accuracy decreases. This has been previously solved by manually dividing the environment into zones. In this paper, an automatic partition of the environment is proposed to increase the localization accuracy in large environments. To do so, a hierarchical partition of the environment is performed using K-Means and the Calinski-Harabasz Index. Then, different classification techniques have been compared to achieve high localization rates. The new approach is tested in a real environment with more than 200 access points and 133 topological positions, obtaining an overall increase in the accuracy of approximately 10% and reducing the error to the real position to 2.45 metres.
2024-01-09T14:31:04Z
2024-01-09T14:31:04Z
2016-11-01
2024-01-09T14:30:33Z
info:eu-repo/semantics/article
Hernández, N., Alonso, J.M. & Ocaña, M. 2016, “Hierarchical approach to enhancing topology-based WiFi indoor localization in large environments”, Journal of Multiple-Valued Logic & Soft Computing, vol. 26, no. 3-5, pp. 221-241.
1542-3980
http://hdl.handle.net/10017/59208
AR/0000025807
Journal of Multiple-Valued Logic and Soft Computing
26
241
3-5
221
eng
https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-26-number-3-5-2016/mvlsc-26-3-5-p-221-241/
info:eu-repo/grantAgreement/MICINN//TIN2011-29824-C02-01/ES/ABSTRACCION, SINTESIS E INTEGRACION DE INFORMACION HETEROGENEA EN EQUIPOS HUMANO-ROBOT/
info:eu-repo/grantAgreement/MICINN//TIN2011-29824-C02-02/ES/ABSTRACCION, SINTESIS E INTEGRACION DE INFORMACION PARA EQUIPOS HUMANO-ROBOT - UAH/
info:eu-repo/grantAgreement/UAH//CCG2013%2FEXP-066
CT13-53
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2016 Old City Publishing
Old City Publishing
oai:ebuah.uah.es:10017/588812023-12-15T01:16:32Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964com_10017_36590com_10017_18241col_10017_150col_10017_292col_10017_36591
2023-12-14T18:21:39Z
urn:hdl:10017/58881
The first widespread solar energetic particle event observed by Solar Orbiter on 2020 November 29
Kollhoff, A.
Gómez Herrero, Raúl
Rodríguez García, Laura
Cernuda Cangas, Ignacio Manuel
Espinosa Lara, Francisco
Rodríguez-Pacheco Martín, Javier
Prieto Mateo, Manuel
Sánchez Prieto, Sebastián
Parra Espada, Pablo
Rodríguez Polo, Óscar
Martínez Hellín, Agustín
Carcaboso Morales, Fernando
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
Sun: particle emission
Sun: heliosphere
Sun: coronal mass ejections (CMEs)
Sun: flares
Interplanetary medium
Context. On 2020 November 29, the first widespread solar energetic particle (SEP) event of solar cycle 25 was observed at four widely separated
locations in the inner (.1 AU) heliosphere. Relativistic electrons as well as protons with energies >50 MeV were observed by Solar Orbiter (SolO),
Parker Solar Probe, the Solar Terrestrial Relations Observatory (STEREO)-A and multiple near-Earth spacecraft. The SEP event was associated
with an M4.4 class X-ray flare and accompanied by a coronal mass ejection and an extreme ultraviolet (EUV) wave as well as a type II radio burst
and multiple type III radio bursts.
Aims. We present multi-spacecraft particle observations and place them in context with source observations from remote sensing instruments and
discuss how such observations may further our understanding of particle acceleration and transport in this widespread event.
Methods. Velocity dispersion analysis (VDA) and time shift analysis (TSA) were used to infer the particle release times at the Sun. Solar wind
plasma and magnetic field measurements were examined to identify structures that influence the properties of the energetic particles such as their
intensity. Pitch angle distributions and first-order anisotropies were analyzed in order to characterize the particle propagation in the interplanetary
medium.
Results. We find that during the 2020 November 29 SEP event, particles spread over more than 230◦
in longitude close to 1 AU. The particle onset
delays observed at the different spacecraft are larger as the flare–footpoint angle increases and are consistent with those from previous STEREO
observations. Comparing the timing when the EUV wave intersects the estimated magnetic footpoints of each spacecraft with particle release times
from TSA and VDA, we conclude that a simple scenario where the particle release is only determined by the EUV wave propagation is unlikely
for this event. Observations of anisotropic particle distributions at SolO, Wind, and STEREO-A do not rule out that particles are injected over
a wide longitudinal range close to the Sun. However, the low values of the first-order anisotropy observed by near-Earth spacecraft suggest that
diffusive propagation processes are likely involved.
2023-12-14T18:21:39Z
2023-12-14T18:21:39Z
2021-12-14
2023-12-14T18:21:14Z
info:eu-repo/semantics/article
Kollhoff, A. [et al.], 2021, "The first widespread solar energetic particle event observed by Solar Orbiter on 2020 November 29", Astronomy & Astrophysics, vol. 653, art. no. A20, pp. 1-16.
0004-6361
http://hdl.handle.net/10017/58881
10.1051/0004-6361/202140937
AR/0000040306
Astronomy & Astrophysics
653
16
1
eng
https://doi.org/10.1051/0004-6361/202140937
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/ESP2017-88436-R/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASES D Y E/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104863RB-I00/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASE E, CALIBRACION Y EXPLOTACION DE DATOS/
http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
Attribution 4.0 International (CC BY 4.0)
The European Southern Observatory (ESO)
oai:ebuah.uah.es:10017/605042024-02-07T01:16:49Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-06T18:12:45Z
urn:hdl:10017/60504
CellEVAC: an adaptive guidance system for crowd evacuation through behavioral optimization
López Carmona, Miguel Ángel
Paricio García, Álvaro
Universidad de Alcalá. Departamento de Automática
Crowd evacuation
Behavioral optimization
Exit-choice decisions
Simulation-optimization modeling
Cell-based evacuation
Evacuation safety
A critical aspect of crowds' evacuation processes is the dynamism of individual decision making. Identifying optimal strategies at an individual level may improve both evacuation time and safety, which is essential for developing efficient evacuation systems. Here, we investigate how to favor a coordinated group dynamic through optimal exit-choice instructions using behavioral strategy optimization. We propose and evaluate an adaptive guidance system (Cell-based Crowd Evacuation, CellEVAC) that dynamically allocates colors to cells in a cellbased pedestrian positioning infrastructure, to provide efficient exit-choice indications. The operational module of CellEVAC implements an optimized discrete-choice model that integrates the influential factors that would make evacuees adapt their exit choice. To optimize the model, we used a simulation?optimization modeling framework that integrates microscopic pedestrian simulation based on the classical Social Force Model. In the majority of studies, the objective has been to optimize evacuation time. In contrast, we paid particular attention to safety by using Pedestrian Fundamental Diagrams that model the dynamics of the exit gates. CellEVAC has been tested in a simulated real scenario (Madrid Arena) under different external pedestrian flow patterns that simulate complex pedestrian interactions. Results showed that CellEVAC outperforms evacuation processes in which the system is not used, with an exponential improvement as interactions become complex. We compared our system with an existing approach based on Cartesian Genetic Programming. Our system exhibited a better overall performance in terms of safety, evacuation time, and the number of revisions of exit-choice decisions. Further analyses also revealed that Cartesian Genetic Programming generates less natural pedestrian reactions and movements than CellEVAC. The fact that the decision logic module is built upon a behavioral model seems to favor a more natural and effective response. We also found that our proposal has a positive influence on evacuations even for a low compliance rate (40%).
2024-02-06T18:12:45Z
2024-02-06T18:12:45Z
2021-07-01
2024-02-06T18:12:02Z
info:eu-repo/semantics/article
López Carmona, M.A. & Paricio García, Á. 2021, "CellEVAC: an adaptive guidance system for crowd evacuation through behavioral optimization", Safety Science, vol. 139, art. no. 105215, pp. 1-22.
0925-7535
http://hdl.handle.net/10017/60504
10.1016/j.ssci.2021.105215
AR/0000037045
Safety Science
139
22
1
eng
https://doi.org/10.1016/j.ssci.2021.105215
info:eu-repo/grantAgreement/MINECO//TIN2016-80622-P/ES/Dynamic Network Agreement: negociaciones estructurales en redes complejas/DNA
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
Elsevier
oai:ebuah.uah.es:10017/563512023-12-14T15:27:39Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2023-04-11T14:23:06Z
urn:hdl:10017/56351
TEDP: an enhanced topology discovery service for Software-Defined Networking
Rojas Sánchez, Elisa
Álvarez Horcajo, Joaquín
Martinez Yelmo, Isaias
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
SDN
OpenFlow
Topology discovery
LLDP
Currently, software-defined networking (SDN) platforms leverage the link-layer discovery protocol (LLDP) to discover the underlying topology. However, the LLDP is suboptimal in terms of message load. In this letter, we present the tree exploration discovery protocol (TEDP), proving that shortest paths can be built at the same time that the topology information is gathered, without extra messages compared with LLDP. We also analyze two alternative implementations for the TEDP and give insights into some features that SDN platforms should ideally provide for an efficient topology discovery service.
2023-04-11T14:23:06Z
2023-04-11T14:23:06Z
2018-06-08
2023-04-11T14:22:21Z
info:eu-repo/semantics/article
Rojas, E., Álvarez Horcajo, J., Martínez Yelmo, I., Carral, J.A. & Arco, J.M. 2018, "TEDP: an enhanced topology discovery service for Software-Defined Networking", IEEE Communications Letters, vol. 22, no. 8, pp. 1540-1543.
1089-7798
http://hdl.handle.net/10017/56351
10.1109/LCOMM.2018.2845372
AR/0000028543
IEEE Communications Letters
22
1543
8
1540
eng
https://doi.org/10.1109/LCOMM.2018.2845372
info:eu-repo/grantAgreement/CAM//S2013%2FICE-2919/ES/TECNOLOGIAS INTEGRADAS DE GESTION Y OPERACIÓN DE RED 5G/TIGRE5-CM
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2018 IEEE
IEEE
oai:ebuah.uah.es:10017/596882024-02-03T01:18:00Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-19T12:22:36Z
urn:hdl:10017/59688
A survey on Machine Learning Techniques for Routing Optimization in SDN
Amin, Rashid
Rojas Sánchez, Elisa
Aqdus, Aqsa
Ramzan, Sadia
Casillas-Perez, David
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
In conventional networks, there was a tight bond between the control plane and the data plane. The introduction of Software-Defined Networking (SDN) separated these planes, and provided additional features and tools to solve some of the problems of traditional network (i.e., latency, consistency, efficiency). SDN is a flexible networking paradigm that boosts network control, programmability and automation. It proffers many benefits in many areas, including routing. More specifically, for efficiently organizing, managing and optimizing routing in networks, some intelligence is required, and SDN offers the possibility to easily integrate it. To this purpose, many researchers implemented different machine learning (ML) techniques to enhance SDN routing applications. This article surveys the use of ML techniques for routing optimization in SDN based on three core categories (i.e. supervised learning, unsupervised learning, and reinforcement learning). The main contributions of this survey are threefold. Firstly, it presents detailed summary tables related to these studies and their comparison is also discussed, including a summary of the best works according to our analysis. Secondly, it summarizes the main findings, best works and missing aspects, and it includes a quick guideline to choose the best ML technique in this field (based on available resources and objectives). Finally, it provides specific future research directions divided into six sections to conclude the survey. Our conclusion is that there is a huge trend to use intelligence-based routing in programmable networks, particularly during the last three years, but a lot of effort is still required to achieve comprehensive comparisons and synergies of approaches, meaningful evaluations based on open datasets and topologies, and detailed practical implementations (following recent standards) that could be adopted by industry. In summary, future efforts should be focused on reproducible research rather than on new isolated ideas. Otherwise, most of these applications will be barely implemented in practice.
2024-01-19T12:22:36Z
2024-01-19T12:22:36Z
2021-07-26
2024-01-16T09:32:38Z
info:eu-repo/semantics/article
R. Amin, E. Rojas, A. Aqdus, S. Ramzan, D. Casillas-Perez and J. M. Arco, "A Survey on Machine Learning Techniques for Routing Optimization in SDN," in IEEE Access, vol. 9, pp. 104582-104611, 2021
2169-3536
http://hdl.handle.net/10017/59688
10.1109/ACCESS.2021.3099092
AR/0000037526
IEEE Access
9
104611
104582
en
https://doi.org/10.1109/ACCESS.2021.3099092
SBPLY/19/180501/000324/IRIS-JCCM (Junta de Comunidades de Castilla-La Mancha), CM/JIN/2019-039/IRIS-CM (Comunidad de Madrid), S2018/TCS-4496/TAPIR-CM (Comunidad de Madrid)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
IEEE
oai:ebuah.uah.es:10017/595722024-01-19T10:31:37Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-17T14:56:28Z
urn:hdl:10017/59572
On the Benefits of Channel Bonding in Dense, Decentralized Wi-Fi 4 Networks
Giménez Guzmán, José Manuel
Marsá Maestre, Iván
Orden Martín, David
Fernández Melián, Susel
Tejedor Romero, Marino
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas
Channel bonding is a technique first defined in the IEEE 802.11n standard to increase the throughput in wireless networks by means of using wider channels. In IEEE 802.11n (nowadays also known as Wi-Fi 4), it is possible to use 40 MHz channels instead of the classical 20 MHz channels. Although using channel bonding can increase the throughput, the classic 802.11 setting only allows for two orthogonal channels in the 2.4 GHz frequency band, which is not enough for proper channel assignment in dense settings. For that reason, it is commonly accepted that channel bonding is not suitable for this frequency band. However, to the best of our knowledge, there is not any accurate study that deals with this issue thoroughly. In this work, we study in depth the effect of channel bonding in Wi-Fi 4 dense, decentralized networks operating in the 2.4 GHz frequency band. We confirm the negative effect of using channel bonding in the 2.4 GHz frequency band with 11 channels which are 20 MHz wide (as in North America), but we also show that when there are 13 or more channels at hand (as in many other parts of the world, including Europe and Japan), the use of channel bonding yields consistent throughput improvements. For that reason, we claim that the common assumption of not considering channel bonding in the 2.4 GHz band should be revised.
2024-01-17T14:56:28Z
2024-01-17T14:56:28Z
2022-02-10
2024-01-15T14:56:38Z
info:eu-repo/semantics/article
Jose Manuel Gimenez-Guzman, Ivan Marsa-Maestre, David Orden, Susel Fernandez, Marino Tejedor-Romero, "On the Benefits of Channel Bonding in Dense, Decentralized Wi-Fi 4 Networks", Wireless Communications and Mobile Computing, vol. 2022, Article ID 8497585, 11 pages, 2022
1530-8669
http://hdl.handle.net/10017/59572
10.1155/2022/8497585
AR/0000040215
Wireless Communications and Mobile Computing
2022
11
1
eng
https://doi.org/10.1155/2022/8497585
SBPLY/19/180 501/000171 (Junta de Comunidades de Castilla-La Mancha)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2022 The authors
Hindawi
oai:ebuah.uah.es:10017/595322024-03-22T17:31:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_8415col_10017_150col_10017_49348
2024-01-17T09:21:28Z
urn:hdl:10017/59532
Simple baseline for vehicle pose estimation: experimental validation
Corrales Sánchez, Héctor
Hernández Martínez, Antonio
Izquierdo Gonzalo, Rubén
Hernández Parra, Noelia
Parra Alonso, Ignacio
Fernández Llorca, David
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Vehicle pose estimation
Vehicle keypoints detection
CNNs
Heat maps
Human pose estimation
Experimental validation
Significant progress on human and vehicle pose estimation has been achieved in recent years. The performance of these methods has evolved from poor to remarkable in just a couple of years. This improvement has been obtained from increasingly complex architectures. In this paper, we explore the applicability of simple baseline methods by adding a few deconvolutional layers on a backbone network to estimate heat maps that correspond to the vehicle keypoints. This approach has been proven to be very effective for human pose estimation. The results are analyzed on the PASCAL3DC dataset, achieving state-of-the-art results. In addition, a set of experiments has been conducted to study current shortcomings in vehicle keypoints labelling, which adversely affect performance. A new strategy for de ning vehicle keypoints is presented and validated with our customized dataset with extended keypoints.
2024-01-17T09:21:28Z
2024-01-17T09:21:28Z
2020-07-20
2024-01-12T10:00:19Z
info:eu-repo/semantics/article
Corrales Sánchez, Héctor, Hernández Martínez, Antonio, Izquierdo Gonzalo, Rubén, Hernández Parra, Noelia, Fernández-Llorca, David, 2020, IEEE Access, v. 8, p. 132539-132550
2169-3536
http://hdl.handle.net/10017/59532
10.1109/ACCESS.2020.3010307
AR/0000034476
IEEE Access
8
132550
132539
eng
https://doi.org/10.1109/ACCESS.2020.3010307
info:eu-repo/grantAgreement/CAM//S2018%2FEMT-4362/SEGURIDAD DE VEHÍCULOS PARA UNA MOVILIDAD INTELIGENTE, SOSTENIBLE, SEGURA E INTEGRADORA/SEGVAUTO 4.0-CM
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/DPI2017-90035-R/ES/INTERACCION PREDICTIVA ENTRE VEHICULOS AUTONOMOS COOPERATIVOS Y USUARIOS VULNERABLES DE CARRETERA ORIENTADA AL USUARIO FINAL/
info:eu-repo/grantAgreement/EC/H2020/723021/BRIDGING GAPS FOR THE ADOPTION OF AUTOMATED VEHICLES/BRAVE
info:eu-repo/grantAgreement/MINECO//PCIN-2017-086
info:eu-repo/grantAgreement/EC/H2020/737469//AutoDrive
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
IEEE
oai:ebuah.uah.es:10017/605932024-02-23T10:10:52Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-08T09:09:38Z
urn:hdl:10017/60593
Suprathermal particles from corotating interaction regions during the first perihelion pass of Solar Orbiter
Allen, R.C.
Mason , G. M.
Ho, G. C.
Rodríguez-Pacheco Martín, Javier
Wimmer-Schweingruber, R. F.
Andrews, G. B.
Berger, L.
Boden, S.
Cernuda Cangas, Ignacio Manuel
Espinosa Lara, Francisco
Freiherr Von Forstner, J.L.
Gómez Herrero, Raúl
Hayes, J. R.
Kulkarni , S. R.
Lees, W. J.
Martin, C.
Pacheco, D.
Rodríguez Polo, Óscar
Prieto Mateo, Manuel
Ravanbakhsh , A.
Sánchez Prieto, Sebastián
Schlemm, C. E.
Seifert , H.
Terasa, J. C.
Tyagi , K.
Xu , Z
Yedla , M.
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Física
acceleration of particles solar wind Sun: abundances interplanetary medium shock waves
The first orbit of Solar Orbiter provided comprehensive measurements of six corotating interaction regions (CIRs) within 1 au. Five of these CIRs were also observed by ACE at 1 au, allowing for comparisons of the suprathermal ion intensities and spectra at di erent radial distances. Only subtle modulations of the 4He spectral slopes are observed between Solar Orbiter and ACE. Additionally, the radial gradients of 226�320 keV/nuc 4He ion intensities between Solar Orbiter and ACE are similar to that of 1.53MeV H reported by Van Hollebeke et al. (1978, J. Geophys. Res., 83, A10). These observations provide a new addition to the study of the radial dependence of CIR-associated suprathermal ions in the inner heliosphere.
2024-02-08T09:09:38Z
2024-02-08T09:09:38Z
2021-12-01
2024-02-07T12:49:50Z
info:eu-repo/semantics/article
Astronomy & Astrophysics, 2021, v. 656, n. , p. L2-
http://hdl.handle.net/10017/60593
10.1051/0004-6361/202039870
AR/0000040724
Astronomy & Astrophysics
656
L2
eng
info:eu-repo/grantAgreement/MCIU//10.13039/501100011033/ES
info:eu-repo/grantAgreement/MCIU//PID2019-104863RB-I00/ES
info:eu-repo/grantAgreement/MCIU//ESP2017-88436-R/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASES D Y E
http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
Attribution 4.0 International (CC BY 4.0)
oai:ebuah.uah.es:10017/596782024-02-26T14:18:05Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-19T11:18:05Z
urn:hdl:10017/59678
Beyond Multi-access Edge Computing: Essentials to realize a Mobile, Constrained Edge
Rojas Sánchez, Elisa
Guimaraes , Carlos
De La Oliva , Antonio
Bernardos , Carlos J
Gazda , Robert
Universidad de Alcalá. Departamento de Automática
ETSI Multi-access Edge computing (MEC) main purpose is to improve latency and bandwidth consumption by keeping local traffic local while providing computing resources near the end-user. Despite its clear benefits, the next-generation of hyper-distributed applications (e.g., edge robotics, augmented environments, or smart agriculture) will exacerbate latency and bandwidth requirements, posing significant challenges to today's MEC deployments. In this work, we leverage on the current study item ETSI GR MEC 036, introducing a lightweight constrained version of a MEC platform that can be deployed in a mobile end terminal or in its closed locality. This work presents design options for cMEC, and how it can untangle the aforementioned gaps while being architectural compatible with a full-fledged MEC framework. Finally, key use cases and still open challenges are discussed, including recommendations to extend the current MEC standard towards constrained environments.
2024-01-19T11:18:05Z
2024-01-19T11:18:05Z
2024-01
2024-01-15T15:19:52Z
info:eu-repo/semantics/article
E. Rojas, C. Guimarães, A. de la Oliva, C. J. Bernardos and R. Gazda, "Beyond Multi-Access Edge Computing: Essentials to Realize a Mobile, Constrained Edge," in IEEE Communications Magazine, vol. 62, no. 1, pp. 156-162, January 2024
0163-6804
http://hdl.handle.net/10017/59678
10.1109/MCOM.017.2300056
AR/0000043955
IEEE Communications Magazine
162
1
156
en
https://doi.org/10.1109/MCOM.017.2300056
CM/JIN/2021-006/MistLETOE-CM (Comunidad de Madrid), PID2020-116361RA-I00/ONENESS (Ministerio de Ciencia e Innovación), EDGEDT (Ministerio de Asuntos Económicos y Transformación Digital), H2020 101070177 (ICOS), HE 101095759 (Hexa-X-II)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2024 IEEE
IEEE
oai:ebuah.uah.es:10017/605822024-02-08T01:16:41Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-07T18:36:02Z
urn:hdl:10017/60582
Application of traffic weighted multi-map optimization strategies to traffic assignment
Paricio García, Álvaro
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Traffic assignment
Traffic control
Traffic simulation
Vehicle routing
Multi-map routing
Traffic weighted multi-maps
Traffic Assignment Problem (TAP) is a critical issue for transportation and mobility models that deals mainly with the calculus and delivery of best-cost routes for the trips in a traffic network. It is a computationally complex problem focused on finding user equilibrium (UE) and system optimum (SO). The Traffic Weighted Multi-Maps (TWM) technique offers a new perspective for TAP calculus, based on routing decisions using different traffic network views. These TWM are complementary cost maps that combine physical traffic networks, traffic occupation data, and routing policies. This paper shows how evolutionary algorithms can find optimal cost maps that solve TAP from the SO perspective, minimizing total travel time and providing the best-cost routes to vehicles. Several strategies are compared: a baseline algorithm that optimizes the whole network and two algorithms based on extended k-shortest path mappings. Algorithms are analyzed following a simulation-optimization methodology over synthetic and real traffic networks. Obtained results show that TWM algorithms generate solutions close to the static UE traffic assignment methods at a reasonable computational cost. A crucial aspect of TWM is its good performance in terms of optimal routing at the system level, avoiding the need for continuous route calculus based on traffic status data streaming
2024-02-07T18:36:02Z
2024-02-07T18:36:02Z
2021-01-06
2024-02-07T18:35:30Z
info:eu-repo/semantics/article
Paricio García, A. & López Carmona, M.A. 2021, "Application of traffic weighted multi-map optimization strategies to traffic assignment", IEEE Access, vol. 9, pp. 28999-29019.
2169-3536
http://hdl.handle.net/10017/60582
10.1109/ACCESS.2021.3058508
AR/0000046275
IEEE Access
9
29019
28999
eng
https://doi.org/10.1109/ACCESS.2021.3058508
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
IEEE
oai:ebuah.uah.es:10017/592132024-02-01T11:25:17Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-09T16:22:09Z
urn:hdl:10017/59213
Filtering of pulses from particle detectors by means of Singular Value Decomposition (SVD)
Regadío Carretero, Alberto
Sánchez Prieto, Sebastián
Esteban, Luis
Universidad de Alcalá. Departamento de Automática
Digital pulse processing
Pulse filtering
Noise
Dimensionality reduction
SVD
This paper presents a novel methodology to filter pulses coming from particle detectors. It is based on variable-in-time convolutions in which one of the operands is the input pulse and the other is a vector that changes with every convolution step. This is equivalent to multiply every incoming pulse by a filtering matrix. The coefficients of this matrix are computed by applying a Singular Value Decomposition (SVD) factorization over a set of training pulses. A detailed explanation of this SVD-filtering methodology, a noise filtering analysis, simulations and filtering of pulses coming from a neutron monitor were carried out to verify its feasibility.
2024-01-09T16:22:09Z
2024-01-09T16:22:09Z
2019-04-01
2024-01-09T16:21:31Z
info:eu-repo/semantics/article
Regadío Carretero, A., Sánchez Prieto, S. & Esteban, L. 2019, “Filtering of pulses from particle detectors by means of Singular Value Decomposition (SVD)”, Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, vol. 922, pp. 257-264.
0168-9002
http://hdl.handle.net/10017/59213
10.1016/j.nima.2019.01.028
AR/0000031737
Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
922
264
257
eng
https://doi.org/10.1016/j.nima.2019.01.028
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/ESP2017-88436-R/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASES D Y E/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2019 Elsevier
Elsevier
oai:ebuah.uah.es:10017/593312024-01-12T01:16:32Zcom_10017_149com_10017_17761com_10017_17741com_10017_255col_10017_150col_10017_256
2024-01-11T16:00:48Z
urn:hdl:10017/59331
Fuzzy classifier ensembles for hierarchical WiFi-based semantic indoor localization
Hernández Parra, Noelia
Alonso Moral, José María
Ocaña Miguel, Manuel
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Electrónica
Indoor Localization
WiFi
Fingerprinting
Fuzzy Logic
Classification
Ensembles
The number of applications for smartphones and tablets is growing exponentially in the last years. Many of these applications are supported by the so-called Location Based Services, which are expected to provide reliable real-time localization anytime and anywhere, no matter either outdoors or indoors. Even though outdoors world-wide localization has been successfully developed through the well-known Global Navigation Satellite System technology, its counterpart large-scale deployment indoors is not available yet. In previous work, we have already introduced a novel technology for indoor localization supported by a WiFi fingerprint approach. In this paper, we describe how to enhance such approach through the combination of hierarchical localization and fuzzy classifier ensembles. It has been tested and validated at the University of Edinburgh, yielding promising results.
2024-01-11T16:00:48Z
2024-01-11T16:00:48Z
2017-12-30
2024-01-11T16:00:24Z
info:eu-repo/semantics/article
Hernández Parra, N., Alonso Moral, J.M. & Ocaña Miguel, M. 2017, “Fuzzy classifier ensembles for hierarchical WiFi-based semantic indoor localization”, Expert Systems with Applications, vol. 90, pp. 394-404.
0957-4174
http://hdl.handle.net/10017/59331
10.1016/j.eswa.2017.08.007
AR/0000026481
Expert Systems with Applications
90
404
394
eng
https://doi.org/10.1016/j.eswa.2017.08.007
info:eu-repo/grantAgreement/MINECO//TIN2014-56633-C3-3-R/ES/ABSTRACCION, SINTESIS E INTEGRACION DE INFORMACION MULTISENSORIAL PARA LA LOCALIZACION, SEGUIMIENTO Y RECONOCIMIENTO DEL COMPORTAMIENTO DE CONSUMIDORES EN CENTROS COMERCIALES/
ED431G/08
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2017 Elsevier
Elsevier
oai:ebuah.uah.es:10017/592562024-01-11T01:17:40Zcom_10017_149com_10017_17761com_10017_17741com_10017_36590com_10017_18241col_10017_150col_10017_36591
2024-01-10T18:13:44Z
urn:hdl:10017/59256
Filtering of pulses from particle detectors using neural networks by dimensionality reduction
Regadío Carretero, Alberto
Sánchez Prieto, Sebastián
Esteban, Luis
Universidad de Alcalá. Departamento de Automática
Digital pulse processing
Pulse filtering
Noise
Dimensionality reduction
Denoising
Autoencoder
Restricted Boltzmann machine
Neural network
This article presents a comparison between different filtering methods based on dimensionality reduction for pulses generated on particle detectors. This reduction has been carried out using Neural Networks (NNs). In particular, three topologies have been used: Autoencoders (AEs), Denoising Autoencoders (DAEs) and Restricted Boltzmann Machines (RBMs). A detailed explanation of these methods, a noise reduction analysis, filtering with simulated data and processing of pulses from a neutron detector have been carried out to verify the feasibility of using these NNs as pulse filters.
2024-01-10T18:13:44Z
2024-01-10T18:13:44Z
2019-10-21
2024-01-10T18:13:13Z
info:eu-repo/semantics/article
Regadío Carretero, A., Sánchez Prieto & Esteban, L., S. 2019, “Filtering of pulses from particle detectors using neural networks by dimensionality reduction”, Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, vol. 942, art. no. 162372.
0168-9002
http://hdl.handle.net/10017/59256
10.1016/j.nima.2019.162372
AR/0000044329
Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
942
eng
https://doi.org/10.1016/j.nima.2019.162372
info:eu-repo/grantAgreement/JCCM//PPII10-0150-6529
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/ESP2017-88436-R/ES/ENERGETIC PARTICLE DETECTOR EN SOLAR ORBITER: FASES D Y E/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2019 Elsevier
Elsevier
oai:ebuah.uah.es:10017/600112024-01-27T01:17:32Zcom_10017_149com_10017_17761com_10017_17741com_10017_248col_10017_150col_10017_304
2024-01-26T19:16:34Z
urn:hdl:10017/60011
What do urban and rural hotel managers say about the future of hotels after COVID-19? The new meaning of safety experiences
Robina Ramírez, Rafael
Medina Merodio, José Amelio
Estriégana Valdehita, Rosa María
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Urban areas
Rural areas
Hotel managers
COVID-19
Sustainability
Safe experiences
Private-public collaboration
The pandemic crisis has caused a change in tourism trends that affect the way hotels are managed. In accordance with the United Nations (2020), hotels must guarantee safe experiences for customers by incorporating sustainability measures. Collaboration between health and tourism authorities and the tourism industry is key. To test this proposal among hotels in Spain, 3 online focus groups and 25 personal interviews with 36 urban and 28 rural hotels were held in order to define the indicators. The questionnaire was applied to a sample of 475 urban hotels out of 443 rural hotels. The conclusions were: 1.) While in urban areas the testing protocols, especially for workers, are followed by most hotels, in rural areas hotel managers do not consider it as a priority in daily activity due to the reduced contact they have. 2.) A change in trends in the sustainable management of both rural and urban hotels is justified. 3.) Urban and rural hotels are more likely to incorporate collaborative strategies with tourism and health authorities to reduce the negative impact of COVID-19. According to the estimates of the hotels, the implementation of these measures would help to start the recovery process of the hotel industry.
2024-01-26T19:16:34Z
2024-01-26T19:16:34Z
2021-10-09
2024-01-26T19:16:08Z
info:eu-repo/semantics/article
Robina Ramirez, R., Medina Merodio, J.A. & Estriégana Valdehita, R.M. 2022, "What do urban and rural hotel managers say about the future of hotels after COVID-19? The new meaning of safety experiences", Cities, vol. 120, art. no. 103492, pp. 1-12.
0264-2751
http://hdl.handle.net/10017/60011
10.1016/j.cities.2021.103492
AR/0000039059
Cities
120
12
1
eng
https://doi.org/10.1016/j.cities.2021.103492
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
Elsevier
oai:ebuah.uah.es:10017/603612024-02-06T01:17:26Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-04T18:42:22Z
urn:hdl:10017/60361
Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
Paricio García, Álvaro
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Traffic assignment
Traffic control
Vehicle routing
Intelligent transportation systems
Traffic big data
Decision making
Evolutionary algorithms
Multi-map routing
TWM
Path flows
Urban traffic congestion is a pressing issue, demanding effective and cost-efficient solutions. This paper develops the Traffic Weighted Multi-Maps (TWM) method to solve the Traffic Assignment Problem in Intelligent Transportation Systems (ITS). TWM offers drivers diverse views of the network, promoting path diversity and adaptability. Providing an optimal TWM configuration to the traffic demand in terms of structure and allocation policy is a challenging issue as it usually depends on the size of the network and its complexity. The paper explores TWM generation and assignment by applying routing areas based on semi-disjointed k-shortest paths and allocating them using a per-sub flow optimized assignment policy. This approach allows obtaining a pseudo-optimal solution for static traffic assignment with similar results in terms of total travel time compared to the direct solution of calculating optimal map weights and the theoretical system optimum. It offers a cost-effective solution valid for wide urban areas, as the TWM calculation depends on the variety of the traffic flows and the number of semi-disjoint routing areas considered instead of the network complexity and size. Urban network experiments with synthetic traffic demands are studied under different TWM adoption rates, comparing results with existing traffic assignment policies and estimation methods. It highlights its potential for enhancing urban traffic management. Overall, TWM presents a promising approach to addressing urban traffic congestion efficiently.
2024-02-04T18:42:22Z
2024-02-04T18:42:22Z
2023-09-07
2024-02-02T11:45:36Z
info:eu-repo/semantics/article
Paricio-Garcia, A.; Lopez-Carmona, M.A. Application of Traffic Weighted Multi-Maps Based on Disjoint Routing Areas for Static Traffic Assignment. Appl. Sci. 2023, 13, 10071.
2076-3417
http://hdl.handle.net/10017/60361
10.3390/app131810071
AR/0000046216
Applied Sciences
13
18
eng
en
https://doi.org/10.3390/app131810071
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2023 The authors
MDPI
oai:ebuah.uah.es:10017/598602024-03-23T01:16:35Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-24T14:13:19Z
urn:hdl:10017/59860
Fully distributed optical fiber strain sensor with 10-12 ε/√Hz sensitivity
Pereira da Costa, Luis Duarte
Fidalgo Martins, Hugo
Martín López, Sonia
Fernández Ruiz, María Del Rosario
González Herráez, Miguel
Universidad de Alcalá. Departamento de Electrónica
Chirp modulation
Optical fiber applications
Optical time domain reflectometry
Phase noise
Remote sensing
Strain measurements
Vibration measurements
Advanced optical fiber reflectometry techniques enable spatially distributed measurements of true relative deformations over the length of a conventional optical fiber cable. This methodology is attractive for many applications ranging from intrusion monitoring to seismology. However, accurate quantification of the applied stimulus in general implies sophisticated implementations with poor sensitivity performance. Coherent reflectometry using chirped pulses is an appealing solution, as it provides fast dynamic strain measurements with a simple experimental deployment. Here, we analyze for the first time to our knowledge the lower performance bounds of this technique as a function of the signal-to-noise ratio of the acquired optical signal. We demonstrate that implementations realized so far have been limited by the temporal sampling used instead of the optical signal quality. Through post-processing interpolation approaches, we reach the performance limit for a given set of signal parameters, attaining unprecedented strain sensitivities (?10?12epsilon/?Hz) for km-length distributed sensors in conventional single-mode fibers.
2024-01-24T14:13:19Z
2024-01-24T14:13:19Z
2019-09-15
2024-01-22T10:52:04Z
info:eu-repo/semantics/article
Costa, L., Fidalgo Martins, H., Martín López, S., Fernández Ruiz, M.R. & González Herráez, M. 2019, "Fully distributed optical fiber strain sensor with 10-12 ε/√Hz sensitivity", Journal of Lightwave Technology, vol. 37, no. 18, pp. 4487-4495.
0733-8724
http://hdl.handle.net/10017/59860
10.1109/JLT.2019.2904560
AR/0000033069
Journal of Lightwave Technology
37
4495
18
4487
eng
https://doi.org/10.1109/JLT.2019.2904560
info:eu-repo/grantAgreement/EC/FP7/307441/EU/Ubiquitous optical FIbre NErves/U-FINE
info:eu-repo/grantAgreement/EC/H2020/722509/EU/Fibre Nervous Sensing Systems/FINESSE
info:eu-repo/grantAgreement/MINECO//PCIN-2015-219/ES/MONITORIZACION DE DIQUES Y FLUJOS DE ESCOMBROS MEDIANTE NOVEDOSOS SENSORES DE FIBRA OPTICA/
info:eu-repo/grantAgreement/MINECO//TEC2015-71127-C2-2-R/ES/REDUCCION DE LOS EFECTOS DE RUIDO EN SISTEMAS DE FIBRA OPTICA NO LINEALES/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2019 IEEE
IEEE
oai:ebuah.uah.es:10017/533922023-12-14T15:50:27Zcom_10017_149com_10017_17761com_10017_17741com_10017_8415col_10017_150col_10017_49348
2022-09-26T16:59:33Z
urn:hdl:10017/53392
Approaches based on LAMDA control applied to regulate HVAC systems for buildings
Morales, L.
Pozo-Espín, D.
Aguilar Castro, José Lisandro
Rodríguez Moreno, María Dolores
Universidad de Alcalá. Departamento de Automática
LAMDA
SMC
Intelligent control
Nonlinear systems
HVAC systems
The control of HVAC (Heating Ventilation and Air Conditioning) systems is usually complex because its modeling in certain cases is difficult, since these systems have a large number of components. Heat exchangers, chillers, valves, sensors, and actuators, increase the non-linear characteristics of the complete model, so it is necessary to propose new control strategies that can handle the uncertainty generated by all these elements working together. On the other hand, artificial intelligence is a powerful tool that allows improving the performance of control systems with inexact models and uncertainties. This paper presents new control alternatives for HVAC systems based on LAMDA (Learning Algorithm for Multivariable Data Analysis). This algorithm has been used in the field of machine learning, however, we have taken advantage of its learning characteristics to propose different types of intelligent controllers to improve the performance of the overall control system in tasks of regulation and reference change. In order to perform a comparative analysis in the context of HVAC systems, conventional methods such as PID and Fuzzy-PID are compared with LAMDA-PID, LAMDA-Sliding Mode Control based on Z-numbers (ZLSMC), and Adaptive LAMDA. Specifically, two HVAC systems are implemented by simulations to evaluate the proposals: an MIMO (Multiple-input Multiple-output) HVAC system and an HVAC system with dead time, which are used to compare the results qualitatively and quantitatively. The results show that ZLSMC is the most robust controller, which efficiently controls HVAC systems in cases of reference changes and the presence of disturbances.
2022-09-26T16:59:33Z
2022-09-26T16:59:33Z
2022-04-01
2022-09-26T16:58:08Z
info:eu-repo/semantics/article
Morales, L., Pozo-Espín, D., Aguilar Castro, J.L. & Rodríguez Moreno, M.D. 2022, “Approaches based on LAMDA control applied to regulate HVAC systems for buildings”, Journal of Process Control, vol. 116, pp. 34-52.
0959-1524
http://hdl.handle.net/10017/53392
10.1016/j.jprocont.2022.05.013
AR/0000041815
Journal of Process Control
116
52
34
eng
https://doi.org/10.1016/j.jprocont.2022.05.013
info:eu-repo/grantAgreement/EC/H2020/754382/EU/GOT Energy Talent/GET
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-109891RB-I00/ES/MEJORA DE LA GESTION DE RECURSOS HOSPITALARIOS MEDIANTE LA PREDICCION DE LA DEMANDA CON APRENDIZAJE AUTOMATICO Y PLANIFICACION/
info:eu-repo/grantAgreement/JCCM//SBPLY%2F19%2F180501%2F000024/ES/MEJORA DE LA GESTIÓN DE RECURSOS HOSPITALARIOS MEDIANTE LA PREDICCIÓN DE LA DEMANDA CON APRENDIZAJE AUTOMÁTICO Y PLANIFICACIÓN
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/596172024-02-26T08:40:54Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-18T11:03:20Z
urn:hdl:10017/59617
Outperforming RPL with scalable routing based on meaningful MAC addressing
Rojas Sánchez, Elisa
Hosseini , Hedayat
Gómez , Carles
Carrascal Acebron, David
Rodrigues Cotrim, Jeferson
Universidad de Alcalá. Departamento de Automática
RPL is the de-facto IPv6-based routing protocol for the Internet of Things (IoT), where networks are mainly formed by sensors and other low capacity devices. However, RPL lacks scalability and is inefficient in any-to-any communications. In this article, we present IoTorii, a hierarchical protocol that creates routes based on a probe frame, instead of the computation of a distance vector, as in RPL. We implemented a proof-of-concept of IoTorii and compared it with RPL, proving lower number of table entries, decreased exchanged control messages and faster convergence time, with similar path hop count, which is particularly promising in the IoT field.
2024-01-18T11:03:20Z
2024-01-18T11:03:20Z
2021-04-01
2024-01-12T10:48:50Z
info:eu-repo/semantics/article
Rojas Sánchez, Elisa, Hosseini, Hedayat , Gomez, Carles, Carrascal Acebrón, David, Rodrigues Cotrim, Jeferson,
Outperforming RPL with scalable routing based on meaningful MAC addressing,
Ad Hoc Networks, Volume 114,2021, 102433
1570-8705
http://hdl.handle.net/10017/59617
10.1016/j.adhoc.2021.102433
AR/0000036856
Ad Hoc Networks
114
102433
eng
https.//doi.org/10.1016/j.adhoc.2021.102433
info:eu-repo/grantAgreement/Generalitat de Catalunya//SGR-376/ES
info:eu-repo/grantAgreement/JCCM//SBPLY%2F19%2F180501%2F000324%2FIRIS-JCCM/ES/Servicios y protocolos para la Integración de Redes de baja capacidad en entornos Inteligentes basados en SDN/NFV y redes 5G
info:eu-repo/grantAgreement/CAM//CM%2FJIN%2F2019-039%2FIRIS-CM/ES/Integración de Redes IoT en entornos inteligentes basados en SDN/NFV y redes 5G
info:eu-repo/grantAgreement/CAM//S2018%2FTCS-4496%2FTAPIR-CM/ES/Técnicas Avanzadas para Potenciar la Inteligencia de las Redes 5G/TAPIR
info:eu-repo/grantAgreement/AEI//PID2019-106808RA-I00/ES/RED MALLADA IOT CON RADIO DE BAJA POTENCIA
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
Elsevier
oai:ebuah.uah.es:10017/605902024-03-04T08:44:49Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-08T08:03:43Z
urn:hdl:10017/60590
Radial evolution of the April 2020 stealth coronal mass ejection between 0.8 and 1 AU - Comparison of Forbush decreases at Solar Orbiter and near the Earth
Freiherr Von Forstner , J.L.
Dumbovic , M.
Mostl , C.
Guo , J.
Papaioannou , A.
Elftmann , R.
Xu , Z
Terasa , C.
Kollhoff , A.
Wimmer-Schweingruber , R. F.
Rodríguez-Pacheco Martín, Javier
Weiss , A.
Hinterreiter , J.
Amerstorfer , T.
Bauer , M.
Belov , A.V.
Abunina , M.A.
Horbury , T. S.
Davies , E.
O¿Brien , H.
Allen, R.C.
Andrews, G. B.
Berger , Lars
Boden , S.
Cernuda Cangas, Ignacio Manuel
Eldrum , S.
Espinosa Lara, Francisco
Gómez Herrero, Raúl
Hayes , J
Ho , G. C.
Kulkarni , S. R.
Lees , J
Martín , C.
Mason , G. M.
Pacheco , D.
Prieto Mateo, Manuel
Sánchez Prieto, Sebastián
Ravanbakhsh , A.
Rodríguez Polo, Óscar
Schlemm , C
Seifert , H.
Tyagi , K.
Yedla , M.
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas
Aims. We present observations of the first coronal mass ejection (CME) observed at the Solar Orbiter spacecraft on April 19, 2020, and the associated Forbush decrease (FD) measured by its High Energy Telescope (HET). This CME is a multispacecraft event also seen near Earth the next day. Methods. We highlight the capabilities of HET for observing small short-term variations of the galactic cosmic ray count rate using its single detector counters. The analytical ForbMod model is applied to the FD measurements to reproduce the Forbush decrease at both locations. Input parameters for the model are derived from both in situ and remote-sensing observations of the CME. Results. The very slow (~350 km/s) stealth CME caused a FD with an amplitude of 3 % in the low-energy cosmic ray measurements at HET and 2 % in a comparable channel of the Cosmic Ray Telescope for the Effects of Radiation (CRaTER) on the Lunar Reconnaissance Orbiter, as well as a 1 % decrease in neutron monitor measurements. Significant differences are observed in the expansion behavior of the CME at different locations, which may be related to influence of the following high speed solar wind stream. Under certain assumptions, ForbMod is able to reproduce the observed FDs in low-energy cosmic ray measurements from HET as well as CRaTER, but with the same input parameters, the results do not agree with the FD amplitudes at higher energies measured by neutron monitors on Earth. We study these discrepancies and provide possible explanations. Conclusions. This study highlights that the novel measurements of the Solar Orbiter can be coordinated with other spacecraft to improve our understanding of space weather in the inner heliosphere. Multi-spacecraft observations combined with data-based modeling are also essential to understand the propagation and evolution of CMEs as well as their space weather impacts.
2024-02-08T08:03:43Z
2024-02-08T08:03:43Z
2021-12-14
2024-02-07T12:36:44Z
info:eu-repo/semantics/article
Johan L. Freiherr von Forstner [et al], Radial evolution of the April 2020 stealth coronal mass ejection between 0.8 and 1 AU - Comparison of Forbush decreases at Solar Orbiter and near the Earth, Astronomy & Astrophysics, 656, A1 (2021)
0004-6361
http://hdl.handle.net/10017/60590
10.1051/0004-6361/202039848
AR/0000040308
Astronomy & Astrophysics
653
16
A1
1
eng
https://doi.org/10.1051/0004-6361/202039848
https://doi.org/10.1051/0004-6361/202039848
ESP2105-68266-R (FEDER/MCIU/AEI) y ESP2017-88436-R (FEDER/MCIU/AEI)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© ESO 2021
edp sciences
oai:ebuah.uah.es:10017/605062024-02-07T01:16:50Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-02-06T19:07:39Z
urn:hdl:10017/60506
Modeling driving experience in smart traffic routing scenarios: application to traffic multi-map routing
Paricio García, Álvaro
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Dynamic traffic assignment
Multi-map routing
Fuzzy logic
Evolutionary algorithms
Discrete choice modeling
Traffic simulation
Vehicle routing
Traffic weighted multi-maps
The effectiveness of user-oriented traffic routing applications to mitigate traffic congestion in Intelligent Transportation Systems depends on their degree of adoption, which usually evolves depending on subjective and exogenous factors. This paper proposes a user experience and social dynamics model to analyze and evaluate traffic routing methods, based on fuzzy rules and discrete choice theory. The model has been applied to the optimal Traffic-Weighted Multi-Maps (TWM) routing method to evaluate the adoption dynamics and analyze convergence towards the system optimum. Route unfairness and resistance to change are also considered in the model. Experimental results are obtained simulating the evolution of the drivers' population behavior. Simulation is carried over synthetic and real networks, using optimized TWM maps. The experimental results show how the TWM system evolves to a stationary System Optimum, improving overall traffic congestion and showing how User Equilibrium variability is bounded as it depends on user routing choices influenced by behavioral patterns.
2024-02-06T19:07:39Z
2024-02-06T19:07:39Z
2021-06-21
2024-02-06T19:07:04Z
info:eu-repo/semantics/article
Paricio García, A. & López Carmona, M.A. 2021, "Modeling driving experience in smart traffic routing scenarios: application to traffic multi-map routing", IEEE Access, vol. 9, pp. 90170-90184.
2169-3536
http://hdl.handle.net/10017/60506
10.1109/ACCESS.2021.3091322
AR/0000046274
IEEE Access
9
90184
90170
eng
https://doi.org/10.1109/ACCESS.2021.3091322
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
IEEE
oai:ebuah.uah.es:10017/551062023-12-14T15:41:51Zcom_10017_149com_10017_17761com_10017_17741com_10017_248com_10017_281com_10017_17964col_10017_150col_10017_304col_10017_282
2023-01-10T14:09:30Z
urn:hdl:10017/55106
A simple formula for the computation of branches and asymptotes of curves and some applications
Campo Montalvo, Elena
Fernández De Sevilla Vellón, María De Los Ángeles
Pérez Díaz, Sonia
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Matemáticas
Parametrization
Curves
Infinity branches
Asymptotes
Perfect curves
In this paper, we obtain a simple formula based on the computation of some derivatives for determining the branches and the asymptotes of curves that are defined by a parametrization. For this purpose, we use some previous results and notions presented in Blasco and Pérez-Díaz, 2014a, Blasco and Pérez-Díaz, 2014b, Blasco and Pérez-Díaz, 2015, Blasco and Pérez-Díaz, 2020. From these results, we show how the generalized asymptotes of the input curve can be easily computed and we present some applications related to the ramification index and degree of the asymptote, the infinity form and the multiplicity of the infinity points. Furthermore, we show how to construct all the families of parametric curves having some given asymptotes. We develop this method for the plane case but it can be trivially adapted for dealing with rational curves in n-dimensional space. In addition, the formulaes presented can be similarly obtained for curves defined by a parametrization not necessarily rational.
2023-01-10T14:09:30Z
2023-01-10T14:09:30Z
2022-03-02
2023-01-10T14:08:58Z
info:eu-repo/semantics/article
Campo Montalvo, E., Fernández de Sevilla, M. & Pérez Díaz, S. 2022, "A simple formula for the computation of branches and asymptotes of curves and some applications", Computer Aided Geometric Design, vol. 94, art. no. 102084.
0167-8396
http://hdl.handle.net/10017/55106
10.1016/j.cagd.2022.102084
AR/0000042016
Computer Aided Geometric Design
94
eng
https://doi.org/10.1016/j.cagd.2022.102084
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-113192GB-I00/ES/VISUALIZACION MATEMATICA: FUNDAMENTOS, ALGORITMOS Y APLICACIONES/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/603462024-02-29T19:02:53Zcom_10017_149com_10017_17761com_10017_17741com_10017_8415col_10017_150col_10017_49348
2024-02-02T18:31:30Z
urn:hdl:10017/60346
Urban intersection classification: a comparative analysis
Ballardini, Augusto Luis
Hernández Saz, Álvaro
Carrasco Limeros, Sandra
Lorenzo Diaz, Javier
Parra Alonso, Ignacio
Hernández Parra, Noelia
García Daza, Iván
Sotelo Vázquez, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Intersection classification
Scene understanding
Self driving
Intelligent transportation systems
CNN
GAN
RNN
Understanding the scene in front of a vehicle is crucial for self-driving vehicles and Advanced Driver Assistance Systems, and in urban scenarios, intersection areas are one of the most critical, concentrating between 20% to 25% of road fatalities. This research presents a thorough investigation on the detection and classification of urban intersections as seen from onboard front-facing cameras. Different methodologies aimed at classifying intersection geometries have been assessed to provide a comprehensive evaluation of state-of-the-art techniques based on Deep Neural Network (DNN) approaches, including single-frame approaches and temporal integration schemes. A detailed analysis of most popular datasets previously used for the application together with a comparison with ad hoc recorded sequences revealed that the performances strongly depend on the field of view of the camera rather than other characteristics or temporal-integrating techniques. Due to the scarcity of training data, a new dataset is created by performing data augmentation from real-world data through a Generative Adversarial Network (GAN) to increase generalizability as well as to test the influence of data quality. Despite being in the relatively early stages, mainly due to the lack of intersection datasets oriented to the problem, an extensive experimental activity has been performed to analyze the individual performance of each proposed systems.
2024-02-02T18:31:30Z
2024-02-02T18:31:30Z
2021-09-18
2024-02-02T18:30:57Z
info:eu-repo/semantics/article
Ballardini, A.L. [et al.], 2021, "Urban intersection classification: a comparative analysis", Sensors, vol. 21, no. 18, pp. 1-31.
1424-8220
http://hdl.handle.net/10017/60346
10.3390/s21186269
AR/0000037837
Sensors
21
31
18
1
eng
https://doi.org/10.3390/s21186269
info:eu-repo/grantAgreement/EC/H2020/754382/EU/GOT Energy Talent/GET
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/DPI2017-90035-R/ES/INTERACCION PREDICTIVA ENTRE VEHICULOS AUTONOMOS COOPERATIVOS Y USUARIOS VULNERABLES DE CARRETERA ORIENTADA AL USUARIO FINAL/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-114924RB-I00/ES/AGENTES REALES EN ENTORNOS VIRTUALES PARA SISTEMAS AUTONOMOS PREDICTIVOS/
2018/EMT-4362 SEGVAUTO 4.0-CM
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2021 The authors
MDPI
oai:ebuah.uah.es:10017/536142023-12-14T15:27:39Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2022-10-13T14:09:55Z
urn:hdl:10017/53614
System Identification for the design of behavioral controllers in crowd evacuations
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Crowd evacuation
Behavioral optimization
Distance-keeping
Behavioral controller
System identification
Model predictive control (MPC)
Behavioral modification using active instructions is a promising interventional method to optimize crowd evacuations. However, existing research efforts have been more focused on eliciting general principles of optimal behavior than providing explicit mechanisms to dynamically induce the desired behaviors, which could be claimed as a significant knowledge gap in crowd evacuation optimization. In particular, we propose using dynamic distancekeeping instructions to regulate pedestrian flows and improve safety and evacuation time. We investigate the viability of using Model Predictive Control (MPC) techniques to develop a behavioral controller that obtains the optimal distance-keeping instructions to modulate the pedestrian density at bottlenecks. System Identification is proposed as a general methodology to model crowd dynamics and build prediction models. Thus, for a testbed evacuation scenario and input?output data generated from designed microscopic simulations, we estimate a linear AutoRegressive eXogenous model (ARX), which is used as the prediction model in the MPC controller. A microscopic simulation framework is used to validate the proposal that embeds the designed MPC controller, tuned and refined in closed-loop using the ARX model as the Plant model. As a significant contribution, the proposed combination of MPC control and System Identification to model crowd dynamics appears ideally suited to develop realistic and practical control systems for controlling crowd motion. The flexibility of MPC control technology to impose constraints on control variables and include different disturbance models in the prediction model has confirmed its suitability in the design of behavioral controllers in crowd evacuations. We found that an adequate selection of output disturbance models in the predictor is critical in the type of responses given by the controller. Interestingly, it is expected that this proposal can be extended to different evacuation scenarios, control variables, control systems, and multiple-input multiple-output control structures.
2022-10-13T14:09:55Z
2022-10-13T14:09:55Z
2022-10-11
2022-10-13T14:09:27Z
info:eu-repo/semantics/article
López Carmona, M.A. 2022, "System Identification for the design of behavioral controllers in crowd evacuations", Tramsportation Research, Part C: Emerging Technologies, vol. 144, art. no. 103913.
0968-090X
http://hdl.handle.net/10017/53614
10.1016/j.trc.2022.103913
AR/0000041899
Tramsportation Research, Part C: Emerging Technologies
144
eng
https://doi.org/10.1016/j.trc.2022.103913
info:eu-repo/grantAgreement/MINECO//TIN2016-80622-P/ES/Dynamic Network Agreement: negociaciones estructurales en redes complejas/DNA
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Elsevier
oai:ebuah.uah.es:10017/551222023-12-14T15:41:51Zcom_10017_149com_10017_17761com_10017_17741com_10017_248com_10017_281com_10017_17964col_10017_150col_10017_304col_10017_282
2023-01-09T16:18:47Z
urn:hdl:10017/55122
Some New Symbolic Algorithms for the Computation of Generalized Asymptotes
Campo Montalvo, Elena
Fernández De Sevilla Vellón, María De Los Ángeles
Magdalena Benedicto, Rafael
Pérez Díaz, Sonia
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Matemáticas
Algebraic curves
Infinity branches
Convergent branches
Approaching curves
Generalized asymptotes
Algorithm performance
Symbolic computation
We present symbolic algorithms for computing the g-asymptotes, or generalized asymptotes, of a plane algebraic curve, C, implicitly or parametrically defined. The g-asymptotes generalize the classical concept of asymptotes of a plane algebraic curve. Both notions have been previously studied for analyzing the geometry and topology of a curve at infinity points, as well as to detect the symmetries that can occur in coordinates far from the origin. Thus, based on this research, and in order to solve practical problems in the fields of science and engineering, we present the pseudocodes and implementations of algorithms based on the Puiseux series expansion to construct the g-asymptotes of a plane algebraic curve, implicitly or parametrically defined. Additionally, we propose some new symbolic methods and their corresponding implementations which improve the efficiency of the preceding. These new methods are based on the computation of limits and derivatives; they show higher computational performance, demanding fewer hardware resources and system requirements, as well as reducing computer overload. Finally, as a novelty in this research area, a comparative analysis for all the algorithms is carried out, considering the properties of the input curves and their outcomes, to analyze their efficiency and to establish comparative criteria between them.
2023-01-09T16:18:47Z
2023-01-09T16:18:47Z
2022-12-26
2023-01-09T16:18:14Z
info:eu-repo/semantics/article
Campo Montalvo, E., Fernandez de Sevilla, M., Magdalena Benedicto, J.R. & Perez Diaz, S. 2023, "Some New Symbolic Algorithms for the Computation of Generalized Asymptotes", Symmetry, vol. 15, no. 1, art. no. 69.
2073-8994
http://hdl.handle.net/10017/55122
10.3390/sym15010069
AR/0000042131
Symmetry
15
1
eng
https://doi.org/10.3390/sym15010069
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-113192GB-I00/ES/VISUALIZACION MATEMATICA: FUNDAMENTOS, ALGORITMOS Y APLICACIONES/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica, Técnica y de Innovación 2021-2023/PID2021-127946OB-100
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
MDPI
oai:ebuah.uah.es:10017/596902024-02-29T19:08:51Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2024-01-19T12:45:48Z
urn:hdl:10017/59690
Towards visual programming abstractions in Software Defined Networking
Rojas Sánchez, Elisa
Ollora Zaballa, Eder
Noci Luna, Victoria
Universidad de Alcalá. Departamento de Automática
Since Software-Defined Networking (SDN) emerged, the research community and industry have developed numerous projects and fostered novel use cases. However, engineers now need to learn how to program the control and data planes, which might slow down technology acceptance. To accelerate it, visual programming abstractions facilitate the incorporation of SDN technologies and assist in creating new applications. So far, very little effort has been made in this field. This letter presents an early-stage SDN visual abstraction initiative based on the Scratch/Blockly programming framework, initially aimed at kids. The objective is to illustrate how this work could be extended to provide value-added resources for network programming.
2024-01-19T12:45:48Z
2024-01-19T12:45:48Z
2022-02-24
2024-01-16T09:43:54Z
info:eu-repo/semantics/article
Internet Technology Letters, 2022, v. 5, n. 3
2476-1508
http://hdl.handle.net/10017/59690
10.1002/itl2.358
AR/0000041077
Internet Technology Letters
5
3
en
https://doi.org/10.1002/itl2.358
info:eu-repo/grantAgreement/UAH//CM-JIN-2019-039
info:eu-repo/grantAgreement/CAM//S2018%2FTCS-4496/ES/TECNICAS AVANZADAS PARA POTENCIAR LA INTELIGENCIA DE LAS REDES 5G/TAPIR-CM
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-116361RA-I00/ES/OPERACION Y GESTION DE REDES PROGRAMABLES PARA EL SOPORTE ACTIVO DE SERVICIOS CENTRADOS EN LOS USUARIOS/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
© 2022 The Authors
oai:ebuah.uah.es:10017/592142024-01-10T01:16:27Zcom_10017_149com_10017_17761com_10017_17741com_10017_291com_10017_17964col_10017_150col_10017_292
2024-01-09T16:46:51Z
urn:hdl:10017/59214
The mini-neutron monitor: a new approach in neutron monitor design
Strauss, Du Toit
Poluianov, Stepan
Van Der Merwe, Cobus
Kruger, Hendrik
Diedericks, Corrie
Kruger, Helena
Usoskin, Ilya
Heber, Bernd
Nndanganeni, Rendani
Blanco Ávalos, Juan José
García Tejedor, Juan Ignacio
Herbst, Konstantin
Caballero-Lopez, Rogelio
Moloto, Katlego
Lara, Alejandro
Walter, Michael
Giday, Nigussie Mezgebe
Traversi, Rita
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Física y Matemáticas
Neutron monitors
Space weather instrumentation
Sosmic rays
Neutron monitor multiplicity
The near-Earth cosmic ray flux has been monitored for more than 70 years by a network of ground-based neutron monitors (NMs). With the ever-increasing importance of quantifying the radiation risk and effects of cosmic rays for, e.g., air and space-travel, it is essential to continue operating the existing NM stations, while expanding this crucial network. In this paper, we discuss a smaller and cost-effective version of the traditional NM, the mini-NM. These monitors can be deployed with ease, even to extremely remote locations, where they operate in a semi-autonomous fashion. We believe that the mini-NM, therefore, offers the opportunity to increase the sensitivity and expand the coverage of the existing NM network, making this network more suitable to near-real-time monitoring for space weather applications. In this paper, we present the technical details of the mini-NM?s design and operation, and present a summary of the initial tests and science results.
2024-01-09T16:46:51Z
2024-01-09T16:46:51Z
2020-08-21
2024-01-09T16:46:31Z
info:eu-repo/semantics/article
Strauss, D.T. [et al.] 2020, "The mini-neutron monitor: a new approach in neutron monitor design", Journal of Space Weather and Space Climate, vol. 10, p. 1-12.
http://hdl.handle.net/10017/59214
10.1051/swsc/2020038
AR/0000035532
Journal of Space Weather and Space Climate
10
12
1
2115-7251
eng
https://doi.org/10.1051/swsc/2020038
info:eu-repo/grantAgreement/AEI//CTM2016-77325-C2-1-P/ES/OBSERVATORIO DE RAYOS COSMICOS ANTARTICOS/ORCA
http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
Attribution 4.0 International (CC BY 4.0)
EDP Sciences
oai:ebuah.uah.es:10017/551082023-12-14T15:41:52Zcom_10017_149com_10017_17761com_10017_17741com_10017_248com_10017_281com_10017_17964col_10017_150col_10017_304col_10017_282
2023-01-10T14:27:31Z
urn:hdl:10017/55108
Asymptotic behavior of a surface implicitly defined
Campo Montalvo, Elena
Fernández De Sevilla Vellón, María De Los Ángeles
Pérez Díaz, Sonia
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Ciencias de la Computación
Universidad de Alcalá. Departamento de Física y Matemáticas. Unidad docente Matemáticas
Algebraic surfaces implicitly defined
Infinity branch
Convergent branch
Asymptotic behavior
Approaching surfaces
In this paper, we introduce the notion of infinity branches and approaching surfaces. We obtain an algorithm that compares the behavior at the infinity of two given algebraic surfaces that are defined by an irreducible polynomial. Furthermore, we show that if two surfaces have the same asymptotic behavior, the Hausdorff distance between them is finite. All these concepts are new and represent a great advance for the study of surfaces and their applications.
2023-01-10T14:27:31Z
2023-01-10T14:27:31Z
2022-04-25
2023-01-10T14:27:04Z
info:eu-repo/semantics/article
Campo Montalvo, E., Fernández de Sevilla, M. & Pérez Díaz, S. 2022, "Asymptotic behavior of a surface implicitly defined", Mathematics, vol. 10, no. 9, art. no. 1445.
2227-7390
http://hdl.handle.net/10017/55108
10.3390/math10091445
AR/0000042017
Mathematics
10
9
eng
https://doi.org/10.3390/math10091445
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-113192GB-I00/ES/VISUALIZACION MATEMATICA: FUNDAMENTOS, ALGORITMOS Y APLICACIONES/
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
MDPI
oai:ebuah.uah.es:10017/12592023-12-14T15:51:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T18:19:02Z
urn:hdl:10017/1259
Arquitectura de agentes para entornos domóticos
Paricio García, Álvaro
Velasco Pérez, Juan Ramón
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Domótica
Agentes inteligentes
Inteligencia Ambiental
En la rápida evolución sufrida por los sistemas domóticos e inmóticos en los últimos años, el papel de los agentes y
específicamente, de los agentes inteligentes, es cada vez más relevante. La gran mayoría de las propuestas de
investigación y comerciales, incluyen uno o más agentes dotados de un nivel de inteligencia variable según su
función. Este artículo realiza una taxonomía de los agentes implicados en el entorno domótico, según su
funcionalidad, proponiendo una Arquitectura de Sistema Multiagente (MAS) al efecto. En ella se presta especial
atención a la distinción entre el conjunto de agentes personales nómadas (móviles con los usuarios y con los
dispositivos), y el conjunto de agentes estáticos o de sistema con los que interactúan. Éstos últimos pueden resultar
de propiedad individual, colectiva o de terceros, por lo que los modelos de negociación presentan ciertas
diferencias, en la obtención de recursos y servicios.
2008-01-24T18:19:02Z
2008-01-24T18:19:02Z
2004
info:eu-repo/semantics/conferenceObject
XIV Jornadas Telecom I+D
http://hdl.handle.net/10017/1259
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12602023-12-14T15:51:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T18:32:51Z
urn:hdl:10017/1260
Arquitectura para un sistema domótico basado en agentes
Marsá Maestre, Iván
Navarro Guillén, Andrés
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Entorno Inteligente
Domótica
Agentes Software
Dispositivos Personales
Un entorno inteligente -smart environment- es aquél capaz de adquirir y aplicar conocimientos acerca de sus habitantes y
de lo que les rodea con el fin de adaptarse a ellos. Esta definición presupone no sólo la capacidad de recoger información
acerca del propio entorno y sus habitantes y de actuar sobre la condiciones del mismo, sino también la capacidad del
entorno para inferir estrategias de operación adecuadas a partir de la observación y del conocimiento de las preferencias
de sus usuarios. Estas consideraciones plantean requisitos de minería de datos distribuida, autonomía e inteligencia que
sugieren el empleo de tecnología de agentes como una opción prometedora para este tipo de sistemas. En este documento
se propone una arquitectura que sirve de punto de partida para la construcción un sistema de entorno inteligente -en
particular, un sistema domótico- basado en agentes software.
2008-01-24T18:32:51Z
2008-01-24T18:32:51Z
2004
info:eu-repo/semantics/conferenceObject
Conferencia IADIS Ibero-americana WWW/Internet 2004
http://hdl.handle.net/10017/1260
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18942023-12-14T15:51:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-09-03T11:56:43Z
urn:hdl:10017/1894
Sistemas multiagente de tiempo real
Marsá Maestre, Iván
Sánchez Prieto, Sebastián
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Sistemas multiagente
Tiempo real
Existen diferentes aplicaciones y entornos de tiempo real
donde puede ser necesario o conveniente incluir capacidades de proceso
e inferencia más propias de la inteligencia arti cial. Este trabajo realiza
un breve análisis de la problemática de integrar inteligencia arti cial y
consideraciones de tiempo real en una misma aplicación, así como de las
técnicas más utilizadas para ello. Por último, se presentan los sistemas
multiagente de tiempo real como una alternativa prometedora para este
tipo de sistemas, se enumeran los requisitos que deben cumplir, y se comentan
dos de las arquitecturas existentes para el diseño de sistemas
multiagente de tiempo real: ObjectAgent y SIMBA.
2008-09-03T11:56:43Z
2008-09-03T11:56:43Z
2005
info:eu-repo/semantics/article
Proceedings of the 1st Iberoamerican Congress on Ubiquitous Computing CICU¿2005
http://hdl.handle.net/10017/1894
spa
info:eu-repo/semantics/openAccess
CEUR Workshop Proceedings
oai:ebuah.uah.es:10017/12622023-12-14T15:52:00Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T18:53:47Z
urn:hdl:10017/1262
A fully-distributed, multiagent approach to negotiation in mobile ad-hoc networks
Marsá Maestre, Iván
Velasco Pérez, Juan Ramón
López Carmona, Miguel Ángel
Navarro Guillén, Andrés
Universidad de Alcalá. Departamento de Automática
Multiagent approach
Mobile ad-hoc networks
This paper presents an interaction protocol intended to be used in distributed negotiation problems using software agents,
which could be applied to multi-agent systems deployed over Personal Digital Assistants (PDAs) connected via wireless
networks. We are especially interested in semi-competitive scenarios, where each agent in the system acts on behalf of a
user, trying to maximize its user preferences while pursuing a common agreement. In these conditions, and especially if
we are dealing with open and dynamic environments like mobile ad-hoc networks, the goals and attitudes of software
agents cannot be guaranteed. Taking this into account we propose a protocol where interaction among agents is done in a
fully-distributed manner, so that no user can have negotiation privileges over the others.
2008-01-24T18:53:47Z
2008-01-24T18:53:47Z
2005-10
info:eu-repo/semantics/conferenceObject
International Conference IADIS WWW/Internet 2005
http://hdl.handle.net/10017/1262
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12632023-12-14T15:52:00Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T18:56:07Z
urn:hdl:10017/1263
A contextual ontology to provide location-aware services and interfaces in smart environments
Machuca, Miriam
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Location-aware services
Interfaces
Smart environments
Context-aware computing is about gathering user information and their environment such as user location and
preferences, service status, and nearby devices. Such context information is used to adjust enviroment settings to suit user
needs and preferences. As environments can change rapidly, applications must be aware of it and adapt their behaviour in
real time. We describe an application that introduces intelligent agents in smart homes to provide location-aware services
and interfaces. This application must keep an eye on some context information to carry out user preferences. Our
approach is based on a contextual ontology that is a key component to enable context sharing and representation.
2008-01-24T18:56:07Z
2008-01-24T18:56:07Z
2005-10
info:eu-repo/semantics/conferenceObject
International Conference IADIS WWW/Internet 2005
http://hdl.handle.net/10017/1263
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18962023-12-14T15:27:41Zcom_10017_149com_10017_17761com_10017_17741col_10017_150
2008-09-03T12:14:58Z
urn:hdl:10017/1896
Modelo de negociación automática bilateral para entornos abiertos de comercio electrónico
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Navarro Guillén, Andrés
Universidad de Alcalá. Departamento de Automática
Comercio electrónico
Modelo de negociación
Entornos abiertos
Negociación automática
Este artículo presenta un modelo para la negociación automática bilateral y multiparámetrica en entornos abiertos de
comercio electrónico. El modelo se describe en el ámbito de un entorno competitivo de agentes software, en el que uno
de los agentes del sistema actúa como comprador y otro de los agentes como vendedor. En un sistema abierto, la
incertidumbre acerca del comportamiento de otro agente es clave, correspondiéndose con la realidad presente en medios
convencionales de negociación o en comercio electrónico e Internet. Aún así, la actitud de un agente en un entorno
competitivo frente a otro agente, puede diferir en cuanto al nivel de confianza recíproca existente. De esta manera, el
modelo integra diferentes estrategias de interacción que son función de este nivel de confianza. Estas estrategias abarcan
desde un posicionamiento púramente competitivo, con criterios estrictos de mínima revelación de información, hasta una
estrategia cooperativa, en la que este criterio de privacidad se relaja. El modelo es capaz de encontrar una solución o
acuerdo justo si dicha solución existe, de manera que en el proceso de negociación ningún usuario tenga privilegios. Se
emplean restricciones difusas con prioridades (PFCSPs) con valoraciones y graduación de privacidad para representar
propuestas, ya sean específicas o de espacios de soluciones, y para definir el grado de satisfacción de estas posibles
soluciones. Dicho grado de satisfacción es función del cumplimiento de las restricciones impuestas al proceso de
negociación, del perfil del usuario, y de mecanismos de argumentación.
2008-09-03T12:14:58Z
2008-09-03T12:14:58Z
2008-09-03T12:14:58Z
info:eu-repo/semantics/article
http://hdl.handle.net/10017/1896
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12652023-12-14T15:52:00Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T19:09:05Z
urn:hdl:10017/1265
Location-aware services and interfaces in smart homes using multiagent systems
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Navarro Guillén, Andrés
López Carmona, Miguel Ángel
Vicente Rodríguez, Antonio José de
Hoz de la Hoz, Enrique de la
Paricio García, Álvaro
Machuca, Miriam
Universidad de Alcalá. Departamento de Automática
Location-aware services
Smart homes
Multiagent systems
Computer systems are fully capable of providing
customized interfaces for users. Every time we log on to an ecommerce
website we have used before, the interface changes
in order to fit our most probable interests. Some sophisticated
vehicles adjust the seat position, rearview mirror orientation and
other parameters to match the preferences of the drivers when
they enter the car -provided that they belong to the set of known
drivers-. However, this kind of service customization has not yet
reached the home environment. In the same way as computer
systems with productivity, the smart home must prevent the user
from performing routine and tedious tasks to achieve comfort,
security, and effective energy management. In this paper we
propose an architecture for building a smart home environment
using multiagent systems, and we demonstrate its effectivenes
with an application example where multimedia contents follow
the user movements throughout the house.
2008-01-24T19:09:05Z
2008-01-24T19:09:05Z
2005
info:eu-repo/semantics/conferenceObject
The 2005 International Conference on Pervasive Systems and Computing
http://hdl.handle.net/10017/1265
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12642023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T19:02:47Z
urn:hdl:10017/1264
Personalización de servicios multimedia en el hogar digital inteligente
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Navarro Guillén, Andrés
López Carmona, Miguel Ángel
Vicente Rodríguez, Antonio José de
Hoz de la Hoz, Enrique de la
Paricio García, Álvaro
Machuca, Miriam
Universidad de Alcalá. Departamento de Automática
Servicios multimedia
Hogar digital inteligente
Hace ya tiempo que los sistemas informáticos
nos tienen acostumbrados a ofrecernos un
interfaz personalizado. Cada vez que nos
conectamos de nuevo a un sitio de comercio
electrónico en el que solemos adquirir
productos, el interfaz de la tienda se adapta a
nuestros gustos o preferencias. Otro ejemplo de
personalización se produce en algunos
vehículos, habitualmente de gama alta, que
configuran el asiento y las condiciones de
conducción a la persona que utiliza el coche
(normalmente, mediante una serie de
preferencias almacenadas en alguna memoria,
que activamos al entrar).
Sin embargo, esa personalización aún no ha
llegado a las viviendas. Al igual que los
ordenadores en el mundo productivo, el hogar
digital del futuro debe evitar que el usuario
tenga que realizar tareas rutinarias que afectan a
su confort, seguridad o movimientos. Este
trabajo propone una arquitectura que permite la
personalización del hogar digital por medio de
la tecnología de sistemas multiagente. Como
ejemplo de aplicación proponemos un sistema
capaz de hacer que los contenidos multimedia a
los que un usuario accede, le ¿persigan¿ por su
hogar a medida que se mueve, sin pérdida de
información.
2008-01-24T19:02:47Z
2008-01-24T19:02:47Z
2005
info:eu-repo/semantics/conferenceObject
X Congreso Nacional de Internet, Telecomunicaciones y Sociedad de la Información
http://hdl.handle.net/10017/1264
spa
info:eu-repo/semantics/openAccess
Mundo Internet 2005
oai:ebuah.uah.es:10017/18922023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-09-03T11:52:29Z
urn:hdl:10017/1892
Un enfoque práctico para la localización de usuarios mediante Bluetooth en entornos domóticos
Marsá Maestre, Iván
Machuca, Miriam
Navarro Guillén, Andrés
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Domótica
Localización de usuarios
Bluetooth
Para que un sistema domótico pueda adaptarse adecuadamente
a las preferencias de sus diferentes usuarios, debe ser capaz de determinar
en cada momento en qué habitación se encuentran éstos dentro
de la vivienda. Este artículo presenta un sistema de localización especialmente
orientado a su utilización dentro del hogar inteligente. Cada
usuario del sistema lleva consigo un dispositivo personal Bluetooth, a
partir del cual el sistema puede identi carle y localizarle dentro de la
vivienda. El sistema se ha desarrollado dentro de una arquitectura multiagente
específicamente diseñada para ser utilizada en un hogar digital
capaz de ofrecer servicios a sus habitantes en función de su ubicación.
2008-09-03T11:52:29Z
2008-09-03T11:52:29Z
2005
info:eu-repo/semantics/article
Proceedings of the 1st Iberoamerican Congress on Ubiquitous Computing CICU¿2005
http://hdl.handle.net/10017/1892
spa
info:eu-repo/semantics/openAccess
CEUR Workshop Proceedings
oai:ebuah.uah.es:10017/18932023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-09-03T11:55:38Z
urn:hdl:10017/1893
Mecanismos de Seguridad para una red ad hoc en un entorno urbano
Hoz de la Hoz, Enrique de la
Marsá Maestre, Iván
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Mecanismos de seguridad
Entorno urbano
Redes ad-hoc
Las redes ad-hoc representan un paradigma de comunicación
emergente cuya aplicación se ha propuesto en diversos entornos por su
capacidad de autoconfiguración y rápido despliegue. Sin embargo, siguen
planteados importantes desafíos relativos a problemas de seguridad. Uno
de estos problemas es la gestión y distribución de claves. Se propone la
aplicación del protocolo TESLA de distribución de claves a una red adhoc
de servicios en un entorno urbano como la alternativa más adecuada
frente a otras propuestas en el estado del arte. Finalmente, se realizan
pruebas de validación de un estadio preliminar del algoritmo propuesto.
2008-09-03T11:55:38Z
2008-09-03T11:55:38Z
2005
info:eu-repo/semantics/article
Proceedings of the 1st Iberoamerican Congress on Ubiquitous Computing CICU¿2005
http://hdl.handle.net/10017/1893
spa
info:eu-repo/semantics/openAccess
CEUR Workshop Proceedings
oai:ebuah.uah.es:10017/12612023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T18:46:48Z
urn:hdl:10017/1261
Infraestructura para servicios e interfaces sensibles a la localicación en hogares inteligentes
Machuca, Miriam
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Servicios sensibles
Hogares inteligentes
Interfaces sensibles
Some not widespread environments like sophisticated vehicles, adjust controlled elements,
like the seat and the rearview, in order to match the preferences of their users. In this context
computer systems are fully capable of providing customized interfaces for users. However, this kind
of service customization has not yet reached the home environment. Inside real home environments,
we can find new services based on automatizing traditional ones, which make our lives easier and
more comfortable. However, this services are provided independently, the degree of personalization is
still very low, and the results are insufficient. The smart home must release the user from performing
routine and tedious tasks to achieve comfort, security, and effective energy management. To achieve
this goal, designed systems must use all posible components at home, providing a high quality service.
In this paper we extend our previous work on using multiagent systems to build a smart home
environment. We describe its funcionality and introduce a new ontology in order to make easy agent
communication and knowledge sharing.
2008-01-24T18:46:48Z
2008-01-24T18:46:48Z
2005-09
info:eu-repo/semantics/conferenceObject
V Jornadas de Ingeniería Telemática JITEL '05
http://hdl.handle.net/10017/1261
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18902023-12-22T08:12:44Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-09-03T11:40:41Z
urn:hdl:10017/1890
A Hierarchical Agent-based Approach to Security in Smart Offices
Marsá Maestre, Iván
Hoz de la Hoz, Enrique de la
Alarcos Alcázar, Bernardo
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Hierarchical
Agent-based approach
Security
Smart offices
Seguridad industrial
International Conference on Ubiuitous Computing 2006
As electronic devices become more and more pervasively integrated
in our daily routine, security concerns start to become evident.
In the last years, there has been an increasing interest on the topic of security
in smart environments. One of the most challenging environments
regarding security are smart offices due to the high number of potential
users, devices and spaces, and the diversity of security roles. This paper
presents a security solution for an agent-based architecture for the smart
office. This security solution is potentially applicable to generic smart
environments, but it suits particularly well to the smart office scenario,
taking advantage of the particular characteristics of the environment to
satisfy the security requirements. The result is a hierarchical, agent-based
solution, flexible and scalable enough to be applicable to different smart
office scenarios, from small businesses to large organizations.
2008-09-03T11:40:41Z
2008-09-03T11:40:41Z
2006-06
info:eu-repo/semantics/article
Marsá, I., Hoz, E., Alarcos, B. & Velasco, j.R., 2006, "A Hierarchical Agent-based Approach to Security in Smart Offices", in International Conference on Ubiuitous Computing 2006.
http://hdl.handle.net/10017/1890
eng
info:eu-repo/grantAgreement/JCCM//PBC-05009-2/ES//
info:eu-repo/grantAgreement/UAH//UAH-PI2005%2F082/ES/SERVICIOS DE VALOR AÑADIDO EN UN ENTORNO URBANO BASADO EN REDES AD-HOC
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18952023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-09-03T12:12:50Z
urn:hdl:10017/1895
Images Protection Sent to Mobile Devices
Díaz, Ukrania
Alarcos Alcázar, Bernardo
Hoz de la Hoz, Enrique de la
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Images Protection
Mobile devices
Sistemas de comunicación móviles
With the increasing use of multimedia technologies and mobile
devices, also increases the applications which purpose is to offer information or
to do advertising by means of the sending of images or videos. In this paper, we
approached a digital tourist guide scene in which mobile devices with limited
resources need to receive multimedia information across a wireless connection.
Also we approached that this information is visible only authorized users. We
centre the article on the protection of images on an format of compression
adapted. Standard JPEG 2000 has been selected to offer an optimal balance between
the quality of image and the occupied space. In order to protect the information,
we have worked with selective encryption mechanism, that allow to
obtain a relation of commitment between the computational cost, on having
concealed the information and the concealment degree.
2008-09-03T12:12:50Z
2008-09-03T12:12:50Z
2006-06
info:eu-repo/semantics/article
International Conference on Ubiuitous Computing
http://hdl.handle.net/10017/1895
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12662023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T19:13:18Z
urn:hdl:10017/1266
Automated Purchase Negotiations in a Dynamic Electronic Marketplace
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Automated purchase
Dynamic electronic marketplace
Nowadays, there is a surge of B2C and B2B e-commerce operated
on the Internet. However, many of these systems are often nothing
more than electronic product or service catalogues. Against this background,
it is argued that new generation systems based on automatic
negotiation will emerge. This paper covers a particular kind of automatic
negotiation systems, where a number of participants in a mobile
dynamic electronic marketplace automatically negotiate the purchase of
products or services, by means of multiple automated one-to-one bargainings.
In a dynamic e-marketplace, the number of buyers and sellers
and their preferences may change over time. By mobile we mean that
buyers in a commercial area may initiate simultaneous negotiations with
several sellers using portable devices like cell phones, laptops or personal
digital assistants, so these negotiations do not require participants to be
colocated in space. We will show how an expressive approach to fuzzy
constraint based agent purchase negotiations in competitive trading environments,
is ideally suited to work on these kind of e-marketplaces. An
example of mobile e-marketplace, and a comparison between an expressive
and an inexpressive approach will be presented to show the efficiency
of the proposed solution.
2008-01-24T19:13:18Z
2008-01-24T19:13:18Z
2006-06
info:eu-repo/semantics/conferenceObject
1st International Conference on Ubiquitous Computing
http://hdl.handle.net/10017/1266
eng
info:eu-repo/grantAgreement/UAH//PI2005%2F082
Info:eu-repo/grantAgreement/MEC//TSI2005-07384-C03-03/ES//IMPROVISA
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12672023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T19:17:12Z
urn:hdl:10017/1267
Extending the bdi-asdp methodology for real-time
Fernández, Susel
Díaz, Ukrania
Marsá Maestre, Iván
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Bdi-asdp
Real-time
Multi-agent systems are an emerging research area which is experiencing a fast growth. In the last years, many theories,
architectures, languages and platforms for the development of agent based systems have been developed. On the other
hand, real-time systems represent an important challenge from the perspective of multi-agent systems, considering the
increasing need to count on software which is able to respond to certain situations in a timely partition. Nevertheless, in
spite of its increasing interest, an important difficulty when applying these technologies to the resolution of a concrete
problem is in the agent-based software development process. Many efforts have been made to extend the capacities of
standard software modelling to integrate multi-agent and real-time systems, and different methodological proposals exist,
but their practical application is not always obvious from the definition of the methodology. This work proposes an
extension of the BDI-ASDP methodology for the inclusion of timing constraints. We have applied this methodology to
model some of the agents which participate in a virtual baseball game.
2008-01-24T19:17:12Z
2008-01-24T19:17:12Z
2007-02
info:eu-repo/semantics/conferenceObject
IADIS International Conference on Applied Computing
http://hdl.handle.net/10017/1267
eng
Info:eu-repo/grantAgreement/MEC//TSI2005-07384-C03-03/ES//IMPROVISA
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12682023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T19:21:23Z
urn:hdl:10017/1268
ANEGSYS: Un sistema de recomendación basado en negociaciones automáticas para mercados electrónicos locales
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Velasco Pérez, Juan Ramón
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
ANEGSYS
Sistema de recomendación
Negociación automática
Mercados electrónicos
Local e-marketplaces are local online e-commerce platforms deployed by product and service
providers and accessed by local customers via mobile devices. In this scenario, customers need to gather
information about available offers from the different providers in the area, in order to select the most
suitable for their needs and preferences. We present ANEGSYS, an agent-based recommender system for
product acquisition which uses automatic bilateral negotiations to generate purchase pre-agreements among
buyer and seller agents. This greatly enhances the search for solutions which maximize both buyer and
seller utilities.
2008-01-24T19:21:23Z
2008-01-24T19:21:23Z
2007-09
info:eu-repo/semantics/conferenceObject
VI Jornadas de Ingeniería Telemática, JITEL 2007
http://hdl.handle.net/10017/1268
spa
info:eu-repo/grantAgreement/JCCM//PBC-05009-2
Info:eu-repo/grantAgreement/MEC//TSI2005-07384-C03-03/ES//IMPROVISA
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12692023-12-14T15:52:03Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-01-24T19:23:31Z
urn:hdl:10017/1269
Dispositivos Móviles y Espacios Inteligentes Personales
Marsá Maestre, Iván
López Carmona, Miguel Ángel
Navarro Guillén, Andrés
Hoz de la Hoz, Enrique de la
Universidad de Alcalá. Departamento de Automática
Dispositivos móviles
Espacios inteligentes
Though personal mobile devices like cell phones and PDAs already offer their users some
kinds of service personalization, service personalization through personal mobile devices can be taken
one step further. In particular, personal devices can be used to integrate services provided within
smart environments with the services provided at the personal devices themselves. In this paper, we
present an approach for the seamless integration of personal devices and smart environments through
the use of personal smart spaces. This would allow personal devices to become even more integrated
in our everyday lives.
2008-01-24T19:23:31Z
2008-01-24T19:23:31Z
2007-09
info:eu-repo/semantics/conferenceObject
Jornadas de Ingeniería Telemática JITEL 2007
http://hdl.handle.net/10017/1269
spa
info:eu-repo/grantAgreement/JCCM//PBC-05009-2
info:eu-repo/grantAgreement/CAM//CCG06-UAH%2FTIC-0424/ES/LOCALIZACION AUTOMATICA DE DISPOSITIVOS EN RECINTOS ACOTADOS/
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18912023-12-14T15:52:03Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2008-09-03T11:49:30Z
urn:hdl:10017/1891
Una Arquitectura de Seguridad Jerárquica para Entornos de Trabajo Inteligentes
Hoz de la Hoz, Enrique de la
Marsá Maestre, Iván
Vicente Rodríguez, Antonio José de
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Seguridad
Trabajo inteligente
Arquitectura
In the last years, there has been an increasing interest on security concerns in smart
environments. In smart home environments the main goals are user comfort and easy deployment of
new devices, so security is usually left apart or focuses mainly in transparency and privacy
enhancement. Office security, however, has more rigorous security requirements due to the high
number of potential users, devices and spaces, and the diversity of security roles. This paper presents a
security solution for an agent-based architecture for the smart office. This security solution is
potentially applicable to generic smart environments, but it suits particularly well to the smart office
scenario, taking advantage of the particular characteristics of the environment to satisfy the security
requirements.
2008-09-03T11:49:30Z
2008-09-03T11:49:30Z
2007-09
info:eu-repo/semantics/article
Jornadas de Ingeniería Telemática JITEL 2007
http://hdl.handle.net/10017/1891
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/41412023-12-20T15:20:48Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2009-09-29T16:12:35Z
urn:hdl:10017/4141
Evaluation of Tree-Based Routing Ethernet
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Azcorra, Arturo
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing bridges
Ethernet
Spanning tree
Routing protocols
Telecommunication network topology
Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)¿a forwarding scheme based on a spanning tree that was extended to use some shortcut links.We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE offers improved throughput. The impact of transient loops in TRE is lower compared to the application of the classical shortest path routing protocols to Ethernet. Finally, TRE is self-configuring and its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.
2009-09-29T16:12:35Z
2009-09-29T16:12:35Z
2009-06
info:eu-repo/semantics/article
http://dx.doi.org/10.1109/LCOMM.2009.090469
http://hdl.handle.net/10017/4141
eng
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
info:eu-repo/semantics/openAccess
IEEE
oai:ebuah.uah.es:10017/41442023-12-20T15:22:27Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2009-09-29T16:24:56Z
urn:hdl:10017/4144
HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Gonzalez, Pedro A.
Azcorra, Arturo
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing
Up/Down routing
Turn prohibition
Cycle-breaking
Ethernet
Ethernet switched networks do not scale appropriately due to limitations inherent to the spanning tree protocol. Ethernet architectures based on routing over a virtual topology in which turns are prohibited offer improved performance over spanning tree, although in some cases suffer from excessive computational complexity. Up/Down routing is a turn prohibition algorithm with low computational complexity. In this paper we propose HURBA, a new layer-two architecture that improves Up/Down routing performance due to an optimization based on the use of hierarchical addressing, while preserving the computational complexity of Up/Down. The resulting architecture requires zero-configuration, uses the same frame format as Ethernet, allows upgrades by software update, and is compatible with 802.1D bridges by means of encapsulation. HURP protocol builds automatically a core with the interconnected HURP routing bridges and the standard bridges get connected to the edges in standard spanning trees. Simulations show that the performance of HURP, evaluated over various combinations of network topology and size, is close to the one of shortest path, is consistently better than that of Up/Down, and is equal or better than Turn Prohibition, with the advantage of having a lower complexity.
2009-09-29T16:24:56Z
2009-09-29T16:24:56Z
2009
info:eu-repo/semantics/article
G. Ibáñez et al., HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks, Comput. Netw. (2009), doi:10.1016/j.comnet.2009.08.007
http://hdl.handle.net/10017/4144
eng
http://dx.doi.org/10.1016/j.comnet.2009.08.007
info:eu-repo/grantAgreement/MEC//TEC2007-67966-C03-03%2FTCM/ES/CONTRIBUCION A LOS NUEVOS PARADIGMAS Y TECNOLOGIAS DE RED PARA LAS COMUNICACIONES DEL MAÑANA/CON-PARTE 3
info:eu-repo/grantAgreement/CAM//CCG07-UC3M%2FTIC-3356/ES/TOLERANCIA A FALLOS EN REDES IP AVANZADAS/
info:eu-repo/grantAgreement/CAM//S-0505%2FTIC%2F000251/ES/APLICACIONES EMERGENTES PARA INTERNET DE NUEVA GENERACION/
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/semantics/openAccess
Elsevier
oai:ebuah.uah.es:10017/41462023-12-20T15:21:14Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2009-09-29T16:29:49Z
urn:hdl:10017/4146
Evolución conceptual de los protocolos de puentes transparentes
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Azcorra, Arturo
Universidad de Alcalá. Departamento de Automática
conmutación de paquetes
enrutamiento
protocolos
puentes
Los puentes Ethernet transparentes son un elemento cada vez más importante en las redes
de telecomunicaciones. Este artículo ofrece una visión panorámica de la evolución conceptual de los
paradigmas de puentes durante las últimas décadas, desde los puentes transparentes con árbol de
expansión hasta las propuestas actualmente en estandarización: por una parte Shortest Path Bridges,
Provider Bridges y Provider Backbone Bridges en el IEEE 802.1; por otra parte Routing Bridges en el
IETF. Estas propuestas buscan aumentar la escalabilidad y obtener una alta utilización de la infraestructura
de red, así como la provisión de servicios basados en Ethernet a gran número de usuarios. Mediante
un mapa genealógico y una tabla se resumen e ilustran los aspectos funcionales, la evolución de los
puentes propuestos en cuanto a los mecanismos básicos empleados para el encaminamiento, reenvío
y la prevención de bucles tales como protocolos de vector distancia y de estado de enlaces, árboles
múltiples de expansión, jerarquización mediante encapsulado de tramas y prohibición de algunos giros
en los nodos. La evolución reciente de las propuestas muestra claramente varias tendencias: el predominio
de los protocolos de estado de enlaces como IS-IS para el encaminamiento y/o construcción de
árboles múltiples, de los mecanismos de encapsulado, y la multiplicación de tipos de identificadores
para etiquetar y procesar separada y homogéneamente miles de servicios y clientes.
2009-09-29T16:29:49Z
2009-09-29T16:29:49Z
2009-03
info:eu-repo/semantics/article
Novática es la revista de la Asociación de Técnicos de Informática, Nº 198, pg 55
http://hdl.handle.net/10017/4146
spa
info:eu-repo/semantics/openAccess
Novatica
oai:ebuah.uah.es:10017/41432023-12-20T15:22:04Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2009-09-29T16:19:32Z
urn:hdl:10017/4143
Hierarchical Up/Down Routing Architecture for Ethernet backbones and campus networks
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Gonzalez, Pedro A.
Azcorra, Arturo
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing
computer networks
Up/Down routing
turn prohibition
cycle breaking
We describe a new layer two distributed and scalable routing architecture. It uses an automatic hierarchical node identifier assignment mechanism associated to the rapid spanning tree protocol. Enhanced up/down mechanisms are used to prohibit some turns at nodes to break cycles, instead of blocking links like the spannning tree protocol does. The protocol performance is similar or better than other turn prohibition algorithms recently proposed with lower complexity O(Nd) and better scalability. Simulations show that the fraction of prohibited turns over random networks is less than 0.2. The effect of root bridge election on the performance of the protocol is limited both in the random and regular networks studied. The use of hierarchical, tree-descriptive addresses simplifies the routing, and avoids the need of all nodes having a global knowleddge of the network topology. Routing frames through the hierarchical tree at very high speed is possible by progressive decoding of frame destination address, without routing tables or port address learning. Coexistence with standard bridges is achieved using combined devices: bridges that forward the frames having global destination MAC addresses as standard bridges and frames with local MAC frames with the proposed protocol.
2009-09-29T16:19:32Z
2009-09-29T16:19:32Z
2008-04
info:eu-repo/semantics/article
INFOCOM Workshops 2008, IEEE , vol., no., pp.1-6
http://hdl.handle.net/10017/4143
eng
info:eu-repo/semantics/openAccess
IEEE
oai:ebuah.uah.es:10017/67702023-12-14T15:52:04Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2010-09-24T15:23:18Z
urn:hdl:10017/6770
A Simple, Zero-configuration, Low Latency, Bridging Protocol
Ibáñez Fernández, Guillermo Agustín
Naous, Jad
Rojas Sánchez, Elisa
Rivera Pinto, Diego
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
This paper describes a demo for a new type of
bridges, ARP-Path bridges. These ARP-based Ethernet Switches
rely on the race between ARP Request packets flooded over all
links, to discover the minimum latency path to the destination
host. The protocol uses all links, is loop free, uses the standard
Ethernet frame format, is fully transparent to hosts and neither
needs a spanning tree protocol to prevent loops nor a links state
protocol to obtain minimum latency paths. Implementations in
Linux and Openflow on NetFPGA show inherent robustness and
fast reconfiguration. Simulation results show throughput and
delay performance superior to the Spanning Tree Protocol and
similar to shortest path routing, with lower complexity.
2010-09-24T15:23:18Z
2010-09-24T15:23:18Z
2010-10-11
info:eu-repo/semantics/conferenceObject
http://www.ieeelcn.org/lcn35demos/lcn-demo2010_ibanez.pdf
http://hdl.handle.net/10017/6770
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
The 35th IEEE Conference on Local Computer Networks (LCN)
oai:ebuah.uah.es:10017/67712023-12-14T15:52:05Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2010-09-24T15:29:16Z
urn:hdl:10017/6771
ARP-Path Bridges: Implementación de Shortest Path Bridges Ethernet basados en ARP sobre Linux y Openflow/NetFPGA
Ibáñez Fernández, Guillermo Agustín
Naous, Jad
Rojas Sánchez, Elisa
Rivera Pinto, Diego
Carral Pelayo, Juan Antonio
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree Protocol
En este artículo se describen los conmutadores ARP-Path (también denominados FastPath y sus implementaciones
recientes en Linux y NetFPGA. ARP-Path es una evolución conceptual de los puentes transparentes con aprendizaje que no requiere
protocolo auxiliar de encaminamiento (ni de árbol de expansión) en capa dos, a diferencia de las propuestas actualmente en
estandarización RBridges y Shortest Path Bridges. Cada host establece, en los conmutadores ARP-Path, un camino mínimo al mismo
tiempo que se envía el paquete estándar ARP_Request, pero inundado por todos los enlaces. El camino marcado por el paquete ARP
Request que alcanza el destino se confirma aprovechando el paquete ARP_Reply de respuesta del host destino. Se han realizado
implementaciones de puentes ARP-Path en Linux y en la plataforma Openflow con tarjetas NetFPGA (actualmente en pruebas), así
como simulaciones sobre Omnet. Las prestaciones son similares o ligeramente superiores a las de enrutadores de camino mínimo y
muy superiores a STP. Las pruebas con tráfico real y de reconfiguración muestran las robustez y rapidez del protocolo. ARP-Path no
modifica la trama de Ethernet y es compatible con puentes estándar en modo núcleo-isla.
2010-09-24T15:29:16Z
2010-09-24T15:29:16Z
2010-09-27
info:eu-repo/semantics/conferenceObject
http://hdl.handle.net/10017/6771
spa
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
XX Jornadas de Telecom I+D
oai:ebuah.uah.es:10017/62982023-12-20T15:21:41Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2010-05-04T09:05:56Z
urn:hdl:10017/6298
Fast Path Ethernet Switching: On-demand Efficient Transparent Bridges for Data Center and Campus Networks
Ibáñez Fernández, Guillermo Agustín
Carral Pelayo, Juan Antonio
García Martínez, Alberto
Arco Rodríguez, José Manuel
Rivera Pinto, Diego
Azcorra, Arturo
Universidad de Alcalá. Departamento de Automática
Routing bridges
Ethernet
Spanning Tree
Computer networks
Routing protocols
Switching
Ethernet bridging in campus networks offers advantages like zero configuration, no need of IP addresses administration in subnets, high performance and low costs. But Ethernet bridging does not scale. Current proposals under standardization, like Shortest Path Bridges and Routing Bridges use a link-state routing protocol to compute shortest paths. As a simpler alternative, we propose an evolution of the transparent bridges learning mechanism, that provides loop-free, full infrastructure utilization for
campus and datacenter networks. Fast Path Ethernet Switches double use the standard ARP Request and Reply packets to set up fast on-demand paths between hosts when needed. This architecture uses standard Ethernet frame format, is fully transparent to hosts and compatible with 802.1D bridges in core-island mode. A proof of concept has been implemented in Linux. Preliminary simulations in metropolitan and campus newtork topologies show clearly superior to spanning tree and even shortest path routers, at a fraction of the complexity.
2010-05-04T09:05:56Z
2010-05-04T09:05:56Z
2010-05-05
info:eu-repo/semantics/conferenceObject
http://hdl.handle.net/10017/6298
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
IEEE LAN/MAN Workshop
oai:ebuah.uah.es:10017/62742023-12-20T15:22:48Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2010-04-20T11:16:53Z
urn:hdl:10017/6274
TRE+: Extended Tree-Based Routing Ethernet
Carral Pelayo, Juan Antonio
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Routing bridges
Ethernet
Spanning tree
Hierarchical addresses
Tree-based routing Ethernet (TRE) is a recent Ethernet
architecture that enables shortcut links to improve performance
compared to spanning tree protocols. However, TRE can only
use shortcuts that arrive directly at bridges located in the
branch of the destination. TRE+ extends the topology
knowledge of a bridge to 2 hops away, thus unveiling new
shortcuts to the destination branch. Simulations show a major
performance improvement of TRE+ compared to TRE, with
results close to shortest paths in some topologies.
2010-04-20T11:16:53Z
2010-04-20T11:16:53Z
2010-02
info:eu-repo/semantics/article
ETRI Journal, vol.32, no.1, Feb. 2010, pp.157-159
http://hdl.handle.net/10017/6274
eng
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/semantics/openAccess
ETRI Journal
oai:ebuah.uah.es:10017/51572023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2009-12-04T12:07:36Z
urn:hdl:10017/5157
A Performance Comparison of Virtual Backbone Formation Algorithms for Wireless Mesh Networks
Ibáñez Fernández, Guillermo Agustín
Manzanedo, Eva
Carral Pelayo, Juan Antonio
García, Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Ad hoc
Algorithms
Connected dominating set (CDS)
Dominating Set Simulation Suite
Mesh
Routing
Algoritmos computacionales
Currently wireless networks are dominant by star
topology paradigm. Its natural the evolution is towards wireless mesh
multi-hop networks. This article compares the performance of several
algorithms for virtual backbone formation in ad hoc mesh networks
both theoretically and through simulations. Firstly, an overview of the
algorithms is given. Next, the results of the algorithm simulations
made with the program Dominating Set Simulation Suite (DSSS) are
described and interpreted. We have been extended the simulator to
simulate the Mobile Backbone Network Topology Synthesis
Algorithm. The results show that this algorithm has the best
combination of performance characteristics among the compared
algorithms.
2009-12-04T12:07:36Z
2009-12-04T12:07:36Z
2009-11
info:eu-repo/semantics/article
http://hdl.handle.net/10017/5157
eng
Info:eu-repo/grantAgreement/MEC//TEC2004-05622-C04-03%2FTCM
info:eu-repo/grantAgreement/CAM//S-0505%2FTIC%2F000251/ES/APLICACIONES EMERGENTES PARA INTERNET DE NUEVA GENERACION/
info:eu-repo/semantics/openAccess
International Journal of Communication Networks and Information Security
oai:ebuah.uah.es:10017/86772023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2011-09-09T11:05:28Z
urn:hdl:10017/8677
Implementation of ARP-Path Low Latency Bridges in Linux and OpenFlow/NetFPGA
Ibáñez Fernández, Guillermo Agustín
De Schuymer, Bart
Naous, Jad
Rivera Pinto, Diego
Rojas Sánchez, Elisa
Carral Pelayo, Juan Antonio
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
This paper describes the implementation of ARP- Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA platforms. These ARP-based Ethernet Switches rely on the race between the replicas of a standard ARP Request packet flooded over all links, to discover the minimum latency path to the destination host, complemented in the opposite direction by the ARP Reply packet directed to the source host. Implementations show that the protocol is loop free, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. Implementations in Linux and OpenFlow on NetFPGA show inherent robustness and fast reconfiguration. Previous simulations showed a superior performance (throughput and delay) than the Spanning Tree Protocol and similar to shortest path routing, with lower complexity.
2011-09-09T11:05:28Z
2011-09-09T11:05:28Z
2011-07-04
info:eu-repo/semantics/article
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5986000
http://hdl.handle.net/10017/8677
eng
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
12th IEEE International Conference on High Performance Switching and Routing
oai:ebuah.uah.es:10017/86762023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2011-09-09T10:29:33Z
urn:hdl:10017/8676
Implementing ARP-Path Low Latency Bridges in NetFPGA
Rojas Sánchez, Elisa
Naous, Jad
Ibáñez Fernández, Guillermo Agustín
Rivera Pinto, Diego
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing bridges
NetFPGA
Shortest Path Bridges
Spanning Tree
Ethernet
The demo is focused on the implementation of ARP-Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges. ARP-Path Bridges rely on the race between broadcast ARP Request packets, to discover the minimum latency path to the destination host. Several implementations (in Omnet++, Linux, OpenFlow, NetFPGA) have shown that ARP-Path exhibits loop-freedom, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. This demo compares our hardware implementation on NetFPGA to bridges running STP, showing that ARP-Path finds lower latency paths than STP.
2011-09-09T10:29:33Z
2011-09-09T10:29:33Z
2011-08-15
info:eu-repo/semantics/article
Proceedings of the ACM SIGCOMM 2011 conference Pages 444-445
http://hdl.handle.net/10017/8676
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/semantics/openAccess
ACM SIGCOMM 2011
oai:ebuah.uah.es:10017/81752023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2011-05-05T10:45:57Z
urn:hdl:10017/8175
ARP-Path: ARP-based, Shortest Path Bridges
Ibáñez Fernández, Guillermo Agustín
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Rivera Pinto, Diego
Montalvo Taravillo, Aarón
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Spanning Tree
This letter is a summary proposal for an evolution of
the Ethernet transparent bridge paradigm that provides simple,
shortest path bridging in campus networks. ARP-Path Ethernet
Switches set up an on-demand path between two hosts just
reusing and flooding the standard ARP request frame through all
links and confirming the path reaching to the destination host
with the ARP reply frame. ARP-Path uses the standard Ethernet
frame format, is fully transparent to hosts and does not require
spanning tree or link state protocol. Simulation results show
superior performance to spanning tree and similar to shortest
path routing, with lower complexity. Our implementations
confirm backward compatibility, robustness and performance.
2011-05-05T10:45:57Z
2011-05-05T10:45:57Z
2011-05-05T10:45:57Z
info:eu-repo/semantics/article
http://hdl.handle.net/10017/8175
eng
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/89632023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2011-10-18T16:58:17Z
urn:hdl:10017/8963
A Small Data Center Network of ARP-Path Bridges made of Openflow Switches
Ibáñez Fernández, Guillermo Agustín
Rojas Sánchez, Elisa
Rivera Pinto, Diego
De Schuymer, Bart
Dietz, Thomas
Naous, Jad
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
This demo shows, in a small data center demo network topology the ARP Path bridges functionality and robustness over varied platforms and their interoperability. ARP-Path bridges set up on-demand shortest paths between hosts using the standard ARP Request, but flooded over all links, to find the lowest latency path to the destination host. ARP Path is loop free, uses the standard Ethernet frame and compatible with hosts and routers.Data center demo network consists of ten ARP Path bridges. Eight bridges are implemented with standard Openflow switches (four NEC PF8800/PF5240 Open flow capable switches and four Soekris boxes running Open flow Switch implementation) and the other two are implemented on OpenWRT. A previous demo showed (in remote lab) the protocol operation over four NetFPGA boards executing Openflow[7]. Demo shows network operation with standard applications like video, demonstrating the protocol robustness, zero configuration, fast network reconfiguration upon link failures and after mobility of a host.. Implementations in Linux and Openflow show inherent robustness and fast reconfiguration. Additionally, information and video of the Sigcomm 2011 demo with implementation of ARP Path protocol on a network of four NetFPGA boards (pure hardware implementation) is also posted [8].
2011-10-18T16:58:17Z
2011-10-18T16:58:17Z
2011-10-05
info:eu-repo/semantics/article
The 36th IEEE Conference on Local Computer Networks (LCN). Bonn(Alemania)(04/10/2011 - 07/10/2011)
http://hdl.handle.net/10017/8963
eng
info:eu-repo/semantics/openAccess
The 36th IEEE Conference on Local Computer Networks (LCN)
oai:ebuah.uah.es:10017/121012023-12-14T15:49:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_17901com_10017_246com_10017_17982com_10017_183com_10017_17963com_10017_279com_10017_17822com_10017_271com_10017_18001col_10017_150col_10017_31238col_10017_298col_10017_184col_10017_280col_10017_272
2012-12-03T12:18:51Z
urn:hdl:10017/12101
Implementación crítica de la reflexión en el proceso de enseñanza-aprendizaje
Quintanilla López, María Gloria
Copa Patiño, José Luis
Guerrero Baquero, Antonio
González-Santander Martínez, Marta
Hernández Romero, María Nieves
Arias Pérez, María Selma
Peña Fernández, María de los Ángeles
Universidad de Alcalá. Departamento de Química Orgánica
Universidad de Alcalá. Departamento de Microbiología y Parasitología
Universidad de Alcalá. Departamento de Automática
Universidad de Alcalá. Departamento de Especialidades Médicas
Universidad de Alcalá. Departamento de Didáctica
Universidad de Alcalá. Departamento de Farmacia y Tecnología Farmacéutica
Weekly Reflection Papers
Teaching innovation
Teaching-learning
process
Teaching innovation group
Reflection guide
Semanarios reflexivos
Innovación docente
Proceso de enseñanza-aprendizaje
Grupo de innovación educativa
Guía para la reflexión.
This communication describes the evolution of an educational innovation strategy, originally called Weekly Reflection Papers, aimed to modify the practical teaching and to go deeper in the process of teaching and learning in higher education. To do this, seven teachers of different subjects of the University of Alcalá have applied this tool to achieve the proposed objectives, essentially based on that students learn to reflect on their own way of learning. Our innovation group has introduced various modifications in this strategy over the years. One of the priorities today is to place a greater emphasis on reflection with what is intended, on the one hand, to teach students to develop their reflective ability and on the other hand it would be very useful for us to analyze in more depth, the educational possibilities that presents this part of the tool.
This work includes surveys carried out at the beginning and at the end of each subject, as well as a guide for reflection.
En esta comunicación se describe la evolución de una estrategia de innovación educativa, denominada originariamente Semanarios Reflexivos, encaminada a modificar la práctica docente y profundizar en el proceso de enseñanza-aprendizaje en la educación universitaria. Para ello, siete profesores de diferentes asignaturas de la Universidad de Alcalá hemos aplicado esta herramienta para alcanzar los objetivos propuestos, que fundamentalmente se basan en que los alumnos aprendan a reflexionar sobre su propia manera de aprender. Nuestro grupo de innovación ha introducido diferentes modificaciones en dicha estrategia a lo largo de los años. En la actualidad una de las prioridades es hacer un mayor hincapié en la reflexión, con lo que se pretende, por una parte, enseñar a los estudiantes a desarrollar su capacidad reflexiva y, por otra, aprender nosotros mismos a analizar, con más profundidad, las posibilidades docentes que presenta esta parte de la herramienta.
Este trabajo incluye unas encuestas que se realizan al principio y al final de cada asignatura, así como una guía para la reflexión.
2012-12-03T12:18:51Z
2012-12-03T12:18:51Z
2013
info:eu-repo/semantics/article
Revista Ibero-Americana de Estudios Em Educaçao, 2013, v. 8, n. 2, p. 394-402
1982-5587
http://hdl.handle.net/10017/12101
spa
http://seer.fclar.unesp.br/iberoamericana/article/view/6534/4806
info:eu-repo/semantics/openAccess
Atribución-NoComercial-SinDerivadas 3.0 España
UNESP (Faculdade de Cièncias e Letras Campus de Araraquara)
Universidad de Alcalá
oai:ebuah.uah.es:10017/170692023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2013-05-07T10:38:43Z
urn:hdl:10017/17069
Shortest Path Bridges Without Routing (All-path) (beyond link-state routing in shortest path bridges)
Ibáñez Fernández, Guillermo Agustín
Rojas Sánchez, Elisa
Universidad de Alcalá. Departamento de Automática
Etherner, All-Path, STP
2013-05-07T10:38:43Z
2013-05-07T10:38:43Z
2013-04-04
info:eu-repo/semantics/article
http://hdl.handle.net/10017/17069
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/170702023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2013-05-07T10:41:00Z
urn:hdl:10017/17070
Torii-HLMAC: Torii-HLMAC: Fat Tree Data Center Architecture
Rojas Sánchez, Elisa
Universidad de Alcalá. Departamento de Automática
Etherner, All-Path, HLMAC
2013-05-07T10:41:00Z
2013-05-07T10:41:00Z
2013-04-03
info:eu-repo/semantics/article
http://hdl.handle.net/10017/17070
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/188812023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2013-09-12T12:08:53Z
urn:hdl:10017/18881
Evaluating Native Load Distribution of ARP- Path Bridging Protocol in Mesh and Data Center
Ibáñez Fernández, Guillermo Agustín
Carral Pelayo, Juan Antonio
Rojas Sánchez, Elisa
Giménez Guzmán, José Manuel
Universidad de Alcalá. Departamento de Automática
Ethernet, Routing bridges, Spanning Tree, Load Distribution
RP-Path is a simple, low latency, shortest path bridging protocol for campus, enterprise and data center networks. We recently found that this protocol natively distributes the traffic load in networks having redundant paths of similar characteristics. The reason is that every new path between hosts is selected on-demand in a race among ARP Request packet replicas over all available paths: the first arriving replica gets its path selected on the fly. This means a continuous adaptation of new paths to variations on the load at links and bridges. To show this unique load distribution capability and path diversity property we use a number of simulations for complex scenarios, including two different simulators: one flow- based and one packet-based, and two basic topologies: data center and a regular mesh. We also verify this behavior on real hardware on a network of nine ARP-Path NetFPGA switches. The conclusion is that the ARP-Path protocol efficiently distributes traffic via alternative paths at all load levels, provided that multiple paths of similar propagation delays are available
2013-09-12T12:08:53Z
2013-09-12T12:08:53Z
2013-06-10
info:eu-repo/semantics/conferenceObject
http://hdl.handle.net/10017/18881
10.1109/ICC.2013.6655142
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/semantics/openAccess
Communications (ICC), 2013 IEEE International Conference on , vol., no., pp.3769,3774, 9-13 June 2013
doi: 10.1109/ICC.2013.6655142
oai:ebuah.uah.es:10017/221182023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2015-07-21T09:10:31Z
urn:hdl:10017/22118
Design and evaluation of a learning environment to effectively provide network security skills
Marsá Maestre, Iván
Hoz de la Hoz, Enrique de la
Giménez Guzmán, José Manuel
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Architectures for educational technology systems
Distributed learning environments
Interactive learning environments
Simulations
Teaching/learning strategies
Information system security and network security are topics of increasing importance in the information society. They are also topics where the adequate education of professionals requires the use of specific laboratory environments where the practical aspects of the discipline may be addressed. However, most approaches currently used are excessively static and lack the flexibility that the education requirements of security professionals demand. In this paper we present NEMESIS, a scenario generation framework for education on system and network security, which is based on virtualization technologies and has been designed to be open, distributed, modular, scalable and flexible. Finally, an example scenario is described and some results validating the benefits of its use in undergraduate computer security courses are shown.
La seguridad de redes y sistemas de información es un área de importancia creciente en el ámbito de la sociedad de información. Además, constituye un tema en el que la adecuada formación de profesionales exige el uso de entornos de laboratorio específicos en los que abordar los aspectos prácticas de la disciplina. Sin embargo, la mayoría de las aproximación usadas en la actualidad son excesivamente estáticas y carecen de la flexibilidad que las exigencias de la formación de profesionales de seguridad imponente. En este artículo, presentamos NEMESIS, un entorno para la generación de escenarios para la formación en seguridad de redes y sistemas, basado en tecnologías de virtualización que ha sido diseñado para ser abierto, distribuido, modular, escalable y flexible. Finalmente, se describe un escenario de ejemplo y se muestran resultados que validan los beneficios de su uso en cursos de seguridad informática de grado
2015-07-21T09:10:31Z
2015-07-21T09:10:31Z
2013
info:eu-repo/semantics/article
Ivan Marsa-Maestre, Enrique de la Hoz, Jose Manuel Gimenez-Guzman, Miguel A. Lopez-Carmona, Design and evaluation of a learning environment to effectively provide network security skills, Computers & Education, Volume 69, November 2013, Pages 225-236, ISSN 0360-1315, http://dx.doi.org/10.1016/j.compedu.2013.07.022.
(http://www.sciencedirect.com/science/article/pii/S0360131513001899)
Keywords: Architectures for educational technology systems; Distributed learning environments; Interactive learning environments; Simulations; Teaching/learning strategies
0360-1315
http://hdl.handle.net/10017/22118
eng
http://dx.doi.org/10.1016/j.compedu.2013.07.022
info:eu-repo/semantics/openAccess
Copyright © 2015 Elsevier Ltd. All rights reserved
Elsevier
oai:ebuah.uah.es:10017/205302023-12-14T15:52:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2014-10-07T09:35:43Z
urn:hdl:10017/20530
Torii: Multipath Distributed Ethernet Fabric Protocol for Data Centers with Zero-Loss Path Repair
Rojas Sánchez, Elisa
Giménez Guzmán, José Manuel
Azcorra, Arturo
Rivera Pinto, Diego
Ibáñez Fernández, Guillermo Agustín
Universidad de Alcalá. Departamento de Automática
Ethernet
Tree-based routing
Routing bridges
Data center
Shortest Path bridges
This paper describes and evaluates Torii, a layer-two data center network fabric protocol. The main features of Torii are being fully distributed, scalable, fault-tolerant and with automatic setup. Torii is based on multiple, tree-based, topological MAC addresses that are used for table-free forwarding over multiple equal-cost paths, and it is capable of rerouting frames around failed links on the fly without needing a central fabric manager for any function. To the best of our knowledge, it is the first protocol that does not require the exchange of periodic messages to work under normal conditions and to recover from link failures, as Torii exchanges messages just once. Moreover, another important characteristic of Torii is that it is compatible with a wide range of data center topologies. Simulation results show an excellent distribution of traffic load and latencies, similar to shortest path protocols.
2014-10-07T09:35:43Z
2014-10-07T09:35:43Z
2014-10-07
info:eu-repo/semantics/article
http://hdl.handle.net/10017/20530
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/211442023-12-20T15:20:10Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2015-02-04T09:00:09Z
urn:hdl:10017/21144
All-Path Bridging: Path Exploration Protocols for Data Center and Campus Networks
Rojas Sánchez, Elisa
Ibáñez Fernández, Guillermo Agustín
Giménez Guzmán, José Manuel
Carral Pelayo, Juan Antonio
García Martínez, Alberto
Martinez Yelmo, Isaias
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Path exploration
Path computation
Routing switches
Shortest path bridges
All-Path
Today, link-state routing protocols that compute multiple shortest paths predominate in data center and campus networks, where routing is performed either in layer three or in layer two using link-state routing protocols. But current proposals based on link-state routing do not adapt well to real time traffic variations and become very complex when attempting to balance the traffic load. We propose All-Path bridging, an evolution of the classical transparent bridging that forwards frames over shortest paths using the complete network topology, which overcomes the limitations of the spanning tree protocol. All-Path is a new frame routing paradigm based on the simultaneous exploration of all paths of the real network by a broadcast probe frame, instead of computing routes on the network graph. This paper presents All- Path switches and their differences with standard switches and describes ARP-Path protocol in detail, its path recovery mechanisms and compatibility with IEEE 802.1 standard bridges. ARP-Path is the first protocol variant of the All-Path protocol family. ARP-Path reuses the standard ARP Request and Reply packets to explore reactively the network and find the fastest path between two hosts. We compare its performance in terms of latency and load distribution with link-state shortest-path routing bridges, showing that ARP-Path distributes the load more evenly and provides lower latencies. Implementations on different platforms prove the robustness of the protocol. The conclusion is that All-Path bridging offer a simple, resilient and scalable alternative to path computation protocols.
2015-02-04T09:00:09Z
2015-02-04T09:00:09Z
2014
info:eu-repo/semantics/article
Elisa Rojas, Guillermo Ibañez, Jose Manuel Gimenez-Guzman, Juan A. Carral, Alberto Garcia-Martinez, Isaias Martinez-Yelmo, Jose Manuel Arco, All-Path bridging: Path exploration protocols for data center and campus networks, Computer Networks, Volume 79, 14 March 2015, Pages 120-132, ISSN 1389-1286.
http://hdl.handle.net/10017/21144
10.1016/j.comnet.2015.01.002
eng
info:eu-repo/grantAgreement/CAM//S2013%2FICE-2919/ES/TECNOLOGIAS INTEGRADAS DE GESTION Y OPERACIÓN DE RED 5G/TIGRE5-CM
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/264432023-12-14T15:52:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2016-10-13T11:38:06Z
urn:hdl:10017/26443
Detecting and defeating advanced man-in-the-middle attacks against TLS
Hoz de la Hoz, Enrique de la
Cochrane, Gary
Moreira-Lemus, Jose Manuel
Paez-Reyes, Rafael
Marsá Maestre, Iván
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Certificate-pinning schemes
MITM attacks retaliation
SDN (Software-defined networking)
OpenFlow
Sobre los derechos de acceso: Permission to make digital or hard copies of this publication for internal use within NATO and for personal or educational use when for non-profi t or non-commercial purposes is granted providing that copies bear this notice and a full citation on the first page. Any other reproduction or transmission requires prior written permission by NATO CCD COE.
TLS es un bloque esencial para la construcción de redes privadas. Un aspecto crítico para la seguridad de TLS es la autenticación y el intercambio de claves, que habitualmente se realiza mediante certificados. Un intercambio inseguro de claves puede conducir a un ataque de hombre en el medio (MITM). La confianza en los certificados se consigue habitualmente gracias a la utilización de una infraestructura de clave pública (PKI), que emplea autoridades de certificación (CA) de confianza para el establecimiento de cadenas de validez de certificados. En los últimos años, han surgido una serie de problemas relacionados con el uso del PKI: lo certificados pueden ser emitidos para cualquier entidad de Internet, con independencia de la posición de la CA en el árbol jerárquico. Esto implica que un ataque exitoso contra una CA tiene el potencial de permitir la generación de certificados válidos que posibilitarán la realización de ataques de hombre en el medio. No podemos descartar la posibilidad de usos malicioso de CA intermedias para llevar a cabo ataques dirigidos mediante la emisión de certificados ad-hoc, que serían extremadamente difíciles de detectar. La infraestructura PKI actual es susceptible a este tipo de ataques, por lo que se hace necesaria la creación de nuevos mecanismos para la detección y neutralización de los mismos. El IETF y otros organismos de estandarización han lanzado distintas iniciativas para posibilitar la detección de certificados falsificados. La mayoría de estas iniciativas intentan solucionar los problemas existentes mantenimiento el modelo PKI y agregando la técnica de 'certificate pinning', que asocia certificados concretos a servidores. Estas técnicas tienen limitaciones significativas, como la necesidad de un proceso de arranque seguro, o el establecimiento de la asociación para cada host de forma individual y uno por uno. Este trabajo proporciona una evolución desde el esquema de 'pinning' realizado en el host a un esquema de 'pinning' en la red, mediante la habilitación de mecanismos para la validación de certificados cuando atraviesan una red determinada. Los certificados se clasificarán como confiables o no como resultado del cruce de información obtenida de distintas fuentes. Esto resultaría en la detección temprana de certificados sospechosos y lanzaría mecanismos para rechazar el ataque, minimizar su impacto y recopilar información sobre los atacantes. Junto con lo anterior, se podría realizar un análisis más detallado y pormenorizado.
TLS is an essential building block for virtual private networks. A critical aspect for the security of TLS dialogs is authentication and key exchange, usually performed by means of certificates. An insecure key exchange can lead to a man-in-the-middle attack (MITM). Trust in certificates is generally achieved using Public Key Infrastructures (PKIs), which employ trusted certificate authorities (CAs) to establish certificate validity chains.
In the last years, a number of security concerns regarding PKI usage have arisen: certificates can be issued for entities in the Internet, regardless of its position in the CA hierarchy tree. This means that successful attacks on CAs have the potential to generate valid certificates enabling man-in-the-middle attacks. The possibility of malicious use of intermediate CAs to perform targeted attacks through ad-hoc certificates cannot be neglected and are extremely difficult to detect. Current PKI infrastructure for TLS is prone to MITM attacks, and new mechanisms for detection and avoidance of those attacks are needed. IETF and other standardization bodies have launched several initiatives to enable the detection of “forged” certificates. Most of these initiatives attempt to solve the existing problems by maintaining the current PKI model and using certificate pinning, which associates certificates and servers on use. These techniques have significant limitations, such as the need of a secure bootstrap procedure, or pinning requiring some host-by-host basis. This study proposes an evolution from pinning-in-the-host to pinning-in-the-net, by enabling mechanisms to validate certificates as they travel through a given network. Certificates would be classified as trusted or not trusted as a result of cross-information obtained from different sources. This would result in early detection of suspicious certificates and would trigger mechanisms to defeat the attack; minimize its impact; and gather information on the attackers. Additionally, a more detailed and thorough analysis could be performed.
2016-10-13T11:38:06Z
2016-10-13T11:38:06Z
2014-10-07
info:eu-repo/semantics/article
E. de la Hoz, G. Cochrane, J. M. Moreira-Lemus, R. Paez-Reyes, I. Marsa-Maestre, and B. Alarcos, “Detecting and defeating
advanced man-in-the-middle attacks against TLS,” in Cyber Conflict (CyCon 2014), 2014 6th International Conference On, 2014,
pp. 209–221.
2325-5366
http://hdl.handle.net/10017/26443
10.1109/CYCON.2014.6916404
eng
http://dx.doi.org/10.1109/CYCON.2014.6916404
info:eu-repo/semantics/openAccess
© NATO CCD COE Publications, Tallinn
NATO CCD COE
oai:ebuah.uah.es:10017/230792023-12-14T15:52:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
2015-11-24T13:14:53Z
urn:hdl:10017/23079
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks
Hoz de la Hoz, Enrique de la
Giménez Guzmán, José Manuel
Marsá Maestre, Iván
Orden Martín, David
Universidad de Alcalá. Departamento de Automática
Wireless sensor networks
Surveillance
Resource assignment
Graphs
Automated negotiation
Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.
2015-11-24T13:14:53Z
2015-11-24T13:14:53Z
2015
info:eu-repo/semantics/article
de la Hoz, E.; Gimenez-Guzman, J.M.; Marsa-Maestre, I.; Orden, D. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks. Sensors 2015, 15, 29547-29568.
1424-8220
http://hdl.handle.net/10017/23079
eng
http://dx.doi.org/10.3390/s151129547
info:eu-repo/grantAgreement/MINECO//TIN 2014-61627-EXP/ES/DIVIDE AND NOT CONQUER-COMPORTAMIENTOS EMERGENTES EN REDES COMPLEJAS EGOISTAS/
info:eu-repo/grantAgreement/CAM//S2013%2FICE-2919/ES/TECNOLOGIAS INTEGRADAS DE GESTION Y OPERACIÓN DE RED 5G/TIGRE5-CM
info:eu-repo/grantAgreement/AEI//MTM2011-22792/ES/COMBINATORIA Y COMPLEJIDAD DE ESTRUCTURAS GEOMETRICAS DISCRETAS/
info:eu-repo/grantAgreement/MINECO//MTM2014-54207-P/ES/COMBINATORIA Y COMPLEJIDAD DE ESTRUCTURAS GEOMETRICAS DISCRETAS/
http://creativecommons.org/licenses/by-nc/3.0/es/
info:eu-repo/semantics/openAccess
Atribución-NoComercial 3.0 España
didl///col_10017_150/100