Historically, the horse has in many ways been important to human beings. Today, Equine Assisted Therapy is a form of treatment in which the horse is used as a tool from the treatment of the client. Supported Equine therapy has a therapeutic purpose and may vary depending on the patient's needs and the professionals work competence. Various studies show that animals have a positive impact on people. The aim of our study was to explore how Equine Assisted Therapy is used within the practical fields of social work in Sweden.

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.

In this essay I reflect on what makes a good preschool teacher today. I discuss the importance of education, the importance of experience and practical knowledge, but also the importance of capacity for self-reflection and listening. I bring up examples from my workplace, where some think more about their limitations than on what and how much they actually can. Others are more satisfied by what they can and see less of their limits. Some are also lack of the will to see differently and to do changes.

Problem solving is a big part of design, however a lot of emphasis is put on creativity in research related to the effects of stress. Research has shown that the amount of stress we feel affects idea generation. Stress may also affect the ability to solve problems, however the researchers don?t seem to agree about what the effect of stress actually does.The study was made through experimental sessions where the respondents were asked to solve 4 matchstick puzzles of similar difficulty. Depending on their outcome they experienced more or less stress.

Purpose: This study aims to investigate the conditions that prevail when companies put their marketing in social media with the purpose of creating a perception of the risks and opportunities it brings to businesses and ultimately how it may affect the corporate image and identity.Theories: The basis of the problem area are presented through a theoretical framework with the purpose of highlighting the notions of social media, communi- cation, marketing communication, groundswell, corporate identity and image.Methodology: To investigate the research questions this study adopted a qualitative approach in which the authors study the properties of a phenomenon in order to seek a deeper understanding of the problems we have presented. There is an exploratory approach to knowledge and the authors have chosen to conduct qualitative research interviews based upon three themes: driving forces, challenges and impacts.Conclusion: The study revealed that traditional models of communication are no longer applicable in social media. Companies are up for a challenge and must clarify their sole purpose when establishing communication in the social landscape. The general motivation for marketing in social media is making profit, however, building relationships is not a natural motive for most companies. The risks companies expe- rience is the exposure caused by social media and the study also reveals that this fear is firmly attached to their lack of knowledge of these new channels of communicat- ion and their primary areas of use which indicates that skilled employees plays a vi- tal role with their use of social media in their communication process.

The aim of this study was to increase our knowledge about how the ?Conversational-contact with the social services? is experienced by the parents who attend it. The research was based on a qualitative method consisting of four individual interviews.Main issues of the study:? The parents experience of the content of the meetings with the social workers? Do the parents experience that the conversational-contact has contributed to some changes in their lives?Results indicated that all parents were positiv to the conversational-contact. Afterwards they felt more secure and stable both as persons and in their role as parents.

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 master?s thesis is to investigate children?s librarian?s perspectives on children?s literature and reading of fiction books. This is a comparative study of Swedish and Lithuanian librarians. The main questions to be answered are how children?s librararians at public libraries motivate their selection and purchase of fiction for children and what kind of considerations there are behind the purchases.

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.