Littérature scientifique sur le sujet « Mise en cache codée »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Mise en cache codée ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Mise en cache codée"
Garot, Matthieu. « « 8 Murders Cache-cache ». Récit horrifique et adolescence ». Cliniques N° 26, no 2 (31 octobre 2023) : 172–86. http://dx.doi.org/10.3917/clini.026.0172.
Texte intégralNachtergael, Magali. « Théâtre d’ombres chez Sophie Calle : les mises en scène du moi et de l’absence ». Filer (Sophie Calle), no 7 (10 août 2011) : 139–50. http://dx.doi.org/10.7202/1005521ar.
Texte intégralDeslauriers, Mélanie, Claire Durand et Gérard Duhaime. « Que se cache-t-il derrière les portraits statistiques nationaux ? » Sociologie et sociétés 43, no 2 (8 mars 2012) : 143–74. http://dx.doi.org/10.7202/1008242ar.
Texte intégralJuillard, Caroline. « L'expansion du wolof à Ziguinchor. Les interactions à caractère commercial ». Plurilinguismes 2, no 1 (1990) : 103–54. http://dx.doi.org/10.3406/pluri.1990.877.
Texte intégralHél-Bongo, Olga. « Métatextualité, mise en abyme et anamorphose dans Le bel immonde de V.Y. Mudimbe ». Articles 42, no 1-2 (15 janvier 2014) : 175–93. http://dx.doi.org/10.7202/1021303ar.
Texte intégralCharest, Johanne. « Dé-paysés et dépaysement à l’œuvre dans Un pays sans bon sens (1970) et La Bête lumineuse (1982) de Pierre Perrault ». Textures, no 24-25 (1 janvier 2018) : 161–74. http://dx.doi.org/10.35562/textures.260.
Texte intégralGuedj, Brigitte, et Fabienne Picard. « Pratiques innovatrices des PME rhône-alpines : une approche par la diversité des sources de l'innovation technologique ». Revue internationale P.M.E. 7, no 3-4 (16 février 2012) : 41–64. http://dx.doi.org/10.7202/1008423ar.
Texte intégralForget, Danielle. « En pièces détachées et déplacées. Frontières, ou Tableaux d’Amérique de Noël Audet ». Études françaises 44, no 1 (11 juin 2008) : 73–87. http://dx.doi.org/10.7202/018164ar.
Texte intégralColin, Thierry, et Benoît Grasser. « Le rôle des réseaux patronaux dans la diffusion de la gestion des compétences en France ». Articles 67, no 3 (28 septembre 2012) : 375–97. http://dx.doi.org/10.7202/1012536ar.
Texte intégralRoyant-Parola, S. « SFRMS – Psychiatrie et sommeil, décodage clinique ». European Psychiatry 29, S3 (novembre 2014) : 583. http://dx.doi.org/10.1016/j.eurpsy.2014.09.289.
Texte intégralThèses sur le sujet "Mise en cache codée"
Zhao, Hui. « High performance cache-aided downlink systems : novel algorithms and analysis ». Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS366.
Texte intégralThe thesis first addresses the worst-user bottleneck of wireless coded caching, which is known to severely diminish cache-aided multicasting gains. We present a novel scheme, called aggregated coded caching, which can fully recover the coded caching gains by capitalizing on the shared side information brought about by the effectively unavoidable file-size constraint. The thesis then transitions to scenarios with transmitters with multi-antenna arrays. In particular, we now consider the multi-antenna cache-aided multi-user scenario, where the multi-antenna transmitter delivers coded caching streams, thus being able to serve multiple users at a time, with a reduced radio frequency (RF) chains. By doing so, coded caching can assist a simple analog beamformer (only a single RF chain), thus incurring considerable power and hardware savings. Finally, after removing the RF-chain limitation, the thesis studies the performance of the vector coded caching technique, and reveals that this technique can achieve, under several realistic assumptions, a multiplicative sum-rate boost over the optimized cacheless multi-antenna counterpart. In particular, for a given downlink MIMO system already optimized to exploit both multiplexing and beamforming gains, our analysis answers a simple question: What is the multiplicative throughput boost obtained from introducing reasonably-sized receiver-side caches?
Parrinello, Emanuele. « Fundamental Limits of Shared-Cache Networks ». Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS491.
Texte intégralIn the context of communication networks, the emergence of predictable content has brought to the fore the use of caching as a fundamental ingredient for handling the exponential growth in data volumes. This thesis aims at providing the fundamental limits of shared-cache networks where the communication to users is aided by a small set of caches. Our shared-cache model, not only captures heterogeneous wireless cellular networks, but it can also represent a model for users requesting multiple files simultaneously, and it can be used as a simple yet effective way to deal with the so-called subpacketization bottleneck of coded caching. Furthermore, we will also see how our techniques developed for caching networks can find application in the context of heterogeneous coded distributed computing
Ben, Ammar Hamza. « On models for performance evaluation and cache resources placement in multi-cache networks ». Thesis, Rennes 1, 2019. http://www.theses.fr/2019REN1S006/document.
Texte intégralIn the last few years, Content Providers (CPs) have experienced a high increase in requests for video contents and rich media services. In view of the network scaling limitations and beyond Content Delivery Networks (CDNs), Internet Service Providers (ISPs) are developing their own caching systems in order to improve the network performance. These factors explain the enthusiasm around the Content-Centric Networking (CCN) concept and its in-network caching feature. The analytical quantification of caching performance is, however, not sufficiently explored in the literature. Moreover, setting up an efficient caching system within a network infrastructure is very complex and remains an open problem. To address these issues, we provide first in this thesis a fairly generic and accurate model of caching nodes named MACS (Markov chain-based Approximation of Caching Systems) that can be adapted very easily to represent different caching schemes and which can be used to compute different performance metrics of multi-cache networks. We tackled after that the problem of cache resources allocation in cache-enabled networks. By means of our analytical tool MACS, we present an approach that solves the trade-off between different performance metrics using multi-objective optimization and we propose an adaptation of the metaheuristic GRASP to solve the optimization problem
Bettignies, Geoffroy de. « Analyse fonctionnelle de la Rho GAP codée par le gène RGD1 chez la levure Saccharomyces cerevisiae : mise en évidence de relations avec la "voie PKC" ». Bordeaux 2, 2000. http://www.theses.fr/2000BOR28740.
Texte intégralMeddeb, Maroua. « Information-Centric Networking, A natural design for IoT applications ? » Thesis, Toulouse, INSA, 2017. http://www.theses.fr/2017ISAT0013/document.
Texte intégralThe Internet of Things (IoT) is commonly perceived as the extension of the current Internet to our physical world. It interconnects an unprecedented number of sensors/actuators, referred as things, to the Internet. Facing the important challenges imposed by devices heterogeneity and the tremendous generated traffic, the current Internet protocol suite has reached its limits. The Information-Centric Networking (ICN) has recently received a lot of attention as a potential Internet architecture to be adopted in an IoT ecosystem. The ICN paradigm is shaping the foreseen future Internet architecture by focusing on the data itself rather than its hosting location. It is a shift from a host-centric! communication model to a content-centric one supporting among! others unique and location-independent content names, in-network caching and name-based routing. By leveraging the easy data access, and reducing both the retrieval delay and the load on the data producer, the ICN can be a viable framework to support the IoT, interconnecting billions of heterogeneous constrained objects. Among several ICN architectures, the Named Data Networking (NDN) is considered as a suitable ICN architecture for IoT systems. Nevertheless, new issues have emerged slowing down the ambitions besides using the ICN paradigm in IoT environments. In fact, we have identified three major challenges. Since IoT devices are usually resource-constrained with harsh limitations on energy, memory and processing power, the adopted in-network caching techniques should be optimized. Furthermore, IoT data are transient and frequently updated by the producer which imposes stringent requirements to maintain cached data freshness. Finally, in IoT scenario, devices are ! frequently mobile and IoT applications require keeping data continuity. In this thesis, we propose a caching strategy that considers devices constraints. Then, we introduce a novel cache freshness mechanism to monitor the validity of cached contents in an IoT environment. Furthermore, to improve caching efficiency, we also propose a cache replacement policy that targets to raise the system performances and maintain data freshness. Finally, we introduce a novel name-based routing for NDN/IoT networks to support the producer mobility. We simulate and compare our proposals to several relevant schemes under a real traffic IoT network. Our schemes exhibit good system performances in terms of hop reduction ratio, server hit reduction ratio, response latency and packet loss, yet it provides a low cache cost and significantly improves the content validity
Busseuil, Rémi. « Exploration d'architecture d'accélérateurs à mémoire distribuée ». Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20218/document.
Texte intégralAlthough the accelerators market is dominated by heterogeneous MultiProcessor Systems-on-Chip (MPSoC), i.e. with different specialized processors, a growing interest is put on another type of MPSoC, composed by an array of identical processors. Even if these processors achieved lower performance to power ratio, the better flexibility and programmability of these homogeneous MPSoC allow an easier adaptation to the load, and offer a wider space of configurations. In this context, this thesis exposes the development of a scalable homogeneous MPSoC – i.e. with linear performance scaling – and different kind of adaptive mechanisms and programming model on it.This architecture is based on an array of MicroBlaze-like processors, each having its own memory, and connected through a 2D NoC. A modular RTOS was build on top of it. Thanks to a complex communication stack, different adaptive mechanisms were made: a “redirected data” task migration mechanism, reducing the impact of the migration mechanism for data-flow applications, and a “remote execution” mechanism. Instead of migrate the instruction code from a memory to another, this last consists in only migrate the execution, keeping the code in its initial memory. The different experiments shows faster reactivity but lower performance of this mechanism compared to migration.This development naturally led to the creation of a shared memory programming model. To achieve this, a scalable hardware/software memory consistency and cache coherency mechanism has been made, through the PThread library development. Experiments show the advantage of using NoC based homogeneous MPSoC with a brand programming model
Brunero, Federico. « Unearthing the Impact of Structure in Data and in Topology for Caching and Computing Networks ». Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS368.pdf.
Texte intégralCaching has shown to be an excellent expedient for the purposes of reducing the traffic load in data networks. An information-theoretic study of caching, known as coded caching, represented a key breakthrough in understanding how memory can be effectively transformed into data rates. Coded caching also revealed the deep connection between caching and computing networks, which similarly show the same need for novel algorithmic solutions to reduce the traffic load. Despite the vast literature, there remain some fundamental limitations, whose resolution is critical. For instance, it is well-known that the coding gain ensured by coded caching not only is merely linear in the overall caching resources, but also turns out to be the Achilles heel of the technique in most practical settings. This thesis aims at improving and deepening the understanding of the key role that structure plays either in data or in topology for caching and computing networks. First, we explore the fundamental limits of caching under some information-theoretic models that impose structure in data, where by this we mean that we assume to know in advance what data are of interest to whom. Secondly, we investigate the impressive ramifications of having structure in network topology. Throughout the manuscript, we also show how the results in caching can be employed in the context of distributed computing
Kamel, Boumédiène. « La responsabilite professionnelle pour les dommages causes par les produits industriels. Techniques legales et jurisprudentielles de mise en oeuvre de la responsabilite ». Rennes 1, 1986. http://www.theses.fr/1986REN11030.
Texte intégralJaber, Ghada. « A content-centric approach for wireless sensor networks ». Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30196.
Texte intégralWireless sensor networks are an essential part of the Internet of Things (IoT) "perception" layer. IoT connects the digital world created by conventional computer networks to the physical world. They continually bring new applications to life through a large number of elements that collect, process and disseminate environmental data. Today, moves accross the IoT a large and varied volume of data. Data is generated in a continuous way with a greater emphasis on information and not on its source. This indifference to the source is reinforced by the interchangeable and redundant deployments of the sensor networks. In this thesis, we focus on integrating the principles and mechanisms of content-oriented networks in wireless sensor networks to improve the operation and performance of these networks. Hence, we first focused on the temporal relevance of data in content-centric sensor networks. Indeed, we considered the content lifetime (or freshness) and we proposed two approaches (one reactive and the other proactive) for their update. In the second part of the thesis, we proposed a mechanism based on the control of the duty-cycle to overcome the impact of the flooding mainly used to disseminate the interests sent by the users and the corresponding contents. For this purpose, we tried to maintain a sufficient subset of nodes necessary to satisfy the interests received by the network. The main challenge was to reduce energy consumption thanks to a mechanism controlling the node activity while keeping a good interest satisfaction rate. Finally, to improve the content caching in a sensor network, we have studied the existing strategies and identified the parameters impacting their performance. We then proposed a strategy placing the contents according to the degree of the nodes and their distance from the source. An exhaustive comparative study with other solutions show that the proposed mechanisms guarantee good performance in terms of latency, energy consumption and interest satisfaction rate
Boughida, Malik. « Factorisation du rendu de Monte-Carlo fondée sur les échantillons et le débruitage bayésien ». Thesis, Paris, ENST, 2017. http://www.theses.fr/2017ENST0013/document.
Texte intégralMonte Carlo ray tracing is known to be a particularly well-suited class of algorithms for photorealistic rendering. However, its fundamentally random nature breeds noise in the generated images. In this thesis, we develop new algorithms based on Monte Carlo samples and Bayesian inference in order to factorize rendering computations, by sharing information across pixels or by caching previous results. In the context of offline rendering, we build upon a recent denoising technique from the image processing community, called Non-local Bayes, to develop a new patch-based collaborative denoising algorithm, named Bayesian Collaborative Denoising. It is designed to be adapted to the specificities of Monte Carlo noise, and uses the additionnal input data that we can get by gathering per-pixel sample statistics. In a second step, to factorize computations of interactive Monte Carlo rendering, we propose a new algorithm based on path tracing, called Dynamic Bayesian Caching. A clustering of pixels enables a smart grouping of many samples. Hence we can compute meaningful statistics on them. These statistics are compared with the ones that are stored in a cache to decide whether the former should replace or be merged with the latter. Finally, a Bayesian denoising, inspired from the works of the first part, is applied to enhance image quality
Livres sur le sujet "Mise en cache codée"
K, Wallace Donna, dir. Mort sur ordonnance : La vérité consternante que cache la surconsommation de médicaments. Gatineau, Québec : Éditions du Trésor caché, 2005.
Trouver le texte intégralActes de conférences sur le sujet "Mise en cache codée"
Musoll, Enric, et Mario Nemirovsky. « A study on the performance of two-level exclusive caching ». Dans International Symposium on Computer Architecture and High Performance Computing. Sociedade Brasileira de Computação, 1999. http://dx.doi.org/10.5753/sbac-pad.1999.19771.
Texte intégral