Le présent mémoire consiste en une analyse thématique des représentations féminines dans l’œuvre de Satoshi Kon, de Perfect Blue à Paprika. L’objectif de ce travail est de démontrer que ces images de la femme reflètent la place des femmes dans la société japonaise contemporaine. À cet effet, nous avons examiné les films du réalisateur selon l’approche des études féministes du cinéma. Nous avons divisé notre analyse en trois thèmes : la violence, la sexualité et le double. Il apparaît que les représentations féminines des longs-métrages de Kon possèdent effectivement des parallèles au sein la société nippone actuelle. Le réalisateur emploie des figures et des motifs narratifs communs au Japon et l’anime afin de produire et reproduire les stéréotypes de genre. Par ailleurs, il utilise les éléments filmiques et les particularités du médium de l’anime pour appuyer ces définitions des rôles sexuels. Cette étude est originale par son angle d’approche féministe et psychanalytique qui est rarement adopté par les théoriciens de l’anime. Les études portant sur ce médium sont d’ailleurs récentes et s’intéressent généralement à l’esthétique de l’anime ou à la formation d’une identité nationale japonaise plutôt qu’à la construction du genre dans un média de culture populaire. / The present thesis consists of a thematic analysis of the feminine representations in Satoshi Kon’s work, from Perfect Blue to Paprika. Our objective is to demonstrate that these female depictions reflect the status of women in contemporary japanese society. To this end, we examined the director’s movies according to feminist film theory. Also, we separated our analysis in three themes : violence, sexuality and the double. It seems that Kon’s feminine representations possess parallels to the present Japanese society. Indeed, the director uses figures and narrative motifs common to Japan and anime in order to produce and reproduce gender stereotypes. In addition, he utilizes filmic elements and the particularities of the anime medium to support these definitions of sexual roles. This study is original in its feminist and psychoanalytic approach which is rarely employed by anime theorists. Furthermore, the studies regarding this medium are fairly new and usually focus on the anime easthetic and the establishment of a Japanese national identity rather than the construction of gender in a popular culture media.

De nos jours, nous accordons une place particulière à la littérature Universelle, qui est située au point de croisement du soi et de l’autre, de l’implicite et de l’explicite, de l’intime et du public. En ce qui concerne notre étude comparative entre la vision de Mowlânâ Djalâl Od-Dîn Mohammad Balkhî Rûmî, poète mystique iranien du XIIIème siècle et celle d'Alfred de Vigny, poète stoïcien, romantique et mystique français du XIXème siècle, sur l'Homme Parfait, nous avons tenté à montrer que nos deux Génies, quoique l’un était oriental et l’autre occidental, que l’un était du 13ème siècle et l’autre du 19ème siècle, que leurs religions étaient différentes, que l’un était postérieur à l’autre et ne l’a fort probablement jamais lu, ont des avis quasiment identiques sur l’Homme Parfait. En effet, la pureté et la bonté spirituelle, l’innocence, l’honnêteté, l’amitié, l’amour, et les caractères humbles de l’être humain, ne dépendent point des dimensions spatio-temporelles, ni de l’idéologie et de la civilisation des sujets à traiter, car ce sont des qualités purement humaines qui prennent leur source dans la conscience, le cœur et l’âme et représentent tout le côté divin de l'être. L'Homme Parfait nommé le "vrai Mystique" chez Mowlanâ et le "Paria" chez Alfred de Vigny certifient que certains hommes sont des êtres à part, sortes d’extraterrestres, tout en étant des symboles de l’humanité. Ces gens là, tout à la fois d’ici-bas et d’au-delà, libérés en fait de leur « moi » matériel, sont le pur reflet d’un « moi » divin. Une telle personne peut espérer être sur le bon chemin et pouvoir rester digne de posséder à la fois la face de l’Homme et la face de Dieu. Par conséquent, nous avons simplement envisagé les points communs entre les sujets en question et en tenant compte des notions d'identité et d'altérité, nous nous sommes focalisés sur une paix universelle. / Today the Universal literature has taken a particular place for itself, because this literature is on the cross point of "self" and "other", "implicit" and "explicit", "intimate" and "public". The comparative study between the foresights of Mowlânâ Djalâl-Od- Dîn Mohammad Rûmî-é BalkhÎ, the Iranian mystic poet of the 13th century, and, Alfred de Vigny, the romantic, stoic, and mystic poet of French 19th century, on the subject of "Perfect Man", in spite of the fact that the two men lived six centuries apart, one was in the East and the other one was in the West of the World, their religions were different, and that most likely Vigny had not read Mowlânâ's works, the two poets have almost similar opinions about the "Perfect Man". Normally, the comparative study is conducted to identify, directly or indirectly, the influence of a certain person or doctrine over another person or doctrine; but in this study, our readers or audience will see that the nature of purity, spiritual goodness, innocence, honesty, friendship, love, and sublime human characteristics are neither dependent of time and place, nor they depend on a specific ideology or a special culture, because they have all their roots in the intelligence, heart, and spirit of individuals and are part of Devine aspect of human being.

Einst als Hilfssatz für Szemerédis Theorem entwickelt, hat sich das Regularitätslemma in den vergangenen drei Jahrzehnten als eines der wichtigsten Werkzeuge der Graphentheorie etabliert. Im Wesentlichen hat das Lemma zum Inhalt, dass dichte Graphen durch eine konstante Anzahl quasizufälliger, bipartiter Graphen approximiert werden können, wodurch zwischen deterministischen und zufälligen Graphen eine Brücke geschlagen wird. Da letztere viel einfacher zu handhaben sind, stellt diese Verbindung oftmals eine wertvolle Zusatzinformation dar. Vom Regularitätslemma ausgehend gliedert sich die vorliegende Arbeit in zwei Teile. Mit Fragestellungen der Extremalen Hypergraphentheorie beschäftigt sich der erste Teil der Arbeit. Es wird zunächst eine Version des Regularitätslemmas Hypergraphen angewandt, um asymptotisch scharfe Schranken für das Auftreten von Hamiltonkreisen in uniformen Hypergraphen mit hohem Minimalgrad herzuleiten. Nachgewiesen werden des Weiteren asymptotisch scharfe Schranken für die Existenz von perfekten und nahezu perfekten Matchings in uniformen Hypergraphen mit hohem Minimalgrad. Im zweiten Teil der Arbeit wird ein neuer, Szemerédis ursprüngliches Konzept generalisierender Regularitätsbegriff eingeführt. Diesbezüglich wird ein Algorithmus vorgestellt, welcher zu einem gegebenen Graphen ohne zu dichte induzierte Subgraphen eine reguläre Partition in polynomieller Zeit berechnet. Als eine Anwendung dieses Resultats wird gezeigt, dass das Problem MAX-CUT für die oben genannte Graphenklasse in polynomieller Zeit bis auf einen multiplikativen Faktor von (1+o(1)) approximierbar ist. Der Untersuchung von Chung, Graham und Wilson zu quasizufälligen Graphen folgend wird ferner der sich aus dem neuen Regularitätskonzept ergebende Begriff der Quasizufälligkeit studiert und in Hinsicht darauf eine Charakterisierung mittels Eigenwertseparation der normalisierten Laplaceschen Matrix angegeben. / Once invented as an auxiliary lemma for Szemerédi''s Theorem the regularity lemma has become one of the most powerful tools in graph theory in the last three decades which has been widely applied in several fields of mathematics and theoretical computer science. Roughly speaking the lemma asserts that dense graphs can be approximated by a constant number of bipartite quasi-random graphs, thus, it narrows the gap between deterministic and random graphs. Since the latter are much easier to handle this information is often very useful. With the regularity lemma as the starting point two roads diverge in this thesis aiming at applications of the concept of regularity on the one hand and clarification of several aspects of this concept on the other. In the first part we deal with questions from extremal hypergraph theory and foremost we will use a generalised version of Szemerédi''s regularity lemma for uniform hypergraphs to prove asymptotically sharp bounds on the minimum degree which ensure the existence of Hamilton cycles in uniform hypergraphs. Moreover, we derive (asymptotically sharp) bounds on minimum degrees of uniform hypergraphs which guarantee the appearance of perfect and nearly perfect matchings. In the second part a novel notion of regularity will be introduced which generalises Szemerédi''s original concept. Concerning this new concept we provide a polynomial time algorithm which computes a regular partition for given graphs without too dense induced subgraphs. As an application we show that for the above mentioned class of graphs the problem MAX-CUT can be approximated within a multiplicative factor of (1+o(1)) in polynomial time. Furthermore, pursuing the line of research of Chung, Graham and Wilson on quasi-random graphs we study the notion of quasi-randomness resulting from the new notion of regularity and concerning this we provide a characterisation in terms of eigenvalue separation of the normalised Laplacian matrix.

Cette dissertation de doctorat développe des contributions importantes à la littérature sur la négociation salariale. Nous introduisons des taux d’actualisation variant dans le temps pour les modèles de négociation salariale afin de modéliser des situations réelles d’une manière plus précise. Dans le Chapitre 1, nous présentons les objectifs principaux de cette dissertation. Dans le Chapitre 2, nous offrons un bref aperçu de la littérature sur les modèles de négociation, plus précisément des modèles de négociation salariale. Nous rappelons les approches axiomatiques et stratégiques des modèles de négociation et étudions en détail l’approche stratégique des modèles de négociation salariale. Dans le Chapitre 3, nous étudions le modèle de négociation salariale avec des préférences qui varient dans le temps. Tout d’abord, nous analysons les équilibres en sous-jeu parfait dans le modèle, d’autre part, nous déterminons les gains d’équilibre en sous-jeux parfaits des parties. Par ailleurs, nous étudions les équilibres inefficaces dans le modèle. Dans le Chapitre 4, nous étudions quelques extensions du modèle de négociation salariale généralisé. Premièrement, nous analysons les négociations salariales avec les actions de “go-slow” et étudions les gains d’équilibre en sous-jeux parfaits. Par ailleurs, nous étudions un modèle de négociation salariale où la firme a l’option de “lockouts”. Dans le Chapitre 5, nous appliquons les modèles de négociation de salaires généralisés aux problèmes de la vie réelle, comme les négociations de prix. Dans le Chapitre 6, nous présentons les conclusions et donnons de nouvelles perspectives à nos recherches futures. / This Ph.D. dissertation develops important contributions to the literature on wage bargaining. We introduce discount rates varying in time to the wage bargaining models in order to model real life situations in a more accurate way. In Chapter 1, we state the main objectives of this dissertation. In Chapter 2, we deliver a brief literature overview of bargaining models, more precisely wage bargaining models. We recall axiomatic and strategic approaches to bargaining and then describe in details strategic approach to wage bargaining models. In Chapter 3, we investigate the wage bargaining model with preferences varying in time. First, we analyze subgame perfect equilibria in the model and then determine the subgame perfect equilibria payoffs of the parties. Furthermore, we study the inefficient equilibria in the model. In Chapter 4, we investigate some extensions of the generalized wage bargaining model. First, we analyze wage bargaining with the go-slow actions of the union and study the subgame perfect equilibrium payoffs. Next, we investigate a wage bargaining model where the firm has the lockout option. In Chapter 5, we apply the generalized wage bargaining models to real life problems, such as price negotiations. In Chapter 6, we present conclusions and give new insights to our future research.

In this thesis we study two probabilistic models defined on graphs: the Stochastic Block model and the Exponential Random Graph. Therefore, this thesis is divided in two parts. In the first part, we introduce the Krichevsky-Trofimov estimator for the number of communities in the Stochastic Block Model and prove its eventual almost sure convergence to the underlying number of communities, without assuming a known upper bound on that quantity. In the second part of this thesis we address the perfect simulation problem for the Exponential random graph model. We propose an algorithm based on the Coupling From The Past algorithm using a Glauber dynamics. This algorithm is efficient in the case of monotone models. We prove that this is the case for a subset of the parametric space. We also propose an algorithm based on the Backward and Forward algorithm that can be applied for monotone and non monotone models. We prove the existence of an upper bound for the expected running time of both algorithms. / Nessa tese estudamos dois modelos probabilísticos definidos em grafos: o modelo estocástico por blocos e o modelo de grafos exponenciais. Dessa forma, essa tese está dividida em duas partes. Na primeira parte nós propomos um estimador penalizado baseado na mistura de Krichevsky-Trofimov para o número de comunidades do modelo estocástico por blocos e provamos sua convergência quase certa sem considerar um limitante conhecido para o número de comunidades. Na segunda parte dessa tese nós abordamos o problema de simulação perfeita para o modelo de grafos aleatórios Exponenciais. Nós propomos um algoritmo de simulação perfeita baseado no algoritmo Coupling From the Past usando a dinâmica de Glauber. Esse algoritmo é eficiente apenas no caso em que o modelo é monotóno e nós provamos que esse é o caso para um subconjunto do espaço paramétrico. Nós também propomos um algoritmo de simulação perfeita baseado no algoritmo Backward and Forward que pode ser aplicado à modelos monótonos e não monótonos. Nós provamos a existência de um limitante superior para o número esperado de passos de ambos os algoritmos.

Abstract With the current technological advancements, stage is being set for new ultra-responsive and robust 5G-enabled applications (e.g., virtual reality, Tactile Internet,…) to deliver critical real-time traffic. The emergence of such critical applications requires new networking models that can handle more connected devices with super high reliability and low latency communications. In the view of these research challenges, this thesis aims to propose new techno-economic models and networking paradigms needed in the redesign of wireless network architectures and protocols to support the connectivity requirements by which operators and users effectively benefit from new opportunities introduced by 5G-enabled applications. In this thesis, new paradigms in wireless network access are presented and analyzed. First, dynamic network architecture (DNA) is introduced, where certain classes of wireless terminals can be turned temporarily into an access point (AP) anytime while connected to the Internet. In this concept, a framework is proposed to optimize different aspects of this architecture. Furthermore, to dynamically reconfigure an optimum topology and adjust it to the traffic variations, a new specific encoding of genetic algorithm (GA) is presented. Then, a distributed user-centric spectrum sharing is developed based on DNA networks to enable user-provided access points pervasively share the unused resources. Next, a flexible cloud-based radio access network (FRAN) is proposed to offload traffic to DNA networks in order to provide low latency communications. In the sequel of the thesis, as a new paradigm, a context-aware resource allocation scheme based on adaptive spatial beamforming and reinforcement learning is proposed. In addition, semi-cognitive radio network (SCRN) as a new spectrum sharing model is developed to improve the utility of primary and secondary owners. / Tiivistelmä Nykyaikaisilla teknologisilla edistysaskeleilla mahdollistetaan uusien 5G-pohjaisien erittäin lyhyen vasteajan ja suuren luotettavuuden sovelluksien ilmestyminen kriittisen reaaliaikaisen informaation välittämiseen (esim. taktiiliset ja virtuaalitodellisuus-sovellukset). Näiden kaltaiset sovellukset vaativat uudenlaisia verkottumismalleja, jotka kykenevät käsittelemään enemmän laitteita suurella toimintavarmuudella ja matalalla latenssilla. Tämä väitöskirja ehdottaa näiden haasteiden valossa uusia teknis-taloudellisia malleja ja verkottumisparadigmoja, joita tarvitaan verkkoarkkitehtuurien ja -protokollien uudelleensuunnittelussa tulevaisuuden sovelluksien tarpeet huomioiden, joiden kautta operaattorit ja käyttäjät voivat hyödyntää tulevien 5G-sovelluksien tuomat mahdollisuudet. Tässä väitöskirjassa esitetään ja analysoidaan uusia paradigmoja langattomaan verkkoliityntään. Ensimmäisenä esitellään dynaaminen verkkoarkkitehtuuri (dynamic network architecture, DNA), missä tietyt langattomat terminaalit voidaan väliaikaisesti muuttaa liityntäpisteiksi milloin vain internetyhteyden ollessa käytettävissä. Tämän konseptin puitteissa ehdotetaan viitekehys sen eri osa-alueiden optimoimiseksi. Tämän lisäksi esitetään uusi spesifinen geneettisen algoritmin (GA) koodaus optimaalisen topologian dynaamiseen konfigurointiin ja sen säätämiseen tietoliikenteen määrän mukaan. Tämän jälkeen esitellään kehitetty hajautettu käyttäjäkeskeinen spektrinjako, joka perustuu DNA-verkkoihin ja joka mahdollistaa käyttämättömien resurssien kokonaisvaltaisen jakamisen käyttäjien kautta. Seuraavaksi työssä ehdotetaan joustavaa pilvipalvelu-pohjaista liityntäverkkoa (flexible cloud-based radio access network, FRAN) käyttäjädatan purkamiseksi DNA-verkoille matalalatenssisen tietoliikenteen tarjoamiseksi. Edellä mainittujen menetelmien seurauksena ehdotetaan uutta paradigmaa: Kontekstiriippuvaista resurssien allokointia perustuen adaptiiviseen spatiaaliseen keilanmuodostukseen ja vahvistusoppimiseen. Näiden lisäksi kehitetään uusi spektrinjakomalli puolikognitiivisille radioverkoille (semi-cognitive radio network, SCRN) ensisijaisien ja toissijaisien käyttäjien utiliteetin parantamiseksi.

This thesis addresses primary concepts in the humanitarian intervention debates. I argue that humanitarian intervention is a perfect duty. The global community has a moral obligation to act decisively in the face of extreme human rights abuses. There are two contrasting theoretical perspectives regarding international relations and humanitarian intervention: statism and cosmopolitanism. These contrasting perspectives contest the relative value of state sovereignty and human rights. Some of the most prominent ethicists in the debate have determined states have a “right” to intervene militarily in the internal affairs of other states to halt severe human rights abuses but there is no “duty”to intervene. These conclusions are largely based upon consequentialist considerations. This thesis argues a deontological perspective is essential. References to events Rwanda, Darfur, and Kosovo are made. There is a critical role for preemptive actions to play in addressing humanitarian crises and calls for global justice.

Le but de cette thèse est de reconstruire l’ensemble des questionnements théoriques qui sont présupposés par les auteurs qui participent de la réception des Seconds Analytiques au XIIIème siècle. Étant donné que la doctrine contenue dans cet ouvrage d’Aristote est difficile à interpréter de manière systématique, il est inévitable que sa réception progressive ait été guidée par des questionnements métaphysiques et gnoséologiques plus ou moins partagés par les auteurs mentionnés. Ma recherche est une tentative pour retracer ces questionnements, le but étant de proposer une reconstruction systématique de l’ensemble de la théorie contenue dans les commentaires des Seconds Analytiques de la période mentionnée. Cette reconstruction systématique offre une vision unifiée de l’ensemble des thèmes traités grâce à l’identification d’une question générale qui déterminerait l’orientation des questions spécifiques. L’auteur sur lequel la plupart des analyses sont concentrées est Thomas d’Aquin, mais le but étant de comprendre les questions qui guident la tradition des commentaires du XIIIème, Robert Grosseteste et Albert le Grand ont une place spéciale dans cette recherche. La thèse proposée est que la question précise qui est censée être répondue par ces commentaires est celle de savoir quelles doivent être les caractéristiques d’une connaissance parfaite. Par conséquent, les doctrines développées dans ces commentaires ne chercheraient pas à proposer une méthode de connaissance certaine de la réalité. Les propriétés d’une démonstration concernant sa forme et le contenu des propositions qui la composent se limiteraient à décrire un idéal de connaissance parfaite. / The aim of this thesis is to reconstruct the set of theoretical questionings supposed by the authors who participate in Posterior Analytics’ reception during the 13th century. Considering that the doctrine contained in this Aristotle’s work is difficult to interpret in a systematical approach is inevitable that its progressive reception would have been guided by metaphysics and epistemological questionings, partially shared by these authors. The present research is an attempt to track down these questionings, with the objective of proposing a systematic reconstruction of the theory contained in the commentaries of the Posterior Analytics during that period. This systematic reconstruction offers a unified vision of the aspects assessed in this investigation. This due to the identification of a general question which would determine the orientation of specific ones. Thomas Aquinas is the author about whom most of the analyses are focused. But always considering the aim of comprehending questions which guide all this tradition of comments, two other comments have been studied: Robert Grosseteste and Alberto the Great. The thesis proposed is that the Posterior Analytics’ reception during the 13th century, reflects an attempt to answer the following question: which characteristics must a perfect knowledge possess? In accordance with this thesis, the doctrines developed in commentaries regarding this Aristotle’s work did not seek to propose a method of true knowledge of reality. The properties of a demonstration, regarding its shape and content of the propositions that compose it, would describe an ideal of perfect knowledge.

Possible areas of improving the efficiencies of the Lincoln University flame weeder are identified and investigated. The Hoffmann burner initially used in the Lincoln University flame weeder was found not to entrain sufficient air to allow complete combustion of the LPG used. A new burner, the Modified Lincoln University burner, was designed to improve the entrainment of air. Results show that the new design entrained sufficient air to theoretically allow complete combustion of the LPG, and this resulted in a 22.7% increase in heat output per Kg of LPG used over the Hoffmann burner. Temperature x time exposure constants required to kill weeds 0 - 15, 15 - 30, and 30 - 45 mm in size, were found to be respectively 750, 882, and 989 degrees Celsius.Seconds. These constants can be used to calculate the maximum speed of travel an operator can use a flame weeder at, once the temperature profile underneath its shields are established at various travel speeds, and therefore ensure that the flame weeder is used at its maximum efficiency. The constants can also be used to establish the cost efficiency of any flame weeder (in $/Ha), depending on the size of the weeds to be treated. The materials and methods used in establishing the temperature x time exposure constants can be used to establish the temperature x time exposure constant of any weed species at any size.

Software radios (SWR) have been proposed for wireless communication systems to enable them to operate according to incompatible wireless communication standards by implementing most analog functions in the digital section on software-reprogrammable hardware. However, this significantly increases the required computations for SWR functionality, mainly because of the digital front-end computationally intensive filtering functions, such as sample rate conversion (SRC), channelization, and equalization. For increasing the computational efficiency of SWR systems, two new SRC methods with better performance than conventional SRC methods are presented. In the first SRC method, we modify the conventional CIC filters to enable them to perform SRC on slightly oversampled signals efficiently. We also describe a SRC method with high efficiency for SRC by factors greater than unity at which SRC in SWR systems may be computationally demanding. This SRC method efficiently increases the sample rate of wideband signals, especially in SWR base station transmitters, by applying Lagrange interpolation for evaluating output samples hierarchically using a low-rate signal that is computed with low cost from the input signal. A new channelizer/synthesizer is also developed for extracting/combining frequency multiplexed channels in SWR transceivers. The efficiency of this channelizer/synthesizer, which uses modulated perfect reconstruction (PR) filter banks, is higher than polyphase filter banks (when applicable) for processing few channels, and significantly higher than discrete filter banks for processing any number of variable-bandwidth channels where polyphase filter banks are inapplicable. Because the available methods for designing modulated PR filter banks are inapplicable due to the required number of subchannels and stopband attenuation of the prototype filters, a new design method for these filter banks is introduced. This method is reliable and significantly faster than the existing methods. Modulated PR filter banks are also considered for implementing a frequency-domain block blind equalizer capable of equalizing SWR signals transmitted though channels with long impulse responses and severe intersymbol interference (ISI). This blind equalizer adapts by using separate sets of weights to correct for the magnitude and phase distortion of the channel. The adaptation of this blind equalizer is significantly more reliable and its computational requirements increase at a lower rate compared to conventional time-domain equalizers making it efficient for equalizing long channels that exhibit severe ISI.