• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 51
  • 37
  • 10
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 111
  • 15
  • 15
  • 14
  • 13
  • 11
  • 11
  • 11
  • 11
  • 11
  • 11
  • 10
  • 10
  • 8
  • 7
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Towards Synthesizing Open Systems : Tableaux For Multi-Agent Temporal Logics / Vers la Synthèse de Systèmes Ouverts : Tableaux pour les Logiques Temporelles Multi-Agents

David, Amélie 30 September 2015 (has links)
Dans cette thèse, nous essayons de fournir des outils automatisés pour élaborer des systèmes ouverts sûrs. Les systèmes ouverts, qui peuvent être vus comme des systèmes multi-agents, peuvent être spécifiés en ATL. La logique ATL a été introduite dans ce but précis. Il existe deux extensions intéressantes d'ATL, à savoir ATL+ et ATL* (ATL+ étant une restriction d'ATL*). ATL+ permet la combinaison Booléenne d'opérateurs temporels, et ATL* permet également l'imbrication d'opérateurs temporels. La procédure de décision basée sur les tableaux pour ATL est une méthode constructive pour tester la satisfiabilité d'une spécification donnée. Elle est constructive dans le sens qu'il est possible d'extraire un modèle depuis le tableau obtenu, lorsque la formule de départ est satisfiable. Dans cette thèse, nous proposons deux procédures de décision basées sur les tableaux pour ATL+ and ATL*, ainsi qu'une implémentation de ces procédures. Notre procédure est correcte, complète et optimale. En effet, nos deux procédures s'exécutent en 2Exptime. A notre connaissance, notre implémentation est le premier exécutable pour décider la satisfiabilité des formules ATL et ATL*. En perspective de cette thèse, nous discutons de la possibilité d'améliorer l'extraction de modèles depuis les tableaux pour ATL, ATL+ and ATL*. Nous aimerions obtenir à la fin des modèles relativement petits. / In this thesis, we try to provide automated tools to design safe open systems. Open systems, which can be viewed as multi-agent systems, may be specified in ATL. The logic ATL has been especially introduced for that purpose. There exist two relevant extensions of ATL, namely ATL+ and ATL* (ATL+ being a restriction of ATL*).ATL+ allows Boolean combination of temporal operators, and ATL* also allows nesting of temporal operators. The tableau-based decision procedure for ATL is a constructive method to test the satisfiability of a given specification. It is constructive in the sense that it is possible to extract a model from the obtained tableau, whenever the root formula is indeed satisfiable. In this thesis, we propose two tableau-based decision procedures for ATL+ and ATL*, as well as an implementation of these procedures. Our procedures are sound, complete and optimal. Indeed, our two procedures run in 2Exptime. Up to our knowledge our implementation is the first running tool to decide satisfiability of both ATL and ATL* formulae. In the perspectives of this thesis, we discuss how it is possible to improve the extraction of models from tableaux for ATL, ATL+ and ATL*. We would like to obtain relatively small models at the end.
2

Quelle(s) définition(s) du tableau photographique ? /

Viale, Marie-Laure, January 1994 (has links)
DEA--Histoire de l'art--Rennes 2, 1994. / Bibliogr. p. 131-138.
3

The Representation Theory of the Symmetric Groups

Halverson-Duncan, Brittany 23 March 2015 (has links)
This paper forms an introductory account of the irreducible representations of the permutation group using Young Tableaux as the tool to achieve this. The basics of C*-Algebra theory and Young Tableaux are provided including a brief history of the two subjects. This paper provides a straightforward development of the subject up to the main result which says that restricting the irreducible representations of S_n corresponding to the Young diagrams of shape ? to S_n-1 decomposes as the direct sum of the irreducible representations of S_n-1 corresponding to the Young diagrams formed by removing one box from ?. / Graduate
4

Path Tableaux and the Combinatorics of the Immanant Function

Tessier, Rebecca January 2013 (has links)
Immanants are a generalization of the well-studied determinant and permanent. Although the combinatorial interpretations for the determinant and permanent have been studied in excess, there remain few combinatorial interpretations for the immanant. The main objective of this thesis is to consider the immanant, and its possible combinatorial interpretations, in terms of recursive structures on the character. This thesis presents a comprehensive view of previous interpretations of immanants. Furthermore, it discusses algebraic techniques that may be used to investigate further into the combinatorial aspects of the immanant. We consider the Temperley-Lieb algebra and the class of immanants over the elements of this algebra. Combinatorial tools including the Temperley-Lieb algebra and Kauffman diagrams will be used in a number of interpretations. In particular, we extend some results for the permanent and determinant based on the $R$-weighted planar network construction, where $R$ is a convenient ring, by Clearman, Shelton, and Skandera. This thesis also presents some cases in which this construction cannot be extended. Finally, we present some extensions to combinatorial interpretations on certain classes of tableaux, as well as certain classes of matrices.
5

Path Tableaux and the Combinatorics of the Immanant Function

Tessier, Rebecca January 2013 (has links)
Immanants are a generalization of the well-studied determinant and permanent. Although the combinatorial interpretations for the determinant and permanent have been studied in excess, there remain few combinatorial interpretations for the immanant. The main objective of this thesis is to consider the immanant, and its possible combinatorial interpretations, in terms of recursive structures on the character. This thesis presents a comprehensive view of previous interpretations of immanants. Furthermore, it discusses algebraic techniques that may be used to investigate further into the combinatorial aspects of the immanant. We consider the Temperley-Lieb algebra and the class of immanants over the elements of this algebra. Combinatorial tools including the Temperley-Lieb algebra and Kauffman diagrams will be used in a number of interpretations. In particular, we extend some results for the permanent and determinant based on the $R$-weighted planar network construction, where $R$ is a convenient ring, by Clearman, Shelton, and Skandera. This thesis also presents some cases in which this construction cannot be extended. Finally, we present some extensions to combinatorial interpretations on certain classes of tableaux, as well as certain classes of matrices.
6

Tableau systems for the modal μ-calculus

Jungteerapanich, Natthapong January 2010 (has links)
The main content of this thesis concerns a tableau method for solving the satisfiability problem for the modal μ-calculus. A sound and complete tableau system for the modal μ-calculus is given. Since every tableau in such tableau system is finite and bounded by the length of the formula, the tableau system may be used as a decision procedure for determining the satisfiability of the formula. An alternative proof of the small model property is obtained: every satisfiable formula has a model of size singleexponential in the length of the formula. Contrary to known proofs in literature, the results presented here do not rely on automata theory. Two simplifications of the tableau system are given. One is for the class of aconjunctive formulae. The resulting tableau system has been used to prove the completeness of Kozen’s axiomatisation with respect to the aconjunctive fragment of the modal μ- calculus. Another is for the formulae in the class Πμ 2 . In addition to the tableau method, the thesis explores some model-surgery techniques with the aim that such techniques may be used to directly prove the small model theorem. The techniques obtained so far have been used to show the small model property for Πμ 2 -formulae and for formulae with linear models.
7

Combinatoire de l’ASEP, arbres non-ambigus et polyominos parallélogrammes périodiques / Combinatorics of the ASEP, non-ambiguous trees and periodic parallelogram polyominoes

Laborde-Zubieta, Patxi 08 December 2017 (has links)
Cette thèse porte sur l’interprétation combinatoire des probabilitésde l’état stationnaire de l’ASEP par les tableaux escaliers, sur les arbresnon-ambigus et sur les polyominos parallélogrammes périodiques.Dans une première partie, nous étudions l’ansatz matriciel de Derrida,Evans, Hakim et Pasquier. Toute solution de ce système d’équation permet decalculer les probabilités stationnaires de l’ASEP. Nos travaux définissent denouvelles récurrences équivalentes à celles de l’ansatz matriciel. En définissantun algorithme d’insertion sur les tableaux escaliers, nous montrons combinatoirementet simplement qu’ils les satisfont. Nous faisons de même pour l’ASEPà deux particules. Enfin, nous énumérons les coins dans les tableaux associésà l’ASEP, nous permettant ainsi de donner le nombre moyen de transitionspossibles depuis un état de l’ASEP.Dans une deuxième partie, nous calculons de jolies formules pour les sériesgénératrices des arbres non-ambigus, desquelles nous déduisons des formulesd’énumérations. Puis, nous interprétons bijectivement certains de ces résultats.Enfin, nous généralisons les arbres non-ambigus à toutes les dimensions finies.Dans la dernière partie, nous construisons une structure arborescente surles polyominos parallélogrammes périodiques, inspirée des travaux de Boussicault,Rinaldi et Socci. Cela nous permet de calculer facilement leur sériegénératrice selon la hauteur et la largeur ainsi que deux nouvelles statistiques :la largeur intrinsèque et la hauteur de recollement intrinsèque. Enfin, nousétudions l’ultime périodicité de leur série génératrice selon l’aire. / This thesis deals with a combinatorial interpretation of the stationnarydistribution of the ASEP given by staircase tableaux and studiestwo combinatorial objects : non-ambiguous trees and periodic parallelogrampolyominoes.In the first part, we study the matrix ansatz introduced by Derrida, Evans,Hakim and Pasquier. Any solution of this equation system can be used tocompute the stationnary probabilities of the ASEP. Our work defines newrecurrences equivalent to the matrix ansatz. By defining an insertion algorithmfor staircase tableaux, we prove combinatorially and easily that they satisfyour new recurrences. We do the same for the ASEP with two types of particles.Finally, we enumerate the corners of the tableaux related to the ASEP, whichgives the average number of transitions from a state of the ASEP.In the second part, we compute nice formulas for the generating functionsof non-ambiguous trees, from which we deduce enumeration formulas. Then, wegive a combinatorial interpretation of some of our results. Lastly, we generalisenon-ambiguous trees to every finite dimension.In the last part, we define a tree structure in periodic parallelogram polyominoes,motivated by the work of Boussicault, Rinaldi and Socci. It allowsus to compute easily the generating function with respect to the height andthe width as well as two new statistics : the intrinsic width and the intrinsicgluing height. Finally, we investigate the ultimate periodicity of the generatingfunction with respect to the area.
8

Um método dos tablôs por prova direta para a lógica clássica

Lemes Neto, Maurício Correia January 2004 (has links)
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação. / Made available in DSpace on 2012-10-21T23:14:47Z (GMT). No. of bitstreams: 1 207778.pdf: 429850 bytes, checksum: 5a8ef0bdb25a1cedbc0312a1d037e76b (MD5) / Este trabalho desenvolve uma forma diferente de se obter árvores de prova por tablôs. Denominamos esse método de direto, por causa da característica em que a possível conclusão é inserida no tablô inicial, sem negá-la. Já o método dos tablôs por refutação se utiliza da negação da possível conclusão. No sistema de tablôs por prova direta para a lógica clássica, cada ramo está relacionado semanticamente à disjunção das fórmulas que o compõem, e o tablô completo corresponde semanticamente à conjunção de todas essas disjunções. Em qualquer um dos métodos baseados em tablôs para a Lógica Clássica, tanto direto quanto indireto, um ramo é considerado fechado se o mesmo contiver duas fórmulas contraditórias. No método direto o fechamento de um ramo corresponde à sua validade semântica, a qual implica, no caso do fechamento de todos os ramos, na validade da possível conclusão. Já no método indireto o fechamento de um ramo corresponde à insatisfatibilidade da negação da possível conclusão, o que por sua vez implica na validade da mesma.
9

La production d'indicateurs de gestion : trois études de cas en management public / Indicators production in management : three study cases in public management

Choffel, Denis 18 October 2007 (has links)
Depuis la décentralisation de 1982, suivie de la Loi Organique, relative aux Lois de Finance (L.O.L.F.), les administrations d'Etat et les organisations publiques ont beaucoup évolué. Ce nouveau contexte a un impact sur le contrôle de gestion des organisations publiques, qui se traduit par la mise en œuvre de nouveaux instruments. Notre recherche porte, grâce aux enseignements tirés de nos 3 études de terrain en Management Public, sur la production d'indicateurs (conception d'une démarche pertinente, architecture, construction et articulation des indicateurs, et enfin sur leurs exploitations et leurs actualisations). Le premier apport de cette thèse est donc d'ordre pratique, car grâce à ces préconisations portant sur les moments clefs de la démarche de construction et de mise en place des indicateurs cela va permettre d'apporter un "savoir actionnable" aux professionnels. Le second apport est d'ordre méthodologique, car la combinaison des différentes approches (2 recherches-actions, 1 observation participante, une analyse quantitative), a renforcé la validité de notre recherche. De plus, notre démarche a eu une dimension exploratoire, car elle a permis de faire un état de lieux en matière de contrôle de gestion tant au niveau d'organisations spécifiques, qu'au niveau des pratiques et jeux d'acteurs. Enfin, sur un plan conceptuel, nous montrons comment l'on peut articuler, au sein d'un même processus de modélisation des activités, des mesures relevant d'une vision partagée et des mesures plus objectives, car c'est l'articulation de ces deux types de mesure qui va renforcer la pertinence du système mis en place et gagner l'adhésion des acteurs du terrain / The State administrations and the public organisations in France have deeply evolved since the decentralisation of 1982 followed by the "Loi Organique" relative to the “Lois de Finance LOLF”. One impact of this emergent context on the management control takes the form of new management tools applied in the public organisations. This dissertation draws lessons on the production of indicators (the conception and architecture of a pertinent approach, the construction of different indicators and the articulation among them, and finally the exploitation and the updating of these indicators) based on three field studies conducted in public managements. The first contribution of this study is practical. The results and recommendations concerning the crucial periods of the construction and the application of indicators provide actionable knowledge to the concerned professionals. Secondly, a methodological contribution may be highlighted as multi-methods have been used (two action-researches, one participant observation, and one quantitative analysis). The combination of these different approaches reinforces the validity of the results. Moreover, this study draws up a literature review on the management control related to specific form of organisations and on the level of practices and different actors. Finally, the study shows how to articulate, for the same process of activities modelling, between measurements related to shared vision and more objective measurements. It is the articulation of these two types of measurements which strengthens the applied system and assures the adhesion of the field actors
10

Combinatorial Properties of the Hilbert Series of Macdonald Polynomials

Niese, Elizabeth M. 27 April 2010 (has links)
The original Macdonald polynomials P<sub>μ</sub> form a basis for the vector space of symmetric functions which specializes to several of the common bases such as the monomial, Schur, and elementary bases. There are a number of different types of Macdonald polynomials obtained from the original P<sub>μ</sub> through a combination of algebraic and plethystic transformations one of which is the modified Macdonald polynomial H̃<sub>μ</sub>. In this dissertation, we study a certain specialization F̃<sub>μ</sub>(q,t) which is the coefficient of x₁x₂…x<sub>N</sub> in H̃<sub>μ</sub> and also the Hilbert series of the Garsia-Haiman module M<sub>μ</sub>. Haglund found a combinatorial formula expressing F̃<sub>μ</sub> as a sum of n! objects weighted by two statistics. Using this formula we prove a q,t-analogue of the hook-length formula for hook shapes. We establish several new combinatorial operations on the fillings which generate F̃<sub>μ</sub>. These operations are used to prove a series of recursions and divisibility properties for F̃<sub>μ</sub>. / Ph. D.

Page generated in 0.0991 seconds