Environmental issues are global problems and they are a major challenge for any successful organizational business worldwide. Many challenges and opportunities emerge during the certification process of an EMS. Therefore it is interesting to contribute in understanding these emerging problems during this process.The aim of this study is to explore how the environmental objectives could be achieved at preschools in Uppsala, investigate the perceived challenges and opportunities and to identify the outcome of implementing the ISO 14001, Green Flag at such set up.A qualitative method is used and three Green Flag certified preschools, affiliated to the Uppsala Municipality and located at different geographical location were selected. A structured interview with the environmental representatives from the preschools and the municipality was completed. The so-called PDCA-cycle as a method of evaluating sustainable development and analysing the imperial data is used.The study showed that environmental certification constitutes a great challenge for the municipality of Uppsala.

This study will focus on how patients that suffer from self-injurious behaviours experience the relation between their self and body according to some professionals. The purpose is to enlighten why a person who has mental problems chooses to injure his or her body. We believe that the reason behind this is based on the early attachment between the parent and child. We also believe that a person only continues with this behaviour if he or she gains from it. The research questions this study raises are:· How does a person with self-injurious behaviour experience the relationship between their body and their self?· What is the effect of self-injurious behaviour on the body and what is the effect on the relationship between their body and their self.· How did the relationship between body and self evolve?This study is qualitative and is based on interviews from our respondents of whom all work or have worked with self-injurious behavioural patients.

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.

This essays main focus will be on emergency shelters in disasters, and their understanding in gender awareness, by focusing on the way gender is constructed and seen. This dissertation will examine documents from Australian Red Cross and IASC (Inter Agency Standing Committee) in order to explore how they work with gender and shelter related issues. The objective is to examine and with help from these documents see how gender is constructed. The method and theory is based on Carol Bacchis; What?s the problem represented to be approach? (WPR-approach).

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.

During the past decade, consumer health information-centers have been developed at the hospital libraries in Sweden in order to meet the increasing demand from patients and their relatives concerning consumer health information. In 1993, the hospital libraries in Falun, Västervik and Karlstad launched a consumer health information database called PION. The aim of this Master's thesis is two-fold. My first aim is to describe and discuss the principles of user-oriented evaluation. In my attempt to convey the theoretical discussion into the everyday life of librarianship, my second and most important aim is to conduct a user-oriented evaluation of the database PION.

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