Weblogs, or blogs, are frequently modified web pages with a series of archived entries, generally in reverse chronological sequence. This thesis focuses on the rapid-growing phenomenon of weblogs and the fact that individuals with a background in library and information science are frequent users of weblogs. Since this is an explorative inductive study the ultimate purpose can be described as to find out what ?blogging? as activity is about. The research questions posed are: Why do individuals with a background in library and information science use weblogs? How does their professional identity affect their blogging? And finally; how do they use the weblog to create networks with other bloggers? The empirical material consists of audiotaped interviews with five informants who are all employed in knowledge work, either as librarians or information specialists.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The jetengines of today are growing in complexity. Reliability for aircraft engines are of extreme importance, mainly due to safety reasons but also economical ones. This master thesis deals with faultdiagnosis in the turbine section of RM12, the engine used in Saab/BAe's Gripen. Three different faults which can occur in the turbine section was studied. These faults are: clogged fuel nozzle, hole in outlet guide vane and sensor fault.

Smallholder farmers in Uganda suffer from declining productivity. With a rapidly increasing population, marginal land is taken into production and the current land management leads to loss in soil fertility and escalation in soil erosion. There are studies indicating that the use of agroforestry increases soil organic carbon (SOC) compared to systems without trees. Soils which are high in carbon have many advantages, for example better water holding capacity, which can reduce stress on crops during drought. The aim of this study was to determine the effect agroforestry has on SOC concentration in small-holder farming systems in Uganda. The intended system to study was farms practicing agroforestry methods or not in intercropped plantain (cooking banana) fields.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The aim of this master thesis?s is to examine what functions writing activities can have in the public library. Some public libraries offer their visitors writing activities, for example courses and camps. The public library is an institution with a particular identity, with special norms and properties which participants within the institution construct and reproduce. The main question of this thesis is to investigate how writing activities can be a part of the public library?s institutional identity and what functions writing activities in the public library can have.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

Background: According to the Swedish Social Board induced abortions are increasing in the modern day society. Nurses who work with in the gynecological department can come across patients seeking care for an induced abortion.Theoretical framework: The findings of the study will be discussed in relation to Peplau's nursing theory, ethical concepts and nursing concepts.Aim: The aim of the literature review was to illuminate the experiences of nurses working with induced abortion.Method: A systematic literature review with an inductive approach was chosen. The findings are based on seven qualitative and two quantitative studies. The articles were assessed through two different modified templates based on qualitative or quantitative design.Findings: Nurses and midwives experienced their work with induced abortions as emotionally stressful. However, it was highlighted that all women have the right whether to choose abortion or to proceed with the pregnancy.

The genus Campylobacter is globally recognised as the leading bacterial cause of human foodborne gastroenteritis. Every year around 8000 Swedes are infected by Campylobacter. Most people are infected by thermotolerant Campylobacter species, commonly C. jejuni and C. coli.

This thesis deals with the design of a combinated rescue-, personal-, and firefighting elevator for a nuclear waste storage facility to be constructed by the client SKB, Svensk Kärnbränslehantering AB. SKB:s mission is to dispose of all nuclear waste from all swedish nuclear power plants. The storage facility will be built in the rock 450 m under the surface and will consist of several kilometers of tunnel where capsules containing the nuclear waste will be placed. It will also hold a central area which contains spaces necessary for the operation and construction of the facility, such as elevator hall, storage hall etc. The facility will have two ways of access: a vehicle ramp and an elevator shaft.

There are two species of voles that cause damage in Swedish fruit production: the water vole (Arvicola terrestris) and the field vole (Microtus agrestis). Both species make the most damage during the winter season. The water vole makes subterranean burrows and cause serious damage by gnawing on the tree roots. The field vole seldom makes burrows and gnaws the bark at the base of the tree trunk. In recent years there have been several reports about increasing vole damage.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.