Pasar al contenido principal

MODELOS Y PLATAFORMAS PARA SISTEMA INFORMATICOS INDUSTRIALES PREDECIBLES, SEGUROS Y CONFIABLES

PID2021-124502OB-C42

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE CANTABRIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Gradient descent algorithm for the optimization of fixed priorities in real-time systems

  • Rivas, Juan M.
  • Gutiérrez, J. Javier
  • Guasque Ortega, Ana|||0000-0002-2900-8466
  • Balbastre, Patricia|||0000-0001-9458-4083
[EN] This paper considers the offline assignment of fixed priorities in partitioned preemptive real-time systems where tasks have precedence constraints. This problem is crucial in this type of systems, as having a good fixed priority assignment allows for an efficient use of the processing resources while meeting all the deadlines. In the literature, we can find several proposals to solve this problem, which offer varying trade-offs between the quality of their results and their computational complexities. In this paper, we propose a new approach, leveraging existing algorithms that are widely exploited in the field of Machine Learning: Gradient Descent, the Adam Optimizer, and Gradient Noise. We show how to adapt these algorithms to the problem of fixed priority assignment in conjunction with existing worst-case response time analyses. We demonstrate the performance of our proposal on synthetic task-sets with different sizes. This evaluation shows that our proposal is able to find more schedulable solutions than previous heuristics, approximating optimal but intractable algorithms such as MILP or brute-force, while requiring reasonable execution times., This work was partially supported by MCIN/ AEI/10.13039/ 501100011033/ FEDER Una manera de hacer Europa , Spain under grants PID2021-124502OB-C41 and PID2021-124502OB-C42 (PRESECREL), and by the Vicerrectorado de Investigación de la Universitat Politècnica de Valencia (UPV) Aid to First Research Projects , Spain under grant PAID-06-23 and PAID-10-20.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An ontology-based secure design framework for graph-based databases

  • Paneque, Manuel
  • Roldán-García, María del Mar
  • Blanco Bueno, Carlos
  • Maté, Alejandro
  • Rosado, David G.
  • Trujillo, Juan
  • Maté, Alejandro|||/items/93f2089c-972b-4620-bfbe-c0e3cc4a6fa3
  • Trujillo, Juan|||/items/6b71a8e1-3f53-45b5-b548-767fac0d66aa
Graph-based databases are concerned with performance and flexibility. Most of the existing approaches used to design secure NoSQL databases are limited to the final implementation stage, and do not involve the design of security and access control issues at higher abstraction levels. Ensuring security and access control for Graph-based databases is difficult, as each approach differs significantly depending on the technology employed. In this paper, we propose the first technology-ascetic framework with which to design secure Graph-based databases. Our proposal raises the abstraction level by using ontologies to simultaneously model database and security requirements together. This is supported by the TITAN framework, which facilitates the way in which both aspects are dealt with. The great advantages of our approach are, therefore, that it: allows database designers to focus on the simultaneous protection of security and data while ignoring the implementation details; facilitates the secure design and rapid migration of security rules by deriving specific security measures for each underlying technology, and enables database designers to employ ontology reasoning in order to verify whether the security rules are consistent. We show the applicability of our proposal by applying it to a case study based on a hospital data access control.