Currently many organizations are transitioning from the traditional approach to the agile approach regarding systems development methods. It is evident that research has mainly focused on smaller organizations transitioning, whilst less focus has been given t0 larger organizations. We find this interesting and the purpose of this study is to gain a deeper and broader knowledge concerning the following research question: How is system development work affected by a change from traditional system development methods to Scrum in large global organizations. We also investigate how Scrum can be adapted to complex projects with an internal client. The study is based on a case study, which takes a qualitative approach with semi-structured interviews for information gathering and was conducted on a major Swedish telecom company.

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.

This thesis describes a method of measuring axial magnetic leakage flux in an operational hydropower generator. Axial magnetic leakage flux is the magnetic flux at the ends of a rotating generator, which goes through the stator parallel to the rotor axis. This flux can cause circulating currents in the stator iron, giving rise to losses, and can in the worst case overheat a generator, causing it to melt down. To measure the axial flux, and how it affects the generator temperature, a measurement system was constructed on behalf of Vattenfall. The system consists of search coil sensors and a signal-processing unit with amplifiers and active filtering.  To confirm the behaviour of the axial leakage flux and the functionality of the measurement system, a test installation was made.

The purpose of this paper was to analyze fishbones from the Pitted Ware Culture settlement named Hemmor. in Dalbo, När parish on Gotland. The fishbones are unburnt and derive from one specific culture layer (c:6) in trench one VI:7, and radiocarbon dated to 2600-2300 BC cal.In this paper I wanted to answer these following questions:1. What kind of fish species did they eat in Hemmor?2.

Since long, Sweden has had exceptionally low calf mortality compared to most other countries. The tradition has been to keep calves in individual pens. With increasing number of cows per herd there is now a larger interest in more efficient and economical group systems for housing calves. However it has been noticed that bigger herds have more health problems and higher calf mortality than smaller herds. The early signs of disease are harder to detect when the animals are not fed manually.

Identification of fungi is based on macroscopic observations of morphology and microscopic characteristics. These conventional methods are time-consuming and requires expert knowledge. For the past years Matrix-assisted laser desorption ionization-time of flight mass spectrometry has been used for routine bacterial identification in clinical laboratories but not yet in the same extension for fungi. In this study three preanalytic preparation methods for fungi were evaluated in order to shorten the processing time in routine laboratory performance.Clinically relevant strains (n=18) of molds and dermatophytes were cultivated on agar plates and prepared according to the different preparation methods for protein extraction. Each strain was analyzed in quadruplicate by the MALDI Biotyper and the database Filamentous Fungi Library 1.0.The results showed that the genus and species identification rates of the least time-consuming direct extraction method were 33% and 11% respectively.

The purpose of this thesis is to examine projects for readingpromotion, aimed at boys, between 8 and 16 years of age. Therelations between librarians approaches to reading and methodsfor reading promotion are analysed with a gender perspective.The study is based on qualitative methods. Librarians involved infour reading projects have been interviewed. In the analysis, ourempirical material is related to theories of approaches to reading.Results have also been compared with earlier studies regardingboys reading, reading promotion, gender and male stereotypes.We find that an emancipatory approach towards reading is themost common. The librarians´ views showed that discussion,development, reading for pleasure and focus on the content of thebook were central to the methods used in the projects.

Many corporations turn to IT-outsourcing to focus more on their core competence or to cut the IT-budget. There is one caveat, the costs presented at a first glance does not always present the entire truth. Instead the costs run deeper and so-called hidden costs exist beyond the contractual cost. Reducing these hidden costs may very well be crucial to the entire IT-outsourcing endeavor. However many firms are not aware of these costs and as such they have a reduced chance of success.

GE Healthcare wants to investigate whether additive manufacturing would be an alternative method in their workshops in the Umea? plant. Additive manufacturing is called 3D printing in everyday language and manufactures details by building them up layer by layer in an automated machine. The purpose of this work is therefore to investigate how mature additive manufacturing methods are and how they could be used at GE.The work has been divided into three parts. The first section investigates how additive manufacturing would work in the production workshop at GE.

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.