Дисертації з теми "Types of classes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Types of classes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
He, Baozhang. "Situation types and aspectual classes of verbs in Mandarin Chinese /." The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487779914827623.
Повний текст джерелаMassicotte, Frédéric. "Une théorie des types pour les classes de failles dans les cryptoprotocoles." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0015/MQ55868.pdf.
Повний текст джерелаSozeau, Matthieu. "Un environnement pour la programmation avec types dépendants." Paris 11, 2008. https://tel.archives-ouvertes.fr/tel-00640052.
Повний текст джерелаSystems based on dependent type theory are getting considerable attention for the verification of computer programs as well as a practical tool for developing formal mathematical proofs involving complex and expensive computations. These systems still require considerable expertise from the users to be used efficiently. We design high-level constructs permitting to use languages based on dependent type theory as easily as modern functional programming languages, without sacrificing the powerful constructs of the former. We study a new language allowing to build certified programs while writing only their algorithmical squeleton and their specification. Typing in this system gives rise to proof obligations that can be handled interactively a posteriori. We demonstrate the main metatheoretical results on this system, whose proofs are partially mechanized, and present its implementation in the Coq proof assistant. Then we describe an integration and extension of the type classes concept à la Haskell into Coq, providing a simple interpretation of the constructs linked with type classes into the underlying dependent type theory. We demonstrate the usefulness of these dependent type classes for specifications and proofs and present an economical yet powerful implementation of a generalized rewriting tactic based on them. We conclude by employing these contributions in the development of a certified library of a complex data structure called Finger Trees
Villeneuve, Paul. "Degré d'ajustement de deux types d'échelle d'attitude à différents modèles de classes latentes /." Thèse, Trois-Rivières : Université du Québec à Trois-Rivières, 1998. http://www.uqtr.ca/biblio/notice/resume/03-2190284R.html.
Повний текст джерелаLe résumé et la table des matières sont disponibles en format électronique sur le site Web de la bibliothèque. CaQTU Bibliographie : f. 74-79.
Villeneuve, Paul. "Degré d'ajustement de deux types d'échelle d'attitude à différents modèles de classes latentes." Thèse, Université du Québec à Trois-Rivières, 1998. http://depot-e.uqtr.ca/3794/1/000650444.pdf.
Повний текст джерелаMatthieu, Sozeau. "Un environnement pour la programmation avec types dépendants." Phd thesis, Université Paris Sud - Paris XI, 2008. http://tel.archives-ouvertes.fr/tel-00640052.
Повний текст джерелаDelgado, Diana. "Subsitution of stimulus functions as a means to distinguish among different types of functional classes /." abstract and full text PDF (free order & download UNR users only), 2005. http://0-wwwlib.umi.com.innopac.library.unr.edu/dissertations/fullcit/1430443.
Повний текст джерела"May, 2005." Includes bibliographical references (leaves 47-49). Online version available on the World Wide Web. Library also has microfilm. Ann Arbor, Mich. : ProQuest Information and Learning Company, [2005]. 1 microfilm reel ; 35 mm.
Maurinot, Franck. "Étude du lignage des cellules progénitrices rétiniennes chez le poulet : origine des classes et types neuronaux." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS275.
Повний текст джерелаThe mechanisms regulating the generation of the different types of neurons of the vertebrate nervous system during development are still poorly understood. In this thesis, the composition and organization of clones of neurons generated by retinal progenitor cells (RPCs) in chicken embryos were characterized with the Brainbow strategy. This technique enables to permanently label RPCs with distinct colour combinations in order to individually track their lineage. New approaches were developed to: 1) trigger Brainbow labels at different stages of development or in genetically identified RPCs; 2) characterize in 3D the organization of retinal clones and identify the neuronal types that they comprise. My results provide evidence for a previously uncharacterized phase of tangential dispersion of RPCs in the retinal neuroepithelium before neurogenesis, leading to uniform intercalation of retinal clones. The composition of these clones was analyzed to understand whether early RPCs could be biased to generate certain neural types and, through intercalation, contribute to their regular distribution in the retina. This study sheds light on the potentialities of a population of neural progenitors and on the possible links between the early development and mature cellular organization of a tissue through new approaches applicable to diverse problematics
Cooper, Lynn Sharon Marcia. "Adult reading acquisition : a study of error types and related difficulties of adults enrolled in literacy classes." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/18800.
Повний текст джерелаMa, Qin. "Classes concurrentes et appel par filtrage dans le join calcul." Paris 7, 2005. http://www.theses.fr/2005PA077072.
Повний текст джерелаDouville, Guillaume. "Déploiements de carquois valués de types B et C." Mémoire, Université de Sherbrooke, 2015. http://hdl.handle.net/11143/8013.
Повний текст джерелаManente, Amélie. "Types de prédication en vietnamien : dynamique et variété des structures." Thesis, Paris 5, 2013. http://www.theses.fr/2013PA05H010/document.
Повний текст джерелаWe present here a syntaxic analysis of the Vietnamese language spoken in Ho Chi Minh City, in line with the functional syntax introduced by André Martinet and developed later by his followers. In a first part, we examined the extent of noun/verb opposition in Vietnamese. After a synthesis of work on this subject, we present our own analysis of the lexical classes, relying on strictly syntactic criteria. A detailed study of the syntactic modalités (undeterminable determinants) - nominalizing undeterminable determinants, undeterminable determinants of degree, predicative undeterminable determinants and injunctive undeterminable determinants - was necessary. These units are used to distinguish different behaviors, and leads to the identification of major lexical classes in Vietnamese: nominals, adjectives, modals and ‘verbals’. It appears that these classes of units are organized along a continuum. In a second part, the analysis focuses on the different types of predicative structures in Vietnamese. The variety of structures - nuclear and connective - is central to the study as well as the identification of the different functions. Finally, we present an analysis of "serial verb constructions" very common in Vietnamese, but actually reflecting very different realities. Throughout this study, we pay particular attention to the variation and change (reanalysis, lexicalizations, grammaticalizations), referring to the dynamics of the various structures and of the Vietnamese language itself
Capponi, Cécile. "Identification et Exploitation des Types dans un modèle de connaissances à objets." Phd thesis, Université Joseph Fourier (Grenoble), 1995. http://tel.archives-ouvertes.fr/tel-00345845.
Повний текст джерелаАфанасьева, О. В., В. И. Мощенок, В. П. Тарабанова, Н. А. Лалазарова та Е. Г. Попова. "Особенности самостоятельной работы студентов при изучении технологии металлов и материаловедения". Thesis, ХНАДУ, 2017. http://openarchive.nure.ua/handle/document/9250.
Повний текст джерелаKassouha, Souleiman. "Etude comparative du fonctionnement de la communication chez les élèves dans les écoles élémentaires : l'interaction entre deux types d'élèves : tout venant et déficient intellectuel intégré." Caen, 2008. http://www.theses.fr/2008CAEN1523.
Повний текст джерелаGarillot, François. "Outils génériques de preuve et théorie des groupes finis." Phd thesis, Ecole Polytechnique X, 2011. http://pastel.archives-ouvertes.fr/pastel-00649586.
Повний текст джерелаMint, Aghrabatt Fatimetou. "Sur l’opérateur de Steklov-Poincaré dans une couche mince : analyse, résolution et résultats optimaux de deux classes de problèmes de transmission régis par des EDP et applications concrètes." Le Havre, 2011. http://www.theses.fr/2011LEHA0016.
Повний текст джерелаIn this work, two types of classes are presented: boundary value problems and transmission governed by EDP. The first one posed in two bodies of which one is a thin layer and the other in two bodies joined by an adhesive small thickness δ. The study is performed in the Hölder spaces. In the first problem: for δ fixed and in the second we study the limiting problem, i. E. When delta tends to zero. Thanks to the techniques related by the operational differential equations, we analyse and solve these problems and we give optimal results on the solutions(existence, uniqueness and maximal regularity). For these two classes, the effectlay is completely characterized and clarified (it is the effect of impedance). This last is very useful for the numerical resolution in the concrete applications
Diallo, Alhassane. "Recherche de sous-groupes évolutifs et leur impact sur la survie : application à des patients atteints d'ataxie spinocérébelleuse (SCA) Body Mass Index Decline Is Related to Spinocerebellar Ataxia Disease Progression Survival in patients with spinocerebellar ataxia types 1, 2, 3, and 6 (EUROSCA): a longitudinal cohort study." Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS447.
Повний текст джерелаIn cohort studies, most often the models used assume that the study population follows an average pattern of evolution. However, in many cases, such as for spinocerebellar ataxias (SCA), it is not uncommon for heterogeneity to be suspected. This heterogeneity could also be inuenced by other intercurrent events for example joint evolution of a second phenotype or occurrence of an event such as dropout or death. In the first part of this thesis, we analyzed the evolution of the BMI of SCA patients and looked for different evolution profiles of BMI. We identified 3 subgroups of BMI evolution: decrease (23% of patients), increase (18%) and stable (59%) ; and we have shown that patients who lower their BMI are faster disease progression. In the second part, we studied the survival of SCA patients and developed a prognostic nomogram. We have shown that it is different according on the genotype. Survival is shorter in SCA1, intermediate in SCA2 and SCA3, and longer in SCA6. Finally, we assessed the long-term impact of ataxia progression on survival. We have shown that progression of ataxia is associated with shorter survival regardless of genotype. Only in SCA1 patients, we identified three subgroups of homogeneous patients in terms of disease progression and risk of death
Valtchev, Petko. "Construction automatique de taxonomies pour l'aide à la représentation de connaissances par objets." Université Joseph Fourier (Grenoble), 1999. http://www.theses.fr/1999GRE10276.
Повний текст джерелаMorris, John Garrett. "Type Classes and Instance Chains: A Relational Approach." PDXScholar, 2013. https://pdxscholar.library.pdx.edu/open_access_etds/1010.
Повний текст джерелаHandley, G. D. "Hilbert and Hardy type inequalities /." Connect to thesis, 2005. http://eprints.unimelb.edu.au/archive/00000818.
Повний текст джерелаAndersson, Stina. "Verbal contents of repetitions in Swedish child-directed speech." Thesis, Stockholms universitet, Institutionen för lingvistik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-131442.
Повний текст джерелаRepetitioner i barnriktat tal (BRT) har visat sig variera över tid, och har föreslagits påverka förstaspåksinlärning. Även ett samband mellan det verbala innehållet i repetitioner i BRT och barns språkutveckling har föreslagits. Det verbala innehållet i repetitioner i svenskt BRT har inte undersökts tidigare. Syftet med denna studie var att undersöka det verbala innehållet i repetitioner i svenskt BRT under barnets två första år och möjliga förändringar gällande andelen repetitioner under samma tidsperiod. Det verbala innehållet i repetitioner i föräldrars tal hos tio förälder-barn-dyader då barnen var 3, 6, 9, 12 och 24 månader gamla undersöktes med fokus på ordklasser, satstyper och förändringar gällande konstituenter. Resultaten jämfördes med barnens produktiva ordförråd vid 30 månaders ålder. Även den möjliga förekomsten av typbaserade konstruktioner (item-based constructions) och frekventa ramar (frequent frames) undersöktes. De övergripande resultaten uppvisade mönster gällande förändringar inom det verbala innehållet i repetitioner över tid samt ett samband mellan det verbala innehållet i repetitioner och barns språkutveckling. Två antaganden gjordes: föräldrar justerar komplexiteten i sitt tal efter språkliga utvecklingsfaser hos sina barn, och den språkliga variationen i inputen ökar med barnets ålder.
MINT: Modelling infant language acquisition from parent-child interaction (MAW 2011.007)
Schoeller, Bernd. "Making classes provable trough contracts, models and frames /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17610.
Повний текст джерелаMontagu, Benoît. "Programmer avec des modules de première classe dans un langage noyau pourvu de sous-typage, sortes singletons et types existentiels ouverts." Phd thesis, Ecole Polytechnique X, 2010. http://tel.archives-ouvertes.fr/tel-00550331.
Повний текст джерелаRomeo, Lauren Michele. "The Structure of the lexicon in the task of the automatic acquisition of lexical information." Doctoral thesis, Universitat Pompeu Fabra, 2015. http://hdl.handle.net/10803/325420.
Повний текст джерелаLa información de clase semántica de los nombres es fundamental para una amplia variedad de tareas del procesamiento del lenguaje natural (PLN), como la traducción automática, la discriminación de referentes en tareas como la detección y el seguimiento de eventos, la búsqueda de respuestas, el reconocimiento y la clasificación de nombres de entidades, la construcción y ampliación automática de ontologías, la inferencia textual, etc. Una aproximación para resolver la construcción y el mantenimiento de los léxicos de gran cobertura que alimentan los sistemas de PNL, una tarea muy costosa y lenta, es la adquisición automática de información léxica, que consiste en la inducción de una clase semántica relacionada con una palabra en concreto a partir de datos de su distribución obtenidos de un corpus. Precisamente, por esta razón, se espera que la investigación actual sobre los métodos para la producción automática de léxicos de alta calidad, con gran cantidad de información y con anotación de clase como el trabajo que aquí presentamos, tenga un gran impacto en el rendimiento de la mayoría de las aplicaciones de PNL. En esta tesis, tratamos la adquisición automática de información léxica como un problema de clasificación. Con este propósito, adoptamos métodos de aprendizaje automático para generar un modelo que represente los datos de distribución vectorial que, basados en ejemplos conocidos, permitan hacer predicciones de otras palabras desconocidas. Las principales preguntas de investigación que planteamos en esta tesis son: (i) si los datos de corpus proporcionan suficiente información para construir representaciones de palabras de forma eficiente y que resulten en decisiones de clasificación precisas y sólidas, y (ii) si la adquisición automática puede gestionar, también, los nombres polisémicos. Para hacer frente a estos problemas, realizamos una serie de validaciones empíricas sobre nombres en inglés. Nuestros resultados confirman que la información obtenida a partir de la distribución de los datos de corpus es suficiente para adquirir automáticamente clases semánticas, como lo demuestra un valor-F global promedio de 0,80 aproximadamente utilizando varios modelos de recuento de contextos y en datos de corpus de distintos tamaños. No obstante, tanto el estado de la cuestión como los experimentos que realizamos destacaron una serie de retos para este tipo de modelos, que son reducir la escasez de datos del vector y dar cuenta de la polisemia nominal en las representaciones distribucionales de las palabras. En este contexto, los modelos de word embedding (WE) mantienen la “semántica” subyacente en las ocurrencias de un nombre en los datos de corpus asignándole un vector. Con esta elección, hemos sido capaces de superar el problema de la escasez de datos, como lo demuestra un valor-F general promedio de 0,91 para las clases semánticas de nombres de sentido único, a través de una combinación de la reducción de la dimensionalidad y de números reales. Además, las representaciones de WE obtuvieron un rendimiento superior en la gestión de las ocurrencias asimétricas de cada sentido de los nombres de tipo complejo polisémicos regulares en datos de corpus. Como resultado, hemos podido clasificar directamente esos nombres en su propia clase semántica con un valor-F global promedio de 0,85. La principal aportación de esta tesis consiste en una validación empírica de diferentes representaciones de distribución utilizadas para la clasificación semántica de nombres junto con una posterior expansión del trabajo anterior, lo que se traduce en recursos léxicos y conjuntos de datos innovadores que están disponibles de forma gratuita para su descarga y uso.
Lexical semantic class information for nouns is critical for a broad variety of Natural Language Processing (NLP) tasks including, but not limited to, machine translation, discrimination of referents in tasks such as event detection and tracking, question answering, named entity recognition and classification, automatic construction and extension of ontologies, textual inference, etc. One approach to solve the costly and time-consuming manual construction and maintenance of large-coverage lexica to feed NLP systems is the Automatic Acquisition of Lexical Information, which involves the induction of a semantic class related to a particular word from distributional data gathered within a corpus. This is precisely why current research on methods for the automatic production of high- quality information-rich class-annotated lexica, such as the work presented here, is expected to have a high impact on the performance of most NLP applications. In this thesis, we address the automatic acquisition of lexical information as a classification problem. For this reason, we adopt machine learning methods to generate a model representing vectorial distributional data which, grounded on known examples, allows for the predictions of other unknown words. The main research questions we investigate in this thesis are: (i) whether corpus data provides sufficient distributional information to build efficient word representations that result in accurate and robust classification decisions and (ii) whether automatic acquisition can handle also polysemous nouns. To tackle these problems, we conducted a number of empirical validations on English nouns. Our results confirmed that the distributional information obtained from corpus data is indeed sufficient to automatically acquire lexical semantic classes, demonstrated by an average overall F1-Score of almost 0.80 using diverse count-context models and on different sized corpus data. Nonetheless, both the State of the Art and the experiments we conducted highlighted a number of challenges of this type of model such as reducing vector sparsity and accounting for nominal polysemy in distributional word representations. In this context, Word Embeddings (WE) models maintain the “semantics” underlying the occurrences of a noun in corpus data by mapping it to a feature vector. With this choice, we were able to overcome the sparse data problem, demonstrated by an average overall F1-Score of 0.91 for single-sense lexical semantic noun classes, through a combination of reduced dimensionality and “real” numbers. In addition, the WE representations obtained a higher performance in handling the asymmetrical occurrences of each sense of regular polysemous complex-type nouns in corpus data. As a result, we were able to directly classify such nouns into their own lexical-semantic class with an average overall F1-Score of 0.85. The main contribution of this dissertation consists of an empirical validation of different distributional representations used for nominal lexical semantic classification along with a subsequent expansion of previous work, which results in novel lexical resources and data sets that have been made freely available for download and use.
Le, botlan Didier. "Ml f : Une extension de ML avec polymorphisme de second ordre et instanciation implicite." Palaiseau, Ecole polytechnique, 2004. http://www.theses.fr/2004EPXX0016.
Повний текст джерелаRasoamanana, Jean-Marc. "Etude résurgente d'une classe d'équations différentielles de type Schrödinger." Angers, 2006. http://www.theses.fr/2006ANGE0008.
Повний текст джерелаDias, D. G. "Classes de hipersuperfícies Weingarten generalizada no espaço euclidiano." Universidade Federal de Goiás, 2014. http://repositorio.bc.ufg.br/tede/handle/tede/4091.
Повний текст джерелаApproved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-02-05T11:02:53Z (GMT) No. of bitstreams: 2 Tese - Diogo Gonçalves Dias - 2014.pdf.pdf: 490676 bytes, checksum: 3c0940e1fbec55f277f969c4751c5ea6 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-02-05T11:02:53Z (GMT). No. of bitstreams: 2 Tese - Diogo Gonçalves Dias - 2014.pdf.pdf: 490676 bytes, checksum: 3c0940e1fbec55f277f969c4751c5ea6 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-09-29
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
We present hypersurfaces with prescribed normal Gauss map. These surfaces are obtained as the envelope of a sphere congruence where the other envelope is contained in a plane. We introduce classes of surfaces that generalize linear Weingarten surfaces, where the coefficients are functions that depend on the support function and the distance function from a fixed point (in short, DSGW-surfaces). The linear Weingarten surfaces, the Appell’s surfaces and the Tzitzeica’s surfaces are all DSGW-surfaces. From them we obtain new classes of DSGW-surfaces applying inversions and dilatations. For a special class of DSGW-surfaces, which is invariant under dilatations and inversions, we obtain a Weierstrass type representation (in short, EDSGW-surfaces). As application we classify the EDSGW-surfaces of rotation and present a 4-parameter family of complete cyclic EDSGW-surfaces with an isolated singularity and foliated by non-parallel planes. We generalized the EDSGW-surfaces for the case of hypersurfaces in Rn+1, n ≥ 2. We present a representation for these hypersurfaces in the case where the stereographic projection of the normal Gauss map N is given by the identity application. As an application, we will characterize the rotational examples.
Apresentamos parametrizações de hipersuperfícies com aplicação normal de Gauss prescrita. Estas parametrizações são obtidas como o envelope de uma congruência de esferas onde o outro envelope esta contido em um hiperplano. Introduzimos classes de superfícies que generalizam as superfícies de Weingarten linear, onde os coeficientes são funções que dependem da função suporte e da função distância a um ponto fixo (superfícies WGSD). Classes conhecidas destas superfícies são as superfícies de Weingarten linear, as superfícies de Appell e as superfícies de Tzitzéica. A partir delas obtemos novas classes de superfícies WGSD aplicando inversões e dilatações. Para uma classe especial de superfícies WGSD, que é invariante por dilatações e inversoes (superfícies WGSDE), obtemos uma representação tipo Weierstrass, dependendo de duas funções holomorfas. Como aplicação classificamos as superfícies WGSDE de rotação e apresentamos uma família a 4-parâmetros de superfícies WGSDE cíclicas completas com uma singularidade isolada e com planos de folheação não paralelos. Terminamos generalizando as superfícies WGSDE para o hipersuperfícies em Rn+1, n ≥ 2. Apresentaremos uma representação para estas hipersuperfícies no caso em que a projeção estereográfica da normal de Gauss N é dada pela aplicação identidade. Como aplicação, caracterizaremos os exemplos rotacionais.
Grieder, Ralph. "On the symplectic classes in the cohomology of the mapping class groups /." [S.l.] : [s.n.], 1996. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=11677.
Повний текст джерелаKlaus, Lorenz. "On classes of unique-sink orientations arising from pivoting in linear complementarity." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Institute for Operations Research, 2009. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=454.
Повний текст джерелаAbylayeva, Akbota. "Inequalities for some classes of Hardy type operators and compactness in weighted Lebesgue spaces." Doctoral thesis, Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-59667.
Повний текст джерелаSaito, Chieri. "A design and theory of strongly typed object-oriented programming languages for extensible recursive classes." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/120371.
Повний текст джерелаSilva, Leonardo de Amorin e. 1980. "Grupos abelianos-por-(nilpotentes de classe 2)." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306919.
Повний текст джерелаTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica
Made available in DSpace on 2018-08-26T02:25:15Z (GMT). No. of bitstreams: 1 Silva_LeonardodeAmorine_D.pdf: 582293 bytes, checksum: ed3c907af5279b8923c782d730bcf1d4 (MD5) Previous issue date: 2014
Resumo: Nesta tese consideramos uma extensão cindida G de um grupo abeliano A por um grupo nilpotente (de classe 2) Q e provamos dois resultados. Primeiro, se Q age nilpotentemente sobre A e G tem tipo FP2, calculamos o sigma invariante de G em dimensão 2. Segundo, se G tem tipo FP4, mostramos que cada quociente de G tem tipo FP4
Abstract: In this thesis we consider a split extension G of an abelian group A by a nilpotent group (class 2) Q and prove two results. First, if Q acts nilpotently on A and G has type FP2, compute the sigma invariant of G in dimension 2. Second, if G has type FP4, we show that every quotient G has type FP4
Doutorado
Matematica
Doutora em Matemática
Thilliez, Vincent. "Classes de Gevrey non isotropes et interpolation dans les domaines de type fini de C2." Paris 11, 1991. http://www.theses.fr/1991PA112114.
Повний текст джерелаLe, Botlan Didier. "MLF : Une extension de ML avec polymorphisme de second ordre et instanciation implicite." Phd thesis, Ecole Polytechnique X, 2004. http://tel.archives-ouvertes.fr/tel-00007132.
Повний текст джерелаde première classe, à la manière du Système F.
Cette extension, nommée MLF, utilise les annotations de types
d'ordre supérieur données explicitement dans le programme pour inférer
de manière principale le type le plus général. Toute expression admet
ainsi un type principal, qui dépend des annotations présentes
initialement dans le programme.
Toute expression de ML est typable dans MLF sans annotation
supplémentaire. Les expressions du Système F sont encodées de
manière systématique dans MLF en supprimant les abstractions
et les applications de types, et en traduisant les annotations
de types dans le langage de types de MLF.
De plus, les paramètres de lambda-abstractions qui ne sont pas
utilisés de manière polymorphe n'ont pas besoin d'être annotés.
Zendra, Olivier. "Traduction et optimisation globale dans les langages de classes." Phd thesis, Université Henri Poincaré - Nancy I, 2000. http://tel.archives-ouvertes.fr/tel-00565633.
Повний текст джерелаMuratbekov, Madi [Verfasser]. "Approximate properties of solutions and spectrum character of some classes of mixed type equations / Madi Muratbekov." Berlin : Freie Universität Berlin, 2008. http://d-nb.info/1022941275/34.
Повний текст джерелаMcgovern, Andrew P. "A comparison of medication adherence and persistence across drug classes in people with type 2 diabetes." Thesis, University of Surrey, 2018. http://epubs.surrey.ac.uk/845963/.
Повний текст джерелаAlawode, Matthew Ibiyosi. "Interactions langagières et construction de savoirs de type métalangagiers en classe de langue." Besançon, 2005. http://www.theses.fr/2005BESA1011.
Повний текст джерелаOurs is an attempt to take a look at the role and usage of metalanguage in the transmission and construction of knoledge by Nigerian teachers and learners of French as a foreign language in the Nigeria French Language Village, Badagry. The study wishes to highlight how the learner goes beyond the level of simply using the French language as a means of expression to using it as a means of reflexion on or about the language s/he is in the process of learning. The kernel of our work is articulated around such questions as to how metalinguistic activities could enhance or inhibit the processes of learning a foreign language and as to what extent verbal interactions in the classroom situation could be a means of enhancing the construction of metalinguistic competence of learners. Finally, we made some proposals as to what pedagogical measures and/or practices to put in place in order to enhance the learning of French language by Nigerian learners through metalinguistic activities, as well as for the training of Nigerian teachers of French as a foreign language in the use of such activities
Brown, Kristopher J. "A Comparison of Match-to-Sample and Respondent Training of the Blocking Effect in Equivalence Classes." Youngstown State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1403280691.
Повний текст джерелаBavard, Juliette. "Dynamique topologique sur les surfaces : gros groupe modulaire & classes de Brouwer." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066514/document.
Повний текст джерелаWe study the mapping class group G of the complement of a Cantor set in the plane and the Brouwer mapping classes of the mapping class group of the complement of Z in the plane. These objects arise naturally in topological dynamics on surfaces. In the first chapter, we study the group G and its action on the ray graph, which is the analog dened by Danny Calegari of the complex of curves for the complement of a Cantor set in the plane. In particular, we show that this graph has infinite diameter and is hyperbolic. We use the action of G on this graph to find an explicit non trivial quasimorphism on G and to show that this group has infinite dimensional second bounded cohomology. We give an example of a hyperbolic element of G with vanishing stable commutator length. In the second chapter, we give new tools for homotopy Brouwer theory. In particular, we describe a canonical reducing set, the set of "walls", which splits the plane into maximal translation areas and irreducible areas. We then focus on Brouwer mapping classes relatively to four orbits and describe them explicitly by adding to Handel's diagram and to the set of walls a "tangle", which is essentially an isotopy class of simple closed curves in the cylinder minus two points
Sagnier, Aurélien. "Un site arithmétique de type connes-consani pour les corps quadratiques imaginaires de nombre de classes 1." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCC190/document.
Повний текст джерелаWe construct, for imaginary quadratic number fields with class number 1, an arithmetic site of Connes-Consani type. The main difficulty here is that the constructions of Connes and Consani and part of their results strongly rely on the natural order existing on real numbers which is compatible with basic arithmetic operations. Of course nothing of this sort exists in the case of imaginary quadratic number fields with class number 1. We first define what we call arithmetic site for such number fields, we then calculate the points of those arithmetic sites and we express them in terms of the ad\`eles class space considered by Connes to give a spectral interpretation of zeroes of Hecke L functions of number fields. We get therefore that for a fixed imaginary quadratic number field with class number 1, that the points of our arithmetic site are related to the zeroes of the Dedekind zeta function of the number field considered and to the zeroes of some Hecke L functions. We then study the relation between the spectrum of the ring of integers of the number field and the arithmetic site. Finally we construct the square of the arithmetic site
Colipan, Ximena. "Etude didactique des situations de recherche pour la classe concernant des jeux combinatoires de type Nim." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM002/document.
Повний текст джерелаThis research is included in the project of the research group "Maths à modeler". In particular, in the part that corresponds to the study of "situations de recherche pour la classe" (SiRC). This research is focused in the study of the role played by the mathematical activity, the combinatorial games and particularly the games of Nim-type in learning the fundamental know-hows. We put under the term "fundamental know-hows" all the knowledge, methods and techniques found in all mathematical activity: experimenting, studying particular cases, conjecturing, building examples and counter-examples, modeling, proving, defining, etc. (Grenier et Payan, 2002). The main aim of this research is the construction, the experimentation and the analysis of SiRC based on combinatorial games of Nim-type for students designed to make them build and develop the know-hows required for the implementation of a "mathematical process". Our main problem is then identifying the fundamental and notional know-hows of the mathematical activity that are used in combinatorial games of Nim-type and establishing the epistemological and didactical conditions and constrains that favor the learning of these know-hows in the classroom. To achieve our aim, our research is supported, on one hand, by some aspects of the theory of didactical situation by Brousseau (Brousseau, 2004) and the theory of conceptual fields by Vergnaud (Vergnaud, 1994) and, on the other hand, by the SiRC model, where we also contribute to precise it. We based our research in the epistemological and didactical study of Nim-type games to conduct mathematical and didactical analysis of two SiRC: the first one, called "the geometrical Euclid game", is a situation of Nim-type created specifically for this research and based on the classical Euclid game. The second one, called "the chocolate game", is a situation frequently experimented by the research group math à modeler whose didactical analysis had not been done yet. The analysis and experimentations we have conducted show that the situations based on Nim-type games can lead to a mathematical activity that goes beyond developing and practicing mathematical techniques. They can open access to more general know-hows specific to the mathematical activity
Billères, Malvina. "Observations et astéroséismologie de sous-naines de type B, une nouvelle classe d'étoiles pulsantes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ55453.pdf.
Повний текст джерелаBILLERES, MALVINA. "Observations et asteroseismologie de sous-naines de type b : une nouvelle classe d'etoiles pulsantes." Paris 6, 1998. http://www.theses.fr/1998PA066034.
Повний текст джерелаHolton, Tracy D. "The Effects of Hook Type on the Hooking Mortality of Two Size Classes of Summer Flounder, Paralichthys dentatus." W&M ScholarWorks, 1995. https://scholarworks.wm.edu/etd/1539617685.
Повний текст джерелаArnaud, Jean-Baptiste. "Vers des références de première classe comme infrastructure de sécurité dans les langages dynamiquement typés." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2013. http://tel.archives-ouvertes.fr/tel-00808419.
Повний текст джерелаPalix, Nicolas, Julia L. Lawall, Gaël Thomas, and Gilles Muller. "How Often do Experts Make Mistakes?" Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4132/.
Повний текст джерелаJacob, Benoît. "Systèmes de type Bost-Connes pour les corps de fonctions." Paris 6, 2007. http://www.theses.fr/2007PA066223.
Повний текст джерелаMalmusi, Davide 1980. "Determinants of social inequalities in selfrated health: analysis at the intersection of gender, class and migration type." Doctoral thesis, Universitat Pompeu Fabra, 2012. http://hdl.handle.net/10803/116733.
Повний текст джерела