Dissertations / Theses on the topic 'Méthodes pour la jeunesse'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Méthodes pour la jeunesse.'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Payraud-Barat, Marie-Françoise. "Paul Faucher : "le Père Castor" : réflexion pédagogique et albums pour enfants." Rennes 2, 2001. http://www.theses.fr/2001REN20019.
Full textPaul Faucher (1898-1967), publisher under the name of " Père Castor ", was a forerunner in contemporary children's literature. He was a book seller who was well introduced in European intellectual circles, a pacifist, a supporter of a new educational approach and, in the thirties under the influence of two Czech educators, Bakulé and Havranek, he put his theory into practice. He set up many editorial projects, constantly amended -which would afterwards become the " anticipated catalogue "- and started publishing activity books and stories ; several avant-garde artists such as Nathalie Parain took part in the venture. Paul Faucher, who was for global education, had published, by Flammarion, books intended to develop manual skills, artistic and musical talents, movement coordination, design, logic and reading tastes in children, whilst all the time respectful of different stages of their development, from infancy to pre-adolescence. He was convinced that only a secure environment was able to ensure their harmonious development, both in health and mind, with an accurate and rich use of langage ; therefore, he established strict rules to write and illustrate his books, which he tested on his pupils, and made the colleagues with whom he collaborated in his workshop -illustrators, scientists and educational instructors - abide by them. He was a recognized innovator in the field of reading and language learning and was the first, in France, to publish books intended for very young children ; they comprised the largest part of his work. As he was constantly preoccupied by tghe educational impact of his work, his books transmitted moral and human values. This present study recollects the career and work of Paul Faucher, based namely on his private archives, most of which have never been used before
Brouzes, Chloé. "Quelles stratégies pour améliorer le régime alimentaire de jeunes femmes égyptiennes en milieu urbain ? Analyse des déséquilibres et identification de stratégies nutritionnelles par méthodes mixtes." Thesis, université Paris-Saclay, 2020. http://www.theses.fr/2020UPASB002.
Full textEgyptian women are a typical yet rarely studied example of population undergoing a nutrition transition, touched by a high prevalence of overweight (88% in urban areas) and iron deficiency (50%). This situation suggests that their dietary intakes, which are so far poorly assessed and not well known, should be rebalanced. Diet modeling is a mathematical tool which helps to identify dietary changes improving nutritional intakes, taking into consideration several parameters of the local food environment. Yet, the acceptability of the nutritional strategies modeled is hardly predictable. This research thesis enabled to quantify the dietary intakes of young Egyptian women living in urban areas and to model strategies to improve nutritional intakes. The acceptability of the “theoretically optimal” solutions was then discussed with the population studied using qualitative surveys. The use of mixed methodologies (quantitative and then qualitative approaches) enabled to analyze in detail the local situation and to identify changes in dietary practices and in the fortified food offer. This approach seems promising to identify realistic and acceptable solutions to contribute solving local nutritional issues
Sohawon, Farzanah. "Les éditions françaises (1837-2005) du recueil de contes Tales from Shakespeare de Charles (1775-1834) et Mary (1764-1847) Lamb : l'apport des méthodes de publication à l'image de cette oeuvre en france." Paris 7, 2009. http://www.theses.fr/2009PA070037.
Full textThe French editions (1837-2005) of Charles (1775-1834) and Mary (1764-1847) Lamb's Tales from Shakespeare (1807), their great number and their high quality, prove that this work's integration in the French bibliographical and publishing scène has been a success. Although it has a strong cultural connotation - this classic of English literature, taking the form of an adaptation which turns into tales twenty plays by William Shakespeare, is to be « submitted to the young reader as an introduction to the study of Shakespeare » , French publishers have managed to fit it to their purposes and to present it as a book likely to interest French readers. This cultural transfer has been helped by the publishing of the Tales into school books (from the 1880s) and, concerning general editions for children, by Shakespeare's celebrity and the tales' educational and entertaining nature. This thesis attempts to understand why this work has attracted so many French publishers, to what purpose they have published it, how they have adapted it for French readers. We examine the French editions in the context of school books and children's books publishing history, their makers (publishers, teachers, preface writers, translators, illustrators), and the collections they belong to. We study the books as objects, their « paratext » 1 (covers, title pages, prefaces, introductions, notes, footnotes, illustrations), the choice of publishing all the taies or just a selection, and the exploitation of some translations. This helps defîne the image of Taies from Shakespeare established by the French publishing world, a positive image owing a lot to the tales' nature which simplifies Shakespeare's work
Bedoin, Evelyne. "Lire le texte, lire le monde : du jeu interprétatif en littérature et en sciences." Rennes 2, 2008. http://www.theses.fr/2008REN20043.
Full textIn recent decades, both natural and cultural sciences have been marked by the increasing importance of the interpretative paradigm. This has led to disciplinary epistemologies calling into question their boundaries around the subject of interpretation. In turn, this study, placed within the framework of comparative didactics, brings together views of the act of interpretation as reading practice in both literature and science. The study focuses upon the final three years of primary education in France concentrating primarily on two objects: firstly, an illustrated children‟s book, and, secondly, the scientific phenomenon of a volcanic eruption. The analysis considers the interpretative debate as a heuristic apparatus for collective reading. Thus, it sets out to trace the points of convergence and divergence between literary and scientific debates asking how the interplay of possibilities is orchestrated, how images of the world are called into question and how scholarly interpretative communities are constituted. The study seeks to measure the impact of interpretative play upon the construction of disciplinary postures, both as ways of relating to the world and as modes of integrating these interpretative communities. To this end, it looks at the way in which interpretations are grounded in systems of intelligibility, or frames of reference, and regards these interpretative frameworks as grounding points for disciplinary postures
Lévêque, Mathilde Nières Isabelle. "Le renouveau du roman et du récit pour la jeunesse en France et en Allemagne pendant l'entre-deux guerres modernité et écriture narrative /." Rennes : Université Rennes 2, 2007. http://tel.archives-ouvertes.fr/tel-00204455/fr.
Full textEzzine, Abdelhak. "Méthodes d'ondelettes pour l'analyse d'opérateurs." Phd thesis, Ecole Nationale des Ponts et Chaussées, 1997. http://pastel.archives-ouvertes.fr/pastel-00569070.
Full textRochefort, Yohan. "Méthodes pour le guidage coopératif." Phd thesis, Supélec, 2013. http://tel.archives-ouvertes.fr/tel-00934428.
Full textEZZINE, ABDELHAK. "Méthodes d'ondelettes pour l'analyse d'opérateurs." Marne-la-vallée, ENPC, 1997. http://www.theses.fr/1997ENPC9735.
Full textVekemans, Denis. "Algorithmes pour méthodes de prédiction." Lille 1, 1995. http://www.theses.fr/1995LIL10176.
Full textBazot, Cécile. "Méthodes bayésiennes pour l'analyse génétique." Phd thesis, Toulouse, INPT, 2013. http://oatao.univ-toulouse.fr/10573/1/bazot.pdf.
Full textDuclos, Thierry. "Jeunesse en difficulté et éducation pour la santé." Montpellier 1, 1990. http://www.theses.fr/1990MON11162.
Full textBeillaud, Nadine. "Le français de la littérature de jeunesse contemporaine (étude linguistique) : analyse contrastive d'ouvrages pour la jeunesse." Tours, 1995. http://www.theses.fr/1995TOUR2013.
Full textThis research is a linguistic study of the french language in contemporary literature for young readers. The comparative works, based upon the contrastive analysis of "Vendredi ou les limbes du pacifique" and "Vendredi ou la vie sauvage" of Michel Tournier, is structured on rand two mains lines: 1. Textual components (narrative, descriptive, poetic, referential, intertextual and argumentative). 2. Syntactic, lexical and rhetorical levels. The aim of this analysis is to show, by the means of linguistic criterions, if does exist or not a specificity of the language of the literature for young readers
Depecker, Marine. "Méthodes d'apprentissage statistique pour le scoring." Phd thesis, Télécom ParisTech, 2010. http://pastel.archives-ouvertes.fr/pastel-00572421.
Full textPasca, Ioana. "Vérification formelle pour les méthodes numériques." Phd thesis, Université de Nice Sophia-Antipolis, 2010. http://tel.archives-ouvertes.fr/tel-00555158.
Full textDans ce cadre, on a analysé la méthode de Newton, couramment utilisée pour approcher les solutions d'une équation ou d'un système d'équations. Le but a été de formaliser le théorème de Kantorovitch qui montre la convergence de la méthode de Newton vers une solution, l'unicité de la solution dans un voisinage, la vitesse de convergence et la stabilité locale de la méthode. L'étude de ce théorème a nécessité la formalisation de concepts d'analyse multivariée. En se basant sur ces résultats classiques sur la méthode de Newton, on a montré qu'arrondir à chaque étape préserve la convergence de la méthode, avec une corrélation bien déterminée entre la précision des données d'entrée et celle du résultat. Dans un travail commun avec Nicolas Julien nous avons aussi formellement étudié les calculs avec la méthode de Newton effectués dans le cadre d'une bibliothèque d'arithmétique réelle exacte.
Pour les systèmes linéaires d'équations, on s'est intéressé aux systèmes qui ont une matrice associée à coefficients intervalles. Pour résoudre de tels systèmes, un problème important qui se pose est de savoir si la matrice associée est régulière. On a fourni la vérification formelle d'une collection de critères de régularité pour les matrices d'intervalles.
Hermosillo, Valadez Gerardo. "Méthodes Variationnelles pour le Recalage Multimodal." Phd thesis, Université de Nice Sophia-Antipolis, 2002. http://tel.archives-ouvertes.fr/tel-00457459.
Full textTouya, Thierry. "Méthodes d'optimisation pour l'espace et l'environnement." Phd thesis, Université Paul Sabatier - Toulouse III, 2008. http://tel.archives-ouvertes.fr/tel-00366141.
Full textLa première traite d'une antenne spatiale réseau active.
Il faut d'abord calculer les lois d'alimentation pour satisfaire les contraintes de rayonnement. Nous transformons un problème avec de nombreux minima locaux en un problème d'optimisation convexe, dont l'optimum est le minimum global du problème initial, en utilisant le principe de conservation de l'énergie.
Nous résolvons ensuite un problème d'optimisation topologique: il faut réduire le nombre d'éléments rayonnants (ER). Nous appliquons une décomposition en valeurs singulières à l'ensemble des modules optimaux relaxés, puis un algorithme de type gradient topologique décide les regroupements entre ER élémentaires.
La deuxième partie porte sur une simulation type boîte noire d'un accident chimique.
Nous effectuons une étude de fiabilité et de sensibilité suivant un grand nombre de paramètres (probabilités de défaillance, point de conception, et paramètres influents). Sans disposer du gradient, nous utilisons un modèle réduit.
Dans un premier cas test nous avons comparé les réseaux neuronaux et la méthode d'interpolation sur grille éparse Sparse Grid (SG). Les SG sont une technique émergente: grâce à leur caractère hiérarchique et un algorithme adaptatif, elles deviennent particulièrement efficaces pour les problèmes réels (peu de variables influentes).
Elles sont appliquées à un cas test en plus grande dimension avec des améliorations spécifiques (approximations successives et seuillage des données).
Dans les deux cas, les algorithmes ont donné lieu à des logiciels opérationnels.
Wintz, Julien. "Méthodes algébriques pour la modélisation géometrique." Phd thesis, Université de Nice Sophia-Antipolis, 2008. http://tel.archives-ouvertes.fr/tel-00347162.
Full textLa première partie de cette thèse porte sur l'utilisation de méthodes algébriques en modélisation géométrique, l'accent étant mis sur la topologie, l'intersection et l'auto-intersection dans le cadre du calcul d'arrangement d'ensembles semi-algébriques comme les courbes et surfaces à représentation implicite ou paramétrique. Une attention particulière est portée à la généricité des algorithmes qui peuvent être spécifiés quel que soit le contexte, puis spécialisés pour répondre aux exigences d'une certaine représentation.
La seconde partie de cette thèse présente le prototypage d'un environnement de modélisation géométrique dont le but est de fournir un moyen générique et efficace pour modéliser des solides à partir d'objets géométriques à re\-pré\-sen\-ta\-tion algébrique tels que les courbes et surfaces implicites ou paramétriques, à la fois d'un point de vue utilisateur et d'un point de vue de développeur, par l'utilisation de librairies de calcul symbolique numérique pour la
manipulation des polynômes définissant les objets géométriques.
Criscuolo, Alexis. "Méthodes de distance pour l'inférence phylogénomique." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2006. http://tel.archives-ouvertes.fr/tel-00142222.
Full textElle peut être décomposée en trois grandes familles méthodologiques: la combinaison basse, qui s'appuie sur la concaténation des différents gènes, la combinaison haute, qui considère l'ensemble des arbres inférés à partir de chaque gène, et la combinaison moyenne, qui encode les différents signaux phylogénétiques puis combine ces différents encodages.
Une méthode d'inférence d'arbre est ensuite appliquée sur le résultat de la combinaison.
Cette thèse développe de nouveaux scénarios d'inférence phylogénomique, principalement basés sur l'estimation de distances évolutives entre chaque paire de taxons.
Elle propose une nouvelle méthode de combinaison moyenne, nommée SDM, qui considère les matrices de distance estimées à partir de chaque gène et qui les combine en une unique supermatrice de distance.
Cette dernière pouvant parfois contenir des distances manquantes, cette thèse décrit également de nouveaux algorithmes, nommés NJ*, UNJ*, BioNJ* et MVR*, permettant d'inférer très rapidement un arbre à partir d'une matrice de distance complète ou incomplète.
De nombreuses simulations ont permis d'observer les bonnes performances de ces nouvelles méthodes de distance.
Initialement développées pour la combinaison moyenne, elles permettent toutefois d'améliorer significativement les résultats de certaines approches standards en combinaison basse, et représentent une alternative efficace à MRP, la plus utilisée des techniques de combinaison haute, en termes de fiabilité et de rapidité.
La taille des jeux de données phylogénomiques étant de plus en plus importante, les méthodes développées dans cette thèse constituent ainsi des outils de choix pour construire l'Arbre de la Vie.
Aussenac-Gilles, Nathalie. "Méthodes ascendantes pour l'ingénierie des connaissances." Habilitation à diriger des recherches, Université Paul Sabatier - Toulouse III, 2005. http://tel.archives-ouvertes.fr/tel-00089165.
Full textL'approche retenue ici met l'accent sur les connaissances liées aux usages et pratiques des personnes concernées par le système à concevoir. L'objectif est de réaliser des aides à la modélisation, et précisément aux processus d'abstraction et de caractérisation des connaissances.
Les recherches développées s'appuient systématiquement sur une démarche expérimentale, grâce à des applications en entreprises et des études de cas, et sur des collaborations interdisciplinaires. Les contributions présentées comprennent des techniques et des logiciels de recueil et d'analyse de connaissances, des méthodes et des représentations des connaissances pour la modélisation conceptuelle ainsi que des plates-formes intégrant ces différents supports.
Ces méthodes et outils répondent successivement à trois problématiques différentes sur la modélisation, en phase avec les évolutions historiques du domaine. Le premier problème traité, assez large, est celui de la modélisation conceptuelle à partir de connaissances d'experts et d'activités humaines, faisant appel à des techniques et problématiques de psychologie et d'ergonomie. Une deuxième manière d'étudier la modélisation a consisté à s'intéresser à l'analyse des textes et aux approches linguistiques pour construire des modèles de domaines spécialisés, comme les bases de connaissances terminologiques et les ontologies. De l'ensemble des expériences menées pour ces évaluer ces propositions, il ressort que l'utilisation des modèles au sein des applications doit être prise en compte dès leur construction. Une troisième problématique porte donc sur l'étude de l'utilisation de modèles conceptuels, et plus particulièrement d'ontologies, dans des cadres applicatifs ciblés, pour ajuster les méthodes et logiciels requis pour leur construction. Les applications étudiées relèvent de la recherche d'information et de l'accès au contenu de documents. Cette problématique soulève des questions fondamentales sur la complémentarité des modèles et des documents en tant que vecteurs de connaissances.
Les perspectives de ce travail se situent selon deux axes liés aux documents. D'une part, si les modèles facilitent l'accès au contenu, comment définir les modalités de l'indexation sémantique de documents (à l'aide d'ontologies) ? D'autre part, les documents et les besoins étant sans cesse renouvelés, comment intégrer la question de la maintenance d'ontologies et de terminologies dans le processus de construction ? L'originalité de l'approche retenue est de traiter ces deux questions conjointement, et d'en chercher des solutions cohérentes s'appuyant sur les outils et méthodes de construction d'ontologies à partir de textes.
Scornavacca, Celine. "Méthodes de superarbres pour la phylogénomique." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2009. http://tel.archives-ouvertes.fr/tel-00842893.
Full textTruong, Quang Huy. "Méthodes d'asservissement visuel pour l'appontage d'hélicoptères." Thesis, Toulouse, ISAE, 2018. http://www.theses.fr/2018ESAE0008/document.
Full textThis thesis is related to the automatic & control engineering field, and itsmain goal is to provide useful tools for ship landing missions, tools that can be used fora potential autopilot. The objective has been to develop a series of control laws manuallypiloted, then automatically controlled by visual servoing using identified image features. Thelaws developped thanks to helicopter models with mechanical limitations were based on flyingqualities criteria from the ADS-33 standard. The process also defines an anti-windup approachto cope with actuator saturations. Finally the main results were assessed in real time withthe ONERA rotorcraft flight test bench at ONERA Salon-de-Provence
Zeydina, Olga. "Méthodes probabilistes pour la sûreté nucléaire." Lorient, 2011. http://www.theses.fr/2011LORIS246.
Full textPlihon, Véronique. "Un environnement pour l'ingénierie des méthodes." Paris 1, 1996. http://www.theses.fr/1996PA010073.
Full textBenhadid, Yacine. "Méthodes numériques pour l'équation de Vlasov." Orléans, 2001. http://www.theses.fr/2001ORLE2006.
Full textGuilbaud, Thérèse. "Méthodes numériques pour la commande optimale." Paris 6, 2002. http://www.theses.fr/2002PA066167.
Full textIdoumghar, Lhassane. "Méthodes algorithmiques pour l'allocation de fréquences." Nancy 1, 2002. http://www.theses.fr/2002NAN10235.
Full textGenerating a frequency plan is a difficult task in the radionetwork planning process, that may lead to obtain frequency plans with poor efficiency under real propagation conditions. In fact, the generation process uses a modelling of existing constraints between transmitters of the radionetwork under study, and a combinatorial optimization that tries to satisfy those constraints. This combinatorial optimization provides an optimal solution from a mathematical viewpoint, but according to the refinement of constraints modelling, the generated solution can be unusable under real propagation conditions. In this thesis, we intoduce new algorithmic approaches to solve the Frequency Assignment Problem in the field of radiobroadcasting. The experiments performed on real radionetworks show that the results obtained by these approaches are better than the best operational solutions that are existing in this domain
Paşca, Ioana. "Vérification formelle pour les méthodes numériques." Nice, 2010. http://www.theses.fr/2010NICE4104.
Full textThis thesis deals with the formalization of mathematics in the proof assistant Coq with the purpose of verifying numerical methods. We focus in particular on formalizing concepts involved in solving systems of equations, both linear and non-linear. We analyzed Newton's method which is a numerical method widely used for approximating solutions of equations or systems of equations. The goal was to formalize Kantorovitch's theorem which gives the convergence of Newton’s method to a solution, the speed of the convergence and the local stability of the method. The formal study of this theorem also demanded a formalization of concepts of multivariate analysis. Based on these classic results on Newton's method, we showed that rounding at each step in Newton's method still yields a convergent process with an accurate correlation between the precision of the input ant that of the result. In a joint work with Nicolas Julien, we studied formally computations with Newton's method in a library of exact real arithmetic. For linear systems of equations, we analyzed the case where the associated matrix has interval coefficients. For solving such systems, an important issue is to establish whether the associated matrix is regular. We provide a collection of formally verified criteria for regularity of interval matrices
Reyes, Riffo Sebastián. "Méthodes mathématiques pour l'extraction d'énergie marine." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLED068.
Full textThe present thesis aims to contribute to the development of a theoretical framework for three problems in the context of renewable marine energy. In the first part, we propose a procedure to couple unbounded in time data assimilation methods with time-parallel algorithms. The combination between the Luenberger observer and Parareal algorithm is studied, providing a way to estimate the number of parareal iterations required to preserve the observer rate of convergence, as well as an estimation of the theoretical efficiency of the entire procedure.We then discuss the determination of a bathymetry from an optimization perspective. Imposing that wave propagation must fulfill a certain criterion associated with a cost functional, we consider a PDE-constrained optimization problem where the bathymetry plays the role of control and wave propagation is described by the Helmholtz equation. We are able to prove, under suitable assumptions, the continuity of the control-to-state mapping and the existence of an optimal solution, including also some results about solutions to Helmholtz problem and convergence in a discrete framework.This work is complemented by numerical experiments.The last part of this work is devoted to analyze the convergence of the Blade element momentum (BEM) theory, a classical method used to determine the propeller efficiency as well as its design parameters. We propose a reformulation of the method that allows to obtain conditions for existence of solutions and establish the convergence of some solving algorithms. We also study the associated optimization problem in certain contexts
Page, Aurel regis. "Méthodes explicites pour les groupes arithmétiques." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0117/document.
Full textCentral simple algebras have many applications in number theory, but their algorithmic theory is not yet fully developed. I present algorithms to compute effectively with central simple algebras that are both faster and more general than existing ones. Some of these algorithms have proven complexity estimates, a new contribution in this area; others rely on heuristic assumptions but perform very efficiently in practice.Precisely, I consider the following problems: computation of the unit group of an order and principal ideal problem. I start by studying the diameter of fundamental domains of some unit groups using representation theory. Then I describe an algorithm with proved complexity for computing generators and a presentation of the unit group of a maximal order in a division algebra, and then an efficient algorithm that also computes a fundamental domain in the case where the unit group is a Kleinian group. Similarly, I present an algorithm with proved complexity that decides whether an ideal of such an order is principal and that computes a generator when it is. Then I describe a heuristically subexponential algorithm that solves the same problem in indefinite quaternion algebras
Kopinski, Thomas. "Méthodes d'apprentissage pour l'interaction homme-machine." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLY002/document.
Full textThis thesis aims at improving the complex task of hand gesture recognition by utilizing machine learning techniques to learn from features calculated from 3D point cloud data. The main contributions of this work are embedded in the domains of machine learning and in the human-machine interaction. Since the goal is to demonstrate that a robust real-time capable system can be set up which provides a supportive means of interaction, the methods researched have to be light-weight in the sense that descriptivity balances itself with the calculation overhead needed to, in fact, remain real-time capable. To this end several approaches were tested:Initially the fusion of multiple ToF-sensors to improve the overall recognition rate was researched. It is examined, how employing more than one sensor can significantly boost recognition results in especially difficult cases and get a first grasp on the influence of the descriptors for this task as well as the influence of the choice of parameters on the calculation of the descriptor. The performance of MLPs with standard parameters is compared with the performance of SVMs for which the parameters have been obtained via grid search.Building on these results, the integration of the system into the car interior is shown. It is demonstrated how such a system can easily be integrated into an outdoor environment subject to strongly varying lighting conditions without the need for tedious calibration procedures. Furthermore the introduction of a modified light-weight version of the descriptor coupled with an extended database significantly boosts the frame rate for the whole recognition pipeline. Lastly the introduction of confidence measures for the output of the MLPs allows for more stable classification results and gives an insight on the innate challenges of this multiclass problem in general.In order to improve the classification performance of the MLPs without the need for sophisticated algorithm design or extensive parameter search a simple method is proposed which makes use of the existing recognition routines by exploiting information already present in the output neurons of the MLPs. A simple fusion technique is proposed which combines descriptor features with neuron confidences coming from a previously trained net and proves that augmented results can be achieved in nearly all cases for problem classes and individuals respectively.These findings are analyzed in-depth on a more theoretical scale by comparing the effectiveness of learning solely on neural activities in the output layer with the previously introduced fusion approach. In order to take into account temporal information, the thesis describes a possible approach on how to exploit the fact that we are dealing with a problem within which data is processed in a sequential manner and therefore problem-specific information can be taken into account. This approach classifies a hand pose by fusing descriptor features with neural activities coming from previous time steps and lays the ground work for the following section of making the transition towards dynamic hand gestures. Furthermore an infotainment system realized on a mobile device is introduced and coupled with the preprocessing and recognition module which in turn is integrated into an automotive setting demonstrating a possible testing environment for a gesture recognition system.In order to extend the developed system to allow for dynamic hand gesture interaction a simplified approach is proposed. This approach demonstrates that recognition of dynamic hand gesture sequences can be achieved with the simple definition of a starting and an ending pose based on a recognition module working with sufficient accuracy and even allowing for relaxed restrictions in terms of defining the parameters for such a sequence
Contal, Emile. "Méthodes d’apprentissage statistique pour l’optimisation globale." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLN038/document.
Full textThis dissertation is dedicated to a rigorous analysis of sequential global optimization algorithms. We consider the stochastic bandit model where an agent aim at finding the input of a given system optimizing the output. The function which links the input to the output is not explicit, the agent requests sequentially an oracle to evaluate the output for any input. This function is not supposed to be convex and may display many local optima. In this work we tackle the challenging case where the evaluations are expensive, which requires to design a careful selection of the input to evaluate. We study two different goals, either to maximize the sum of the rewards received at each iteration, or to maximize the best reward found so far. The present thesis comprises the field of global optimization where the function is a realization from a known stochastic process, and the novel field of optimization by ranking where we only perform function value comparisons. We propose novel algorithms and provide theoretical concepts leading to performance guarantees. We first introduce an optimization strategy for observations received by batch instead of individually. A generic study of local supremum of stochastic processes allows to analyze Bayesian optimization on nonparametric search spaces. In addition, we show that our approach extends to natural non-Gaussian processes. We build connections between active learning and ranking and deduce an optimization algorithm of potentially discontinuous functions
Camus, Thomas. "Méthodes algorithmiques pour les réseaux algébriques." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM033/document.
Full textThis thesis deals with lattices, which are fundamental objects in many fields, such as number theory and cryptography.As a first step, we propose a generalization and an implantation of the Lenstra, Lenstra and Lov'asz algorithm (LLL algorithm) in the simple algebraic setting of lattices over quadratic imaginary and euclidean ring of integers.Then, we present the notions of algebraic lattices and Humbert forms, which are extensions of euclidean lattices and quadratic forms in a large algebraic setting. Introducing these objects leads us to develop and implant modifications of the Plesken and Souvignier algorithm. This algorithm efficiently solves the isometric lattices problem and the automorphism group computation problem for algebraic lattices.Eventually, we analyze in depth the complexity of this two algorithmic problems. We show that they are intimately related to similar problems on graphs. This reduction leads us to express unprecedented complexity bounds
Corriveau, David. "Méthodes topologiques pour l'étude des formes." Mémoire, Université de Sherbrooke, 2004. http://savoirs.usherbrooke.ca/handle/11143/4585.
Full textElchawa, Abdudlayem. "La littérature pour la jeunesse dans le monde arabe." Paris 7, 1991. http://www.theses.fr/1991PA070077.
Full textThe arab military defeat of 1967 resulted in the emergence of a new type of children's literature in the arab world. The subject-matter of this literature is more topical, the sources more diversified, the themes more appealing, the form more modern, the substance richer. Hense the need for us to analyse its specific features. This investigation has made us aware of the necessity of throwing into relief the social conditions, the psycho-educational and aesthetic aspects which contribute to weaving a relation between discourse and society, author and child. The study of sources and themes has led us to identify the historical influences: the impact of islam, that of the nationalist ideologies and the values they propound as well as the social imperatives. Our research confirms the following hypothesis: children's literature is a literature made-to-measure. It further shows a discrepancy, a "lopsidedness" between the author's intention and the child's response. In order to circumvent censorship, the writer resorts to fantasy, to a symbolic bestiary or to an antropomorphic presentation of nature. As a conclusion we can venture the following exploration: besides its more overt and numerous objectives, arabic children's literature has been produced essentially for the purpose of giving a convenient alibi to authors. They entrust their readers with a mission which they, adults, have been unable to fulfil : i. E. Building up a great motherland and a new modern democratic arab society
Acerra, Eleonora. "Les applications littéraires pour la jeunesse : œuvres et lecteurs." Thesis, Montpellier 3, 2019. http://www.theses.fr/2019MON30106.
Full textThis dissertation focuses on a very recent and still unestablished digital artifact: children’s literary applications. From a perspective that combines literary education and digital literary theory, we develop two research lines, aimed at defining both the structures of the apps and their potential role in promoting young readers’ multiliteracy competencies. Two main objectives are thus pursued: describing and analyzing the apps, by questioning them as literary “technotexts” [Hayles, 2002] intended for a specific audience; analyzing their actual reception and, more particularly, their comprehension and interpretation among children, observing both their actuals manipulations on the screen and their retrospective recalls of the stories. Therefore, the first part of this study offers, on the one hand, a broad view on the editorial offer and, on the other hand, a close reading of its main features and literary “figures”. The second part is dedicated to the observation of five groups of empirical readers and is aimed at verifying how they approach and understand digital literary works, thereby responding to their interaction requests with an “actualized interpretation” [Jeanneret, 2000] that results from a subjective reception of the text
Gourmelen, Marcel. "Actions partenariales et développement local de l'emploi pour les jeunes." Paris 1, 1988. http://www.theses.fr/1988PA010031.
Full textLacroix, Anna. "Le pessimisme en littérature pour la jeunesse : le cas des dystopies pour adolescents." Master's thesis, Université Laval, 2018. http://hdl.handle.net/20.500.11794/33431.
Full textThis master’s thesis aims to analyse the pessimism in children’s literature, focussing particularly on its manifestation within dystopias for young adults. Children’s literature is traditionally regarded by many as an inherent optimist genre, as shown by the censorship to which it is regularly subjected, principally by the editorial process. In this context, it seems hard to explain the massive popularity wave that the dystopian novels for young adults experienced in the wake of the XXI century. This genre, displaying an usually futuristic fictional society in which evolves a character who suffers and who desires to revolt against it, is indeed characterized by a pronounced pessimism. This master’s thesis questions the way authors of dystopias for young adults harmonise the inherent optimism of children’s literature and the pessimism of the dystopian genre, while posing the hypothesis that the said pessimism is presented to the young target audience in a much attenuated state. A comparison between a corpus of novels intended to teenagers and another one that has an adult target audience was used in order to study our hypothesis within two main aspects, the character and the society, as well as other mitigating factors that can be seen throughout the book. We think these various elements all contribute to reduce the pessimism in dystopias for young adults by creating a familiar feeling for the readers and by lightening the burden that is resting on their shoulders and on those of the protagonists.
Arkiliç-Songören, Sevgi. "Familienleben in Deutschland und in der Türkei im Spiegel der Kinder- und Jugendliteratur : vergleichende Analyse ausgewählter deutschsprachiger und türkischer Kinder- und Jugendromane der Gegenwart /." Frankfurt am Main : P. Lang, 2006. http://catalogue.bnf.fr/ark:/12148/cb41147770d.
Full textEggeling, Wolfram. "Die Prosa sowjetischer Kinderzeitschriften, 1919-1925 : eine Themen- und Motivanalyse in Bezug auf das Bild des Jungen Protagonisten /." München : O. Sagner, 1986. http://catalogue.bnf.fr/ark:/12148/cb34983931m.
Full textBriel, Petra-Gabriele. "" Lumpenkind und Traumprinzessin" : zur Sozialgestalt der Zigeuner in der Kinder- und Jugendliteratur seit dem 19. Jahrhundert /." Giessen : Focus-Berl, 1989. http://catalogue.bnf.fr/ark:/12148/cb35561920h.
Full textMadore, Édith. "Constitution de la littérature québécoise pour la jeunesse, 1920-1995." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq26077.pdf.
Full textTurcotte, Julie. "La collection "Contes pour tous" publiée chez Québec/Amérique Jeunesse." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0019/MQ47247.pdf.
Full textPoulin, Manon. "Eugene Achard, éditeur : L'émergence d'une édition pour la jeunesse canadienne." Thèse, Université de Sherbrooke, 1994. http://hdl.handle.net/11143/10367.
Full textLegardeur, Jérémy. "Méthodes et outils pour l'innovation produit/process." Phd thesis, Grenoble INPG, 2001. http://tel.archives-ouvertes.fr/tel-00662411.
Full textMantzaflaris, Angelos. "Méthodes algébriques robustes pour le calcul géométrique." Phd thesis, Université de Nice Sophia-Antipolis, 2011. http://tel.archives-ouvertes.fr/tel-00651672.
Full textUrso, Pascal. "Généralisations et méthodes correctes pour l'induction mathématique." Phd thesis, Université de Nice Sophia-Antipolis, 2002. http://tel.archives-ouvertes.fr/tel-00505928.
Full textProlhac, Sylvain. "Méthodes exactes pour le modèle d'exclusion asymétrique." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2009. http://tel.archives-ouvertes.fr/tel-00423952.
Full textDans une première partie, nous expliquons les liens que le modèle d'exclusion asymétrique entretient avec d'autres modèles de la physique statistique, en particulier des modèles de croissance, de polymère dirigé en milieu aléatoire, ou encore des modèles de vertex. Après avoir récapitulé quelques résultats connus, nous expliquons comment le modèle d'exclusion peut être étudié en utilisant l'Ansatz de Bethe.
La deuxième partie est consacrée au calcul par Ansatz de Bethe des fluctuations du courant dans le modèle d'exclusion partiellement asymétrique avec des conditions aux bords périodiques. Utilisant une formulation fonctionnelle des équations de Bethe, nous obtenons des expressions exactes pour les trois premiers cumulants du courant. À partir de ces expressions exactes et de calculs effectués pour de petits systèmes, nous conjecturons ensuite une expression combinatoire explicite pour tous les cumulants du courant.
Dans la troisième partie, nous présentons le modèle d'exclusion à plusieurs classes de particules, qui généralise le modèle étudié dans les deux premières parties. Nous montrons que ses probabilités stationnaire peuvent s'écrire sous la forme de traces de produits de matrices. Nous expliquons ensuite la formulation algébrique de l'Ansatz de Bethe pour ce modèle.
Mahey, Philippe. "Méthodes de décomposition pour la programmation mathématique." Habilitation à diriger des recherches, Grenoble INPG, 1990. http://tel.archives-ouvertes.fr/tel-00337842.
Full textNovytskyi, Dimitri. "Méthodes géométriques pour la mémoire et l'apprentissage." Phd thesis, Université Paul Sabatier - Toulouse III, 2007. http://tel.archives-ouvertes.fr/tel-00285602.
Full textPrieur, Christophe. "Diverses méthodes pour des problèmes de stabilisation." Phd thesis, Université Paris Sud - Paris XI, 2001. http://tel.archives-ouvertes.fr/tel-00001928.
Full text