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 aim of this study was to, using previously collected data from self-declared antisocial behaviour questionnaires, examine if the crime frequency has been different between adolescents that have either been referred to two different forms of open care in social service, child and youth psychiatric inpatient care or have been sent to Homes for Specialised Supervision. The criminality frequency and the most common crimes committed were compared between the study groups and further between genders in each particular study group. Statistical significance testing was used and the results of the survey revealed that juvenile delinquents that had committed severe criminal acts were represented in all four groups. The study group with adolescents in national care was the most different from other groups. These youths seemed to have had a lower crime frequency than the other groups with the exception assault and robbery.

The end of the 20th century brought a dramatic change to the music industry. The then predominant models for music consumption and sales were forever altered when the possibility to distribute music over the internet emerged. It has now become evident that it is virtually impossible to stop the distribution of digital music files. Music has turned into a non-excludable and non-rival product, which in economic terms is described as a public good. Public goods theory serves as a starting point for this study, which explores some of the factors that might explain why some consumers pay for music, while others choose to download music illegally.

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.

Achievements within the fields of computer- and telecommunication technology have led to a revolution when it comes to managing information. These achievements have made it possible to offer new services in healthcare, especially in telemedicine. New technology has become a complement to traditional care, thus partly compensating for insufficient time and resources. Telephone Linked Care (TLC) is a telecommunication technology that enables automated dialog counselling and monitoring of patients in their homes. During the last two decades numerous randomized controlled studies with TLC have demonstrated improvement among outpatients with chronic and health behaviour disorders.

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.

Colobus angolensis palliatus is a small old world monkey inhabiting southern coastal Kenya to southern Tanzania. The species activity budget is known to vary between seasons and areas, probably due to differences in group sizes, diets, predatory presence and resource competition. The variations between male and female activity budgets are reckoned to be a result of pregnancy and lactation. The aim of this study was to investigate potential differences in behaviours between morning and afternoon periods and between males and females. The study was carried out in two forest fragments in Diani Beach on the south coast of Kenya.

Rock groundwater has always caused major problems when tunnelling. Water leaking into tunnels can cause large problems, not only on the construction itself but also on the environment. A continuous water leakage can lead to a declining water supply, and geotechnical problems can occur as subsidence in the ground. Therefore it is of great importance to predict the consequences that can appear in the surroundings due to a declining groundwater surface.The aim of the study was to investigate different methods for predicting leakage and changes in groundwater level due to tunnelling excavations in rock. This thesis was performed by comparing mathematical methods, actual groundwater changes and results from preliminary investigations.Investigations were made for three railway tunnels planned by Botniabanan AB.

The purpose of this thesis was to examine the ways in which the constructions of heterosexuality and gender in three Disney movies about princesses affect the power relations between men and women in the movies, and how discourses on gender and heterosexuality have changed over time. Research questions were:How do characters in the movies talk about gender and heterosexuality?How does the interplay between gender and heterosexuality affect the power relations between men and women in the movies?What are the likenesses and differences between movies from different time periods?Discourses were mapped out using a model based on Ernesto Laclau and Chantal Mouffe?s political theories. These discourses were then analyzed with a theoretical framework consisting of Yvonne Hirdman?s concept of gender system and gender contracts, Judith Butler?s view on the heterosexual matrix and an understanding of power relations based on Michel Foucault.