Portail HAL de Télécom Paris
Not a member yet
14191 research outputs found
Sort by
Collaborative Action on Timing InterferenCes: Summary and Perspectives at Mid-term
No full textInternational audienceCAOTIC is an ambitious initiative aimed at pooling and coordinating the efforts of major French research teams working on timing analysis of multicore real-time systems, with a focus on interference due to shared resources. The objective is to enable the efficient use of multicores in critical systems. Based on a better understanding of timing anomalies and interference, considering the specificities of applications (structural properties and execution model), and revisiting the links between timing analysis and synthesis processes (code generation, mapping, scheduling), we target significant progresses in timing analysis models and techniques for critical systems, as well as in methodologies for their application in industry. In this paper, at project mid-term, we show the progress of the project. We also present some original work, about the use of a Tricore plaform and its timing model, and discuss open questions and future work
Valoriser la production fruitière écologique du Pilat un projet de recherche-action
No full textThis work describes the co-design process for a fruit-growing region, aimed at promoting the ecological nature of fruit production, enabling farmers to earn a good income and offering them good working conditions, while promoting biodiversity, preserving natural resources and contributing to food security in the surrounding areas.Ces travaux décrivent les démarches de co-conception d'un territoire de production fruitière, visant à valoriser le caractère écologique de la production fruitière, permettant de bien rémunérer les agriculteurs et de leur offrir des bonnes conditions de travail tout en favorisant les biodiversité et préservant les ressources naturelles et en participant à la sécurité alimentaire des bassins de vie
Quelle(s) place(s) du végétal sur les photographies diffusées sur les réseaux sociaux numériques ? Le Jardin des Plantes sur Instagram (2012-2024) : méthodes et premières observations
No full textInternational audienc
Readability as a multi-measure construct in data visualization
No full textInternational audienceIn this paper, we argue that readability cannot be meaningfully discussed without considering multiple complementary measures, and that relying on a single measure constitutes an epistemological choice that constrains the conclusions that can be drawn
Images that Highlight: The Case of Video Calls Between an Emergency Call Service and People with Aphasia
No full textInternational audienceThis study is part of a wider project to ensure that people with aphasia have better access to emergency calls in France, via Centre National Relais 114 (CNR114), a specialized emergency call reception center. We collected data from video calls between 114’s agents and aphasic volunteers simulating emergency situations. We closely examined how participants deal with comprehension problems, in particular how the agent's use of images shown and pointed at the camera proves decisive. Using a conversation analysis approach that takes into account the specificity of the participants, we provide emblematic cases of what we found in the data, all in line with the practical problem of organizing and ensuring mutual understanding, through referential activities. The results reveal some in-depth aspects of emergency service agents’ expertise from an interactional and creative point of view: facilitating the progressivity of interaction and ensuring a better understanding of the different referents mobilized in discourse
Cross-Core Covert Channel for RISC-V: Implementation, Countermeasures and Cross-Platform Analysis
No full textInternational audienceCache-based covert channels exploit microarchitectural timing differences to enable unauthorized communication between processes. While extensively studied on x86 architectures, such channels remain underexplored in the emerging RISC-V ecosystem. This paper presents the design and implementation of a novel prefetcher and cache timing covert channel for RISC-V platforms that exploits the timing difference between cached and uncached memory accesses. Our implementation supports both standardized RISC-V cache management extensions (Zicbom and Zicbop) and vendor-specific instructions (T-Head C910 custom instructions), demonstrating cross-platform portability across heterogeneous RISC-V implementations. The sender encodes bits by selectively prefetching or flushing a shared cache line, while the receiver decodes information by measuring memory access latency. Through careful synchronization using POSIX shared memory and atomic operations, we achieve reliable bit transmission on both the RISC-V gem5 full-system simulator (Sifive U54 core) and physical RISC-V Beagle-V Ahead (T-Head C910 core). Our paper contributes to understanding the security implications of cache and prefetcher management instructions in RISC-V systems and provides a foundation for developing detection and mitigation strategies for this emerging architecture.</div
LELA: an LLM-based Entity Linking Approach with Zero-Shot Domain Adaptation
No full textEntity linking (mapping ambiguous mentions in text to entities in a knowledge base) is a foundational step in tasks such as knowledge graph construction, question-answering, and information extraction. Our method, LELA, is a modular coarse-to-fine approach that leverages the capabilities of large language models (LLMs), and works with different target domains, knowledge bases and LLMs, without any fine-tuning phase. Our experiments across various entity linking settings show that LELA is highly competitive with fine-tuned approaches, and substantially outperforms the non-fine-tuned ones
Towards a systemic framework for assessing the environmental rebound effects of Artificial Intelligence
No full textInternational audienc
Compression in 3D Gaussian Splatting: A Survey of Methods, Trends, and Future Directions
No full textInternational audienceGaussian Splatting (3DGS) has recently emerged as a pioneering approach in explicit scene rendering and computer graphics. Unlike traditional neural radiance field (NeRF) methods, which typically rely on implicit, coordinatebased models to map spatial coordinates to pixel values, 3DGS utilizes millions of learnable 3D Gaussians. Its differentiable rendering technique and inherent capability for explicit scene representation and manipulation positions 3DGS as a potential game-changer for the next generation of 3D reconstruction and representation technologies. This enables 3DGS to deliver realtime rendering speeds while offering unparalleled editability levels. However, despite its advantages, 3DGS suffers from substantial memory and storage requirements, posing challenges for deployment on resource-constrained devices. In this survey, we provide a comprehensive overview focusing on the scalability and compression of 3DGS. We begin with a detailed background overview of 3DGS, followed by a structured taxonomy of existing compression methods. Additionally, we analyze and compare current methods from the topological perspective, evaluating their strengths and limitations in terms of fidelity, compression ratios, and computational efficiency. Furthermore, we explore how advancements in efficient NeRF representations can inspire future developments in 3DGS optimization. Finally, we conclude with current research challenges and highlight key directions for future exploration.</div
Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
No full textIn this paper, we study the class of operations , of any fixed arity , satisfying the following property: for each fixed integer , there exists an algorithm for a RAM machine which, for any input integer , - pre-computes some tables in time, - then reads operands , or conversely, is reduced to , for any positive \varepsilon<1 (provided the set of primitive operation includes , and ). To complete the picture, we demonstrate that the class degenerates if the preprocessing time reduces to