In a global context the traditional democratic process is facing new challenges. Scholars are talking about a transition from government to governance, where local and regional networks as well as international collaboration are an important part in how regional policy is produced and implemented. In this paper the processes in regional projects funded by the European Union are considered, and related to the traditional democratic process. The study has been fulfilled through informant interviews with representatives from four EU-projects. The interviews are supplemented by a qualitative text analysis of current statutes.

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 study aims to investigate associations in two areas in Stockholm County with diverse socio-economic conditions. The study intends to examine the impact these differences have on what role the bureaucrats and politicians in the two areas think that the associations should have. Bureaucrats are those who design guidelines for associations and that is why they have an important role in the conditions of the associations. A comparison between the two areas has been made to see if the requirement in the guidelines for the areas are different according to where the members live. The two areas that have been used to compare the guidelines of associations are Danderyd municipal and the district Spånga-Tensta.

The purpose of this essay is to examine progression in user education atprimary and secondary school levels, specifically the role played byschool libraries, librarians and strategy documents in securingeducational progression. Progression is examined in the user educationprovided by the five schools, part of the same municipal schoolmanagement area which share the same strategy plan. The area, NorraFäladen, was awarded School Library of the Year in 2011 for its work,making it particularly interesting for this essay's purpose. The studycombines interviews with the area's three school librarians, who dividetheir time between the five schools, with an analysis of the strategydocuments that regulate user education within Norra Fäladen. Theanalytical framework is based on: AASL's model of progression in usereducation (Standards for the 21st-century learner); Ekström's model forsuccessful and active strategy documents; Kuhlthau's theory of thelibrarian's role in the information search process; and Limberg'staxonomy of the role of the school library.The study shows how a number of concurrent factors and prerequisitesinfluence how goals for progression in user education are met.

The purpose of this study has been to examine reading habits and the use of the library by pre­school teachers in a mainly multicultural community, and also explore to what extent activities in the local library are aimed at preschoolers.The study used a sociocultural approach based on Vygotsky?s theories of learning and development and Söderbergh?s theory of early childhood language development, and was carried out during the summer 2009. The methodology used was both quantitative and qualitative, with a combination of questionnaires and interviews. Questionnaires were sent out to each section of the municipal pre­schools within the catchments area of the local public library in a multicultural suburb of Uppsala. Three short interviews were carried out with staff at the local and main library branches, as well as library staff at the County Council.The results show that, although preschool teachers find reading important in their work, many teachers read spontaneously and/or sporadically.

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 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.

Some researchers claim that we are witnessing the advancement of becoming a network society, and in spite of the different problems associated with the network form of organization, many cities still choose to engage in different types of networks. On account of that the aim of the study is to examine which expectations Swedish member cities of the network Eurotowns might have, and if their actions in the initial period of engagement in Eurotowns mainly could be explained by ?Logic of Consequentiality? or ?Logic of Appropriateness?.A qualitative research method was used and a major part of the empirical material consists of the information given by the interviewees.Regarding the expectations Swedish member cities have on Eurotowns, the result showed that five main areas could be identified mutual resource exchange, activities, breadth, security and meeting place. The results also showed that the actions of Swedish member cities may vary between ?Logic of Consequentiality?, ?Logic of Appropriateness? or a combination of the both logics.Furthermore the study also provides empirical evidence supporting the previously theoretical criticism expressed regarding the central assumption that the strategic actions of an actor can be regarded as a direct consequence of the mutual resource dependency..

On December 20, 2001, the Swedish citizen Mehdi Ghezali was captured on the border between Afghanistan and Pakistan. Ghezali spent the following 930 days in U.S. captivity, without being charged with any crime. My aim in this essay is to analyze how Ghezali was portrayed in three Swedish newspapers under and after his captivity, two nationwide and one local newspaper based in Ghezali's hometown. My purpose is to see whether Ghezali's identity is constructed differently in the three newspapers, as regards The Other, Stereotypization, etc.