Adaptive tree multigrids and simplified spherical harmonics approximation in deterministic neutral and charged particle transport

A new deterministic three-dimensional neutral and charged particle transport code, MultiTrans, has been developed. In the novel approach, the adaptive tree multigrid technique is used in conjunction with simplified spherical harmonics approximation of the Boltzmann transport equation. The development of the new radiation transport code started in the framework of the Finnish boron neutron capture therapy (BNCT) project. Since the application of the MultiTrans code to BNCT dose planning problems, the testing and development of the MultiTrans code has continued in conventional radiotherapy and reactor physics applications. In this thesis, an overview of different numerical radiation transport methods is first given. Special features of the simplified spherical harmonics method and the adaptive tree multigrid technique are then reviewed. The usefulness of the new MultiTrans code has been indicated by verifying and validating the code performance for different types of neutral and charged particle transport problems, reported in separate publications.

Coherent quasiparticle approximation cQPA and nonlocal coherence

We show that the dynamical Wigner functions for noninteracting fermions and bosons can have complex singularity structures with a number of new solutions accompanying the usual mass-shell dispersion relations. These new shell solutions are shown to encode the information of the quantum coherence between particles and antiparticles, left and right moving chiral states and/or between different flavour states. Analogously to the usual derivation of the Boltzmann equation, we impose this extended phase space structure on the full interacting theory. This extension of the quasiparticle approximation gives rise to a self-consistent equation of motion for a density matrix that combines the quantum mechanical coherence evolution with a well defined collision integral giving rise to decoherence. Several applications of the method are given, for example to the coherent particle production, electroweak baryogenesis and study of decoherence and thermalization.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

A simple local 3-approximation algorithm for vertex cover

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. (c) 2009 Elsevier B.V. All rights reserved.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

My Fair Lady på skandinaviska : En studie i funktionell sångöversättning

The dissertation presents a functional model for analysis of song translation. The model is developed on the basis of an examination of theatrical songs and a comparison of three translations: the songs of the Broadway musical My Fair Lady (Lerner and Loewe, 1956), made for the premiere productions (1959–1960) in Swedish, Danish, and Norwegian. The analysis explores the three challenges of a song translator: the fitting of a text to existing music, the consideration of a prospective sung performance, and the verbal approximation of the content of the source lyric. The theoretical foundation is based on a functional approach to translation studies (Christiane Nord) and a structuralist/semiotic analysis of a theatrical message (Ivo Osolsobě, building on Roman Jakobson). Thus, three functional levels in the fitting of a text to music are explored: first, a prosodic/phonetic format; secondly, a poetic/rhetoric format; and thirdly, semantic/reflexive values (verbalizing musical expression). Similarly, three functional levels in the textual connections to a prospective performance are explored: first, a presentational goal; secondly, the theatrical potential; and thirdly, dramaturgic values (for example dramatic information and linguistic register). The functionality of Broadway musical theatre songs is analyzed, and the song score of My Fair Lady, source and target lyrics, is studied, with an in-depth analysis of seven of the songs. The three translations were all considered very well-made and are used in productions of the musical to this day. The study finds that the song translators appear to have worked from an understanding of the presentational goal, designed their target texts on the prosodic and poetic shape of the music, and pursued the theatrical functionality of the song, not by copying, but by recreating connections to relevant contexts, partly independently of the source lyrics, using the resources of the target languages. Besides metaphrases (closest possible transfer), paraphrases and additions seem normally to be expected in song translation, but song translators may also follow highly individual strategies – for example, the Norwegian translator is consistently more verbally faithful than the Danish and Swedish translators. As a conclusion, it is suggested that although linguistic and cultural difference play a significant role, a translator’s solution must nevertheless be arrived at, and assessed, in relation to the song as a multimedial piece of material. As far as a song can be considered a theatrical message – singers representing the voice, person, and situation of the song – the descriptive model presented in the study is also applicable to the translation of other types of song.