Ce mémoire s’intéresse aux deux traductions en roumain du roman Kamouraska d’Anne Hébert. La première traduction paraît en Roumanie en 1986 à partir de la version anglaise qu’avait proposée Norman Shapiro en 1973. La deuxième traduction, faite cette fois à partir de la version originale française, paraît en 2008. Notre étude contient une présentation du cadre sociopolitique dans lequel a été faite la première traduction de Kamouraska sous le régime communiste, après quoi nous nous penchons sur le contexte de publication des deux traductions et sur des éléments paratextuels : couvertures, quatrièmes de couverture, préfaces, etc. L’examen des principales caractéristiques du style d’Anne Hébert dans Kamouraska est suivi d’une analyse comparative de quelques extraits significatifs du roman dans la première et la deuxième traductions. Nous présentons ensuite notre version française des deux préfaces aux traductions de Kamouraska : la première est signée par Irina Bădescu, et la seconde, par Cătălin Sturza. La traduction française de ces deux textes vient enrichir notre connaissance de la réflexion critique qui est faite de ce roman partout dans le monde. / Abstract : This M.A. thesis focuses on the two translations of Anne Hébert’s novel Kamouraska into Romanian. Published in Romania in 1986, the first translation was done from the English version that Norman Shapiro proposed in 1973. The second translation, this time done directly from the original French version, was published in 2008. We aim at introducing the political context in which the first translation of Kamouraska was made, more specifically under the Communist regime. We then proceed to present the editorial context of these two translations as well as some of the paratextual elements: covers, back covers, prefaces, etc. A survey of Anne Hébert’s main stylistic features in writing Kamouraska is followed by a comparative analysis of significant excerpts from the novel for the first and the second translation. Afterwards we introduce our French version of the two prefaces to the translations of Kamouraska: the first is signed by Irina Bădescu, and the second by Cătălin Sturza. The French translation of these two introductions enriches the critical understanding that is done of that novel everywhere in the world.

Syftet med denna uppsats är att ta reda på hur vanligt förekommande smilisen är generellt på en chatt och vilka sorter som används. Som ett komplement till detta vill jag även ta reda på om enskilda personer använder många smilisar och hur många sorter dessa representerar. Först redogör jag för tidigare forskning på området och då främst när det gäller ickeverbala signaler och deras motsvarande chattstrategier. Dessutom kategoriserar jag smilisar generellt efter orientering, föreställning, funktion och variation och får på detta sätt en grund att stå på i materialanalys och diskussion. Som motivering till mitt materialval har jag även placerat in olika chattar i tre olika kategorier: parinriktade, gruppinriktade och virtuella världar. Mitt material består av sju dagars loggar från IRC-kanalen #Sweden och omfattar sammanlagt 16582 faktiska inlägg. För att inte påverka resultaten har jag insamlat detta i rollen som spion. Det jag kommer fram till är att smilisar förekommer i 14,5 % av inläggen. Dessa är orienterade både som liggande och stående med en klar övervikt på den förra. Alla tre föreställningar är representerade men föremål och händelser står bara för 1 % av totalen. Även samtliga funktioner används men bara i orienteringen liggande. Slutligen har också variationen av de liggande smilisarna visat sig vara stor. Resultaten komna ur analyser av tre chattare visar sig vara ett bra komplement. En mycket aktiv chattare visar sig endast använda ett fåtal smilisar av ett mycket litet antal sorter. Mindre aktiva chattare använder däremot en större andel smilisar. Smilisen har alltså visat sig vara ett vanligt och ett värdefullt komplement till den reella texten. Den liggande smilisen är till synes helt klart användbarast då den är både enkel att skriva och lätt att förstå. Jag tycker mig också ana att de smilisar som används oftast kan förknippas med genrestilen medan de som endast förekommer sällsynt snarare är tecken på personlig stil. Slutligen argumenterar jag för chattens och sålunda också smilisens fortsatta överlevnad.

The first line of defence against wireless attacks in Radio Frequency Identi cation (RFID) systems is authentication of tags and readers. RFID tags are very constrained in terms of power, memory and size of circuit. Therefore, RFID tags are not capable of performing sophisticated cryptographic operations. In this dissertation, we have designed light-weight authentication schemes to securely identify the RFID tags to readers and vice versa. The authentication schemes require simple binary operations and can be readily implemented in resource-constrained Radio Frequency Identi cation (RFID) tags. We provide a formal proof of security based on the di culty of solving the Syndrome Decoding (SD) problem. Authentication veri es the unique identity of an RFID tag making it possible to track a tag across multiple readers. We further protect the identity of RFID tags by a light-weight privacy protecting identifi cation scheme based on the di culty of the Learning Parity with Noise (LPN) complexity assumption. To protect RFID tags authentication against the relay attacks, we have designed a resistance scheme in the analog realm that does not have the practicality issues of existing solutions. Our scheme is based on the chaos-suppression theory and it is robust to inconsistencies, such as noise and parameters mismatch. Furthermore, our solutions are based on asymmetric-key algorithms that better facilitate the distribution of cryptographic keys in large systems. We have provided a secure broadcast encryption protocol to effi ciently distribute cryptographic keys throughout the system with minimal communication overheads. The security of the proposed protocol is formally proven in the adaptive adversary model, which simulates the attacker in the real world.

Physical layer network coding (PNC) was proposed under the two-way relay hannel (TWRC) scenario, where two sources exchange information aided by a relay. PNC allows the two sources to transmit to the relay simultaneously, where superimposed signals at the relay can be mapped to network-coded symbols and then be broadcast to both sources instead of being treated as interference. Concurrent transmissions using PNC achieve a higher spectrum efficiency compared to time division and network coding solutions. Existing research mainly focused on the symmetric PNC designs, where the same channel coding and modulation configurations are applied by both sources. When the channel conditions of the two source-relay links are asymmetric or unequal amount of data are exchanged, heterogeneous modulation PNC designs are necessary. In additional, the design and optimization of multi-hop PNC, where multiple relays forming a multi-hop path between the two sources, remains an open issue. The above issues motivate the study of this dissertation. This dissertation investigates the design of heterogeneous modulation physical layer network coding (HePNC), the integration of channel error control coding into HePNC, the combination of HePNC with hierarchical modulation, and the design and generalization of multi-hop PNC. The contributions of this dissertation are four-fold. First, under the asymmetric TWRC scenario, where the channel conditions of the two source-relay links are asymmetric, we designed a HePNC protocol, including the optimization of the adaptive mapping functions and the bit-symbol labeling, to minimize the end-to-end BER. In addition, we developed an analytical framework to derive the BER of HePNC. HePNC can substantially enhance the throughput compared to the existing symmetric PNC under the asymmetric TWRC scenario. Second, we investigated channel coded HePNC and integrated the channel error control coding into HePNC in a link-to-link coding, where the relay tries to decode the superimposed codewords in the multi-access stage. A full-state sum-product decoding algorithm is proposed at the relay based on the repeat-accumulate codes to guarantee reliable end-to-end communication. Third, we proposed hierarchical modulation PNC (H-PNC) under asymmetric TWRC, where additional data exchange between the relay and the source with the relatively better channel condition is achieved in addition to that between the two end sources, benefiting from superimposing the additional data flow on the PNC transmission. When the relay also has the data exchange requirement with the source with a better source-relay channel, H-PNC outperforms HePNC and PNC in terms of the system sum throughput. Fourth, we designed and generalized multi-hop PNC, where multiple relays located in a linear topology are scheduled to support the data exchange between two end sources. The impact of error propagation and mutual interference among the nodes are addressed and optimized. The proposed designs outperform the existing ones in terms of end-to-end BER and end-to-end throughout. / Graduate

This diploma thesis analyzes the deep web environment with the use of business models from the surface web. In the indroduction part of the thesis summarize terms web, deep web and dark web, these terms are intermingle the entire thesis, also brings the concept on Onion routing with use of Tor software. An inseparable part is the comparsion of tools which can be used for access to the dark web. The main part of the thesis analyzes most used business models on the surface web including their methods of monetization and after that author tries to apply these models in the dark web environment. An importat part of this work is the analysis a type of services occuring on the dark web and mutual comparison of several sub-criteria of each service. In the final part the thesis presents project Turris on which is applied to create a relay node for the Tor network.

The thesis is concerned with capacity and coverage enhancement of OFDMA heterogeneous cellular systems with a specific focus on fractional frequency reuse (FFR), femtocells and amplify-and-forward (AF) relay systems. The main aim of the thesis is to develop new mathematical analysis for the spectral efficiency and outage probability of multi-cells multi-tier systems in diverse traffic, interference and fading scenarios. In the first part of the thesis, a new unified mathematical framework for performance analysis of FFR and soft frequency reuse (SFR) schemes is developed. This leads to new exact expressions of FFR and SFR area spectral efficiency in downlink and uplink scenarios which account for a mixture of frequency reuse factors in a homogeneous cellular system. The mathematical framework is extended to include modelling and performance analysis of FFR systems with elastic data traffic. Further analysis is carried out in relation to the performance of FFR and/or SFR schemes, in terms of energy efficiency and base station cooperation. The new proposed analytical framework can lead to a better understanding and computationally efficient performance analysis of next generation heterogeneous cellular systems. Next generation cellular systems are characterized by an increase in the spatial node density to improve the spectral efficiency and coverage, especially for users at home and at the cell edges. In this regard, relays and femtocells play a major role. Therefore, relays and femocells are the focus of the second part of the thesis. Firstly, we present a new and unified spectral efficiency analysis in dual-hop fixed-gain AF relay systems over generalised interferences models. The generalised interference models are either based on the Nakagami-m fading with arbitrary distance or on spatial Poisson Point Process in case of randomly deployed heterogeneous interferers. The models have been considered separately in the open literature due to the complexity of the mathematical analysis. Secondly, the outage probability is utilised to deduce the femtocell exclusion region for FFR system and a new static resource allocation scheme is proposed for femtocells which improve the capacity. The work presented in the thesis has resulted in the publication of seven scientific papers in prestigious IEEE journals and conferences.

In this work, the problem of relay selection and resource power allocation in one- way and two-way cognitive relay networks using half duplex channels with different relaying protocols is investigated. Optimization problems for both single and multiple relay selection that maximize the sum rate of the secondary network without degrading the quality of service of the primary network by respecting a tolerated interference threshold were formulated. Single relay selection and optimal power allocation for two-way relaying cognitive radio networks using decode-and-forward and amplify-and-forward protocols were studied. Dual decomposition and subgradient methods were used to find the optimal power allocation. The transmission process to exchange two different messages between two transceivers for two-way relaying technique takes place in two time slots. In the first slot, the transceivers transmit their signals simultaneously to the relay. Then, during the second slot the relay broadcasts its signal to the terminals. Moreover, improvement of both spectral and energy efficiency can be achieved compared with the one-way relaying technique. As an extension, a multiple relay selection for both one-way and two-way relaying under cognitive radio scenario using amplify-and-forward were discussed. A strong optimization tool based on genetic and iterative algorithms was employed to solve the 
formulated optimization problems for both single and multiple relay selection, where discrete relay power levels were considered. Simulation results show that the practical and low-complexity heuristic approaches achieve almost the same performance of the optimal relay selection schemes either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity.

In this thesis, we investigate two different system infrastructures in underlay cognitive radio network, in which two popular techniques, cross-layer design and cooperative communication, are considered, respectively. In particular, we introduce the Aggressive Adaptive Modulation and Coding (A-AMC) into the cross-layer design and achieve the optimal boundary points in closed form to choose the AMC and A-AMC transmission modes by taking into account the Channel State Information (CSI) from the secondary transmitter to both the primary receiver and the secondary receiver. What’s more, for the cooperative communication design, we consider three different relay selection schemes: Partial Relay Selection, Opportunistic Relay Selection and Threshold Relay Selection. The Probability Density Functions (PDFs) of the Signal-to- Noise Ratio (SNR) in each hop for different selection schemes are provided, and then the exact closed-form expressions for the end-to-end packet loss rate in the secondary link considering the cooperation of the Decode-and-Forward (DF) relay for different relay selection schemes are derived.

Mechanical and electrical stresses reduce the life of all devices. The lifetime of some devices is affected by these stress factors more, others less. For high voltage products, it's not just a lifetime or a price, but a security that should be the first. This thesis deals with protection of elements of high voltage switchboards. Specifically, it is a PWC600 Point-on-Wave Controller that attempts to minimize stress when connecting or disconnecting loads or generators.

In-band full-duplex, by which radios may simultaneously transmit and receive over the same channel, has been always considered practically-unfeasible due to the prohibitively strong self-interference. Indeed, a freshly-generated transmit signal power is typically ten orders of magnitude higher than that of a naturally-attenuated received signal. While unable to manage such an overwhelming interference, wireless communications resorted to half-duplex operation, transmitting and receiving over orthogonal channel resources. Recent research has demonstrated the practical feasibility of full-duplexing via successive sophisticated stages of signal suppression/cancellation, bringing this long-held assumption down and reviving the promising full-duplex potentials. Full-duplex relaying (FDR), where intermediate nodes may now support source-destination communication via simultaneous listening/forwarding, represents one of two full-duplex settings currently recommended for deployment in future fifth-generation (5G) systems. Theoretically, it has been widely accepted that FDR potentially doubles the channel capacity when compared to its half-duplex counterpart. Although FDR doubles the multiplexing gain, the effective signal-to-noise ratio (SNR) can be significantly degraded due to the residual self-interference (RSI) if not properly handled. In this work, efficient protocols are devised for different FDR settings. Selective cooperation is proposed for the canonical three-terminal FDR channel with RSI, which exploits the cooperative diversity offered by the independently fading source/relay message replicas arriving at the destination. Closed-form expressions are derived for the end-to-end SNR cumulative distribution function (CDF) under Rayleigh and Nakagami-m fading. Further, the offered diversity gain is presented as a function of the RSI scaling trend with the relay power. We show that the existing diversity problem in simple FDR protocols can be considerably fixed via block transmission with selective cooperation. Beyond the single-relay setting, the outage performance of different opportunistic full-duplex relay selection (FDRS) protocols is also evaluated under Rayleigh and Nakagami-m fading. It is shown that, with state-of-the-art adaptive self-interference cancellation techniques, FDRS can offer the same diversity order of its half-duplex rival while supporting a higher level of spectral efficiency. FDRS is also analyzed when adopted by a spectrum-sharing secondary system while the primary spectrum user imposes an additional interference constraint. Finally, buffer-aided hybrid half-/full-duplex cooperation is addressed. To maximize the end-to-end throughput, joint duplexing mode and link selection is studied where the system leverages the buffer and outage state information at the transmitters. All theoretic findings are corroborated with numerical simulations, with comparisons to existing protocols.