Academic literature on the topic 'Méthodes basées mémoire'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Méthodes basées mémoire.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Méthodes basées mémoire"
Lesnoff, Matthieu. "Evaluation d’une méthode d’enquête rétrospective sur une période de douze mois pour estimer les taux de mise bas et de mortalité du bétail dans un système d’élevage africain traditionnel." Revue d’élevage et de médecine vétérinaire des pays tropicaux 62, no. 1 (January 1, 2009): 49. http://dx.doi.org/10.19182/remvt.10093.
Full textMilosavljević, Mladen. "KAKO SAMOSTALNO UČITI JEZIK POSREDSTVOM INTERNET RESURSA: TEORIJSKI I PRAKTIČNI ASPEKTI." Lipar XXII, no. 77 (2022): 213–32. http://dx.doi.org/10.46793/lipar77.213m.
Full textGagnon, Michèle, and Lisa Sweet. "W.D. Molloy and P.J. Caldwell. Alzheimer's Disease. Toronto, ON: Key Porter, 1998." Canadian Journal on Aging / La Revue canadienne du vieillissement 19, no. 2 (2000): 282–84. http://dx.doi.org/10.1017/s0714980800014069.
Full textBesson, Jean. "L’héritage de l'esclavage La mémoire du sol en Jamaïque occidentale." Annales. Histoire, Sciences Sociales 59, no. 3 (June 2004): 569–87. http://dx.doi.org/10.1017/s0395264900017728.
Full textCottez, Henri. "Les bases épistémologiques et linguistiques de la nomenclature chimique de 1787." Meta 39, no. 4 (September 30, 2002): 676–91. http://dx.doi.org/10.7202/002408ar.
Full textKastowo, Aryo Iguh. "LA RELATION INTERTEXTUELLE DES TROIS CONTES DANS HISTOIRES OU CONTES DU TEMPS PASSÉ PAR CHARLES PERRAULT ET DANS LE CONTEUR AMOUREUX PAR BRUNO DE LA SALLE: UNE ÉTUDE INTERTEXTUELLE SELON LA PENSÉE DE JULIA KRISTEVA. MÉMOIRE." Lingua Litteratia Journal 6, no. 1 (June 12, 2019): 15–26. http://dx.doi.org/10.15294/ll.v6i1.30873.
Full textHOUNDJI, Pamphile, Eusêbe C. M. CAPO, Issihako ZIME LAFIA, and Rock ADOUKO. "Croissance Urbaine Et Terres Agricoles Dans La Ville De Pobe." International Journal of Progressive Sciences and Technologies 25, no. 1 (February 26, 2021): 286. http://dx.doi.org/10.52155/ijpsat.v25.1.2825.
Full textClark, Jeffrey, Philip G. Crandall, Robert Pellegrino, and Jessica Shabatura. "Assessing Smart Glasses-based Foodservice Training: An Embodied Learning Theory Approach." Canadian Journal of Learning and Technology / La revue canadienne de l’apprentissage et de la technologie 45, no. 2 (October 3, 2019). http://dx.doi.org/10.21432/cjlt27838.
Full textDias, Amanda de Araújo, Édina Lúcia de Araújo Dias, Ciane Martins de Oliveira, Carla Viana Dendasck, and Euzébio de Oliveira. "Dépendance chimique pour l’usage de la marijuana: du plaisir à la maladie. Un grave problème de santé publique au Brésil." Revista Científica Multidisciplinar Núcleo do Conhecimento, March 19, 2021, 78–86. http://dx.doi.org/10.32749/nucleodoconhecimento.com.br/sante/marijuana.
Full textGagné, Natacha. "Anthropologie et histoire." Anthropen, 2017. http://dx.doi.org/10.17184/eac.anthropen.060.
Full textDissertations / Theses on the topic "Méthodes basées mémoire"
Jezequel, Loïc. "Vers une détection d'anomalie unifiée avec une application à la détection de fraude." Electronic Thesis or Diss., CY Cergy Paris Université, 2023. http://www.theses.fr/2023CYUN1190.
Full textDetecting observations straying apart from a baseline case is becoming increasingly critical in many applications. It is found in fraud detection, medical imaging, video surveillance or even in manufacturing defect detection with data ranging from images to sound. Deep anomaly detection was introduced to tackle this challenge by properly modeling the normal class, and considering anything significantly different as anomalous. Given the anomalous class is not well-defined, classical binary classification will not be suitable and lack robustness and reliability outside its training domain. Nevertheless, the best-performing anomaly detection approaches still lack generalization to different types of anomalies. Indeed, each method is either specialized on high-scale object anomalies or low-scale local anomalies.In this context, we first introduce a more generic one-class pretext-task anomaly detector. The model, named OC-MQ, computes an anomaly score by learning to solve a complex pretext task on the normal class. The pretext task is composed of several sub-tasks allowing it to capture a wide variety of visual cues. More specifically, our model is made of two branches each representing discriminative and generative tasks.Nevertheless, an additional anomalous dataset is in reality often available in many applications and can provide harder edge-case anomalous examples. In this light, we explore two approaches for outlier-exposure. First, we generalize the concept of pretext task to outlier-exposure by dynamically learning the pretext task itself with normal and anomalous samples. We propose two the models SadTPS and SadRest that respectively learn a discriminative pretext task of thin plate transform recognition and generative task of image restoration. In addition, we present a new anomaly-distance model SadCLR, where the training of previously unreliable anomaly-distance models is stabilized by adding contrastive regularization on the representation direction. We further enrich existing anomalies by generating several types of pseudo-anomalies.Finally, we extend the two previous approaches to be usable in both one-class and outlier-exposure setting. Firstly, we introduce the AnoMem model which memorizes a set of multi-scale normal prototypes by using modern Hopfield layers. Anomaly distance estimators are then fitted on the deviations between the input and normal prototypes in a one-class or outlier-exposure manner. Secondly, we generalize learnable pretext tasks to be learned only using normal samples. Our proposed model HEAT adversarially learns the pretext task to be just challenging enough to keep good performance on normal samples, while failing on anomalies. Besides, we choose the recently proposed Busemann distance in the hyperbolic Poincaré ball model to compute the anomaly score.Extensive testing was conducted for each proposed method, varying from coarse and subtle style anomalies to a fraud detection dataset of face presentation attacks with local anomalies. These tests yielded state-of-the-art results, showing the significant success of our methods
Bibi, Hatem. "Construction de bases d'ondelettes de $L^2[0,1]$ et estimation du paramètre de longue mémoire par la méthode des ondelettes." Phd thesis, Université Panthéon-Sorbonne - Paris I, 2011. http://tel.archives-ouvertes.fr/tel-00666162.
Full textLe, Sergent Thierry. "Méthodes d'exécution et machines virtuelles parallèles pour l'implantation distribuée du langage de programmation parallèle LCS." Toulouse 3, 1993. http://www.theses.fr/1993TOU30021.
Full textLachat, Cédric. "Conception et validation d'algorithmes de remaillage parallèles à mémoire distribuée basés sur un remailleur séquentiel." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00932602.
Full textHedabou, Mustapha. "Amélioration et sécurisation des calculs arithmétiques pour la cryptographie basée sur les courbes elliptiques." Toulouse, INSA, 2006. http://www.theses.fr/2006ISAT0020.
Full textIn this Ph. D, we study some efficiency and security aspects of the implementation of Elliptic Curve Cryptosystems. In the first part, we improve the efficiency of the arithmetic computations on the elliptic curve, by introducing new methods for the scalar multiplication. These methods, which are derived from well-known efficient methods, such as the comb or "tau"-adic methods, allow to reduce the size of the used memory space, the computation time or both, without requiring the insertion of any additional routine. The results found are corroborated by numerical studies. In the second part, we present two types of countermeasures to protect Elliptic Curve Cryptosystems running on limited resources such as smart cards against Side Channel Attacks (SCA). The first type consists in extending or enhancing some known countermeasures. The second one consists in converting the methods proposed in the first part into efficient SCA-resistant methods. Furthermore, we evaluate and compare various combinations of countermeasures in order to be able to come to a conclusion about the best choices for an implementation
Möller, Nathalie. "Adaptation de codes industriels de simulation en Calcul Haute Performance aux architectures modernes de supercalculateurs." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLV088.
Full textFor many years, the stability of the architecture paradigm has facilitated the performance portability of large HPC codes from one generation of supercomputers to another.The announced breakdown of the Moore's Law, which rules the progress of microprocessor engraving, ends this model and requires new efforts on the software's side.Code modernization, based on an algorithmic which is well adapted to the future systems, is mandatory.This modernization is based on well-known principles as the computation concurrency, or degree of parallelism, and the data locality.However, the implementation of these principles in large industrial applications, which often are the result of years of development efforts, turns out to be way more difficult than expected.This thesis contributions are twofold :On the one hand, we explore a methodology of software modernization based on the concept of proto-applications and compare it with the direct approach, while optimizing two simulation codes developed in a similar context.On the other hand, we focus on the identification of the main challenges for the architecture, the programming models and the applications.The two chosen application fields are the Computational Fluid Dynamics and Computational Electro Magnetics
Casadei, Astrid. "Optimisations des solveurs linéaires creux hybrides basés sur une approche par complément de Schur et décomposition de domaine." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0186/document.
Full textIn this thesis, we focus on the parallel solving of large sparse linear systems. Our main interestis on direct-iterative hybrid solvers such as HIPS, MaPHyS, PDSLIN or ShyLU, whichrely on domain decomposition and Schur complement approaches. Althrough these solvers arenot as time and space consuming as direct methods, they still suffer from serious overheads. Ina first part, we thus present the existing techniques for reducing the memory consumption, andwe present a new method which does not impact the numerical robustness of the preconditioner.This technique reduces the memory peak by doing a special scheduling of computation, allocation,and freeing tasks in particular in the Schur coupling blocks of the matrix. In a second part,we focus on the load balancing of the domain decomposition in a parallel context. This problemconsists in partitioning the adjacency graph of the matrix in as many domains as desired. Wepoint out that a good load balancing for the most expensive steps of an hybrid solver such asMaPHyS relies on the balancing of both interior nodes and interface nodes of the domains.Through, until now, graph partitioners such as MeTiS or Scotch used to optimize only thefirst criteria (i.e., the balancing of interior nodes) in the context of sparse matrix ordering. Wepropose different variations of the existing algorithms to improve the balancing of interface nodesand interior nodes simultaneously. All our changes are implemented in the Scotch partitioner.We present our results on large collection of matrices coming from real industrial cases
Book chapters on the topic "Méthodes basées mémoire"
ELIAHU, Adi, Rotem BEN HUR, Ameer HAJ ALI, and Shahar KVATINSKY. "mMPU, une architecture polyvalente de calcul dans la mémoire basée sur memristor." In Systèmes multiprocesseurs sur puce 1, 155–69. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9021.ch6.
Full text