Design of Pulsed Electroacoustic Measurement System for Space Charge Characterisation

Pulsed electroacoustic (PEA) method is a commonly used non-destructive technique for investigating space charges. It has been developed since early 1980s. These days there is continuing interest for better understanding of the influence of space charge on the reliability of solid electrical insulation under high electric field. The PEA method is widely used for space charge profiling for its robust and relatively inexpensive features. The PEA technique relies on a voltage impulse used to temporarily disturb the space charge equilibrium in a dielectric. The acoustic wave is generated by charge movement in the sample and detected by means of a piezoelectric film. The spatial distribution of the space charge is contained within the detected signal. The principle of such a system is already well established, and several kinds of setups have been constructed for different measurement needs. This thesis presents the design of a PEA measurement system as a systems engineering project. The operating principle and some recent developments are summarised. The steps of electrical and mechanical design of the instrument are discussed. A common procedure for measuring space charges is explained and applied to verify the functionality of the system. The measurement system is provided as an additional basic research tool for the Corporate Research Centre of ABB (China) Ltd. It can be used to characterise flat samples with thickness of 0.2–0.5 mm under DC stress. The spatial resolution of the measurement is 20 μm.

Loss Modelling of Three-Level Inverters controlled with Space Vector Modulation Technique

The objective of this master’s thesis is to investigate the loss behavior of three-level ANPC inverter and compare it with conventional NPC inverter. The both inverters are controlled with mature space vector modulation strategy. In order to provide the comparison both accurate and detailed enough NPC and ANPC simulation models should be obtained. The similar control model of SVM is utilized for both NPC and ANPC inverter models. The principles of control algorithms, the structure and description of models are clarified. The power loss calculation model is based on practical calculation approaches with certain assumptions. The comparison between NPC and ANPC topologies is presented based on results obtained for each semiconductor device, their switching and conduction losses and efficiency of the inverters. Alternative switching states of ANPC topology allow distributing losses among the switches more evenly, than in NPC inverter. Obviously, the losses of a switching device depend on its position in the topology. Losses distribution among the components in ANPC topology allows reducing the stress on certain switches, thus losses are equally distributed among the semiconductors, however the efficiency of the inverters is the same. As a new contribution to earlier studies, the obtained models of SVM control, NPC and ANPC inverters have been built. Thus, this thesis can be used in further more complicated modelling of full-power converters for modern multi-megawatt wind energy conversion systems.

Quantum Tomography with Phase Space Measurements

This thesis addresses the use of covariant phase space observables in quantum tomography. Necessary and sufficient conditions for the informational completeness of covariant phase space observables are proved, and some state reconstruction formulae are derived. Different measurement schemes for measuring phase space observables are considered. Special emphasis is given to the quantum optical eight-port homodyne detection scheme and, in particular, on the effect of non-unit detector efficiencies on the measured observable. It is shown that the informational completeness of the observable does not depend on the efficiencies. As a related problem, the possibility of reconstructing the position and momentum distributions from the marginal statistics of a phase space observable is considered. It is shown that informational completeness for the phase space observable is neither necessary nor sufficient for this procedure. Two methods for determining the distributions from the marginal statistics are presented. Finally, two alternative methods for determining the state are considered. Some of their shortcomings when compared to the phase space method are discussed.

Muukalainen aviovuoteessa : I married a monster for outer space (1958) ja invaasioelokuvan sukupuolittuneet todellisuudet

Teemanumero 1/2011 : Kauhut ja pelot.

Analysis and validation of space averaged drag model for numerical simulations of gas-solid flows in fluidized beds

This thesis presents an approach for formulating and validating a space averaged drag model for coarse mesh simulations of gas-solid flows in fluidized beds using the two-fluid model. Proper modeling for fluid dynamics is central in understanding any industrial multiphase flow. The gas-solid flows in fluidized beds are heterogeneous and usually simulated with the Eulerian description of phases. Such a description requires the usage of fine meshes and small time steps for the proper prediction of its hydrodynamics. Such constraint on the mesh and time step size results in a large number of control volumes and long computational times which are unaffordable for simulations of large scale fluidized beds. If proper closure models are not included, coarse mesh simulations for fluidized beds do not give reasonable results. The coarse mesh simulation fails to resolve the mesoscale structures and results in uniform solids concentration profiles. For a circulating fluidized bed riser, such predicted profiles result in a higher drag force between the gas and solid phase and also overestimated solids mass flux at the outlet. Thus, there is a need to formulate the closure correlations which can accurately predict the hydrodynamics using coarse meshes. This thesis uses the space averaging modeling approach in the formulation of closure models for coarse mesh simulations of the gas-solid flow in fluidized beds using Geldart group B particles. In the analysis of formulating the closure correlation for space averaged drag model, the main parameters for the modeling were found to be the averaging size, solid volume fraction, and distance from the wall. The closure model for the gas-solid drag force was formulated and validated for coarse mesh simulations of the riser, which showed the verification of this modeling approach. Coarse mesh simulations using the corrected drag model resulted in lowered values of solids mass flux. Such an approach is a promising tool in the formulation of appropriate closure models which can be used in coarse mesh simulations of large scale fluidized beds.

Reflexive Space. A Constructionist Model of the Russian Reflexive Marker

This study examines the structure of the Russian Reflexive Marker ( ся/-сь) and offers a usage-based model building on Construction Grammar and a probabilistic view of linguistic structure. Traditionally, reflexive verbs are accounted for relative to non-reflexive verbs. These accounts assume that linguistic structures emerge as pairs. Furthermore, these accounts assume directionality where the semantics and structure of a reflexive verb can be derived from the non-reflexive verb. However, this directionality does not necessarily hold diachronically. Additionally, the semantics and the patterns associated with a particular reflexive verb are not always shared with the non-reflexive verb. Thus, a model is proposed that can accommodate the traditional pairs as well as for the possible deviations without postulating different systems. A random sample of 2000 instances marked with the Reflexive Marker was extracted from the Russian National Corpus and the sample used in this study contains 819 unique reflexive verbs. This study moves away from the traditional pair account and introduces the concept of Neighbor Verb. A neighbor verb exists for a reflexive verb if they share the same phonological form excluding the Reflexive Marker. It is claimed here that the Reflexive Marker constitutes a system in Russian and the relation between the reflexive and neighbor verbs constitutes a cross-paradigmatic relation. Furthermore, the relation between the reflexive and the neighbor verb is argued to be of symbolic connectivity rather than directionality. Effectively, the relation holding between particular instantiations can vary. The theoretical basis of the present study builds on this assumption. Several new variables are examined in order to systematically model variability of this symbolic connectivity, specifically the degree and strength of connectivity between items. In usage-based models, the lexicon does not constitute an unstructured list of items. Instead, items are assumed to be interconnected in a network. This interconnectedness is defined as Neighborhood in this study. Additionally, each verb carves its own niche within the Neighborhood and this interconnectedness is modeled through rhyme verbs constituting the degree of connectivity of a particular verb in the lexicon. The second component of the degree of connectivity concerns the status of a particular verb relative to its rhyme verbs. The connectivity within the neighborhood of a particular verb varies and this variability is quantified by using the Levenshtein distance. The second property of the lexical network is the strength of connectivity between items. Frequency of use has been one of the primary variables in functional linguistics used to probe this. In addition, a new variable called Constructional Entropy is introduced in this study building on information theory. It is a quantification of the amount of information carried by a particular reflexive verb in one or more argument constructions. The results of the lexical connectivity indicate that the reflexive verbs have statistically greater neighborhood distances than the neighbor verbs. This distributional property can be used to motivate the traditional observation that the reflexive verbs tend to have idiosyncratic properties. A set of argument constructions, generalizations over usage patterns, are proposed for the reflexive verbs in this study. In addition to the variables associated with the lexical connectivity, a number of variables proposed in the literature are explored and used as predictors in the model. The second part of this study introduces the use of a machine learning algorithm called Random Forests. The performance of the model indicates that it is capable, up to a degree, of disambiguating the proposed argument construction types of the Russian Reflexive Marker. Additionally, a global ranking of the predictors used in the model is offered. Finally, most construction grammars assume that argument construction form a network structure. A new method is proposed that establishes generalization over the argument constructions referred to as Linking Construction. In sum, this study explores the structural properties of the Russian Reflexive Marker and a new model is set forth that can accommodate both the traditional pairs and potential deviations from it in a principled manner.

Hakkeen kuivaus ennen varastointia ja biopolttoaineterminaalin suunnittelu

Lempäälään aiotaan rakentaa uusi kaukolämpölaitos, jossa polttoaineena käytettäisiin haketta. Nykyään Lempäälässä tuotetaan kaukolämpöä maakaasulla, jonka käyttämisestä halutaan siirtyä käyttämään lähialueilta saatavaa biopolttoainetta. Tässä työssä halutaan selvittää, mitä hyötyjä saataisiin hakkeen koneellisesta kuivauksesta. Työn toisena tavoitteena on suunnitella ja pohtia biopolttoaineterminaalin rakentamista sekä käsitellä hakkeen varastointia yleensä. Työssä tutustutaan hakkeeseen aiheesta kertovan kirjallisuuden avulla. Työssä on myös laskettu hakkeen kuivauksesta saatavia hyötyjä hakkeen lämpöarvoon sekä energiatiheyteen. Erityisesti perehdytään metsätähdehakkeeseen, rankahakkeeseen, kuorihakkeeseen sekä sahanpuruun. Laskelmien tuloksista on havaittu, että suurin hyöty hakkeen energiatiheyden parantumisessa saadaan kun hake kuivataan 35 % kosteuspitoisuuteen. Tämän jälkeen energiatiheyden paraneminen tapahtuu hitaammin. Hakkeen kuivauksesta saadaan myös muita hyötyjä kuin energiatiheyden paraneminen. Kuivan hakkeen käsittelyn ja varastoinnin on havaittu olevan vaivattomampaa kuin märän hakkeen. Biopolttoaineterminaalin ja voimalaitoksen tulisi sijaita rinnakkain, jotta hakkeen kuivauksesta saadaan mahdollisimman kustannustehokasta. Näin ollen syntyisi myös säästöjä hakkeen kuljetuksen suhteen. Biopolttoaineterminaalin rakentamista varten tarvittaisiin tilaa alustavien laskelmien perusteella noin yksi hehtaari. Työssä on myös laskettu biopolttoaineterminaalin rakentamisesta aiheutuvia kustannuksia sekä hakkeen kuljetuksesta koituvia logistiikka kustannuksia. Haketerminaalin ja voimalaitoksen sijaintia Lempäälässä on myös kartoitettu.

Plan B from Outer Space - InsomniaGame-pelin suunnittelu ja toteutus 2010–2011

InsomniaGame oli Turun yliopiston digitaalisen kulttuurin oppiaineen ja Insomnia verkkopeliyhdistyksen yhteistyössä vuosina 2010 ja 2011 toteuttama pelikonseptikokeilu. InsomniaGame oli osa laajempaa ”CoEx: Yhteisöllistä tekemistä tukevat tilat kokemusten jakamisessa” kaksivuotista (1.10.2009–31.12.2011) hanketta, jonka toteuttivat yhteistyössä Turun yliopiston Porin yksikkö, Tampereen teknillisen yliopiston Porin yksikkö ja Tampereen yliopisto. Hankkeen tavoitteena oli toteuttaa sosiaalista mediaa, yhteisöllisyyttä ja lisättyä todellisuutta hyödyntäviä virtuaalisia ja julkisia tiloja, joissa käyttäjät voivat jakaa kokemuksia. Tutkimus on luonteeltaan soveltava pro gradu -tutkielma, joka sisältää kaksi vuotta kestäneen ja kaksi pelisovellusta sisältävän työosuuden. InsomniaGame koostui erilaisista pelaajien suorittamista tehtävistä, pelialustasta sekä taustatarinasta. Päätutkimuskysymykset ovat: Mitkä tekijät vaikuttivat pelisuunnitteluprosessiin ja miten? Työ esittelee InsomniaGame-pelin kehityksen. Erityistarkastelussa ovat suunnitteluprosessin ja pelin sisällölliset muutokset sekä niihin vaikuttaneet tekijät. Pelin kehitys perustui pääasiassa erilaisiin dokumentteihin, joita käytettiin suunnittelun apuvälineenä sekä viestinnässä projektin eri toimijoiden kesken. Tutkimus pyrkii syntyneiden dokumenttien sekä pelisuunnittelijoiden muistin perusteella rekonstruoimaan InsomniaGame-pelisovelluksen kehityskaaren. InsomniaGamen kehityksessä oli monia tekijöitä, jotka muuttuivat sen kehityskaaren aikana. Itse pelin sisältö, kuten myös suunnittelutapa, muuttuivat kahden vuoden aikana huomattavasti. Pelillä oli myös monia erityispiirteitä, jotka tekevät sen kehityksestä ainutlaatuisen, sillä esimerkiksi pelin testaaminen yhtenä kokonaisuutena oli mahdotonta. Lisäksi peli oli tutkimus- ja yhteistyöprojekti, jossa oli mukana monia eri toimijoita ja erityisesti tutkimuksessa korostuu yhteistyökumppani Insomnia verkkopeliyhdistyksen osallisuus. InsomniaGamen kummankaan vuoden toteutus ei sujunut odotetulla tavalla, mikä osaltaan vaikutti etenkin jälkimmäisen vuoden pelin suunnitteluun. Varsinainen suunnittelutyö kuitenkin eteni ensimmäisenä vuonna käytetyn mallin mukaisesti, mutta kuitenkin niin että alkuperäiset oletukset pelisuunnittelusta ja lopputuloksesta muuttuivat. Tämän vuoksi peliprojektia voi paikoitellen luonnehtia jopa kaoottiseksi, ja erityisesti toteutusvaiheessa jouduttiin luomaan nopealla aikataululla uusia toimintamalleja. Työ toimii mallina tuleville peliprojekteille, mutta erityisen tärkeää olisi luoda yhtenäinen kehitysalusta vastaavanlaisia projekteja varten.

Lagrangian multipliers for coast-arcs of optimum space trajectories

Some properties of generalized canonical systems - special dynamical systems described by a Hamiltonian function linear in the adjoint variables - are applied in determining the solution of the two-dimensional coast-arc problem in an inverse-square gravity field. A complete closed-form solution for Lagrangian multipliers - adjoint variables - is obtained by means of such properties for elliptic, circular, parabolic and hyperbolic motions. Classic orbital elements are taken as constants of integration of this solution in the case of elliptic, parabolic and hyperbolic motions. For circular motion, a set of nonsingular orbital elements is introduced as constants of integration in order to eliminate the singularity of the solution.

Numerical and experimental investigation of thermal louvers for space applications

Thermal louvers, using movable or rotating shutters over a radiating surface, have gained a wide acceptance as highly efficient devices for controlling the temperature of a spacecraft. This paper presents a detailed analysis of the performance of a rectangular thermal louver with movable blades. The radiative capacity of the louver, determined by its effective emittance, is calculated for different values of the blades opening angle. Experimental results obtained with a prototype of a spacecraft thermal louver show good agreement with the theoretical values.

Design Space Exploration for MPSoC Architectures

Multiprocessor system-on-chip (MPSoC) designs utilize the available technology and communication architectures to meet the requirements of the upcoming applications. In MPSoC, the communication platform is both the key enabler, as well as the key differentiator for realizing efficient MPSoCs. It provides product differentiation to meet a diverse, multi-dimensional set of design constraints, including performance, power, energy, reconfigurability, scalability, cost, reliability and time-to-market. The communication resources of a single interconnection platform cannot be fully utilized by all kind of applications, such as the availability of higher communication bandwidth for computation but not data intensive applications is often unfeasible in the practical implementation. This thesis aims to perform the architecture-level design space exploration towards efficient and scalable resource utilization for MPSoC communication architecture. In order to meet the performance requirements within the design constraints, careful selection of MPSoC communication platform, resource aware partitioning and mapping of the application play important role. To enhance the utilization of communication resources, variety of techniques such as resource sharing, multicast to avoid re-transmission of identical data, and adaptive routing can be used. For implementation, these techniques should be customized according to the platform architecture. To address the resource utilization of MPSoC communication platforms, variety of architectures with different design parameters and performance levels, namely Segmented bus (SegBus), Network-on-Chip (NoC) and Three-Dimensional NoC (3D-NoC), are selected. Average packet latency and power consumption are the evaluation parameters for the proposed techniques. In conventional computing architectures, fault on a component makes the connected fault-free components inoperative. Resource sharing approach can utilize the fault-free components to retain the system performance by reducing the impact of faults. Design space exploration also guides to narrow down the selection of MPSoC architecture, which can meet the performance requirements with design constraints.

Neutronisäteilylle altistuminen käytetyn polttoaineen siirrossa Olkiluodon voimalaitoksella

Tässä työssä on tutkittu OL1/OL2-ydinvoimalaitosten käytetyn polttoaineen siirrossa aiheutuvaa altistusta neutronisäteilylle. Käytetty polttoaine siirretään vedellä täytetyssä käytetyn polttoaineen siirtosäiliössä Castor TVO:ssa OL1/OL2-laitoksilta käytetyn polttoaineen varastolle. Siirtotyön aikana useat eri ammattiryhmiin kuuluvat henkilöt työskentelevät siirtosäiliön välittömässä läheisyydessä, altistuen käytetystä polttoaineesta emittoituvalle fotoni- ja neutronisäteilylle. Aikaisemmista neutronisäteilyannosten mittauksista on todettu, ettei jatkuvalle altistuksen seurannalle ole ollut tarvetta. Tämän työn tarkoitus on selvittää teoreettisilla laskelmilla siirtotyöhön osallistuvan henkilön mahdollisuus saada kirjausrajan ylittävä annos neutronisäteilyä. Neutronisäteilyn annosnopeudet siirtosäiliötä ympäröivässä tilassa on laskettu yhdysvaltalaisella Monte Carlo-menetelmään perustuvalla MCNP-ohjelmalla. MCNP:llä mallinnettiin siirtosäiliö, siirtosäiliön sisältämä polttoaine ja ympäröivä tila kolmella jäähtymisajalla ja kolmella keskimääräisellä maksimipoistopalamalla. Polttoainenippujen isotooppikonsentraatiot ja säteilylähteiden voimakkuudet on laskettu Studsvik SNF-ohjelmalla. Simuloinnin perusteella voidaan todeta, ettei neutronisäteilyannosten jatkuvalle seurannalle ole tarvetta käytetyn polttoaineen siirrossa. Vaikka neutronisäteilyn annosnopeudet voivat nousta siirtosäiliön läheisyydessä suhteellisen suuriksi, ovat siirtosäiliön lähellä tehtävät työt niin lyhytaikaisia, että kirjausrajan ylitystä voidaan pitää hyvin epätodennäköisenä. Johtopäätökset varmistetaan työssä suunnitellulla mittausjärjestelyllä.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.