TCP Performance in Heterogeneous Wireless Networks

The TCP protocol is used by most Internet applications today, including the recent mobile wireless terminals that use TCP for their World-Wide Web, E-mail and other traffic. The recent wireless network technologies, such as GPRS, are known to cause delay spikes in packet transfer. This causes unnecessary TCP retransmission timeouts. This dissertation proposes a mechanism, Forward RTO-Recovery (F-RTO) for detecting the unnecessary TCP retransmission timeouts and thus allow TCP to take appropriate follow-up actions. We analyze a Linux F-RTO implementation in various network scenarios and investigate different alternatives to the basic algorithm. The second part of this dissertation is focused on quickly adapting the TCP's transmission rate when the underlying link characteristics change suddenly. This can happen, for example, due to vertical hand-offs between GPRS and WLAN wireless technologies. We investigate the Quick-Start algorithm that, in collaboration with the network routers, aims to quickly probe the available bandwidth on a network path, and allow TCP's congestion control algorithms to use that information. By extensive simulations we study the different router algorithms and parameters for Quick-Start, and discuss the challenges Quick-Start faces in the current Internet. We also study the performance of Quick-Start when applied to vertical hand-offs between different wireless link technologies.

Efficient search for statistically significant dependency rules in binary data

Analyzing statistical dependencies is a fundamental problem in all empirical science. Dependencies help us understand causes and effects, create new scientific theories, and invent cures to problems. Nowadays, large amounts of data is available, but efficient computational tools for analyzing the data are missing. In this research, we develop efficient algorithms for a commonly occurring search problem - searching for the statistically most significant dependency rules in binary data. We consider dependency rules of the form X->A or X->not A, where X is a set of positive-valued attributes and A is a single attribute. Such rules describe which factors either increase or decrease the probability of the consequent A. A classical example are genetic and environmental factors, which can either cause or prevent a disease. The emphasis in this research is that the discovered dependencies should be genuine - i.e. they should also hold in future data. This is an important distinction from the traditional association rules, which - in spite of their name and a similar appearance to dependency rules - do not necessarily represent statistical dependencies at all or represent only spurious connections, which occur by chance. Therefore, the principal objective is to search for the rules with statistical significance measures. Another important objective is to search for only non-redundant rules, which express the real causes of dependence, without any occasional extra factors. The extra factors do not add any new information on the dependence, but can only blur it and make it less accurate in future data. The problem is computationally very demanding, because the number of all possible rules increases exponentially with the number of attributes. In addition, neither the statistical dependency nor the statistical significance are monotonic properties, which means that the traditional pruning techniques do not work. As a solution, we first derive the mathematical basis for pruning the search space with any well-behaving statistical significance measures. The mathematical theory is complemented by a new algorithmic invention, which enables an efficient search without any heuristic restrictions. The resulting algorithm can be used to search for both positive and negative dependencies with any commonly used statistical measures, like Fisher's exact test, the chi-squared measure, mutual information, and z scores. According to our experiments, the algorithm is well-scalable, especially with Fisher's exact test. It can easily handle even the densest data sets with 10000-20000 attributes. Still, the results are globally optimal, which is a remarkable improvement over the existing solutions. In practice, this means that the user does not have to worry whether the dependencies hold in future data or if the data still contains better, but undiscovered dependencies.

Computational Methods for Locating and Analyzing Conserved Gene Regulatory DNA Elements

This thesis presents methods for locating and analyzing cis-regulatory DNA elements involved with the regulation of gene expression in multicellular organisms. The regulation of gene expression is carried out by the combined effort of several transcription factor proteins collectively binding the DNA on the cis-regulatory elements. Only sparse knowledge of the 'genetic code' of these elements exists today. An automatic tool for discovery of putative cis-regulatory elements could help their experimental analysis, which would result in a more detailed view of the cis-regulatory element structure and function. We have developed a computational model for the evolutionary conservation of cis-regulatory elements. The elements are modeled as evolutionarily conserved clusters of sequence-specific transcription factor binding sites. We give an efficient dynamic programming algorithm that locates the putative cis-regulatory elements and scores them according to the conservation model. A notable proportion of the high-scoring DNA sequences show transcriptional enhancer activity in transgenic mouse embryos. The conservation model includes four parameters whose optimal values are estimated with simulated annealing. With good parameter values the model discriminates well between the DNA sequences with evolutionarily conserved cis-regulatory elements and the DNA sequences that have evolved neutrally. In further inquiry, the set of highest scoring putative cis-regulatory elements were found to be sensitive to small variations in the parameter values. The statistical significance of the putative cis-regulatory elements is estimated with the Two Component Extreme Value Distribution. The p-values grade the conservation of the cis-regulatory elements above the neutral expectation. The parameter values for the distribution are estimated by simulating the neutral DNA evolution. The conservation of the transcription factor binding sites can be used in the upstream analysis of regulatory interactions. This approach may provide mechanistic insight to the transcription level data from, e.g., microarray experiments. Here we give a method to predict shared transcriptional regulators for a set of co-expressed genes. The EEL (Enhancer Element Locator) software implements the method for locating putative cis-regulatory elements. The software facilitates both interactive use and distributed batch processing. We have used it to analyze the non-coding regions around all human genes with respect to the orthologous regions in various other species including mouse. The data from these genome-wide analyzes is stored in a relational database which is used in the publicly available web services for upstream analysis and visualization of the putative cis-regulatory elements in the human genome.

Exploring privacy for ubiquitous computing: Tools, methods and experiments

Ubiquitous computing is about making computers and computerized artefacts a pervasive part of our everyday lifes, bringing more and more activities into the realm of information. The computationalization, informationalization of everyday activities increases not only our reach, efficiency and capabilities but also the amount and kinds of data gathered about us and our activities. In this thesis, I explore how information systems can be constructed so that they handle this personal data in a reasonable manner. The thesis provides two kinds of results: on one hand, tools and methods for both the construction as well as the evaluation of ubiquitous and mobile systems---on the other hand an evaluation of the privacy aspects of a ubiquitous social awareness system. The work emphasises real-world experiments as the most important way to study privacy. Additionally, the state of current information systems as regards data protection is studied. The tools and methods in this thesis consist of three distinct contributions. An algorithm for locationing in cellular networks is proposed that does not require the location information to be revealed beyond the user's terminal. A prototyping platform for the creation of context-aware ubiquitous applications called ContextPhone is described and released as open source. Finally, a set of methodological findings for the use of smartphones in social scientific field research is reported. A central contribution of this thesis are the pragmatic tools that allow other researchers to carry out experiments. The evaluation of the ubiquitous social awareness application ContextContacts covers both the usage of the system in general as well as an analysis of privacy implications. The usage of the system is analyzed in the light of how users make inferences of others based on real-time contextual cues mediated by the system, based on several long-term field studies. The analysis of privacy implications draws together the social psychological theory of self-presentation and research in privacy for ubiquitous computing, deriving a set of design guidelines for such systems. The main findings from these studies can be summarized as follows: The fact that ubiquitous computing systems gather more data about users can be used to not only study the use of such systems in an effort to create better systems but in general to study phenomena previously unstudied, such as the dynamic change of social networks. Systems that let people create new ways of presenting themselves to others can be fun for the users---but the self-presentation requires several thoughtful design decisions that allow the manipulation of the image mediated by the system. Finally, the growing amount of computational resources available to the users can be used to allow them to use the data themselves, rather than just being passive subjects of data gathering.

Modeling Efficient Classification as a Process of Confidence Assessment and Delegation

In visual object detection and recognition, classifiers have two interesting characteristics: accuracy and speed. Accuracy depends on the complexity of the image features and classifier decision surfaces. Speed depends on the hardware and the computational effort required to use the features and decision surfaces. When attempts to increase accuracy lead to increases in complexity and effort, it is necessary to ask how much are we willing to pay for increased accuracy. For example, if increased computational effort implies quickly diminishing returns in accuracy, then those designing inexpensive surveillance applications cannot aim for maximum accuracy at any cost. It becomes necessary to find trade-offs between accuracy and effort. We study efficient classification of images depicting real-world objects and scenes. Classification is efficient when a classifier can be controlled so that the desired trade-off between accuracy and effort (speed) is achieved and unnecessary computations are avoided on a per input basis. A framework is proposed for understanding and modeling efficient classification of images. Classification is modeled as a tree-like process. In designing the framework, it is important to recognize what is essential and to avoid structures that are narrow in applicability. Earlier frameworks are lacking in this regard. The overall contribution is two-fold. First, the framework is presented, subjected to experiments, and shown to be satisfactory. Second, certain unconventional approaches are experimented with. This allows the separation of the essential from the conventional. To determine if the framework is satisfactory, three categories of questions are identified: trade-off optimization, classifier tree organization, and rules for delegation and confidence modeling. Questions and problems related to each category are addressed and empirical results are presented. For example, related to trade-off optimization, we address the problem of computational bottlenecks that limit the range of trade-offs. We also ask if accuracy versus effort trade-offs can be controlled after training. For another example, regarding classifier tree organization, we first consider the task of organizing a tree in a problem-specific manner. We then ask if problem-specific organization is necessary.

Mining Cell Transition Data

Cell transition data is obtained from a cellular phone that switches its current serving cell tower. The data consists of a sequence of transition events, which are pairs of cell identifiers and transition times. The focus of this thesis is applying data mining methods to such data, developing new algorithms, and extracting knowledge that will be a solid foundation on which to build location-aware applications. In addition to a thorough exploration of the features of the data, the tools and methods developed in this thesis provide solutions to three distinct research problems. First, we develop clustering algorithms that produce a reliable mapping between cell transitions and physical locations observed by users of mobile devices. The main clustering algorithm operates in online fashion, and we consider also a number of offline clustering methods for comparison. Second, we define the concept of significant locations, known as bases, and give an online algorithm for determining them. Finally, we consider the task of predicting the movement of the user, based on historical data. We develop a prediction algorithm that considers paths of movement in their entirety, instead of just the most recent movement history. All of the presented methods are evaluated with a significant body of real cell transition data, collected from about one hundred different individuals. The algorithms developed in this thesis are designed to be implemented on a mobile device, and require no extra hardware sensors or network infrastructure. By not relying on external services and keeping the user information as much as possible on the user s own personal device, we avoid privacy issues and let the users control the disclosure of their location information.

Learning Nonlinear Visual Processing from Natural Images

The paradigm of computational vision hypothesizes that any visual function -- such as the recognition of your grandparent -- can be replicated by computational processing of the visual input. What are these computations that the brain performs? What should or could they be? Working on the latter question, this dissertation takes the statistical approach, where the suitable computations are attempted to be learned from the natural visual data itself. In particular, we empirically study the computational processing that emerges from the statistical properties of the visual world and the constraints and objectives specified for the learning process. This thesis consists of an introduction and 7 peer-reviewed publications, where the purpose of the introduction is to illustrate the area of study to a reader who is not familiar with computational vision research. In the scope of the introduction, we will briefly overview the primary challenges to visual processing, as well as recall some of the current opinions on visual processing in the early visual systems of animals. Next, we describe the methodology we have used in our research, and discuss the presented results. We have included some additional remarks, speculations and conclusions to this discussion that were not featured in the original publications. We present the following results in the publications of this thesis. First, we empirically demonstrate that luminance and contrast are strongly dependent in natural images, contradicting previous theories suggesting that luminance and contrast were processed separately in natural systems due to their independence in the visual data. Second, we show that simple cell -like receptive fields of the primary visual cortex can be learned in the nonlinear contrast domain by maximization of independence. Further, we provide first-time reports of the emergence of conjunctive (corner-detecting) and subtractive (opponent orientation) processing due to nonlinear projection pursuit with simple objective functions related to sparseness and response energy optimization. Then, we show that attempting to extract independent components of nonlinear histogram statistics of a biologically plausible representation leads to projection directions that appear to differentiate between visual contexts. Such processing might be applicable for priming, \ie the selection and tuning of later visual processing. We continue by showing that a different kind of thresholded low-frequency priming can be learned and used to make object detection faster with little loss in accuracy. Finally, we show that in a computational object detection setting, nonlinearly gain-controlled visual features of medium complexity can be acquired sequentially as images are encountered and discarded. We present two online algorithms to perform this feature selection, and propose the idea that for artificial systems, some processing mechanisms could be selectable from the environment without optimizing the mechanisms themselves. In summary, this thesis explores learning visual processing on several levels. The learning can be understood as interplay of input data, model structures, learning objectives, and estimation algorithms. The presented work adds to the growing body of evidence showing that statistical methods can be used to acquire intuitively meaningful visual processing mechanisms. The work also presents some predictions and ideas regarding biological visual processing.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Stem anatomy and adventitious root formation in cuttings of Angophora, Corymbia and Eucalyptus

Many plantation eucalypts are difficult to propagate from cuttings, and their rooted cuttings often possess very few adventitious roots. We microscopically examined the stem anatomy of cuttings from 12 species of eucalypts and we determined whether adventitious root formation in auxin-treated cuttings of four species was limited to particular positions around the vascular tissue. Most species contained a central pith that was arranged in a four-pointed stellate pattern. The surrounding vascular tissue was also arranged in a stellate pattern near the shoot apex but it developed a more rectangular shape at the outer phloem as the stems enlarged radially. Adventitious roots formed at, or slightly peripheral to, the vascular cambium, and they formed at both the corners and the sides of the rectangular-shaped vascular tissue. The study highlighted that auxin-treated eucalypt cuttings can produce roots at multiple positions around the vascular tissue and so propagation methods can aim to produce more than four adventitious roots per rooted cutting. Higher numbers of adventitious roots could improve the root system symmetry, stability, survival and growth rate of clonal eucalypt trees. © 2015 by the authors; licensee MDPI, Basel, Switzerland.

Foreign Capital and Finland : Central government's first period of reliance on international financial markets, 1862-1938

The main objective of the study is to evaluate the Finnish central government s foreign borrowing between the years 1862 and 1938. Most of this period was characterised by deep capital market integration that bears resemblance to the liberal world financial order at the turn of the millennium. The main aim is to analyse the credit risk associated with the state and its determination by evaluating the world financial market centres perception of Finland. By doing this, the study is also expected to provide an additional dimension to Finland s political and economic history by incorporating into the research the assessments of international capital markets regarding Finland during a period that witnessed profound political and economic changes in Finnish society. The evaluation of the credit risk mainly relies on exchange-rate risk free time series of the state s foreign bonds. They have been collected from quotations in the stock exchanges in Helsinki, Hamburg, Paris and London. In addition, it investigates Finland s exposure to short-term debt and Moody s credit ratings assigned to Finland. The study emphasises the importance of the political risk. It suggests that the hey-day of the state s reliance on foreign capital markets took place during last few decades of the 19th century when Finland enjoyed a wide autonomy in the Russian Empire and prudently managed its economy, highlighted in Finland s adherence to the international gold standard. Political confrontations in Finland and, in particular, in Russia and the turbulence of the world financial system prevented the return of this beneficial position again. Through its issuance of foreign bonds the state was able to import substantial amounts of foreign capital, which was sorely needed to foster economic development in Finland. Moreover, the study argues that the state s presence in the western capital markets not only had economic benefits, but it also increased the international awareness of Finland s distinct and separate status in the Russian Empire and later underlined its position as an independent republic.

"Köyhyydestä ei puhuttu, sitä vaan elettiin." : Köyhyyden kokemus ja selviytyminen 1930-luvun pulan oloissa Suomen maaseudulla

On the material level of poverty, the work shows how the Great Depression forced rural women and children to enhance their work input and find new ways of coping. The most serious impact of the Depression was poor nutrition, as well as scarcity of food and clothes. Women's and men's ways to make a living started to resemble each other; men had also to consent to wages in form of foodstuff. The research also focuses on immaterial poverty by means of exploring experiences of otherness: shame, hatred and expressions of protest. Substantial humiliation was induced by poor relief and begging. A clear gap prevailed between the poor and the better off people in school, work and at leisure. The economic crisis deepened this gap even further. The dissertation specifies the poor people s every day experiences by taking into account the different worlds of men and women. The analysis of four different memory-based sources is the core in the micro-historical research design. The narrators of the research were survivors, unlike many others, who experienced the Great Depression. Moralization and humiliation of the poor have not ceased in contemporary society. Therefore, the historical perspective of both the material and the immaterial side of poverty could increase the understanding of the multifaceted phenomenon of today s poverty.

The Soviet Union, Finland and the Cold War : The Finnish Card in Soviet Foreign Policy, 1956-1959

From the Soviet point of view the actual substance of Soviet-Finnish relations in the second half of 1950s clearly differed from the contemporary and later public image, based on friendship and confidence rhetoric. As the polarization between the right and the left became more underlined in Finland in the latter half of the 1950s, the criticism towards the Soviet Union became stronger, and the USSR feared that this development would have influence on Finnish foreign policy. From the Soviet point of view, the security commitments of FCMA-treaty needed additional guarantees through control of Finnish domestic politics and economic relations, especially during international crises. In relation to Scandinavia, Finland was, from the Soviet point of view, the model country of friendship or neutrality policy. The influence of the Second Berlin Crisis or the Soviet-Finnish Night Frost Crisis in 1958-1959 to Soviet policy towards Scandinavia needs to be observed from this point of view. The Soviet Union used Finland as a tool, in agreement with Finnish highest political leadership, for weakening of the NATO membership of Norway and Denmark, and for maintaining Swedish non-alliance. The Finnish interest to EFTA membership in the summer of 1959, at the same time with the Scandinavian countries, seems to have caused a panic reaction in the USSR, as the Soviets feared that these economic arrangements would reverse the political advantages the country had received in Finland after the Night Frost Crisis. Together with history of events, this study observes the interaction of practical interests and ideologies, both in individuals and in decision-making organizations. The necessary social and ideological reforms in the Soviet Union after 1956 had influence both on the legitimacy of the regime, and led to contradictions in the argumentation of Soviet foreign policy. This was observed both in the own camp as well as in the West. Also, in Finland a breakthrough took place in the late 1950's: as the so-called counter reaction lost to the K-line, "a special relationship" developed with the Soviet Union. As a consequence of the Night Frost Crisis the Soviet relationship became a factor decisively defining the limits of domestic politics in Finland, a part of Finnish domestic political argumentation. Understood from this basis, finlandization is not, even from the viewpoint of international relations, a special case, but a domestic political culture formed by the relationship between a dominant state, a superpower, and a subordinate state, Finland.

Essays on Russia's Economic Transition

This study comprises an introductory section and three essays analysing Russia's economic transition from the early 1990s up to the present. The papers present a combination of both theoretical and empirical analysis on some of the key issues Russia has faced during its somewhat troublesome transformation from state-controlled command economy to market-based economy. The first essay analyses fiscal competition for mobile capital between identical regions in a transition country. A standard tax competition framework is extended to account for two features of a transition economy: the presence of two sectors, old and new, which differ in productivity; and a non-benevolent regional decision-maker. It is shown that in very early phase of transition, when the old sector clearly dominates, consumers in a transition economy may be better off in a competitive equilibrium. Decision-makers, on the other hand, will prefer to coordinate their fiscal policies. The second essay uses annual data for 1992-2003 to examine income dispersion and convergence across 76 Russian regions. Wide disparities in income levels have indeed emerged during the transition period. Dispersion has increased most among the initially better-off regions, whereas for the initially poorer regions no clear trend of divergence or convergence could be established. Further, some - albeit not highly robust - evidence was found of both unconditional and conditional convergence, especially among the initially richer regions. Finally, it is observed that there is much less evidence of convergence after the economic crisis of 1998. The third essay analyses industrial firms' engagement in provision of infrastructure services, such as heating, electricity and road maintenance. Using a unique dataset of 404 large and medium-sized industrial enterprises in 40 regions of Russia, the essay examines public infrastructure provision by Russian industrial enterprises. It is found that to a large degree engagement in infrastructure provision, as proxied by district heating production, is a Soviet legacy. Secondly, firms providing district heating to users outside their plant area are more likely to have close and multidimensional relations with the local public sector.

Itsenäisen Suomen puolesta : Sotilaskomitea 1915-1918

For Independent Finland. The Military Committee 1915–1918 In the course of the First World War, several organizations were founded with the purpose of making Finland independent or, at least, restoring her autonomous status. The Military Committee was the most significant active independence organization in Finland in the First World War, in addition to the activist student movement, i.e., the Jaeger Movement. The Military Committee was an organization founded in 1915 by officers who had attended the Hamina Cadet School, with the goal of creating a national army for a liberation war against the Russian troops. It was believed that the liberation war should succeed only with the help of the German Army. With the situation in society continually tensing up in the autumn 1917, the Military Committee also had to figure on the possibility of a Civil War. The activities of the Military Committee started in the early part of 1915 when they were still small-scale, but they gained significant momentum after the Russian Revolution in March 1917. In January 1918, the Military Committee formed the general staff for the White Army, the Senate’s troops. The independence-related activities of the Hamina cadets in the years of the First World War were more extensive and multifaceted than has been believed heretofore. The work of the Military Committee was divided into preparations for a liberation war in Finland, on one hand, and in Stockholm and Berlin, on the other hand. In Finland, the Military Committee took part in intelligence gathering for Germany and in supporting the recruiting Jaegers, and later in founding the civil guard organization, in solving the law and order authorities issue, and finally in selecting the Commander-in-Chief for the Senate’s troops. The member of the Military Committee, especially Captain Hannes Ignatius of the Cavalry contributed greatly to the drafting of the independence activists’ national action plan in Stockholm in May 1917. This plan preceded the formation of the civil guard organization. The Military Committee’s role in founding the civil guards was initially minor, but in the fall of 1917, the Military Committee started to finance the activities of the civil guards, named several former officers as commanders of the civil guards and finally overtook the entire civil guard movement. In Stockholm and Berlin, the representatives of the Military Committee were in active contact with both the high command of the German Army and with the representatives of the Swedish Army. Colonel Nikolai Mexmontan, who was a representative of the Military Committee, collaborated with Swedish officers and Jaeger officers in Stockholm in coming up with comprehensive and detailed plans for starting the Liberation War. Under Mexmontan’s leadership, there were serious negotiations to enter into a confederation with Germany. Lieutenant Colonel Wilhelm Thesleff, on the other hand, became the commander of the Jaeger Battalion 27. The influence and importance of the Military Committee came to the forefront in independent and conflict-torn Finland. The Military Committee became a Senate committee on the 7th of January 1918, with its chairman, for all practical purposes, as the Commander-in-Chief in an eventual war. Lieutenant General Claes Charpentier was the chairman of the Military Committee from mid-December 1917 onwards, but on the 15th of January 1918 he had to resign in favour of Lieutenant General Gustaf Mannerheim. Soon after that, Mannerheim got an order from the chairman of the Senate P. E. Svinhufvud to organize and assume the leadership of the law and order authorities. The chairman of the Military Committee became the Commander-in-Chief of the Senate troops in January 1918, and the Military Committee became the Commander-in-Chief’s general staff. The Military Committee had turned from a clandestine organization into the first general staff of the independent Finnish Army.

Stalinismin lyhyt kurssi : Suomalaiset Moskovan Lenin-koulussa 1926-1938

This study of the Finns at the International Lenin School (ILS) reflects history of the Soviet Union during Stalin's era, history of the Communist International (Comintern) as well as history of Finnish communism. The life span of the ILS (1926-1938) matches up with creating and establishing the power structures of Stalinism. Both the ILS and Finnish Communism in the USSR became casualties of the Great Terror (1937-1938). After the WW2, however, the Soviet education was appreciated inside the Communist Party of Finland (CPF). If Finland would have become People's Democracy, the former ILS students would have composed the inner circle of the new "democratic" government. The Finnish teachers of the ILS were leaders of the CPF that was headquartered in Moscow. At the ILS studied in total 141 Finnish communists. The purpose of the ILS was to educate the communist parties' leading stratum of functionaries. They were supposed to internalize current values, methods and discipline of the Bolsheviks. This study evaluates the effects of the total school experience on the Finns that often ended in another total institution in Finland: prison. The curricula of the ILS consisted of theory of Marxism-Leninism, party history, political economics and themes of campaigns of Stalinism. The ILS year included participation in Bolshevik party life and practical work. During summer excursions (praktikas) the students could acquaint themselves with building of socialism in the Soviet Republics. At the ILS, intention to ideological moulding was not hidden. The students were supposed to adopt the Stalinist identity of the professional revolutionaries of the era. The ILS was saturated with ideology and propaganda. This study analyzes especially uses of history as vehicle of ideological standardisation and as instrument of power. Stalin contributed personally to shortcomings of history writing of the communist party. Later he supervised writing of the inclusive handbook of communism, "History of the All-Union Communist Party. Short Course". Special attention will be paid to the effects of Stalin's intervention at the ILS and inside the CPF. The life of the Finns at the ILS and outside the school is described at grass roots. The dividing line between personal and political is analyzed by charting emotional, intimate and bodily experiences of the Finns of the ILS. The fates of the ILS Finns after the studying or teaching period in Moscow are explored in detail. The protagonist among the teachers is Yrjö Sirola that was called "father of the CPF cadres". The Finnish ILS teachers and the formed students that had remained in the USSR were most severely hit by the Great Terror. The Soviet education had most importance in Finland of post WW2 period. The training at the ILS, however, did not contribute to revolution in Finland. The main heading of the study, "A Short Course of Stalinism", crystallises interpretation of the ILS as seat of learning of ideological unity of Stalinism. On the other hand, the title includes a statement of incompleteness of the Stalinist education if the schooling at the ILS had remained in one year.