Un code correcteur d'erreur ajoute de la redondance à un message afin de pouvoir corriger celui-ci lorsque des erreurs se sont introduites pendant la transmission. Les codes convolutifs sont des codes performants, et par conséquent, souvent utilisés. Le principe d'un code convolutif consiste à se fixer une fonction de transfert définie sur le groupe des entiers relatifs et à effectuer la convolution d'un message avec cette fonction de transfert. Ces codes ne protègent pas le message d'une interception par une tierce personne. C'est pourquoi nous proposons dans cette thèse, des codes convolutifs avec des propriétés cryptographiques, définis sur des groupes non-commutatifs. Nous avons tout d'abord étudié les codes définis sur le groupe diédral infini, qui, malgré de bonnes performances, n'ont pas les propriétés cryptographiques recherchées. Nous avons donc étudié ensuite des codes convolutifs en bloc sur des groupes finis, avec un encodage variable dans le temps. Nous avons encodé chaque message sur un sous-ensemble du groupe différent à chaque encodage. Ces sous-ensembles sont générés de façon chaotique à partir d'un état initial, qui est la clé du cryptosystème symétrique induit par le code. Nous avons étudié plusieurs groupes et plusieurs méthodes pour définir ces sous-ensembles chaotiques. Nous avons étudié la distance minimale des codes que nous avons conçus et montré qu'elle est légèrement plus petite que la distance minimale des codes en blocs linéaires. Cependant, nous avons, en plus, un cryptosystème symétrique associé à ces codes. Ces codes convolutifs non-commutatifs sont donc un compromis entre correction d'erreur et sécurité. / An error correcting code adds redundancy to a message in order to correct it when errors occur during transmission.Convolutional codes are powerful ones, and therefore, often used. The principle of a convolutional code is to perform a convolution product between a message and a transfer function, both defined over the group of integers. These codes do not protect the message if it is intercepted by a third party. That is why we propose in this thesis, convolutional codes with cryptographic properties defined over non-commutative groups. We first studied codes over the infinite dihedral group, which despite good performance, do not have the desired cryptographic properties. Consequently, we studied convolutional block codes over finite groups with a time-varying encoding. Every time a message needs to be encoded, the process uses a different subset of the group. These subsets are chaotically generated from an initial state. This initial state is considered as the symmetric key of the code-induced cryptosystem. We studied many groups and many methods to define these chaotic subsets. We examined the minimum distance of the codes we conceived and we showed that it is slightly smaller than the minimum distance of the linear block codes. Nevertheless, our codes have, in addition, cryptographic properties that the others do not have. These non-commutative convolutional codes are then a compromise between error correction and security.

The use of Hilbert space theory became an important tool for ergodic theoreticians ever since John von Neumann proved the fundamental Mean Ergodic theorem in Hilbert space. Recurrence is one of the corner stones in the study of dynamical systems. In this dissertation some extended ideas besides those of the basic, well-known recurrence results are investigated. Hilbert space theory proves to be a very useful approach towards the solution of multiple recurrence problems in ergodic theory. Another very important use of Hilbert space theory became evident only relatively recently, when it was realized that non-commutative dynamical systems become accessible to the ergodic theorist through the important Gelfand-Naimark-Segal (GNS) representation of C*-algebras as Hilbert spaces. Through this construction we are enabled to invoke the rich catalogue of Hilbert space ergodic results to approach the more general, and usually more involved, non-commutative extensions of classical ergodic-theoretical results. In order to make this text self-contained, the basic, standard, ergodic-theoretical results are included in this text. In many instances Hilbert space counterparts of these basic results are also stated and proved. Chapters 1 and 2 are devoted to the introduction of these basic ergodic-theoretical results such as an introduction to the idea of measure-theoretic dynamical systems, citing some basic examples, Poincairé’s recurrence, the ergodic theorems of Von Neumann and Birkhoff, ergodicity, mixing and weakly mixing. In Chapter 2 several rudimentary results, which are the basic tools used in proofs, are also given. In Chapter 3 we show how a Hilbert space result, i.e. a variant of a result by Van der Corput for uniformly distributed sequences modulo 1, is used to simplify the proofs of some multiple recurrence problems. First we use it to simplify and clarify the proof of a multiple recurrence result by Furstenberg, and also to extend that result to a more general case, using the same Van der Corput lemma. This may be considered the main result of this thesis, since it supplies an original proof of this result. The Van der Corput lemma helps to simplify many of the tedious terms that are found in Furstenberg’s proof. In Chapter 4 we list and discuss a few important results where classical (commutative) ergodic results were extended to the non-commutative case. As stated before, these extensions are mainly due to the accessibility of Hilbert space theory through the GNS construction. The main result in this section is a result proved by Niculescu, Ströh and Zsidó, which is proved here using a similar Van der Corput lemma as in the commutative case. Although we prove a special case of the theorem by Niculescu, Ströh and Zsidó, the same method (Van der Corput) can be used to prove the generalized result. Copyright 2004, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. Please cite as follows: Beters, FJC 2004, A Hilbert space approach to multiple recurrence in ergodic theory, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://upetd.up.ac.za/thesis/available/etd-02222006-104936 / > / Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007. / Mathematics and Applied Mathematics / unrestricted

Les éditeurs collaboratifs permettent à des utilisateurs éloignés de collaborer à une tâche commune qui va de l'utilisation d'un agenda partagé à la réalisation de logiciels. Ce concept est né avec SCCS en1972 et connait un engouement récent (ex: Wikipedia). L'absence de centralisation et l'asynchronisme sont des aspects essentiels de cette approche qui relève d'un modèle pair-à-pair (P2P).  D'un autre côté,le format XML est devenu une référence pour la manipulation et l'échange de documents. Notre travail vise à la réalisation d'un éditeur collaboratif P2P pour l'édition de documents semi-structurés qui sont une abstraction du format XML.  Le problème est difficile et de nombreuses propositions se sont révélées erronées ou ne passant pas à l'échelle. Nous rappelons les concepts et l'état de l'art sur l'édition collaborative, les modèles centralisés et le P2P.  Ensuite, nous explorons deux approches différentes : les transformées opérationnelles et le CRDT (Commutative Replicated Data Type) avec différentes structures de données arborescentes. L'objectif est de réaliser les opérations de base (ajout, suppression et ré-étiquetage) tout en garantissant la convergence du processus d'édition. Nous proposons un algorithme générique pour l'approche CRDT basée sur une notion d'indépendance dans la structure de données.  Nous avons étendu nos travaux afin de réaliser l'opération de déplacement d'un sous-arbre et de prendre en compte le typage XML. Peu de travaux abordent ces deux points qui sont très utiles pour l'édition de documents. Finalement, nous donnons les résultats expérimentaux obtenus avec un prototype permettant de valider notre approche. / Collaborative editors allow different users to work together on a common task. Such tasks range from using a shared calendar to realizing software programmed by users located at distant sites. This concept was invented in 1972 with SCCS. In the last years, this paradigm became popular (ex. Wikipedia). Decentralization and asynchronicity are essential in this approach, leading to peer-to-peer (P2P) models. Meanwhile, the XML format has arrived as the de facto standard for editing and exchanging documents. Our work aims at defining a collaborative editor for semi-structured documents, which provide an abstraction of the XML format. The problem is difficult since many previous approaches are flawed or not scalable. Firstly,we describe the basic concepts on collaborative edition and network models and we give the state of the art of this topic. Then, we investigate two different approaches : the operational transformation(OT) approach and the Commutative Replicated Data Type (CRDT) approach for different (tree-like) data structures. Our goal is to ensure the convergence of the editing process with the basic operations (Add, Deland rename a node. We have proposed a new generic algorithm based on semantic independence in data structure for CRDT approach. We have extended our results by dealing with the operation that moves a subtree and with XML schema compliance. Few works have been devoted to these extensions which are useful in collaborative edition. Finally, we provide experimental results obtained from our implementation that validate our approach.

Certain Small Island Developing States (hereinafter the "SIDS") such as Kiribati or Tuvalu are often incorrectly called "sinking islands" because their highest points are located just a few meters above the sea level. Sea level rise may turn their territories to uninhabitable land gradually disappearing beneath the tide. Worsening of the environmental conditions causes internal displacement, migration and other problems. SIDS repeatedly brought their plight to the United Nations Security Council (the "UNSC") during its meetings in 2007, 2011, 2015, 2018 and 2019. They demanded that the UNSC should deal with their situation as a potential security issue and safeguard more equal distribution of environmental security risks and costs. During the UNSC negotiations, various states attempted to interpret and re-interpreted the UNSC mandate in order to suit their interests. The representatives of SIDS suggested that the UNSC should be a body based on the principles of distributive justice decision-making and thus safeguard fairer sharing of threats and burdens, including those of environmental character. The rapidly developing states strongly opposed; they implicitly claimed that the UNSC should be based rather on the principles of commutative justice, i.e. decide in strictly given situations of violations of...

<p>Jezik nad E je proizvoljan skup reci nad E, tj. proizvoljan podskup slobodnog monoida E*. Jezici nad datom azbukom formiraju al&shy; gebre jezika, sa operacijama unije, konkatenacije (dopisivanja red), Kleene-jeve iteracije i sa 0, {A} kao konstantama. Regularni jezici nad E su elementi podalgebre algebre jezika nad E generisane konačnim jezicima. Ispostavlja se da algebre jezika generi&scaron;u isti varijetet (i stoga zadovoljavaju iste iden&shy;titete) kao i algebre binarnih relacija snabdevene operacijama unije, kompozi&shy;cije, refleksivno-tranzitivnog zatvorenja i praznom relacijom i dijagonalom kao konstantama. Reč je o varijetetu Kleenejevih algebri, i slobodne algebre tog varijeteta su ba&scaron; algebre regularnih jezika. Na početku disertacije, izloženi su neki aspekti algebarske teorije automata i formalnih jezika, teorije binarnih relacija i univerzalne algebre, relevantni za ispitivanje identiteta na algebrama jezika. Zatim je dat klasični rezultat (Redko, 1964.) da varijetet Kleenejevih algebri nema konačnu bazu identiteta. Ovde je prikazan dokaz Conwaya iz 1971., budući da on sadrži neke ideje koje su se pokazale korisne za dalji rad. Glave 3 i 4 sadrže originalne rezultate usmerene na profinjenje Redkovog rezultata. Pokazano je da uzroci beskonačnosti baze identiteta za Kleenejeve algebre leže u interakciji operacija konkatenacije i iteracije jezika (odnosno, kompozicije i refleksivno-tranzitivnog zatvorenja relacija). Drugim recima, klasa redukata algebri jezika bez operacije unije nema konačnu bazu identiteta. To daje odgovor na problem D. A. Bredikhina iz 1993. godine. S druge strane, pro&scaron;irenjem tipa Kleenejevih algebri involutivnom operacijom inverza jezika, odnosno relacija, takođe se dolazi do beskonačno baziranih varijeteta, čime se re&scaron;ava problem B. Jonssona iz 1988. godine. Analogno, komutativni jezici nad E su proizvoljni podskupovi slobodnog komutativnog monoida E&reg;. U Glavi 5 je dokazano da se jednakosna teorija algebri komutativnih jezika poklapa sa jednakosnom teorijom algebre (regu&shy;larnih) jezika nad jednoelementnim alfabetom, &scaron;to daje odgovor na problem koji je jo&scaron; 1969. formulisao A. Salomaa u svojoj monografiji&nbsp; Theory of Au&shy;tomata.Na taj način, iz poznatih rezultata o jednakosnoj aksiomatizaciji komutativnih jezika se dobija jedna baza za algebre jezika nad jednoelement&shy;nim alfabetom, kao i veoma kratak dokaz poznate činjenice (takođe Redko, 1964.) da algebre komutativnih jezika nemaju konačnu bazu identiteta. Na kraju disertacije, identiteti Kleenejevih algebri se posmatraju u kon&shy;tekstu dinamičkih algebri. Reč je o algebarskoj verziji dinamičkih logika, koje su konstruisane sedamdesetih godina kao matematički model rada računara, kada se na njima izvr&scaron;ava program pisan u nekom imperativnom program&shy; skom jeziku. Na primer, problemi verifikacije i ekvivalentnosti programa se lako izražavaju preko identiteta dinamičkih algebri, tako da razne njihove jednakosne osobine odgovaraju pojmovima iz teorijskog računarstva. Takođe, interesatno je da je jednakosna teorija Kleenejevih algebri &rsquo;&rsquo; kodirana&rdquo; u konačno baziranoj jednakosnoj teoriji dinamičih algebri. Polazeći od poznatih rezul&shy;tata za dvosortne dinamičke algebre (pri čemu je jedna komponenta algebra istog tipa kao i Kleenejeve algebre, dok je druga Booleova algebra), neki od tih rezultata su transformisani i pro&scaron;ireni za Jonssonove dinamičke algebre (jednosortne modele dinamičkih logika). Na primer, ako se Kleenejeva algebra K može predstaviti kao konačan direktan proizvod slobodnih algebri varijeteta Kleenejevih algebri generisanih Kleenejevim relacionim algebrama, tada vari&shy;jetet K-dinamičkih algebri ima odlučivu jednakosnu teoriju. Odavde se izvodi da svaki varijetet Kleenejevih algebri generisan Kleenejevim relacionim algeb&shy;rama takođe ima odlučivu jednakosnu teoriju.</p> / <p>A language over &pound; is an arbitrary set of words, i.e. any subset of the free monoid &pound;*. All languages over a given alphabet form the algebra of languages, which is equipped with the operations of union, concate&shy;nation, Kleene iteration and 0, {A } as constants. Regular languages over &pound; are the elements of the subalgebra of the algebra of languages over &pound; generated by finite languages. It turns out that algebras of languages generate exactly the same variety as algebras of binary relations, endowed with union, rela&shy;tion composition, formation of the refelxive-transitive closure and the empty relation and the diagonal as constants. The variety in question is the vari&shy;ety of Kleene algebras, and the algebras of regular languages are just its free algebras. The present dissertation starts with several aspects of algebraic theory of automata and formal languages, theory of binary relations and universal alge&shy;bra, which are related to problems concerning identities of language algebras. This material is followed by the classical result (Redko, 1964) claiming that the variety of Kleene algebras have no finite equational base. We present the proof of Conway from 1971, since it contains some ideas which can be used for generalizations in different directions. Chapters 3 and 4 contain original results which refine the one of Redko. It is shown that the cause of nonfinite axiomatizability of Kleene algebras lies in the superposition of the concatenation and the iteration of languages, that is, composition of relations and reflexive-transitive closure. In other words, the class of -(--free reducts of algebras of languages has no finite equational base, which answers in the negative a problem of D. A. Bredikhin from 1993. On the other hand, by extending the type of Kleene algebras by the involutive operation of inverse of&nbsp; languages (converse of relations), we also obtain a nonfinitely based variety, which solves a problem of B. Jonsson from 1988. Analogously, commutative languages over E are defined as subsets of the free commutative monoid &pound;&reg;. It is proved in Chapter 5 that equational the&shy; ories of algebras of commutative languages and, respectively, of the algebra of (regular) languages over the one-element alphabet, coincide. This result settles a thirty year old problem of A. Salomaa, formulated back in his wellknown monograph&nbsp; Theory of Automata.Thus, we obtain an equational base for the algebra of one-letter languages, and, on the other hand, a very short proof of another Redko&rsquo;s result from 1964, according to which there is no finite equational base for algebras of commutative languages. Finally, identities of Kleene algebras are considered in the context of dy&shy;namic algebras, which are just algebraic counterparts of dynamic logics. They were discovered in the seventies as a result of the quest for an appropriate logic for reasoning about computer programs written in an imperative pro&shy; gramming language. For example, problems concerning program verification and equivalence can be easily translated into identities of dynamic algebras, so that many of their equational properties correspond to notions from computer science. It is also interesting that the whole equational theory of Kleene alge&shy; bras is &rsquo;&rsquo;encoded&rdquo; in the finitely based equational theory of dynamic algebras.<br />Starting with known results on two-sorted dynamic algebras (where one com&shy; ponent is an algebra of the same signature as Kleene algebras, while the other is a Boolean algebra), some of those results are transformed and extended for Jonsson dynamic algebras (that is, one-sorted models of dynamic logics). For example, if a Kleene algebra K can be represented as a finite direct product of free algebras of varieties of Kleene algebras generated by Kleene relation algebras, then the variety of K-dynamic algebras has a decidable equational theory. The latter yields that all varieties of Kleene algebras generated by Kleene relation algebras have decidable equational theories, too.</p>

Cette thèse d'algèbre commutative porte principalement sur la théorie de la profondeur. Nous nous efforçons d'en fournir une approche épurée d'hypothèse noethérienne dans l'espoir d'échapper aux idéaux premiers et ceci afin de manier des objets élémentaires et explicites. Parmi ces objets, figurent les complexes algébriques de Koszul et de Cech dont nous étudions les propriétés cohomologiques grâce à des résultats simples portant sur la cohomologie du totalisé d'un bicomplexe. Dans le cadre de la cohomologie de Cech, nous avons établi la longue suite exacte de Mayer-Vietoris avec un traitement reposant uniquement sur le maniement des éléments. Une autre notion importante est celle de dimension de Krull. Sa caractérisation en termes de monoïdes bords permet de montrer de manière expéditive le théorème d'annulation de Grothendieck en cohomologie de Cech. Nous fournissons également un algorithme permettant de compléter un polynôme homogène en un h.s.o.p.. La profondeur est intimement liée à la théorie des résolutions libres/projectives finies, en témoigne le théorème de Ferrand-Vasconcelos dont nous rapportons une généralisation due à Jouanolou. Par ailleurs, nous revenons sur des résultats faisant intervenir la profondeur des idéaux caractéristiques d'une résolution libre finie. Nous revisitons, dans un cas particulier, une construction due à Tate permettant d'expliciter une résolution projective totalement effective de l'idéal d'un point lisse d'une hypersurface. Enfin, nous abordons la théorie de la régularité en dimension 1 via l'étude des idéaux inversibles et fournissons un algorithme implémenté en Magma calculant l'anneau des entiers d'un corps de nombres. / This Commutative Algebra thesis focuses mainly on the depth theory. We try to provide an approach without noetherian hypothesis in order to escape prime ideals and to handle only basic and explicit concepts. We study the algebraic complexes of Koszul and Cech and their cohomological properties by using simple results on the cohomology of the totalization of a bicomplex. In the Cech cohomology context we established the long exact sequence of Mayer-Vietoris only with a treatment based on the elements. Another important concept is that of Krull dimension. Its characterization in terms of monoids allows us to show expeditiously the vanishing Grothendieck theorem in Cech cohomology.We also provide an algorithm to complete a omogeneous polynomial in a h.s.o.p.. The depth is closely related to the theory of finite free/projective resolutions. We report a generalization of the Ferrand-Vasconcelos theorem due to Jouanolou. In addition, we review some results involving the depth of the ideals of expected ranks in a finite free resolution.We revisit, in a particular case, a construction due to Tate. This allows us to give an effective projective resolution of the ideal of a point of a smooth hypersurface. Finally, we discuss the regularity theory in dimension 1 by studying invertible ideals and provide an algorithm implemented in Magma computing the ring of integers of a number field.

La théorie classique du contrat et ses corollaires, l’autonomie de la volonté des parties et le principe de la stabilité des contrats, ont longtemps régné en droit des obligations. Depuis l’introduction du Code civil du Québec, la notion de bonne foi a été l’objet de plusieurs textes de doctrine et de plusieurs décisions judiciaires phares. La notion est considérée comme l’outil de prédilection des juristes pour assurer une meilleure justice contractuelle, parfois pour développer des théories allant à l’encontre du principe de la stabilité des contrats. Or, le récent arrêt Churchill Falls nous enseigne que la bonne foi a ses propres contours et ne peut donc pas être utilisée en dehors des limites qui lui sont intrinsèques. Dans ce travail, la notion de bonne foi est revisitée conjointement avec la notion d’équité afin de présenter leurs paramètres fondamentaux initiaux, leurs mutations et leurs portées actuelles en droit civil québécois. Bien que ces deux outils contribuent à assurer une meilleure justice commutative dans les échanges, la bonne foi a ce l’équité n’a pas : une synchronicité avec les principes de stabilité des contrats et d’autonomie de la volonté. Cette constatation peut expliquer la mise au placard de l’équité à titre d’outil de justice dans le régime général des obligations. Ainsi, en filigrane, il appert que la stabilité des contrats demeure une valeur prédominante du législateur malgré les allures d’une nouvelle moralité du droit des obligations. / The classical theory of contract and its corollaries, the autonomy of the parties' will and the principle of the stability of contracts, have ruled the law of obligations for long. Since the introduction of the Civil Code of Québec, the notion of good faith has been the subject of several doctrinal texts and landmark judicial decisions. The notion is considered as the preferred tool of jurists to ensure a better contractual justice, sometimes to develop theories that run counter to the principle of the stability of contracts. However, the Supreme Court in its judgment Churchill Falls decision teaches us that good faith has its own contours and therefore cannot be used outside its intrinsic limits. In this paper, the notion of good faith is revisited in conjunction with the notion of equity to present their initial fundamental parameters, their mutations, and their current scope in Quebec civil law. Although both tools contribute to ensuring better commutative justice in exchanges, good faith has what equity does not: synchronicity with the principles of stability of contracts and autonomy of the will. This observation may explain the shelving of equity as a tool of justice in the general regime of obligations. Thus, it appears that the stability of contracts remains a predominant value of the legislator despite the appearance of a new morality in the law of obligations.

No description available.

L'algorithme covariant de van Holten, servant à construire des quantités conservées, est présenté avec une attention particulière portée sur les vecteurs de type Runge-Lenz. La dynamique classique des particules portant des charges isospins est passée en revue. Plusieures applications physiques sont considerées. Des champs de type monopôles non-Abéliens, générés par des mouvements nucléaires dans les molécules diatomiques, introduites par Moody, Shapere et Wilczek, sont étudiées. Dans le cas des espaces courbes, le formalisme de van Holten permet de décrire la symétrie dynamique des monopôles Kaluza-Klein généralisés. La procédure est étendue à la supersymétrie et appliquée aux monopôles supersymétriques. Une autre application, concernant l'oscillateur non-commutatif en dimension trois, est également traitée.

Ce travail peut être divisé en trois partie: 1. Théorie des groupes. Il s'agit ici d'une étude de la structure du groupe T de Thompson. On explique la notion de la mutation linéaire par morceaux et on obtient la nouvelle présentation de ce groupe en termes des génerateurs et relations. 2. Géometrie birationnelle. On étudie en détail le groupe de Cremona qui est un groupe des automorphismes birationnels du plan projectif. En particulier on s'interesse à son sous-groupe Symp des elements qui préserve le crochet de Poisson dit logarithmique, aussi bien qu'à un sous-groupe H engendré par SL(2,Z) et par les mutations. On construit des limites projectives des surfaces sur lesquelles ces groupes agissent régulièrement, et on en déduit les répresentations linéaires de ces groupes dans les limites inductives des groupes de Picard des surfaces. 3. Algèbre homologique. A partir d'une variété algébrique on construit une catégorie triangulée qui ne dépend que de sa classe birationnelle. En utilisant la technique de quotient de dg-catégories, on calcule explicitement cette catégorie pour les surfaces rationnelles. Comme consequence on obtient l'action du groupe de Cremona sur une algébre non-commutative par les automorphismes extérieures. On donne les applications de ces résultats aux formules des mutations des variables non-commutatives.