Jorge Ortega-Arjona
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jorge Ortega-Arjona has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Héctor Benítez-Pérez
Dirección General de Cómputo y de Tecnologías de Información y Comunicación, Universidad Nacional Autónoma de México, Ciudad de México, Mexico
5 shared publications - Adrián Durán Chavesti
Departamento de Ingeniería en Sistemas Computacionales y Automatización (DISCA), Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas (IIMAS), CDMX, Universidad Nacional Autónoma de México (UNAM), Mexico City 04510, Mexico
2 shared publications - Jared A. Rojas-Vargas
IIMAS UNAM Cto. Escolar 3000, C. U., México D. F
2 shared publications - Paul Erick Mendez-Monroy
Universidad Nacional Autónoma de México Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas
2 shared publications Andrés Álvarez-Cid
Facultad de Ingeniería UNAM Av. Universidad 3000, C.U., México D. F
1 shared publication- Gunnar Wolf
Universidad Nacional Autónoma de México
1 shared publication
Latest Publications
- Open Access
- 4 March 2024
- Published by Sociedade Brasileira de Computação in Journal of Internet Services and Applications
- Vol. 15 (1) , 46-58
A Protocol for Solving Certificate Poisoning for the OpenPGP Keyserver Network
The OpenPGP encryption standard builds on a transitive trust distribution model for identity assertion, using a non-authenticated, distributed keyserver network for key distribution and discovery. An attack termed “certificate poisoning”, surfaced in 2019 and consisting in adding excessive trust signatures from inexistent actors to the victim key so that it is no longer usable, has endangered the continued operation of said keyserver network. In this article, we explore a protocol modification in the key acceptance and synchronization protocol termed First-party attested third-party certification that, without requiring the redeployment of updated client software, prevents the ill effects of certificate poisoning without breaking compatibility with the OpenPGP installed base. We also discuss some potential challenges and limitations of this approach, providing recommendations for its adoption.
- 4 March 2024
- Published by Sociedade Brasileira de Computação in Journal of Internet Services and Applications
- Vol. 15 (1) , 46-58
Open AccessA Protocol for Solving Certificate Poisoning for the OpenPGP Keyserver Network
The OpenPGP encryption standard builds on a transitive trust distribution model for identity assertion, using a non-authenticated, distributed keyserver network for key distribution and discovery. An attack termed “certificate poisoning”, surfaced in 2019 and consisting in adding excessive trust signatures from inexistent actors to the victim key so that it is no longer usable, has endangered the continued operation of said keyserver network. In this article, we explore a protocol modification in the key acceptance and synchronization protocol termed First-party attested third-party certification that, without requiring the redeployment of updated client software, prevents the ill effects of certificate poisoning without breaking compatibility with the OpenPGP installed base. We also discuss some potential challenges and limitations of this approach, providing recommendations for its adoption.
- Open Access
- 1 December 2020
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 354, 171-186
Gradual Typing Using Union Typing With Records
- 1 December 2020
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 354, 171-186
Open AccessGradual Typing Using Union Typing With Records
- 8 April 2016
- Published by Springer Nature
- p. 201-212
An Agglomeration Strategy for the Parallel Processes Mapping onto a Distributed Computing Architecture
- 8 April 2016
- Published by Springer Nature
- p. 201-212
An Agglomeration Strategy for the Parallel Processes Mapping onto a Distributed Computing Architecture
- Open Access
- 26 January 2016
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 11 (2) , 179-193
Design of a Fuzzy Networked Control Systems. Priority Exchange Scheduling Algorithm
This work presents a supervisory control strategy for Networked Control Systems (NCSs). This shows the identification and control of the plant using fuzzy theory. The fuzzy model incorporates the delay dynamics within the fuzzy rules based upon a real-time hierarchical scheduling strategy. A hierarchical scheduling Priority Exchange algorithm is used based upon codesign strategy following mutual correlation among control and network algorithms in order to bounded time delays. A system of magnetic levitation is presented as a case study.
- 26 January 2016
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 11 (2) , 179-193
Open AccessDesign of a Fuzzy Networked Control Systems. Priority Exchange Scheduling Algorithm
This work presents a supervisory control strategy for Networked Control Systems (NCSs). This shows the identification and control of the plant using fuzzy theory. The fuzzy model incorporates the delay dynamics within the fuzzy rules based upon a real-time hierarchical scheduling strategy. A hierarchical scheduling Priority Exchange algorithm is used based upon codesign strategy following mutual correlation among control and network algorithms in order to bounded time delays. A system of magnetic levitation is presented as a case study.
- Open Access
- 16 November 2015
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 11 (1) , 11-25
A Fuzzy Networked Control System Following Frequency Transmission Strategy
At present, network control systems employ a common approximation to solve the connectivity issue due to time delays coupled with external factors . However, this approach tends to be complex in terms of time delays, and the inherent local phase is missing. Therefore, it is necessary to study the behavior of the delays as well as the integration of the differential equations of these bounded delays. The related time delays need to be known a priori, but from a dynamic real-time perspective in order to understand the dynamic phase behavior. The objective of this paper is to demonstrate the inclusion of the data frequency transmission and time delays that are bounded as parameters of the dynamic response from a real-time scheduling approximation, considering the local phase situation. The related control law is designed considering a fuzzy logic approximation for nonlinear time delays coupling. The main advantage is the integration of this behavior through extended state space representation. This keeps certain linear and bounded behavior leading to a stable situation during an events presentation, based on an accurate data transmission rate. An expected result is that the basics of the local phase missing as a result of the local bounded time delays from the lack of tide synchronization conforms to the modeling approximation.
- 16 November 2015
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 11 (1) , 11-25
Open AccessA Fuzzy Networked Control System Following Frequency Transmission Strategy
At present, network control systems employ a common approximation to solve the connectivity issue due to time delays coupled with external factors . However, this approach tends to be complex in terms of time delays, and the inherent local phase is missing. Therefore, it is necessary to study the behavior of the delays as well as the integration of the differential equations of these bounded delays. The related time delays need to be known a priori, but from a dynamic real-time perspective in order to understand the dynamic phase behavior. The objective of this paper is to demonstrate the inclusion of the data frequency transmission and time delays that are bounded as parameters of the dynamic response from a real-time scheduling approximation, considering the local phase situation. The related control law is designed considering a fuzzy logic approximation for nonlinear time delays coupling. The main advantage is the integration of this behavior through extended state space representation. This keeps certain linear and bounded behavior leading to a stable situation during an events presentation, based on an accurate data transmission rate. An expected result is that the basics of the local phase missing as a result of the local bounded time delays from the lack of tide synchronization conforms to the modeling approximation.
- Open Access
- 18 October 2015
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 2015, 1-8
A Consensus Routing Algorithm for Mobile Distributed Systems
This paper introduces aconsensus routing algorithmbased on an availability function. Such a function obtains a consensus among a group of nodes by evaluating the idle time in the scheduler of each node, along with the general conditions of the network and determining the next step of the route. In this regard, the algorithm proposed here makes it possible to avoid flooding while reducing bandwidth use and keeping changes of the network only at a local scale.
- 18 October 2015
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 2015, 1-8
Open AccessA Consensus Routing Algorithm for Mobile Distributed Systems
This paper introduces aconsensus routing algorithmbased on an availability function. Such a function obtains a consensus among a group of nodes by evaluating the idle time in the scheduler of each node, along with the general conditions of the network and determining the next step of the route. In this regard, the algorithm proposed here makes it possible to avoid flooding while reducing bandwidth use and keeping changes of the network only at a local scale.
- Open Access
- 29 March 2014
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 7 (2) , 365
Fuzzy Control Design for a Class of Nonlinear Network Control System: Helicopter Case Study
This paper presents a fuzzy control approach to a helicopter MIMO nonlinear system, implemented on a Networked Control System, as case study. For this, a hardware-in-the-Loop implementation is developed using several multi-channel A/D Cards, integrated to a computer network system. Variant time delays are considered over Ethernet and CANBUS networks. Fuzzy logic is used to deal with the complexity of the integrated computer network as well as with the dynamics of the system. Two fuzzy logic control systems are coupled for both signals of the helicopter case study: yaw and pitch. Both these tend to concentrate around desired references, considering variant time delays.
- 29 March 2014
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 7 (2) , 365
Open AccessFuzzy Control Design for a Class of Nonlinear Network Control System: Helicopter Case Study
This paper presents a fuzzy control approach to a helicopter MIMO nonlinear system, implemented on a Networked Control System, as case study. For this, a hardware-in-the-Loop implementation is developed using several multi-channel A/D Cards, integrated to a computer network system. Variant time delays are considered over Ethernet and CANBUS networks. Fuzzy logic is used to deal with the complexity of the integrated computer network as well as with the dynamics of the system. Two fuzzy logic control systems are coupled for both signals of the helicopter case study: yaw and pitch. Both these tend to concentrate around desired references, considering variant time delays.
- 21 September 2012
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 27 (6) , 481-502
Bounded communication between nodes of a networked control system as a strategy of scheduling
In a networked control system, several nodes exchange information through a network, to achieve specific control goals and thus increasing network traffic. This affects the overall system performance. Several approaches try to satisfy requirements of both control and communication performance. Particularly, some methodologies have been proposed to save bandwidth. One of such methodologies has been scheduling, which has been studied in depth through the last decade. Commonly, the objective of using scheduling to save bandwidth is to accurately use the computing resources. This paper shows two scheduling strategies, one performing static scheduling and the other carrying out dynamic scheduling, in order to expose the advantages of using dynamic scheduling in an ad hoc implementation. Both strategies execute on a real-time distributed system, and both are able to modify the frequency of transmission as well as the periods of tasks in individual components. Hence, both of them tend to impact on the quality of performance of the system, due to network use. The first scheduling strategy modifies the periods of task, and network access is assigned through a static scheduling algorithm. On the other hand, the second strategy, schedulability, is dynamically achieved by controlling the rate of frequency transmission into a frequency region, bounded by minimum and maximum transmission rates. Numerical simulations are used as implementations of both strategies.
- 21 September 2012
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 27 (6) , 481-502
Bounded communication between nodes of a networked control system as a strategy of scheduling
In a networked control system, several nodes exchange information through a network, to achieve specific control goals and thus increasing network traffic. This affects the overall system performance. Several approaches try to satisfy requirements of both control and communication performance. Particularly, some methodologies have been proposed to save bandwidth. One of such methodologies has been scheduling, which has been studied in depth through the last decade. Commonly, the objective of using scheduling to save bandwidth is to accurately use the computing resources. This paper shows two scheduling strategies, one performing static scheduling and the other carrying out dynamic scheduling, in order to expose the advantages of using dynamic scheduling in an ad hoc implementation. Both strategies execute on a real-time distributed system, and both are able to modify the frequency of transmission as well as the periods of tasks in individual components. Hence, both of them tend to impact on the quality of performance of the system, due to network use. The first scheduling strategy modifies the periods of task, and network access is assigned through a static scheduling algorithm. On the other hand, the second strategy, schedulability, is dynamically achieved by controlling the rate of frequency transmission into a frequency region, bounded by minimum and maximum transmission rates. Numerical simulations are used as implementations of both strategies.