?The trees importance to the street? discusses just that, the trees importance to the street. The purpose of this paper has been to examine what influence the trees have on streets. By writing about good examples of how trees can add good qualities to a street I wish to inspire to more use of trees in future city-planning. I have examined three streets in Malmö and three streets in Berlin and analyzed the trees influences there through the help of literature by three authors: Great Streets (1993) and The Boulevard Book (2002) by Allan B. Jacobs, Trees in Urban Design (1993) by Henry F.

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.

This essay concerns the interpretation of house plans in three-aisled longhouses and hall-buildings, in Scandinavia during Iron Age. Full scale house reconstructions need a better basis of interpretations to understand the patterns of roof supporting post holes in excavated house plans. This has led to the thesis, presented here, that the layout of house plans during Iron Age is based on geometrical proportions. In order to prove this, geometric house plans were applied and compared with excavated house plans in 11different case studies, including the fortification of Fyrkat Denmark. It was found that all house plans in the case studies indicate, that the geometrical proportions 1:2, 1:3 and 2:3 of a given circle must have been used for the basic layout of the roof supporting post holes, using a compass and a straightedge.

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 purpose of this study was to examine the relation between the Big Five personality traits Extraversion, Agreeableness and Neuroticism and the five conflict styles developed by Thomas-Kilmann: Accommodating, Avoiding, Compromising, Collaborating and Competing. The participants consisted of 128 students of the Linnaeus University in Växjö. A questionnaire consisting of two parts were used for this study: Part one consist of a personality-test developed from Lewis R. Goldberg?s Big-five scale, and part two where the participant is asked to fill out Thomas-Kilmanns conflict style test.

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 report is a study in voltagelevel in connection with regeneration of brake energy from the tramtype M31 in Gothenburg.In the act of braking, the tram M31 uses electrical braking where the electrical motors generates energy and if possible send it back to the overheadline, where other trams in the nearby can use this regenerated energy for its own driving force. In cases where no other energyconsumers are located in the same section, there is a resistance witch task is to convert this energy into heat. The regulation of this resistance appears to cause an increase in the voltagelevel into far too high levels.Investigations of the trams regulationequipment and its construction have been done. Further have measurements on the overheadline been performed in order to map the voltagevariations during a longer period of time.The result have been showing that the voltagelevel during regeneration often is as high as 880V-920V, more extreme values have not been observed in a large scale. The values are especially high compared to the nominal voltagelevel.

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.