Evaluations of open Ditch status and function, with an assessment of suitability of a conversion to a two stage ditch as a low maintenance alternative. To illustrate Swedish drainage problems this work focused on two agricultural drainage associations assessed in detail with a new method called MADRAS (Minnesota Agricultural Ditch Reach Assessment for Stability). With the assessment of the MADRAS method estimates were made to conclude the ditches operating problems. This was made through measurements of sediment depths, mass bank failures etc. in order to quantify ditch problems and propose practical actions for improved ditch stability and water quality. The MADRAS surveys were conducted in two main ditches that drains 2900 hectares of land on the northern shores of Mälaren. In the study measurements of the ditch cross-sections were also conducted to compare actual profiles with the original map profiles. The evaluation showed that parts of the studied ditch sections were operatively poor; main reason was mass bank failure, undercut channel banks, sediment aggregations and narrowed ditches. The profile survey shows that a majority of the profiles 80 % has sediment accumulations there remains only 64 % of the original profile from the map.

In this thesis we have tried to show the problems that the categorisation of ?norrlänningar? generates. We have also tried to describe what the stereotypes of ?norrlänningar? are by examining what people say on web logs. The method we have used to find the stereotypes in our empirical material is the discourse analyse.

Chronic obstructive pulmonary disease can limit patients physical abilities and contribute to social isolation. The purpose of this literature study is to investigate men's and women's experiences of living with chronic obstructive pulmonary dis-ease, and the supporting and guiding role of the nurse to an increased quality of life. 13 critical reviewed articles were used to find the answers to our questions. Quality rating forms were used in order to guarantee a good scientific quality. The results show that, it is of great importance for the COPD-patients well-being to experience social support from those around them, and to have a close relation-ship with their families and friends, in order to experience quality of life.

The study intends to find easily recognizable indicator species for water quality in the constructed wetland of Flemingsbergsviken. The study is relevant since indicator species can be difficult to determine for common people. Easily recognizable indicator species could improve dialogue between the scientific community, administrative authorities and the general public. Such species could be used in education systems, associations or in information campaigns. Therefore, I have chosen to refer to these species as didactical species.

In this thesis, the four types of math problems that occur in the digital educational math game Zcooly Affären 2 have been analyzed. Focus has been aimed at how the problems mediate instructions and mathematical concepts to players, and how the mathematical content is supported by the context within the game. The result shows both positive and negative aspects of the math problems, based on the theories for math education used in this thesis. Apart from the analysis of the game, this thesis also presents earlier research regarding what possibilities digital games possess as tools for learning. Researchers have partly different views on how digital games should be designed to enhance learning, and whether or not games are efficient to use for learning purposes..

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.

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 essay aims to investigate how women who fall ill in Rheumatoid Arthritis, during or just after their pregnancy, experience and cope with this. The main questions were 1. What experiences did the women have from receiving their diagnosis? 2. How has the motherhood and the sickness affected one another? 3.

Prisons are for many an unknown world, and few know about the prison culture which includes unwritten rules, power structures, interactions and relationships between inmates and correctional employees.While many think that Swedish prisons are too comfortable,inmates are facing extreme stress due to surveillance and detention, by depriving inmates their possibility to shape their own lives. When the inmates is deprived of control over their own life?s the penal system have great power to shape and to influence the inmates.The purpose of this paper is to investigate prisoners' experiences of treatment and exercise of power in prisons. Starting point is to examine what are the kinds of relationships between prison officers and inmates from a power perspective, if there is any difference between the closed and open prisons and how the inmates affected by the structures that exist.Based on my overall purpose, and with my informant´s stories which revealed a number of similar points, four main headings were developed; Mass media and society´s view, and unknown world, interaction between inmates and prison officers and consequences.Prison officers with the role as a contact persons as well and other staff which work close to the inmates play a significant role by supporting through motivational interviewing and can help the inmates to gain insight about their life situation and actions. My informant?s underlined that a good contact person can either help or discourage.Inmates who contributed with their experiences express that there is a big difference between open-and closed prisons.