Sveriges Radio stores their data in large archives which makes it hard to retrieve specific information. The sheer size of the archives makes retrieving information about a specific event difficult and causes a big problem. To solve this problem a more consistent use of metadata is needed. This resulted in an investigation about metadata and keyword genera-tion.The appointed task was to automatically generate keywords from transcribed radio shows. This included an investigation of which systems and algorithms that can be used to generate keywords, based on previous works.

The transition from paper to electronic journals in induces a major change in academic libraries. The library must focus on customising the service to meet user needs in order to compete with other actors on the market. This situation entails the need for a marketing and management approach in library organisations. Linda Ashcroft has in previous research focused on marketing of electronic journals. She has stated the importance of simplifying the user environment of electronic journals and the importance of regaining control over electronic journals from publishers and vendors.

There is desire to evaluate the tracheal diameter in the Swedish population of English Bulldog, a breed with breathing disorders, and if possible use it as a criteria for breeding in the hope of improving the life situation for these dogs. The Swedish Kennel Club has together with the Swedish Club for English Bulldog and veterinarians presented a five year radiological study that has the purpose to give an average look on how the tracheal situation is in the population. The trachea will be evaluated through two different methods, both measuring two distances in the thorax. The first one compares the tracheal diameter to the height of the cranial opening of the thorax, and the second one to the width of the third rib. With the measured distances one will calculate a quotient and compares it to the reference values.This study is designed to get a preliminary evaluation, based on the 65 dogs that were available on the time for the study, with measurements done by two persons on three different occasions each.

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.

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.

The interest in the significance of public health for economic growth has increasedsteadily in recent years and a clarification of this connection may be of importance forthe status of public health. Aim: The aim of this literature based study is to describewhat previous research has shown in terms of the connection between public health andeconomic growth, focusing on high-income countries. Method: The study is based ontwelve scholarly articles retrieved from four scholarly databases. Result: The resultclarify that there is a positive long-term correlation between good public health andeconomic growth in high-income countries. Good health has a positive effect onproductivity, which leads to increased economic growth.

Within the literature and film sciences there are clear models of storytelling and methods of creating a good story. In the game industry it's more difficult because the games are often non-linear, and games are a less established medium than the other two. With this study our purpose was to examine game developers and methods they used when creating a videogame, with focus on storytelling. Four interviews were made with representatives from four different videogame companies in Sweden. The information from the interviews was put in relation to theories regarding the structure of videogames and an established model for creating videogames.

Fluids are important to the Visual Effects Industry but extremely hard to control and simulate because of the complexity of the governing equations. Fluid solvers can be divided into two categories, those of the Eulerian point of reference and those of the Lagrangian. Both categories have different advantages and weaknesses and hybrid methods are popular. This thesis examines Smoothed Particle Hydrodynamics, a Lagrangian method for physically based uid simulations. To allow the artist the exibility given by shorter simulation times and increased number of iterations, the performance of the solver is key.

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.