Academic literature on the topic 'Petits jeux de données'
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 'Petits jeux de données.'
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 "Petits jeux de données":
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.
Daniel, Sylvie. "Revue des descripteurs tridimensionnels (3D) pour la catégorisation des nuages de points acquis avec un système LiDAR de télémétrie mobile." Geomatica 72, no. 1 (March 1, 2018): 1–15. http://dx.doi.org/10.1139/geomat-2018-0001.
Tabouret-Keller, Andrée. "Continuité et discontinuité de la transmission de l’emploi de l’alsacien dans deux familles alliées." Plurilinguismes 1, no. 1 (1988): 1–12. http://dx.doi.org/10.3406/pluri.1988.899.
LEROUX, C., L. BERNARD, F. DESSAUGE, F. LE PROVOST, and P. MARTIN. "La fonction de lactation : régulation de la biosynthèse des constituants du lait." INRAE Productions Animales 26, no. 2 (May 17, 2013): 117–28. http://dx.doi.org/10.20870/productions-animales.2013.26.2.3141.
DENDONCKER, Morgane. "Cinquante ans de dynamique de la végétation ligneuse dans le Sahel sénégalais (Ferlo) : bases pour une approche de la diversité fonctionnelle." BOIS & FORETS DES TROPIQUES 354 (December 1, 2022): 79–80. http://dx.doi.org/10.19182/bft2022.354.a36986.
Schubauer-Leoni, Maria Luisa, and Anne-Marie Munch. "Un jeu de société dans une institution de la petite enfance : analyse didactique des interactions entre une éducatrice et cinq enfants à propos d’un jeu." Bulletin de psychologie 56, no. 466 (2003): 457–72. http://dx.doi.org/10.3406/bupsy.2003.15237.
Goldstein, Mauricio, and Philip Read. "Petits jeux de pouvoir en entreprise." Revue internationale de psychosociologie et de gestion des comportements organisationnels XVIII, no. 45 (2012): 293. http://dx.doi.org/10.3917/rips1.045.0293.
RAYNAUT, William, Chantal SOULE-DUPUY, and Nathalie VALLES-PARLANGEAU. "Dissimilarités entre jeux de données." Ingénierie des systèmes d'information 22, no. 3 (March 28, 2017): 35–63. http://dx.doi.org/10.3166/isi.22.3.35-63.
Viquesnel, Benoît. "5. Jeux vocaux avec les tout-petits." Métiers de la Petite Enfance 21, no. 219 (March 2015): 33–34. http://dx.doi.org/10.1016/j.melaen.2014.12.014.
Feurer, Denis, Mohamed Amine El Maaoui, Mohamed Rached Boussema, and Olivier Planchon. "Méthode opérationnelle de production d'orthophotos et de MNT décimétriques à l'échelle du kilomètre carré par cerf-volant." Revue Française de Photogrammétrie et de Télédétection, no. 213 (April 26, 2017): 43–53. http://dx.doi.org/10.52638/rfpt.2017.190.
Dissertations / Theses on the topic "Petits jeux de données":
Gay, Antonin. "Pronostic de défaillance basé sur les données pour la prise de décision en maintenance : Exploitation du principe d'augmentation de données avec intégration de connaissances à priori pour faire face aux problématiques du small data set." Electronic Thesis or Diss., Université de Lorraine, 2023. http://www.theses.fr/2023LORR0059.
This CIFRE PhD is a joint project between ArcelorMittal and the CRAN laboratory, with theaim to optimize industrial maintenance decision-making through the exploitation of the available sources of information, i.e. industrial data and knowledge, under the industrial constraints presented by the steel-making context. Current maintenance strategy on steel lines is based on regular preventive maintenance. Evolution of preventive maintenance towards a dynamic strategy is done through predictive maintenance. Predictive maintenance has been formalized within the Prognostics and Health Management (PHM) paradigm as a seven steps process. Among these PHM steps, this PhD's work focuses on decision-making and prognostics. The Industry 4.0 context put emphasis on data-driven approaches, which require large amount of data that industrial systems cannot ystematically supply. The first contribution of the PhD consists in proposing an equation to link prognostics performances to the number of available training samples. This contribution allows to predict prognostics performances that could be obtained with additional data when dealing with small datasets. The second contribution of the PhD focuses on evaluating and analyzing the performance of data augmentation when applied to rognostics on small datasets. Data augmentation leads to an improvement of prognostics performance up to 10%. The third contribution of the PhD consists in the integration of expert knowledge into data augmentation. Statistical knowledge integration proved efficient to avoid performance degradation caused by data augmentation under some unfavorable conditions. Finally, the fourth contribution consists in the integration of prognostics in maintenance decision-making cost modeling and the evaluation of prognostics impact on maintenance decision cost. It demonstrates that (i) the implementation of predictive maintenance reduces maintenance cost up to 18-20% and ii) the 10% prognostics improvement can reduce maintenance cost by an additional 1%
Coveliers, Alexandre. "Sensibilité aux jeux de données de la compilation itérative." Paris 11, 2007. http://www.theses.fr/2007PA112255.
In the context of architecture processor conception, the performance research leads to a constant growth of architecture complexity. This growth of architecture complexity made more difficult the exploitation of their potential performance. To improve architecture performance exploitation, new optimization techniques based on dynamic behavior –i. E. Run time behavior- has been proposed Iterative compilation is a such an optimization approach. This approach allows to determine more relevant transformation than those obtained by static analysis. The main drawback of this optimization method is based on the fact that the information that lead to the code transformation are specific to a particular data set. Thus the determined optimizations are dependent on the data set used during the optimization process. In this thesis, we study the optimized application performance variations according to the data set used for two iterative code transformation techniques. We introduce different metrics to quantify this sensitivity. Also, we propose data set selection methods for choosing which data set to use during code transformation process. Selected data sets enable to obtain an optimized code with good performance with all other available data sets
Caron, Maxime. "Données confidentielles : génération de jeux de données synthétisés par forêts aléatoires pour des variables catégoriques." Master's thesis, Université Laval, 2015. http://hdl.handle.net/20.500.11794/25935.
Confidential data are very common in statistics nowadays. One way to treat them is to create partially synthetic datasets for data sharing. We will present an algorithm based on random forest to generate such datasets for categorical variables. We are interested by the formula used to make inference from multiple synthetic dataset. We show that the order of the synthesis has an impact on the estimation of the variance with the formula. We propose a variant of the algorithm inspired by differential privacy, and show that we are then not able to estimate a regression coefficient nor its variance. We show the impact of synthetic datasets on structural equations modeling. One conclusion is that the synthetic dataset does not really affect the coefficients between latent variables and measured variables.
Ben, Ellefi Mohamed. "La recommandation des jeux de données basée sur le profilage pour le liage des données RDF." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT276/document.
With the emergence of the Web of Data, most notably Linked Open Data (LOD), an abundance of data has become available on the web. However, LOD datasets and their inherent subgraphs vary heavily with respect to their size, topic and domain coverage, the schemas and their data dynamicity (respectively schemas and metadata) over the time. To this extent, identifying suitable datasets, which meet specific criteria, has become an increasingly important, yet challenging task to supportissues such as entity retrieval or semantic search and data linking. Particularlywith respect to the interlinking issue, the current topology of the LOD cloud underlines the need for practical and efficient means to recommend suitable datasets: currently, only well-known reference graphs such as DBpedia (the most obvious target), YAGO or Freebase show a high amount of in-links, while there exists a long tail of potentially suitable yet under-recognized datasets. This problem is due to the semantic web tradition in dealing with "finding candidate datasets to link to", where data publishers are used to identify target datasets for interlinking.While an understanding of the nature of the content of specific datasets is a crucial prerequisite for the mentioned issues, we adopt in this dissertation the notion of "dataset profile" - a set of features that describe a dataset and allow the comparison of different datasets with regard to their represented characteristics. Our first research direction was to implement a collaborative filtering-like dataset recommendation approach, which exploits both existing dataset topic proles, as well as traditional dataset connectivity measures, in order to link LOD datasets into a global dataset-topic-graph. This approach relies on the LOD graph in order to learn the connectivity behaviour between LOD datasets. However, experiments have shown that the current topology of the LOD cloud group is far from being complete to be considered as a ground truth and consequently as learning data.Facing the limits the current topology of LOD (as learning data), our research has led to break away from the topic proles representation of "learn to rank" approach and to adopt a new approach for candidate datasets identication where the recommendation is based on the intensional profiles overlap between differentdatasets. By intensional profile, we understand the formal representation of a set of schema concept labels that best describe a dataset and can be potentially enriched by retrieving the corresponding textual descriptions. This representation provides richer contextual and semantic information and allows to compute efficiently and inexpensively similarities between proles. We identify schema overlap by the help of a semantico-frequential concept similarity measure and a ranking criterion based on the tf*idf cosine similarity. The experiments, conducted over all available linked datasets on the LOD cloud, show that our method achieves an average precision of up to 53% for a recall of 100%. Furthermore, our method returns the mappings between the schema concepts across datasets, a particularly useful input for the data linking step.In order to ensure a high quality representative datasets schema profiles, we introduce Datavore| a tool oriented towards metadata designers that provides rankedlists of vocabulary terms to reuse in data modeling process, together with additional metadata and cross-terms relations. The tool relies on the Linked Open Vocabulary (LOV) ecosystem for acquiring vocabularies and metadata and is made available for the community
Bouillot, Flavien. "Classification de textes : de nouvelles pondérations adaptées aux petits volumes." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS167.
Every day, classification is omnipresent and unconscious. For example in the process of decision when faced with something (an object, an event, a person), we will instinctively think of similar elements in order to adapt our choices and behaviors. This storage in a particular category is based on past experiences and characteristics of the element. The largest and the most accurate will be experiments, the most relevant will be the decision. It is the same when we need to categorize a document based on its content. For example detect if there is a children's story or a philosophical treatise. This treatment is of course more effective if we have a large number of works of these two categories and if books had a large number of words. In this thesis we address the problem of decision making precisely when we have few learning documents and when the documents had a limited number of words. For this we propose a new approach based on new weights. It enables us to accurately determine the weight to be given to the words which compose the document.To optimize treatment, we propose a configurable approach. Five parameters make our adaptable approach, regardless of the classification given problem. Numerous experiments have been conducted on various types of documents in different languages and in different configurations. According to the corpus, they highlight that our proposal allows us to achieve superior results in comparison with the best approaches in the literature to address the problems of small dataset. The use of parameters adds complexity since it is then necessary to determine optimitales values. Detect the best settings and best algorithms is a complicated task whose difficulty is theorized through the theorem of No-Free-Lunch. We treat this second problem by proposing a new meta-classification approach based on the concepts of distance and semantic similarities. Specifically we propose new meta-features to deal in the context of classification of documents. This original approach allows us to achieve similar results with the best approaches to literature while providing additional features. In conclusion, the work presented in this manuscript has been integrated into various technical implementations, one in the Weka software, one in a industrial prototype and a third in the product of the company that funded this work
Coatélan, Stéphane. "Conception et évaluation d'un système de transmission sur canal acoustique sous-marin horizontal petits fonds." Brest, 1996. http://www.theses.fr/1996BRES2001.
Dumonceaux, Frédéric. "Approches algébriques pour la gestion et l’exploitation de partitions sur des jeux de données." Nantes, 2015. http://archive.bu.univ-nantes.fr/pollux/show.action?id=c655f585-5cf3-4554-bea2-8e488315a2b9.
The rise of data analysis methods in many growing contexts requires the design of new tools, enabling management and handling of extracted data. Summarization process is then often formalized through the use of set partitions whose handling depends on applicative context and inherent properties. Firstly, we suggest to model the management of aggregation query results over a data cube within the algebraic framework of the partition lattice. We highlight the value of such an approach with a view to minimize both required space and time to generate those results. We then deal with the consensus of partitions issue in which we emphasize challenges related to the lack of properties that rule partitions combination. The idea put forward is to deepen algebraic properties of the partition lattice for the purpose of strengthening its understanding and generating new consensus functions. As a conclusion, we propose the modelling and implementation of operators defined over generic partitions and we carry out some experiences allowing to assert the benefit of their conceptual and operational use
Fan, Qingfeng. "Stratégie de transfert de données dans les grilles de capteurs." Versailles-St Quentin en Yvelines, 2014. http://www.theses.fr/2014VERS0012.
Big data era is coming, and the amount of data increases dramatically in many application fields every day. This thesis mostly focuses on the big data transmission strategy for query optimization in Grid infrastructure. Firstly, we discuss over file degree: the ring and thread replication strategy, and under file degree: the file-parted replication strategy to improve the efficiency of Data Grid. We also tackle the data packets degree using multicast data transfer within a Sensor Grid, which is widely utilized in the in-network query operation. The system comprehensively considers the location factor and data factor, and combines them in a general weighted vector. In a third stage, we extended our model to account for the energy factor to deal with wireless sensor grids, which corresponds to a 3 vectors correlation problem. We show that our approach can be extended further to any finite-dimensional factors. The last part deals with the mobile context, i. E. When users and the queried resources are mobile. We proposed an extension of the semantic cache based optimization for such mobile distributed queries. In this context, the query optimization depends, not only on the cache size and its freshness, but also on the mobility of the user
Abdelmoula, Mariem. "Génération automatique de jeux de tests avec analyse symbolique des données pour les systèmes embarqués." Thesis, Nice, 2014. http://www.theses.fr/2014NICE4149/document.
One of the biggest challenges in hardware and software design is to ensure that a system is error-free. Small errors in reactive embedded systems can have disastrous and costly consequences for a project. Preventing such errors by identifying the most probable cases of erratic system behavior is quite challenging. Indeed, tests in industry are overall non-exhaustive, while formal verification in scientific research often suffers from combinatorial explosion problem. We present in this context a new approach for generating exhaustive test sets that combines the underlying principles of the industrial test technique and the academic-based formal verification approach. Our approach builds a generic model of the system under test according to the synchronous approach. The goal is to identify the optimal preconditions for restricting the state space of the model such that test generation can take place on significant subspaces only. So, all the possible test sets are generated from the extracted subspace preconditions. Our approach exhibits a simpler and efficient quasi-flattening algorithm compared with existing techniques and a useful compiled internal description to check security properties and reduce the state space combinatorial explosion problem. It also provides a symbolic processing technique of numeric data that provides a more expressive and concrete test of the system. We have implemented our approach on a tool called GAJE. To illustrate our work, this tool was applied to verify an industrial project on contactless smart cards security
Modrzejewski, Richard. "Recalage déformable, jeux de données et protocoles d'évaluation pour la chirurgie mini-invasive abdominale augmentée." Thesis, Université Clermont Auvergne (2017-2020), 2020. http://www.theses.fr/2020CLFAC044.
This thesis deals with deformable registration techniques of preoperative data to the intra-operative sceneas an indispensable step in the realisation of augmented reality for abdominal surgery. Such techniques arethus discussed as well as evaluation methodologies associated with them. Two contexts are considered : theregistration for computer-assisted laparoscopic surgery and the postural registration of the patient on theoperating table. For these two contexts, the needs to be met by the registration algorithms considered arediscussed, as well as the main limitations of the existing solutions. Algorithms developped during this thesis,allowing to meet these needs are thus proposed and discussed. Special attention is given to their evaluation.Different datasets allowing a quantitative evaluation of the accuracy of the registration algorithms, also realizedduring this thesis, and made public, are also discussed. Such data are extremely important because they respondto a lack of evaluation data needed in order to evaluate the registration error in a quantitative way, and thus tocompare the different algorithms. The modeling of the illumination of the laparoscopic scene, allowing one toextract strong constraints between the data to be registered and the surface of the observed organ, and thus tobe used to constrain these registration problems, is also discussed. This manuscript has seven parts. The firstdeals with the context surrounding this thesis. Minimally invasive surgery is presented as well as various generalcomputer vision problems which, when applied to the medical context, allow the definition of computer-assistedsurgery. The second part deals with the prerequisites for reading the thesis. The pre-processing of pre-operativeand per-operative data, before their use by the presented registration algorithms, is thus discussed. The thirdpart corresponds to the registration of hepatic data in laparoscopy, and the evaluation associated with thisproblems. The fourth part deals with the problem of postural registration. The fifth part proposes a modellingof the lighting in laparoscopy which can be used to obtain strong constraints between the observed surfaceand the laparoscopic images. The sixth part proposes a use of the light models discussed in the previous partin order to refine and densify reconstructions of the laparoscopic scene. Finally, the seventh and last partcorresponds to our conclusions regarding the issues addressed during this thesis, and to future work
Books on the topic "Petits jeux de données":
Prati, Elisa. Jeux pour petits sorciers. Paris: Gründ, 2004.
Larin, Robert. Petits problèmes amusants. Saint-Alphonse-de-Granby [Québec]: Éditions de la Paix, 1992.
Larin, Robert. Petits problèmes amusants. 3rd ed. Saint-Alphonse-de-Granby, Québec: Éditions de la Paix, 1995.
Desanti, Dominique. Petits jeux du grand hasard. Paris: Maren Sell, 2005.
Mina, Attilio. Activités manuelles et petits travaux. Paris: De Vecchi, 1997.
Tyberg, Son. 365 jeux et activités: Pour les tout-petits. Aartselaar, Belgique: Chantecler, 1997.
Rousseau, Fabienne. Les petits imagiers. Montréal: Presses Aventure, 2007.
Rousseau, Fabienne. Les petits imagiers. Montréal: Presses Aventure, 2007.
Nadja. Deux mains deux petits chiens. Paris: Loulou et Cie-l'École des loisirs, 2013.
Evelyne; illus. de Martine Bourre Resmond-Wenz. Les jeux chantš des tout-petits 0-3 ans. S.I: Didier Jeunesse, 2007.
Book chapters on the topic "Petits jeux de données":
de Micheaux, Pierre Lafaye, Rémy Drouilhet, and Benoît Liquet. "Quelques jeux de données et problématiques." In Le logiciel R, 7–12. Paris: Springer Paris, 2011. http://dx.doi.org/10.1007/978-2-8178-0115-5_2.
de Micheaux, Pierre Lafaye, Rémy Drouilhet, and Benoît Liquet. "Quelques jeux de données et problématiques." In Le logiciel R, 31–36. Paris: Springer Paris, 2014. http://dx.doi.org/10.1007/978-2-8178-0535-1_2.
Thiolas, Pierre. "Formes architecturales et fonctions de l’aditus maximus dans les théâtres du Proche‑Orient romain." In Les théâtres antiques et leurs entrées, 95–116. Lyon: MOM Éditions, 2024. http://dx.doi.org/10.4000/11qro.
Graner, François, Robin Kaiser, Antonin Marchand, and Thomas Salez. "Données numériques et formulaire." In Petits problèmes de physique, 251–65. Dunod, 2011. http://dx.doi.org/10.3917/dunod.grane.2011.01.0251.
Chignard, Simon. "Jeux de données : comment s'y prendre." In Guide pratique Archimag, 30–33. Serda édition-IDP, 2012. http://dx.doi.org/10.3917/serda.archi.2012.03.0030.
Garet, Élise. "Panorama thématique des jeux de données." In Guide pratique Archimag, 10–11. Serda édition-IDP, 2012. http://dx.doi.org/10.3917/serda.archi.2012.03.0010.
Gauthier, Estelle, Olivier Weller, Pierre Pétrequin, Maréva Gabillot, Robin Brigand, Jehanne Affolter, Pierre Allard, et al. "Les jeux de données et leur exploitabilité." In ARCHAEDYN. Dynamique spatiale des territoires de la Préhistoire au Moyen Âge. Volume 1, 101–22. Presses universitaires de Franche-Comté, 2022. http://dx.doi.org/10.4000/books.pufc.46812.
DÉJEAN, Sébastien, and Kim-Anh LÊ CAO. "Modèles multivariés pour l’intégration de données et la sélection de biomarqueurs dans les données omiques." In Intégration de données biologiques, 211–69. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9030.ch7.
Lafourcade, Mathieu, and Nathalie Lebrun. "Vers un réseau lexico-sémantique de grande taille obtenu par crowdsourcing." In Le Crowdsourcing, 75–94. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.3913.
MARAGE, Damien, Catherine FRUCHART, Isabelle JOUFFROY-BAPICOT, Olivier GIRARDCLOS, and Vincent BALLAND. "Vers un cadre méthodologique afin d’examiner l’histoire cachée des couvertures boisées." In Écologie historique, 143–58. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9090.ch11.
Conference papers on the topic "Petits jeux de données":
Zanoaga, Teodor-Florin. "Le français des Sports. Quels enjeux pour la recherche linguistique ? Étude d’un corpus d’articles sur les Jeux olympiques de Tokyo (2021)." In Language for International Communication. University of Latvia Press, 2023. http://dx.doi.org/10.22364/lincs.2023.19.
Reports on the topic "Petits jeux de données":
Clark, Louise, Jo Carpenter, and Joe Taylor. Des idées pour le travail d’influence : comprendre les chemins d’impact dans la réponse aux crises. Institute of Development Studies, February 2024. http://dx.doi.org/10.19088/core.2023.019.