The health care formulation of the principle of autonomy can be expressed as follows; ?you shall not treat a patient without the informed consent of the patient, or his or her lawfulsurrogate, except in narrowly defined emergencies?. The principle of beneficence refers to a moral obligation to act for the benefit of others. In heath care, the good or benefit in question is the restoration of the health of the patient. In fulfilling this obligation of beneficence, the physician sometimes intentionally overrides the patient?s preferences or actions for the purpose of benefiting the patient.

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 Bachelor Thesis in the area of Computer Science and Work Science describes the process of design and development of an IT-tool between the municipality of Ron-neby and TietoEnator a development and consultancy firm, the Gothenburg office. The thesis focuses mainly on the cooperation between the consultant designer and the local municipal. Through cooperation, the organisation is incorporated into the tool and the tool is incorporated into the organisation. Concepts that are central in this thesis are design, cooperation and tailoring. A question raised is, if distance work and extensive cooperation might be a good way of working in the process of design and development, when the organisation is being incorporated into the tool. Advan-tages and disadvantages of this way of working are discussed. Our studies show that distance work is a good complement for personal meet-ings between designer and co-developer.

This report deals with activities that from a CSR perspective are considered to create a shared value for a medium-sized construction company in Sweden. The CSR definition used in the report is the European Commission?s since it reflects the valuecreating aspects of CSR, in contrast to the traditional philanthropic aspect of CSR.Companies in the building construction industry have difficulties identifying activities that create value in society and in the company. The aim with the project is to, from a CSR perspective, identify and evaluate value creating activities in a building construction company. The activities will be evaluated with respect to competitiveness and how they can be implemented into an organization.

Background: Good quality of communication has a significant role and is essential in the care, and there are many factors that have an impact on the communication between nurse and patient. It is important that the interaction and communication is directed to and focused on understanding in broad sense in order to make sure that the meeting between nurse and care taker will result in something positive. Through a greater understanding the cooperation between nurse and the patient will be facilitated, which will create opportunities for both sides to be part of and contribute to a meaningful rehabilitation.Purpose: The aim of the study is to describe how the elderly patient and the nurse experience the communication within the health care, however also to identify what factors that are essential for an optimal communication.2Method: In this study the method that has been chosen is metasynthesis. The metasynthesis method implies that qualitative studies, that illustrate elderly patients and nurses perceptions and experiences of communication within health care, have systematically been reviewed and compiled to a result.Result: The analysis of the study?s results in a composition that consist of the following three themes; the patients and the nurses perspective on how information should be conveyed, the role of the time aspect in communication and the impact of the attitude on communication.

Two haematological instruments intended for small animal clinic use were evaluated at the Department of Clinical Chemistry, Swedish University of Agricultural Sciences (SLU), Uppsala, Sweden. The QBC-V and Vet abc were compared to a reference instrument, the Cell-Dyn 3500. Fresh blood samples were obtained from canine and feline patients from the University Veterinary Hospital, SLU. The QBC-V was used for 111 canine samples and 78 canine blood samples were analysed with Vet abc. From cats, 23 samples were analysed with both instruments.

That the Swedish society looks different depending on the location is a fact and that in turn means different schools with different conditions and resources depending on the localization. We have in this study interviewed four teachers in a high-status school and four teachers at a low-status school in a municipality south of Stockholm. The purpose of our study is to find out how teachers / educators perceive children's physical and psychological safety in their workplaces, and if there is a difference between the schools in resource allocation.In order to answer our purpose of the study, we chose to interview teachers about how the school looks for the kids in order of enough resources such as books for all, enough facilities and competent and even skilled teachers. To take into account and consider people´s backgrounds, experiences, and cultural frames of reference is a way to interact within a respectful world, and as a good approach to educating children from all parts of the world and with all the different mental and physical difficulties. The two schools in our study show lack of resources but of different kinds.

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.