The aim of this thesis is to investigate the possibility to improve the separation of HCl and SO2 in the dry ue-gas treatment for boiler #3 at Fortum's thermal power plant in Hogdalen; by using a model predictive control instead of a PID controller to govern the slaked lime injection. To achieve this an ARMAX model was derived using MATLAB's System Identi cation Toolbox and measurements of the incoming and outgoing levels of HCl, SO2 and the speed of the injection motor. The ARMAX model was then converted to a state space model which will be used as the internal model for the MPC predictions. The cost function was a quadratic problem which included the error between the output and the set points, the change rate of the input and the inputs deviation from a default value. The MPC uses both a feedforward and a feedback loop to estimate the error over the prediction horizon. The controller also utilizes the ability to set constraints and tuning of the cost function weights. In conclusion, the thesis shows that a MPC controlled lime injection is possible and would o er some unique possibilities such as: natural constraints handling, more intuitive live tuning for the operator and prioritized input control. However the dry scrubber still struggles to suppress high amounts of incoming SO2 and since the project lacked a measuring unit for incoming HCl concentration the results showing an improvements in pollution separation was not conclusive. / Under 2011 utförde Fortum en ombyggnation av Panna 3 för att oka energiproduktionen vid Högdalens värmeverk. Detta ledde till ett okat rökgasflöde genom pannans rökgasrening och Fortum har sedan ombyggnationen noterat en försämrad separation av väteklorid (HCl) och svaveldioxid (SO2) i den torra rökgasreningen. I den torra rökgasreningen (torr skrubber) tillsatts släckt kalk till rökgaskanalen som sedan reagerar med HCl och SO2. Reaktionen mellan kalk och HCl/SO2 skapar ett fast ämne som kan filtreras med ett filter. Detta projekt har undersökt möjligheten att förbättra separationen av HCl och SO2 i den torr skrubbern genom att använda en prediktive regulator för att styra kalkinmatningen istället för en PID regulator. Projektet inleddes med att skapa en matematisk modell som beskriver sambandet mellan inkommande HCl, SO2 och kalk och utgående HCl och SO2. För att åstadkomma detta så mättes indata och utdata för att sedan användas i MATLAB's System Identification Toolbox som sedan skapade en ARMAX (Autoregressive Moving Average Extra signal) modell. Denna modell konverterades sedan till en tillståndsmodell för att bättre passa ändamålet som en intern modell i MPC regulatorn. Nästa steg var att sätta ihop själva regulatorn som styr hastigheten av de motorer som matar in kalk i rökgaskanalen i MATLAB Simulink. Denna regulator har till uppgift att hitta den optimala förändringen av motorhastigheten som gör så att utsignalen håller sig på en önskad referensnivå. Detta utförs genom att ställa upp en så kallad kostnadsfunktion som associerar en fiktiv kostnad till att avvika från referensnivån, att föreslå en stor ändring av motorhastigheten eller att avvika från en önskad motorhastighet. Kostnadsfunktionen ar formulerad som kvadratisk problem som MPC regulatorn försöker lösa för att hitta den optimala insignalen till systemet. Med andra ord så försöker regulatorn att hitta den minsta andringen av motorhastigheten som bidrar till den minsta avvikelsen från önskad motorhastighet och minsta avvikelsen mellan utsignal och referensnivå _a. Den framtagna regulatorn använder sig av både framkoppling och återkoppling för att estimera summan av de nuvarande och förväntade avvikelsen mellan utsignal och referensnivå. Regulatorn använder sig också av restriktioner som begränsar hastigheten på motorn och hur snabbt regulatorn kan andra den tidigare motorhastigheten. Detta betyder att regulatorn kommer endast att föreslå en förändring av hastigheten som ligger inom systemets restriktioner. Denna rapport kommer i jämförelsesyfte också att presentera en simulation av den existerande PID regulatorn. Resultaten från denna rapport kommer att innehålla den framtagna tillståndsmodellen, en skiss over den implementerade MPC regulatorn, den kod som utför själva optimeringen samt diagram från simuleringar av MPC och PID regulatorerna. I dessa resultat visade det sig att MPC regulatorn lyckas _åstadkomma marginellt bättre kontroll over utgående SO2 samt en mer exakt kontroll av utgående HCl. Det skall dock noteras att dessa resultat ar baserade på simuleringar och kan komma att andras i en verklig implementation. Aven med små förbättringar av utsläppsvärdena så erbjuder MPC regulatorn några intressanta möjligheter. En MPC regulator kan hantera restriktioner i processen mycket mer naturligt an PID regulatorn. Den kan också justeras under drift av operatören samt prioriterat val av kontrollsignal. Med prioriterat val av kontrollsignal menas att det ar möjligt att förknippa olika kostnader till era olika kontrollsignaler i kostnadsfunktionen. Detta skulle medföra att regulatorn prioriterar en andringar av den kontrollsignal som medför den minsta kostnaden under rådande omständigheter.

During the last years, multi-carrier modulations have raised a particular interest due to their high spectral efficiency and the possible assumption of flat frequency fading. The most broadly used multi-carrier modulation is the CP-OFDM. It allows very simple equalizations methods and MIMO transcoders which keep orthogonality between carrier waveforms. However, it does not allow any waveform flexibility and is not fully spectrally efficient. Due to the low waveform flexibility its performance is quite limited in scenarios like the frequency division multiple accesses. In order to improve its performance in this case, it is important to have a multi-carrier modulation with the possibility to have a waveform well localized in time and frequency. Grey analysis shows that the only way to get both full spectral efficiency and waveforms well localized in both time and frequency domain is to give up the orthogonality in the complex field. Using filter bank multi-carrier (FBMC) with Offset-QAM (OQAM) is one combination which achieves this task. In this thesis, we study this modulation, how it is possible to efficiently modulate and demodulate it but also the transcoder (pre-coder, equalizer or both) that can be used when transmitting through multi-tap and MIMO channels. Another modulation, based on FBMC with OQAM, cyclic offset-QAM (COQAM) tries to make a tradeoff between spectral efficiency and simplicity of the equalization and transcoding methods. In this thesis, FBMC based modulation schemes are tested through different scenario: unsynchronized multi-users, unsynchronized uplink, multitaps channels, SIMO, MISO and MIMO channels. COQAM is tested with some of these scenario when it is considered as relevant to test it. / Under senare år har intresset för multi-carrier modulering ökat på grund av dess höga spektrumeffektivitet under antagandet om slät frekvensfäding. Den vanligaste multicarrier moduleringen i praktiken är CP-OFDM. Denna modulering tillåter användning av enkla equalizeringsmetoder och MIMO transkodare vilket behåller ortogonalitet mellan vågformerna. Däremot tillåter den inte någon flexibilitet i val av vågform och är inte heller helt spektraleffektiv. På grund av inflexibilitet i val av vågform är dess prestanda begränsad under till exempel frekvensmultiplexing (FDMA). För att förbättra prestandan hos CP-OFDM ¨ar det viktigt att ha en modulering med möjlighet att en vågform begränsad i både tid och frekvens. Grey analys visar att det enda sättet att uppnå full spektrumeffektivitet, i kombination med vågformer som är väl begränsade i både tid och frekvens, är att ge upp ortogonaliteten i komplexa fältet. Filter Bank Multi-Carrier (FBMC) med Offset-QAM (OQAM) är ett alternativ som uppnår detta. I den här avhandlingen studeras just denna modulation, hur det är möjligt att göra effektiv modulation och demodulation, men också hur dess equalizer, pre-kodare och transkoder används vid multi-tap och MIMO-kanaler. En annan modulation, baserad på FBMC med OQAM, är cyclisk offset-QAM (COQAM). COQAM försöker göra avvägning mellan spektral effektivitet och enkelhet av utjämnings- och transkodrar metoder. I den här avhandlingen studeras både FBMC-baserade modulationer och COQAM i en rad olika scenarios: osynkroniserade multianvändare, osynkroniserad upplänk, flera vägar kanaler, SIMO, MISO och MIMO-kanaler.

The installed wind power capacity has increased rapidly over the last decades and wind power now has a strong impact on the European electric system. The development of wind power is expected to continue in the coming decades and it is therefore crucial to correctly take it into account in network simulations of the future system. Metrix is a model used at EDF R&D for technical and economical simulations of the European electric system. It uses a multi-scenario approach that aims at calculating different possible states of the network for a chosen moment in the future. Until this master thesis, the generation of the wind farms was the same in all the scenarios. This does not reflect the high variability of wind power generation and does not allow to correctly simulate the effects of wind power on the system. The goal of the project presented in this report is to integrate a multiscenario approach of wind power with spatial variations in Metrix in order to represent a range of wind power situations that is representative of what might happen at a simulated moment in the future. The chosen method consists of using wind scenarios from the past, applying them to the future wind park and integrating them in the scenarios used in the simulations. The database of wind situations used in this project allows to have 13 wind zones over Europe. An analysis of the seasonal and diurnal cycles of wind power generation is performed for the abovementioned purpose. The methodology is applied to the study of the winter peak and leads to the choice of up to 1092 suitable wind power scenarios. Then, statistical methods are used to estimate the number of scenarios that is necessary to reach the desired accuracy in the simulation results. Finally, the benefits of the proposed approach of wind power are demonstrated by showing how it allows to analyse the impact of wind power generation on different system quantities and components.

From an energy eciency viewpoint of improving the cellular access networks, the power consumption of the whole system needs to be tracked. In this project, a theoretical model is studied which jointly encompasses sleep control strategy and Base Station (BS) cooperation polices, our goal is to obtain a Pareto Op- timal tradeo between energy consumption and average delay time. Based on the trac load variation, the sleep control strategy is proposed by adjusting the BS working mode. This project focuses on the multi-cell network which is more close to the real world. In multi-cell scenario, except for the design of the sleep control, the issues of BS cooperation and the inter-cell interference also need to be covered. Furthermore, based on the multi-cell network, three types of energy saving strategies are considered: In case I, users only can be served by their own Base stations (BSs) which go to sleep mode when there is no ac- tive user and will not wake up until N users need to be served. This strategy leads to a good energy performance but the long delay. To reduce the average delay, therefore, in case II, we introduced the user association policies that the network handover the user to his adjacent BSs when his own BS is in the sleep mode. Furthermore, the relay-assisted network was studied in the case III. Fi- nally, Based on theoretical and simulation results, we compared these tree cases under the given trac conditions from the perspective of achieving the optimal average energy-delay tradeo . And also we found out that sacricing network throughput can yield the energy saving if we carefully design the network. / Ur energie ektivitetssynpunkt att frbttra de cellulra accessnten, mste e ekt- frbrukningen fr hela systemet som ska spras. I detta projekt r en teoretisk modell studerat vilka tillsammans omfattar smnkontrollstrategi och basstatio- nen (BS) samarbetspolitiken, r vrt ml att f en Pareto Optimal avvgning mellan energifrbrukning och genomsnittlig frdrjning. Baserat p trakbelastning varia- tionen r smnkontrollstrategi fresls genom att justera BS arbetslge. Detta projekt fokuserar p multicellntverk som r mer nra den verkliga vrlden. I ercells sce- nario, med undantag fr utformningen av smnkontroll, frgor om BS samarbete och intercell interferens mste ocks tckas. Dessutom bygger p ercellsntverk, r tre typer av sparenergistrategier beaktas: I fall jag, anvndarna endast kan betjnas av egna Basstationer (BSS) som gr till vilolge nr det inte nns ngon aktiv an- vndare och kommer inte vaknar tills N anvndare behver delges. Denna strategi leder till en god energiprestanda men den lnga frseningen. Fr att minska den genomsnittliga frseningen drfr ifall II infrde vi de anvndar freningens policy att ntverket lmnandet anvndaren att hans intilliggande BS nr hans egen BS r i vilolge. Vidare relet assisterade nt studerades i fallet III. Slutligen Baserat p teoretiska och simuleringsresultat, jmfrde vi dessa trd ml enligt de givna trak- frhllandena ur perspektivet att uppn den optimala genomsnittliga energifrdrjn- ings avvgning. Och ven vi ck reda p att o ra ntverksgenomstrmning kan ge energibesparingar om vi noggrant utforma ntverket.

A collisionless model for fast-ion transport in a tokamak reactor is derived from first principles, and a new orbitfollowing code is developed to simulate this model. Results from the model applied on two scenarios of DT fusion plasmas, one from ITER and one from JET, are compared, and the prompt losses as well as the effects of orbit shapes are quantified; it is shown that both the prompt losses and the orbit effect on confined particles are very small in both reactors. Although some problems are still present, the method presented shows potential for further investigating orbit effects. / En modell för kollisionsfri transport av högenergetiska joner i tokamaks har tagits fram, och en ny banlösande kod har utvecklads för att simulera denna model. Resultat från modellen applicerad på två scenarion med DTplasma, ett från ITER och ett från JET, jämförs, och omedelbara förluster samt effekter av inneslutna banors form kvantifieras; både ban- och omedelbara förluster visas vara mycket små i båda reaktorerna. Även om mindre problem återstår att lösa, har metodent pontential för att vidare undersöka baneffekter i fusionsplasman.

The recent studies on sensor networks are causing a huge development of wire-less communications. These studies are motivated by the wide-range promisingapplications. However, this development faces multiple challenges. The privacyissue is one of these challenges. The study on the privacy-constrained sensornetworks is presented in previous works where the eavesdropping privacy risk istaken into account in the physical-layer distributed detection design. Nonethe-less, a rigorous study on the receiver operating characteristics (ROC) is missing.In this thesis, we will focus on a parallel distributed detection networkwith one fusion node that makes the final decision. We show how the fusionROC changes against different settings when considering the privacy constraints.First, a Bayesian detection scenario is considered. Second, some parameters aremodified for the purpose of studying the affect on the ROC. Finally, an otherscenario is analyzed where the eavesdropping is modeled a Neyman-Pearsondetection attach while the settings of the Bayesian distributed with detectionsystem is kept. / De senaste studierna om sensorn ̈atverk ̈ar f ̈oranledd av en snabb utveckling inomtr ̊adl ̈os kommunikation. Studierna motiveras av de lovande till ̈ampningar somfinns inom ett flertal omr ̊aden. Utvecklingen av sensorn ̈atverk st ̊ar dock inf ̈orett antal utmaningar. Den personliga integriteten ̈ar en utav dessa utmaningar.Studien om sekretessbegr ̈ansade sensorn ̈atverk finns presenterad i tidigare verkd ̈ar integritetsrisken vid avlyssnings tas i beaktning inom det f ̈ordelade fysiskalagrets detektionsdesign. Dock saknas en rigor ̈os under ̈okning p ̊a mottagarensdriftegenskaper (ROC).Denna avhandling kommer att fokusera p ̊a ett parallellt distribuerat detek-tionsn ̈atverk med en fusions nod som fattar det slutgiltiga beslutet. Vi visar hurfusions ROC ̈andras med olika inst ̈allningar n ̈ar man tar h ̈ansyn till begr ̈ansadsekretess. F ̈orst studeras ett Bayesianskt detekteringsscenario. Sedan kommervissa parametrar modifieras i syfte att studera dess inverkan p ̊a ROC. Slutligenanalyseras det andra scenariot d ̈ar avlyssningen modelleras som en Neyman-Pearson detektion medan inst ̈allningarna f ̈or det Bayesiansk distribuerade de-tekteringssystemet fortfarande h ̊aller.

Speech signal processing is an old research topic within the communication theory community. The continously increasing telephony market brought special attention to the discipline during the 80’s and 90’s, specially in speech coding and speech enhancement, where the most significant contributions were made. More recently, due to the appearance of novel signal processing techniques, the standard methods are being questioned. Sparse representation of signals and compessed sensing made significant contributions to the discipline, through a better representation of signals and more efficient processing techniques. In this thesis, standard speech modeling techniques are revisited. Firstly, a representation of the speech signal through the line spectral frequencies (LSF) is presented, with a extended stability analysis. Moreover, a new Bayesian framework to time-varying linear prediction (TVLP) is shown, with the analysis of different methods. Finally, a theoretical basis for speech denoising is presented and analyzed. At the end of the thesis, the reader will have a broader view of the speech signal processing discipline with new insights that can improve the standard methodology.

Visual analysis tasks, like detection, recognition and tracking, are com- putationally intensive, and it is therefore challenging to perform such tasks in visual sensor networks, where nodes may be equipped with low power CPUs. A promising solution is to augment the sensor network with pro- cessing nodes, and to distribute the processing tasks among the process- ing nodes of the visual sensor network. The objective of this project is to enable a visual sensor network testbed to operate with multiple cam- era sensors, and to implement an algorithm that computes the allocation of the visual feature tasks to the processing nodes. In the implemented system, the processing nodes can receive and process data from differ- ent camera sensors simultaneously. The acquired images are divided into sub-images, the sizes of the sub-images are computed through solving a linear programming problem. The implemented algorithm performs local optimization in each camera sensor without data exchange with the other cameras in order to minimize the communication overhead and the data computational load of the camera sensors. The implementation work is performed on a testbed that consists of BeagleBone Black computers with IEEE 802.15.4 or IEEE 802.11 USB modules, and the existing code base is written in C++. The implementation is used to assess the performance of the distributed algorithm in terms of completion time. The results show a good performance providing lower average completion time.

In this master thesis project, we study the problem in Visual Sensor Networks in which only limited bandwidth is provided. The task is to search for ways to decrease the transmitting data on the camera side, and distribute the data to dif- ferent nodes. To do so, we extract the interest points on the camera side by using BRISK in- terest point detector, and we distribute the detected interest points into di erent number of processing node by implementing proposed clustering methods, namely, Number Based Clustering, K-Means Clustering and DBSCAN Clustering. Our results show it is useful to extract interest points on the camera side, which can reduce almost three quarters of data in the network. A step further, by imple- menting the clustering algorithms, we obtained the gain in overhead ratio, interest point imbalance and pixel processing load imbalance, respectively. Specically, the results show that none of the proposed clustering methods is better than oth- ers. Number Based Clustering can balance the processing load between di erent processing nodes perfectly, but performs bad in saving the bandwidth resources. K-Means Clustering performs middle in the evaluation while DBSCAN is great in saving the bandwidth resources but leads to a bad processing balance performance among the processing nodes.

Tor is a very popular anonymisation software and network. For which we created Torminator, a fingerprinting suite written in the Java programming language. Fingerprinting is an attack type applicable to Tor utilising side-channel information from the network packets. With side-channel data, we can analytically access information that purportedly been hidden by design by Tor. Because Tor is a low-latency, low-overhead by design, it will leak communication patterns with intermediate (thus total) communication size. In our case this may able us figure out to which site/service the Tor user is using. This means that anyone with access to user’s traffic can use the fingerprinting attack to partly compromise the provided anonymity. By investigating such attacks, it may help us to better understand how to withstand and resist attacks from powerful adversaries such as state agencies. Torminator automatises the process for gathering fingerprints. It uses the official Tor Browser through its GUI to enter websites to recreate the real world scenario. This gives us real and reliable fingerprints without having to employ a human to do anything, as Torminator simulates user interaction on Tor Browser for us. We can also give Torminator a list of websites to fingerprint, making it easy to generate lots of fingerprints for a great number given sites. A contribution of Torminator, is that we improved on the previous de facto standard of the fingerprints collected from the available tools from previous works. We have gathered fingerprints and have now a dataset of 65792 fingerprints. Fingerprints like these can be used with machine learning techniques to teach a machine to recognise web-pages by reading the packet size and directions saved in the fingerprint files.