Ajan sisäkkäiset tilat. Arkkitehtuuri, valokuva ja menneisyyden esittäminen W. G. Sebaldin romaanissa Austerlitz

In her thesis, Kaisa Kaakinen analyzes how the German emigrant author W. G. Sebald (1944-2001) uses architecture and photography in his last novel "Austerlitz" to represent time, history and remembering. Sebald describes time in spatial terms: it is like a building, the rooms and chambers of which are connected to each other. The poetics of spatial time manifests itself on multiple levels of the text. Kaakinen traces it in architectural representations, photographic images, intertextuality, as well as in the form of the text, using the concept of spatial form by Joseph Frank. Architectural and photographic representations serve as meeting points for different aspects and angles of the novel and illustrate the idea of a layered present that has multiple connections to the past. The novel tells a story of Jacques Austerlitz, who as a small child was sent from Prague to Britain in one of the so-called Kindertransports that saved children from Central Europe occupied by the National Socialists. Only gradually he remembers his Jewish parents, who have most likely perished in Nazi concentration camps. The novel brings the problematic of writing about another person's past to the fore by the fact that Austerlitz's story is told by an anonymous narrator, Austerlitz's interlocutor, who listens to and writes down Austerlitz's story. Kaakinen devotes the final part of her thesis to study the demands of representing a historical trauma, drawing on authors such as Dominick LaCapra and Michael Rothberg. Through the analysis of architectural and photographic representations in the novel, she demonstrates how Austerlitz highlights the sense of singularity and inaccessibility of memories of an individual, while also stressing the necessity - and therefore a certain kind of possibility - of passing these memories to another person. The coexistence of traumatic narrowness and of the infinity of history is reflected in ambivalent buildings. Some buildings in the novel resemble reversible figures: they can be perceived simultaneously as ruins and as construction sites. Buildings are also shown to be able to both cover and preserve memories - an idea that also is repeated in the use of photography, which tends to both replace memories and cause an experience of the presence of an absent thing. Commenting and critisizing some recent studies on Sebald, the author develops a reading which stresses the ambivalence inherent in Sebald's view on history and historiography. Austerlitz shows the need to recognize the inevitable absence of the past as well as the distance from the experiences of others. Equally important, however, is the refusal to give up narrating the past: Sebald's novel stresses the necessity to preserve the sites of the past, which carry silent traces of vanished life. The poetics of Austerlitz reflects the paradox of the simultaneous impossibility and indispensability of writing history.

E. G. Gulinin ekumeeninen työ ja ajattelu

This study explores ecumenical activity of professor and bishop E. G. Gulin (1893 1975). Gulin was one of the key figures in the Finland s Evangelical Lutheran Church during the twentieth century. He was also one of the leading persons who imported ecumenical influences from abroad. However, unlike other churches, the Church of Finland did not recognise his importance. For example, in the 1950s Gulin was seen by the Anglicans as a future archbishop for the Evangelical Lutheran Church of Finland. Gulin s career as an ecumenist can be divided to three parts. Between 1917 and 1929, Gulin learned ecumenical working methods in Finland s World Student Christian Federation. He had a background in the revivalist movement, and his parents supported him in his studies. The Evangelical Lutheran Church did not originally play a major role for Gulin, although he was a member. Between 1930 and 1944, Gulin had more and more responsibility as a leading ecumenist in Finland. He became a member of Finland s ecumenical board, Yleiskirkollinen toimikunta. During the Second World War Gulin tried to solicit assistance for Finland s war effort at theological conferences, where Finnish theologians often discussed cooperation among Christians. A third period started in 1945, when Gulin became the bishop of Tampere. His new status in the Evangelical Lutheran Church placed him in a challenging position in ecumenical questions. He had responsibility for inter-church aid in Finland. He also participated in the World Council of Churches (WCC) assemblies in Evanston in 1954 and in New Delhi in 1961. Gulin s role was quite insignificant in those meetings. Closely related to Gulin s texts about ecumenism is kokemus, experience. Gulin wrote about his ecumenical experience or ekumeeninen kokemus. He believed that it was vital for the churches to appreciate their own experiences, since experience was the basis for further development. Yet Gulin mentioned very little about Christian dogma. The main reason seems to have been that he did not believe that a union between churches could be built on dogma.

IL-10 in Human Newborns : Ontogeny of IL-10 secretion and relation to the secretion of IFN-g, immunoglobulin M, G, and A, and mononuclear cell composition in newborns

The purpose of this work was to elucidate the ontogeny of interleukin-10 (IL-10) secretion from newborn mononuclear cells (MCs), and to examine its relation to the secretion of interferon-g (IFN-g) and immunoglobulins (Igs). The initial hypothesis was that the decreased immunoglobulin (Ig) synthesis of newborn babies was the result of immature cytokine synthesis regulation, which would lead to excessive IL-10 production, leading in turn to suppressed IFN-g secretion. Altogether 57 full-term newborns and 34 adult volunteers were enrolled. Additionally, surface marker compositions of 29 premature babies were included. Enzyme-linked immunoassays were used to determine the amount of secreted IL-10, IFN-g, and Igs, and the surface marker composition of MC were analyzed with a FACScan flow cytometer. The three most important findings were: 1. Cord blood MC, including CD5+ B cells, are able to secrete IL-10. However, when compared with adults, the secretion of IL-10 was decreased. This indicates that reasons other than excessive IL-10 secretion are responsible of reduced IFN-g secretion in newborns. 2. As illustrated by the IL-10 and IFN-g secretion pattern, newborn cytokine profile was skewed towards the Th2 type. However, approximately 25% of newborns had an adult like cytokine profile with both good IL10 and IFN-g secretion, demonstrating that fullterm newborns are not an immunologically homogenous group at the time of birth. 3. There were significant differences in the surface marker composition of MCs between individual neonates. While gestational age correlated with the proportion of some MC types, it is evident that there are many other maternal and fetal factors that influence the maturity and nature of lymphocyte subpopulations in individual neonates. In conclusion, the reduced ability of neonates to secrete Ig and IFN-g is not a consequence of high IL-10 secretion. However, individual newborns differ significantly in their ability to secrete cytokines as well as Igs.

G.W. Leibniz and Scientific Societies

The famous philosopher Leibniz (1646-1716) was also active in the (cultural) politics of his time. His interest in forming scientific societies never waned and his efforts led to the founding of the Berlin Academy of Sciences. He also played a part in the founding of the Dresden Academy of Science and the St. Petersburg Academy of Science. Though Leibniz's models for the scientific society were the Royal Society and the Royal Science Academy of France, his pansophistic vision of scientific cooperation sometimes took on utopian dimensions. In this paper, I will present Leibniz's ideas of scientific cooperation as a kind of religious activity and discuss his various schemes for the founding of such scientific societies.

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.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.