Blogue
MedNNS: Supernet-based Medical Task-Adaptive Neural Network Search
Deep learning (DL) has achieved remarkable progress in the field of medical imaging. Cependant, adapting DL models to medical tasks remains a significant challenge, primarily due to two key factors: (1) architecture selection, as different tasks necessitate specialized model designs, et (2)...
Une prise de décision tactique à horizon étendu pour une conduite automatisée basée sur sur Recherche d'arbres de Monte Carlo
This paper introduces COR-MCTS (Conservation of Resources – Monte Carlo Tree Search), a novel tactical decision-making approach for automated driving focusing on maneuver planning over extended horizons. Traditional decision-making algorithms are often constrained by fixed planning horizons, typically up to 6 seconds...
Couverture satellitaire-terrestre active aérienne assistée par STAR-RIS Communications
An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. Cependant, the networks are hindered by the long-distance path loss and security risks in dense urban environments. Dans ce travail, we propose a satellite-terrestrial covert...
Actions de jauge améliorées par RG apprises par machine et classiquement parfaites flux dégradés
Extracting continuum properties of quantum field theories from discretized spacetime is challenging due to lattice artifacts. Renormalization-group (RG)-improved lattice actions can preserve continuum properties, but are in general difficult to parameterize. Machine learning (ML) with gauge-equivariant convolutional neural networks provides a way...
Détection multi-échelle de changements pratiquement significatifs dans un environnement progressivement séries chronologiques variables
In many change point problems it is reasonable to assume that compared to a benchmark at a given time point $t_0$ the properties of the observed stochastic process change gradually over time for $t >t_0$. Souvent, these gradual changes are not of...
Planification bidirectionnelle des tâches et des mouvements basée sur le renforcement hiérarchique Apprendre pour la confrontation stratégique
En robotique en essaim, scénarios de confrontation, including strategic confrontations, require efficient decision-making that integrates discrete commands and continuous actions. Traditional task and motion planning methods separate decision-making into two layers, but their unidirectional structure fails to capture the interdependence between these layers, limiting...
Défauts, Amortissement du son, et le pic Boson dans les solides amorphes
Two nearly universal and anomalous properties of glasses, the peak in the specific heat and plateau of the thermal conductivity, occur around the same temperature. This coincidence suggests that the two phenomena are related. Both effects can be rationalized by assuming Rayleigh...
Cryptoanalysis of a public key exchange based on circulant matrix over digital semiring
We present a cryptanalysis of a key exchange protocol based on the digital semiring. For this purpose, we find the maximal solution of a linear system over such semiring, and use the properties of circulant matrix to demonstrate that the protocol is...
Measurement of the time-integrated $CP$ asymmetry in $D^0 \to K^0_{\rm S} K^0_{\RM S}$ désintégrations en utilisant le marquage de saveur du côté opposé chez Belle et Belle II
We measure the time-integrated $CP$ asymmetry in $D^0 \to K^0_{\RM S} K^0_{\RM S}$ decays reconstructed in $e^+e^-\to c{\overline c}$ events collected by the Belle and Belle II experiments. The corresponding data samples have integrated luminosities of 980 et 428 fb${}^{-1}$, respectivement. À...
Algorithmes de branchement et de liaison en tant que schémas d'approximation en temps polynomial
Algorithmes de branchement et de liaison (B&B) et schémas d'approximation en temps polynomial (PTAS) sont deux domaines apparemment éloignés de l’optimisation combinatoire. We intend to (partiellement) bridge the gap between them while expanding the boundary of theoretical knowledge on the B&Cadre B. Branch-and-bound algorithms typically guarantee that an...