Abortion remains a contentious issue, which greatly raises ethical problems. This thesis examines the leading arguments in the Swedish abortion debate around the ? in terms of legislation ? critical years of 1938 and 1974. With Foucault's genealogical method, Butler's theories of gender as a social construction in relation to power and doxa, the study examines what the development of the argumentation says about the views on morality, the woman's body, life, individual and state? How has the arguments pro and against abortion changed over time and what does this say about the norms that guide and orientate the arguments? The most obvious change in argumentation is seen in the shift from an absolute moral and conservative position into an increasingly relativistic and liberal position, and this study will argue that this shift has its prerequisites in the changing status of the citizen and state.

Choosing the right user experience evaluation method can be difficult, choosing the right one for mobile user experience can be even more so. One major cause is that mobile usage is context dependent. Another contributing factor is that there is not one widely adopted theory or framework for user experience due to its complexity.The purpose of this study was to evaluate an existing method artifact in its feasibility for evaluating mobile applications. The chosen method, AttrakDiff2 is a self-reporting semantic differential questionnaire to evaluate the user experience of an interactive product, based on its hedonic and pragmatic qualities.A study was conducted where the participants assessed one mobile and one web application, which were later rated with AttrakDiff2. The completion of the questionnaire was conducted as a think-aloud session subsequently followed by an interview.The results suggest that the participants experience was affected more by the evaluated application style than the different platforms.

The aim of this thesis is to form a theory of the green consumer power and to distinguish whether this phenomenon could indicate a movement toward the ecological citizenship. To do so, scientific theories regarding the responsibility of companies have been used, as well as the public choice theory, to link individuals as citizens to individuals as consumers. The motives of corporate environmental responsibility, along with consumers ability to bring pressure in different dimensions, are later drawn on as indicators applied to empirical information. The largest producer of ecological products in Sweden, Arla Foods, is employed as case study to explore if the green consumer power can and does exist. The ecological citizenship uses the ecological footprint, to define in what ways we can minimize our part of environmental degradation.The study seems to strengthen the theory, consumers do have a power to make companies go green and they tend to use it increasingly.

In 1993, Sweden signed the Convention on Biological Diversity and thus agreed to conserve our indigenous biological diversity. As a part of the convention, Sweden is obliged to conserve a number of domestic animal breeds and among them the Linderöd pig. In 1952, the zoo, Skånes Djurpark, took care of a pregnant sow that was regarded to be related to the old "forest pig". The old forest pig was thought to have been extinguished by the early 20th century as a result of the ban on boars not approved by state inspectors. However, according to later accounts, several farmers still kept some of these non-approved pigs.

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.

In a column experiment the effect of three different biochars on nitrous gas emissions, nitrogenretention and water filled pore space (WFPS) were studied in a Swedish sandy soil, classified as aCryopsamment. Ammonium retention was positively correlated, while KCl-extractable ammoniumwas negatively correlated, with the specific area of the biochars. The question was raised whether thenegative correlation between extractable ammonium and biochar specific area reflects the amount ofammonium present in the soil or its extractability from the biochar, and whether methods forextracting soil mineral nitrogen, like KCl-extractions, have to be modified for application on biocharamended soils. There was a tendency of increased nitrate retention and KCl-extractable nitrate withbiochar and KCl-extractable nitrate was positively correlated with the specific area of the biochar. pHwas higher for all biochars compared with control, although the differences were not significant, andWFPS was lowered by biochar addition, significantly in one case.

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.