Meillä ei ole ikuisia ystäviä eikä ikuisia vihollisia. Ikuisia ovat meidän omat etumme. : Suomen suhteet Kiinan kansantasavaltaan 1949 - 1989

"We have neither Eternal Friends nor Eternal Enemies. We have only Eternal Interests .Finland's Relations with China 1949-1989 The study focuses on the relations between Finland and the People s Republic of China from 1949-1989 and examines how a small country became embroiled in international politics, and how, at the same time, international politics affected Finnish-Chinese relations and Finland s China policy formulation. The study can be divided into three sections: relations during the early years, 1949-1960, before the Chinese and Soviet rift became public; the relations during the passive period during the 1960s and 1970s; and the impact of China s Open Door policy on Finland s China policy from 1978-1989. The diplomatically challenging events around Tiananmen Square and the reactions which followed in Finland bring the study to a close. Finland was among the first Western countries to recognise the People s Republic and to establish diplomatic relations with her, thereby giving Finland an excellent position from which to further develop good relations. Finland was also the first Western country to sign a trade agreement with China. These two factors meant that Finland was able to enjoy a special status with China during the 1950s. The special status was further strengthened by the systematic support of the government of Finland for China's UN membership. The solid reputation earned in the 1950s had to carry Finland all the way through to the 1980s. For the two decades in between, during the passive policy period of the 1960s and 1970s, relations between Finland and the Soviet Union also determined the state of foreign relations with China. Interestingly, however, it appeared that President Urho Kekkonen was encouraged by Ambassador Joel Toivola to envisage a more proactive policy towards China, but the Cultural Revolution cut short any such plan for nearly twenty years. Because of the Soviet Union, Finland held on to her passive China policy, even though no such message was ever received from the Soviet Union. In fact, closer relationships between Finland and China were encouraged through diplomatic channels. It was not until the presidency of Mauno Koivisto that the first high-level ministerial visit was made to China when, in 1984, Foreign Minister Paavo Väyrynen visited the People s Republic. Finnish-Chinese relations were lifted to a new level. Foreign Minister Väyrynen, however, was forced to remove the prejudices of the Chinese. In 1985, when the Speaker of the Finnish Parliament, Erkki Pystynen visited China he also discovered that Finland s passive China policy had caused misunderstandings amongst the Chinese politicians. The number of exchanges escalated in the wake of the ground-breaking visit by Foreign Minister Väyrynen: Prime Minister Kalevi Sorsa visited China in 1986 and President Koivisto did so in 1988. President Koivisto stuck to practical, China-friendly policies: his correspondence with Li Peng, the attitude taken by the Finnish government after the Tiananmen Square events and the subsequent choices made by his administration all pointed to a new era in relations with China.

Groteski suomalaisessa kirjallisuudessa : Neljä tapaustutkimusta

The grotesque in Finnish literature. Four case studies The topic of the dissertation is the grotesque in Finnish literature. The dissertation is twofold. Firstly, it focuses on the genre tradition of the grotesque, especially its other main branch, which has been named, following in Bakhtin s footsteps, subjective ( chamber ) grotesque, to be distinguished from carnivalistic ( public square ) grotesque. Secondly, the dissertation analyses and interprets four fictional literary works within the context of the grotesque genre, constructed on the basis of previous research and literature. These works are the novel Rakastunut rampa (1922) by Joel Lehtonen, the novel Prins Efflam (1953, transl. into Finnish as Kalastajakylän prinssi) by Sally Salminen, the short story Orjien kasvattaja (1965) by Juhani Peltonen, and the novel Veljeni Sebastian (1985) by Annika Idström. What connects these stirring novels, representing early or full modernism, is the supposition that they belong to the tradition of the subjective grotesque, not only due to occasional details, but also in a more comprehensive manner. The premises are that genre is a significant part of the work and that reading a novel in the context of the genre tradition adds something essential to the interpretation of individual texts and reveals meanings that might otherwise go unnoticed. The main characteristic of the grotesque is breaking the norm. This is accomplished through different means: degradation, distortion, inversion, combination, exaggeration and multiplication. The most significant strategy for breaking the norm is incongruence: the grotesque combines conflicting or mutually exclusive categories and elements on different levels. Simultaneously, the grotesque unravels categorisations and questions our way of perceiving the world. The grotesque not only poses a threat to one s identity, but can also pose a threat to the cognitive process. An analysis of the fictional works is presented as case studies of each chosen work as a whole. The analysis is based on the method of close reading, which draws on both classical and postclassical narratology, and the analysis and interpretation are expanded within the genre tradition of the grotesque. The grotesque is also analysed in terms of its relationship to the neighbouring categories and genre traditions, such as the tragic, the sublime, the horror story and the coming-of-age story. This dissertation shows how the grotesque is constructed repeatedly on deviations from the norm as well as on incongruence, also in the works analysed, and how it stratifies in these novels on and between different levels, such as the story, text, narration, composition and the world of the novels. In all the works analysed, the grotesque reduces and subverts. Again and again it reveals different sides of humanity stripped of idealisation and glorification. The dissertation reveals that Finnish literature is not a solitary island, even regarding the grotesque, for it continues and offers variations of the common tradition of grotesque literature, and likewise draws on grotesque visual arts. This dissertation is the first monograph in Finnish literature research focusing on the subjective grotesque.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Zur Wiedergabe von Helsinkier Toponymen in den deutschen Übersetzungen von drei finnischen Romanen

Tutkielma keskittyy tarkastelemaan, kuinka Helsingin erilaiset paikannimet on välitetty kaunokirjallisuuden saksannoksissa kohdekieliselle lukijalle. Helsingin paikannimiin lukeutuvat tutkielmassa mm. Helsingissä tai pääkau-punkiseudulla sijaitsevien katujen, kaupunginosien, tunnettujen tavaratalojen ja ravintoloiden, julkisten rakennusten ja patsaiden nimet. Tutkimusmateriaalina on kolme suomenkielistä romaania ja niiden saksankieliset käännökset: Joel Haahtelan Perhoskerääjä (Der Schmetterlingssammler), Kari Hotakaisen Juoksuhaudantie (Aus dem Leben eines unglücklichen Mannes) ja Outi Pakkasen Punainen pallotuoli (Der rote Sessel). Yhteistä näille kolmelle kaunokirjalliselle teokselle on, että niiden tapahtumat sijoittuvat Helsinkiin. Tutkimusmateriaalin keskeisenä valintakriteerinä on ollut, että kunkin romaanin on saksantanut eri kääntäjä. Tutkielman tarkoitus on havainnollistaa esimerkein deskriptiivis-kvalitatiivisesti, kuinka kääntäjä voi toimia, kun lähtöteksti sisältää pulmia tuottavia kulttuurisidonnaisia paikannimiä. Tutkielman teoriaosuudessa tarkastellaan paikannimiä kulttuurisidonnaisina käännösongelmina sekä esitellään, millaisia funktioita paikannimillä voi olla kaunokirjallisessa teoksessa. Teoriaosuudessa pohditaan myös aiempien teorioiden avulla, ovatko paikannimet ylipäätään käännettävissä vieraalle kielelle. Lisäksi esitetään käännöstieteellisiä näkemyksiä siitä, kuinka kääntäjän olisi välitettävä kaunokirjallisen lähtötekstin paikannimet kohdekieleen. Helsingin katujen nimeämisperiaatteita esitellään lyhyesti historian ja nykyajan valossa keskittyen tutkielman kannalta relevantteihin nimiin. Tutkimusmateriaalin analyysin yhtenä perustana on Bödekerin ja Freesen (1987) luoma prototypologia, jossa käännösratkaisuja tarkastellaan ensin leksikaalisella tasolla ja sitten lähtö- ja kohdekielen välisenä etäisyytenä. Kujamäki (1998) on omassa tutkimuksessaan kehittänyt tätä prototypologiaa eteenpäin sulauttamalla yhteen nämä molemmat ulottuvuudet. Samalla hän on jakanut käännösstrategiat yksityiskohtaisempiin luokkiin: vieras-sanalaina (Fremdwortübernahme), käännöslaina (Lehnübersetzung), selittävä kääntäminen (erklärendes Übersetzen), analogia (Anwendung einer Analogie in der Zielsprache), hyperonyyminen käännös (hyperonymische Übersetzung), kohyponyyminen käännös (kohyponymische Übersetzung), assosioiva käännös (assoziative Übersetzung), poisto (Auslassung) ja lisäys (Hinzufügung), jotka toimivat tässä tutkielmassa käännösratkaisujen tarkastelun lähtökohtana. Kujamäen (1998) luokituksesta poiketen lisään luokitukseen puolittaisen käännöslainan (Halblehnübersetzung), määrittelen selittävän kääntämisen luokan siten, että siihen sisältyvät sekä eksplikaatio (Explikation) että kiertoilmaus (Umschreibung), ja jätän Kujamäen käyttämän lisäyksen pois. Analyysissä pyritään esittelemään kulloisenkin paikannimen funktio tekstiympäristössään, minkä pohjalta tarkastellaan kääntäjien tekemiä ratkaisuja. Edellä mainitun luokituksen ohella tuon jokaisen käännösratkaisun kohdalla esiin Bödekerin ja Freesen (1987) luokituksen mukaisen luokkayhdistelmän, jota kulloinenkin kääntäjän tekemä valinta edustaa. Lopputuloksena on pääteltävissä, että ensisijaisesti paikannimen funktio tekstissä vaikuttaa siihen, kuinka nimi välitetään käännöksessä kohdekieliselle lukijalle. Lopuksi todetaan vielä, ettei tämän tutkielman perusteella voi antaa suosituksia, kuinka tulisi toimia välitettäessä kaunokirjallisen tekstin paikannimiä kohdekieleen, vaan tarkoitus havainnollistaa, mitä mahdollisuuksia kääntäjällä on, ja jokainen ratkaisu on punnittava kontekstissaan.

Tax havens and their impacts on the non-haven countries

Tax havens have attracted increasing attention from the authorities of non-haven countries. The financial crisis exacerbates the negative attitude to tax havens. Offshore zones are now under strong pressure from the international, both financial and political institutions. Thus, the thesis will focus on the current problem of the modern economy, namely tax havens and their impact on the non-haven countries. This thesis will be based on the several articles, in particular “Tax Competition With Parasitic Tax Havens” by Joel Slemrod and John D. Wilson (University of Michigan, 2009) and “Do Havens Divert Economic Activity” by James R. Hines Jr., C. Fritz Foley and Mihir A. Desai (Ross School of Business, 2005). This paper provides two completely different and contradictory viewpoints on the problem of coexisting tax havens and non-haven countries. There are two models, examined in this work, present two important researches. The first one will be concentrated on the positive effect from tax havens whereas the last model will be focused on the completely negative effect from offshore jurisdictions. The first model gives us a good explanation and proof of its statement why tax havens can positively influence on nearby high-tax countries. It describes that the existence of offshore jurisdictions can stimulate the growth of operations and facilitates economic activity in non-haven countries. In contrast to above mentioned, the model with quite opposite view was presented. This economic model and its analysis confirms the undesirability of the existence of offshore areas. Taking into consideration, that the jurisdictions choose their optimal policy, the elimination of offshores will have positive impact on the rest of countries. The model proofs the statement that full or partial elimination of tax havens raises the equilibrium level of the public good and increases country welfare. According to the following study, it can be concluded that both of the models provide telling arguments to prove their assertions. Thereby both of these points of view have their right to exist. Nevertheless, the ongoing debate concerning this issue still will raise a lot of questions.

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 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.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

Nonequilibrium stationary states of harmonic chains with bulk noises

We consider a chain composed of $N$ coupled harmonic oscillators in contact with heat baths at temperature $T_\ell$ and $T_r$ at sites 1 and $N$ respectively. The oscillators are also subjected to non-momentum conserving bulk stochastic noises. These make the heat conductivity satisfy Fourier's law. Here we describe some new results about the hydrodynamical equations for typical macroscopic energy and displacement profiles, as well as their fluctuations and large deviations, in two simple models of this type.