Aika ennen aluepolitiikkaa. Pohjoisen kehityshankkeet ja alueiden kehittämisen idea 1950-luvun Suomessa

The dissertation focuses on the recognition of the problems of uneven regional development in Finland in the 1950s, and the way the idea of controlling this development was introduced to Finnish politics. Since it is often stated that Finnish regional policy only began in the mid-1960s, the period at hand is considered to fall in the time before regional policy. However, various ideas, plans and projects of regional development as well as different aims of development were brought forward and discussed already in the 1950s. These give an interesting perspective to the ideas of later regional development. In the 1950s, many Finnish politicians became more conscious of the unavoidable societal change. The need for overall modernisation of the society made it reasonable to expect a growing level of unemployment and eagerness to migration. The uneven distribution of well-being was also feared to cause discontent and political changes. International experience proved interfering in the regional development possible when using the argument of public interest ; the measures taken increased the level of well-being, helped sustain societal balance, and supported national economy. Many of the development projects of the 1950s focused on Northern Finland, the natural resources of which were considered an important reserve and the political climate of which was regarded unstable. After the late 1940s, regional development was discussed frequently both on the national and the regional level. Direct and indirect support was given to less developed areas and the government outlined thorough investigations in order to relieve the regional problem. Towards the end of the decade, the measures taken were already often connected to the idea of equality. In the 1950s the conflicts within and between the largest Finnish political parties significantly affected the decisions of regional development. There are three case studies in this qualitative research based on the narrative method. The case studies clarify the characteristics of the 1950s regional development. In the first one, the representatives of the northern region and the state first discuss the location of a state-run nitrogen fertilizer factory and later the location of a new university. In the second, the aims and perspectives of private entrepreneurs and the state collide due to ideas of statist industrialisation projects and later due to an idea of a tax relief targeting northern industry. In the third case, the main role is given to the changing rural areas, in relation to which societal development and urbanisation were often measured. The regional development of the 1950s laid groundwork for the new, more established regional policy. The early problem solving actions were aimed both at the prevailing situation and the future and thus showed the way for the upcoming actions. Regional development policy existed already before regional policy.

Weeds of Direct-Seeded Rice in Asia: Problems and Opportunities

Rice production symbolizes the single largest land use for food production on the Earth. The significance of this cereal as a source of energy and income seems overwhelming for millions of people in Asia, representing 90% of global rice production and consumption. Estimates indicate that the burgeoning population will need 25% more rice by 2025 than today's consumption. As the demand for rice is increasing, its production in Asia is threatened by a dwindling natural resource base, socioeconomic limitations, and uncertainty of climatic optima. Transplanting in puddled soil with continuous flooding is a common method of rice crop establishment in Asia. There is a dire need to look for rice production technologies that not only cope with existing limitations of transplanted rice but also are viable, economical, and secure for future food demand.Direct seeding of rice has evolved as a potential alternative to the current detrimental practice of puddling and nursery transplanting. The associated benefits include higher water productivity, less labor and energy inputs, less methane emissions, elimination of time and edaphic conflicts in the rice-wheat cropping system, and early crop maturity. Realization of the yield potential and sustainability of this resource-conserving rice production technique lies primarily in sustainable weed management, since weeds have been recognized as the single largest biological constraint in direct-seeded rice (DSR). Weed competition can reduce DSR yield by 30-80% and even complete crop failure can occur under specific conditions. Understanding the dynamics and outcomes of weed-crop competition in DSR requires sound knowledge of weed ecology, besides production factors that influence both rice and weeds, as well as their association. Successful adoption of direct seeding at the farmers' level in Asia will largely depend on whether farmers can control weeds and prevent shifts in weed populations from intractable weeds to more difficult-to-control weeds as a consequence of direct seeding. Sustainable weed management in DSR comprises all the factors that give DSR a competitive edge over weeds regarding acquisition and use of growth resources. This warrants the need to integrate various cultural practices with weed control measures in order to broaden the spectrum of activity against weed flora. A weed control program focusing entirely on herbicides is no longer ecologically sound, economically feasible, and effective against diverse weed flora and may result in the evolution of herbicide-resistant weed biotypes. Rotation of herbicides with contrasting modes of action in conjunction with cultural measures such as the use of weed-competitive rice cultivars, sowing time, stale seedbed technique, seeding rate, crop row spacing, fertilizer and water inputs and their application method/timing, and manual and mechanical hoeing can prove more effective and need to be optimized keeping in view the type and intensity of weed infestation. This chapter tries to unravel the dynamics of weed-crop competition in DSR. Technological issues, limitations associated with DSR, and opportunities to combat the weed menace are also discussed as a pragmatic approach for sustainable DSR production. A realistic approach to secure yield targets against weed competition will combine the abovementioned strategies and tactics in a coordinated manner. This chapter further suggests the need of multifaceted and interdisciplinary research into ecologically based weed management, as DSR seems inevitable in the near future.

Solution of a class of vibration problems by flowgraph methods

A 4-degree-of-freedom single-input system and a 3-degree-of-freedom multi-input system are solved by the Coates', modified Coates' and Chan-Mai flowgraph methods. It is concluded that the Chan-Mai flowgraph method is superior to other flowgraph methods in such cases.

A parametric differentiation version with finite-difference scheme applicable to a class of problems in boundary layer flow with massive blowing

A numerical procedure, based on the parametric differentiation and implicit finite difference scheme, has been developed for a class of problems in the boundary-layer theory for saddle-point regions. Here, the results are presented for the case of a three-dimensional stagnation-point flow with massive blowing. The method compares very well with other methods for particular cases (zero or small mass blowing). Results emphasize that the present numerical procedure is well suited for the solution of saddle-point flows with massive blowing, which could not be solved by other methods.

Increased attractiveness of honeybee hive product volatiles to adult small hive beetle, Aethina tumida, resulting from small hive beetle larval infestation

The small hive beetle, Aethina tumida Murray (Coleoptera: Nitidulidae), is a recent but significant pest of honeybee Apis mellifera L. (Hymenoptera: Apidae) hives in various regions throughout the world, including Eastern Australia. The larval stage of this beetle damages hives when they feed on brood, pollen, and honeycomb, leaving behind fermented wastes. In cases of extreme damage, hives collapse and are turned to an odorous mass of larvae in fermenting hive products. The yeast Kodamaea ohmeri (Etchells & Bell) Yamada et al. (Ascomycota) has been consistently isolated from the fermenting material as well as each life stage of this beetle. Various studies have noted that the small hive beetle is attracted to volatiles from hive products and those of the yeast K. ohmeri, although earlier studies have not used naturally occurring hive products as their source of fermentation. This study investigated changes through time in the attractiveness of natural honeybee hive products to the small hive beetle as the hive products were altered by the action of beetle larvae and fermentation by K. ohmeri. We used gas chromatography-mass spectrometry and choice-test behavioural assays to investigate these changes using products sampled from three apiaries. Attractiveness of the fermenting hive products (‘slime’) increased as fermentation progressed, and volatile profiles became more complex. Fermenting hive products remained extremely attractive for more than 30 days, significantly longer than previous reports. These results have strong implications for the development of an external attractant trap to assist in the management of this invasive pest.

Strategic tillage in no-till farming systems in Australia’s northern grains-growing regions: II. Implications for agronomy, soil and environment

In semi-arid sub-tropical areas, a number of studies concerning no-till (NT) farming systems have demonstrated advantages in economic, environmental and soil quality aspects over conventional tillage (CT). However, adoption of continuous NT has contributed to the build-up of herbicide resistant weed populations, increased incidence of soil- and stubble-borne diseases, and stratification of nutrients and organic carbon near the soil surface. Some farmers often resort to an occasional strategic tillage (ST) to manage these problems of NT systems. However, farmers who practice strict NT systems are concerned that even one-time tillage may undo positive soil condition benefits of NT farming systems. We reviewed the pros and cons of the use of occasional ST in NT farming systems. Impacts of occasional ST on agronomy, soil and environment are site-specific and depend on many interacting soil, climatic and management conditions. Most studies conducted in North America and Europe suggest that introducing occasional ST in continuous NT farming systems could improve productivity and profitability in the short term; however in the long-term, the impact is negligible or may be negative. The short term impacts immediately following occasional ST on soil and environment include reduced protective cover, soil loss by erosion, increased runoff, loss of C and water, and reduced microbial activity with little or no detrimental impact in the long-term. A potential negative effect immediately following ST would be reduced plant available water which may result in unreliability of crop sowing in variable seasons. The occurrence of rainfall between the ST and sowing or immediately after the sowing is necessary to replenish soil water lost from the seed zone. Timing of ST is likely to be critical and must be balanced with optimising soil water prior to seeding. The impact of occasional ST varies with the tillage implement used; for example, inversion tillage using mouldboard tillage results in greater impacts as compared to chisel or disc. Opportunities for future research on occasional ST with the most commonly used implements such as tine and/or disc in Australia’s northern grains-growing region are presented in the context of agronomy, soil and the environment.

Post-head-emergence frost in wheat and barley: defining the problem, assessing the damage, and identifying resistance

Radiant frost is a significant production constraint to wheat (Triticum aestivum) and barley (Hordeum vulgare), particularly in regions where spring-habit cereals are grown through winter, maturing in spring. However, damage to winter-habit cereals in reproductive stages is also reported. Crops are particularly susceptible to frost once awns or spikes emerge from the protection of the flag leaf sheath. Post-head-emergence frost (PHEF) is a problem distinct from other cold-mediated production constraints. To date, useful increased PHEF resistance in cereals has not been identified. Given the renewed interest in reproductive frost damage in cereals, it is timely to review the problem. Here we update the extent and impacts of PHEF and document current management options to combat this challenge. We clarify terminology useful for discussing PHEF in relation to chilling and other freezing stresses. We discuss problems characterizing radiant frost, the environmental conditions leading to PHEF damage, and the effects of frost at different growth stages. PHEF resistant cultivars would be highly desirable, to both reduce the incidence of direct frost damage and to allow the timing of crop maturity to be managed to maximize yield potential. A framework of potential adaptation mechanisms is outlined. Clarification of these critical issues will sharpen research focus, improving opportunities to identify genetic sources for improved PHEF resistance.

Post-head-emergence frost in wheat and barley: defining the problem, assessing the damage, and identifying resistance

Radiant frost is a significant production constraint to wheat (Triticum aestivum) and barley (Hordeum vulgare), particularly in regions where spring-habit cereals are grown through winter, maturing in spring. However, damage to winter-habit cereals in reproductive stages is also reported. Crops are particularly susceptible to frost once awns or spikes emerge from the protection of the flag leaf sheath. Post-head-emergence frost (PHEF) is a problem distinct from other cold-mediated production constraints. To date, useful increased PHEF resistance in cereals has not been identified. Given the renewed interest in reproductive frost damage in cereals, it is timely to review the problem. Here we update the extent and impacts of PHEF and document current management options to combat this challenge. We clarify terminology useful for discussing PHEF in relation to chilling and other freezing stresses. We discuss problems characterizing radiant frost, the environmental conditions leading to PHEF damage, and the effects of frost at different growth stages. PHEF resistant cultivars would be highly desirable, to both reduce the incidence of direct frost damage and to allow the timing of crop maturity to be managed to maximize yield potential. A framework of potential adaptation mechanisms is outlined. Clarification of these critical issues will sharpen research focus, improving opportunities to identify genetic sources for improved PHEF resistance.

Semantic Classes in Topic Detection and Tracking

Topic detection and tracking (TDT) is an area of information retrieval research the focus of which revolves around news events. The problems TDT deals with relate to segmenting news text into cohesive stories, detecting something new, previously unreported, tracking the development of a previously reported event, and grouping together news that discuss the same event. The performance of the traditional information retrieval techniques based on full-text similarity has remained inadequate for online production systems. It has been difficult to make the distinction between same and similar events. In this work, we explore ways of representing and comparing news documents in order to detect new events and track their development. First, however, we put forward a conceptual analysis of the notions of topic and event. The purpose is to clarify the terminology and align it with the process of news-making and the tradition of story-telling. Second, we present a framework for document similarity that is based on semantic classes, i.e., groups of words with similar meaning. We adopt people, organizations, and locations as semantic classes in addition to general terms. As each semantic class can be assigned its own similarity measure, document similarity can make use of ontologies, e.g., geographical taxonomies. The documents are compared class-wise, and the outcome is a weighted combination of class-wise similarities. Third, we incorporate temporal information into document similarity. We formalize the natural language temporal expressions occurring in the text, and use them to anchor the rest of the terms onto the time-line. Upon comparing documents for event-based similarity, we look not only at matching terms, but also how near their anchors are on the time-line. Fourth, we experiment with an adaptive variant of the semantic class similarity system. The news reflect changes in the real world, and in order to keep up, the system has to change its behavior based on the contents of the news stream. We put forward two strategies for rebuilding the topic representations and report experiment results. We run experiments with three annotated TDT corpora. The use of semantic classes increased the effectiveness of topic tracking by 10-30\% depending on the experimental setup. The gain in spotting new events remained lower, around 3-4\%. The anchoring the text to a time-line based on the temporal expressions gave a further 10\% increase the effectiveness of topic tracking. The gains in detecting new events, again, remained smaller. The adaptive systems did not improve the tracking results.

Problems and Algorithms for Sequence Segmentations

The analysis of sequential data is required in many diverse areas such as telecommunications, stock market analysis, and bioinformatics. A basic problem related to the analysis of sequential data is the sequence segmentation problem. A sequence segmentation is a partition of the sequence into a number of non-overlapping segments that cover all data points, such that each segment is as homogeneous as possible. This problem can be solved optimally using a standard dynamic programming algorithm. In the first part of the thesis, we present a new approximation algorithm for the sequence segmentation problem. This algorithm has smaller running time than the optimal dynamic programming algorithm, while it has bounded approximation ratio. The basic idea is to divide the input sequence into subsequences, solve the problem optimally in each subsequence, and then appropriately combine the solutions to the subproblems into one final solution. In the second part of the thesis, we study alternative segmentation models that are devised to better fit the data. More specifically, we focus on clustered segmentations and segmentations with rearrangements. While in the standard segmentation of a multidimensional sequence all dimensions share the same segment boundaries, in a clustered segmentation the multidimensional sequence is segmented in such a way that dimensions are allowed to form clusters. Each cluster of dimensions is then segmented separately. We formally define the problem of clustered segmentations and we experimentally show that segmenting sequences using this segmentation model, leads to solutions with smaller error for the same model cost. Segmentation with rearrangements is a novel variation to the segmentation problem: in addition to partitioning the sequence we also seek to apply a limited amount of reordering, so that the overall representation error is minimized. We formulate the problem of segmentation with rearrangements and we show that it is an NP-hard problem to solve or even to approximate. We devise effective algorithms for the proposed problem, combining ideas from dynamic programming and outlier detection algorithms in sequences. In the final part of the thesis, we discuss the problem of aggregating results of segmentation algorithms on the same set of data points. In this case, we are interested in producing a partitioning of the data that agrees as much as possible with the input partitions. We show that this problem can be solved optimally in polynomial time using dynamic programming. Furthermore, we show that not all data points are candidates for segment boundaries in the optimal solution.

Dislocation after total hip replacement: there is no such thing as a safe zone for socket placement with the posterior approach

Introduction Malorientation of the socket contributes to instability after hip arthroplasty but the optimal orientation of the cup in relation to the pelvis has not been unequivocally described. Large radiological studies are few and problems occur with film standardisation, measurement methodology used and alternative definitions of describing acetabular orientation. Methods A cohort of 1,578 patients from a single institution is studied where all patient data was collected prospectively. Risk factors for patients undergoing surgery are analysed. Radiological data was compared between a series of non-dislocating hips and dislocating cases matched 2:1 by operation type, age and diagnosis. Results The overall dislocation rate for all 1,578 cases was 3.23% but the rate varied according to the type of surgery performed. The rate in uncomplicated primary cases was 2.4% which increased to 9.3% for second stage implantation for a two stage procedure for infection. There was no significant difference in the variability of the dislocating and non-dislocating groups for either inclination (p = 0.393) or anteversion (p = 0.661). Conclusions A “safe zone” for socket orientation to avoid dislocation could not be defined. The cause of dislocation is multifactorial, re-establishing the anatomic centre of rotation, balancing soft tissues and avoidance of impingement around the hip are important considerations.

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.

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.