For the last decades, Sweden has transformed from a state with strong elements of corporatism, to a governance of pluralistic character. This development has opened up to a new form of participation ? lobbyism ? which since has spread and commercialized. Because of this, a report on the state of Swedish democracy ? Demokratiutredningen ? was issued to examine the phenomenon of lobbyism as it was feared to challenge the functioning of a representative democracy.

Snow White through Grimm and Disney - A Comparative StudyThis essay attempts to discern the differences regarding six Swedish versions of the fairy-tale Snow White and the Seven Dwarfs over a period of 150 years. Focus is placed on structural transformations through time and media according to the analytical theories of Vladimir Propp. Attention is also given to former research done on the impact of the fairy-tale on the child from a psychological and social point of view. Of interest is the historical background of the tale, commencing with oral tradition, and how this was dealt with by the Grimm brothers. Three of the versions used for this comparative study are variants of the Grimm tale, and three belong to Walt Disney productions, i.e.

The purpose of this thesis is to study how some librarians working at a public library experience problems that can occur at the reference interview, slightly focusing on communication difficulties. Therefore I interviewed three librarians working at the reference desk on a daily basis. I chose to limit the study to public libraries and to the south of Sweden. My main question is: what difficulties can a librarian encounter during a reference interview and what can he/she do to treat these? In support of my main question I have three subordinated questions:What reasons can there be to a librarian not understanding a user?s information need?What methods are useful for a librarian to enhance the condition of the reference interview? What attitudes and qualities can be of use for the librarian at a difficult reference interview?For the collection of empirical data I chose to use semi-structured interviews.

The purpose of this essay was to overview the conflicts regarding the exhibition space (Kunsthalle) Tensta Konsthall during 2003 and 2004, in order to gain an understanding of the following: why the conflict started, if anyone exceeded their authority, how the case has been reviewed in the press, what kind of value judgements lay behind the actions and why this case has received so much attention. By studying mainly press material and political documents it has been made clear that Tensta Konsthall?s location in an ill reputed suburb of Stockholm has been the cause for its exposure to different demands and expectations compared to other similar exhibition spaces. Further the essay deals with questions raised by the conflict in the intersection of culture and politics..

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.

Background: Breast cancer is one of the most common cancer diseases among women worldwide. Breast cancer brings fear into many womens? life. It is a threat against life, but also to the psychological health, self-esteem and the female identity. Aim: The aim of this literature review was to describe newly breast cancer patient?s perception of information provided by healthcare personnel.

The aim of this thesis is to examine how the history of mathematics can be used in teaching and whether pupils? attitudes to mathematics can be affected by this. In order to do this a school project about the history of mathematics is planned, implemented and analysed.The following questions are addressed:? Why use the history of mathematics in teaching?? How can the history of mathematics be used in teaching?? Can a historical perspective in teaching affect pupils? views on mathematics?The school curriculum emphasizes the importance of history in teaching. Literature, scientific articles and government inquiries call attention to the positive effects of including a historical perspective in teaching.The school project, which underlies this thesis, is put to practice by 25 pupils in a mathematics science profile class.

Abstract The 1st of January 2009 there will be a new discrimination law in Sweden. That means that the Parliament finally will interpret three EC-directives in there entirety. The new law means that the present discrimination laws will be merged to one law. The situation for disabled persons on the labour market has improved, since the discrimination law was founded in 1999. The Labour Court got some cases to judge and media has attracted attention to disabled persons rights.

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.