Archives Ouvertes HAL
Toutes les publications de l'ENAC en direct.
All ENAC publications.
[hal-04568108] How Hard is Asynchronous Weight Reassignment?
Quorum systems are fundamental abstractions employed to design fault-tolerant and available distributed protocols. While the regular majority quorum system is commonly employed due to its simplicity and optimal fault tolerance, it falls short in addressing the dynamic and heterogeneous nature of practical systems. This limitation becomes evident in protocols such as the ones deployed in wide-area networks, where nodes exhibit diverse performance, or those used in blockchain and decentralized payment systems, where nodes' stakes or reputations vary over time. Presenting a dynamic weighted variant of this quorum system effectively addresses these challenges but introduces a...
[hal-04568108] How Hard is Asynchronous Weight Reassignment?
Quorum systems are fundamental abstractions employed to design fault-tolerant and available distributed protocols. While the regular majority quorum system is commonly employed due to its simplicity and optimal fault tolerance, it falls short in addressing the dynamic and heterogeneous nature of practical systems. This limitation becomes evident in protocols such as the ones deployed in wide-area networks, where nodes exhibit diverse performance, or those used in blockchain and decentralized payment systems, where nodes' stakes or reputations vary over time. Presenting a dynamic weighted variant of this quorum system effectively addresses these challenges but introduces a...
[hal-04568108] How Hard is Asynchronous Weight Reassignment?
Quorum systems are fundamental abstractions employed to design fault-tolerant and available distributed protocols. While the regular majority quorum system is commonly employed due to its simplicity and optimal fault tolerance, it falls short in addressing the dynamic and heterogeneous nature of practical systems. This limitation becomes evident in protocols such as the ones deployed in wide-area networks, where nodes exhibit diverse performance, or those used in blockchain and decentralized payment systems, where nodes' stakes or reputations vary over time. Presenting a dynamic weighted variant of this quorum system effectively addresses these challenges but introduces a...
[hal-04567240] A Reactive System-specific Compilation Chain from Synchronous Dataflow Models to FPGA Netlist
Modern Field Programmable Gate Arrays (FPGAs) offer a solution to several issues related to real-time on-board systems, such as guaranteed execution time. They are currently considered as target platforms for space applications. However, the complexity of producing circuits on these components poses a challenge to their widespread adoption. To address this issue, high-level synthesis tools provide another layer of abstraction above the logic circuit design process, for example compiling C code into Hardware Description Languages such as VHDL or Verilog. However, high-level synthesis results are poorly predictable and do not guarantee the efficient use of recent FPGA...
[hal-04564025] ArGaze: An Open and Flexible Software Library for Gaze Analysis and Interaction
Gaze analysis has evolved into a mature technique with diverse applications enabling the investigation of various human activities and cognitive processes such as reading, visual attention, memory as well as real time gaze interaction. However, existing proprietary software or librairies often lacks the flexibility needed to incorporate emerging gaze metrics or real time processing, limiting researchers to predefined methodologies. To address these limitations, we introduce ArGaze, an open and flexible software library designed to provide a unified and modular approach to gaze analysis or gaze interaction. ArGaze facilitates real-time and/or post-processing analysis for...
[hal-04550976] Extending Guiding Vector Field to track unbounded UAV paths
A recent advance in vector field path following is the introduction of the Parametric Guiding Vector Field method. It allows for singularity-free vector fields with strong convergence guarantees, usable even for self-intersecting paths. However, the method requires significant gain tuning for practical use. In particular, for unbounded paths, the gains will inevitably become ill-suited for efficient path following. We propose a method to overcome this issue by introducing a dynamic step adaptation strategy, which provides additional normalization properties to the field. This allows the following of unbounded curves and reduces the number of gains to tune. The proposed...
[hal-04543171] Adversarial Robustness with Partial Isometry
Despite their remarkable performance, deep learning models still lack robustness guarantees, particularly in the presence of adversarial examples. This significant vulnerability raises concerns about their trustworthiness and hinders their deployment in critical domains that require certified levels of robustness. In this paper, we introduce an information geometric framework to establish precise robustness criteria for l2 white-box attacks in a multi-class classification setting. We endow the output space with the Fisher information metric and derive criteria on the input–output Jacobian to ensure robustness. We show that model robustness can be achieved by constraining...