Detta kandidatarbete undersöker gröna tak i urban miljö. Gröna tak är i denna uppsats ett begrepp och samlingsnamn för vegetation på byggnaders tak i olika former. Trenden för gröna tak pekar uppåt, främst utomlands men även i Sverige. Emporia i Malmö som är ett av Skandinaviens största köpcentrum är byggt med ett så kallat grönt tak. Detta tak anlades dock på initiativ av byggherren och inte efter kommunens beslut. Huvudsyftet med uppsatsen är att undersöka om och i så fall hur kommunen kan planlägga gröna tak. Fördelar och nackdelar med det gröna taket kommer också att utgöra en del av uppsatsen.

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 objective of this study was to examine how an IT department has been affected by the changes of increased local usage of IT, and how the usage have affected municipalities IT departments demands of IT support. In the study we explore how both the IT department and the IT support works by interviewing present and former employees at the local IT department. The current IT department have undergone a series of local changes over the last 20 years, the department has gone from only having internal users to getting the entire municipalitiy?s agencies of IT as users. It started with how the municipality began to dig down fiber optic cable in the middle of the 1990?s, and today has started to develop solutions as to how to meet the demands of future usage of IT.

ABSTRACTSegregation is more and more common in the Swedish society, especially in those suburbs called ?miljonprogramsförorter? which are characterized as grey and boring districts with low status. These suburbs are often mentioned in the media and the public associate them with immigrants, problems and crimes. Kungsmarken in Karlskrona is one of these suburbs and the purpose of this essay was to compare the media image with the images local participants had of Kungsmarken. The questions I brought up were how media was describing Kungsmarken, how this image has contributed to the low status of Kungsmarken, and if this image was reflecting the local participants? images.

Based on different integration policies, we aim to examine how five municipalities in Stockholm County are working to promote integration at a local level with focus on voter participation and to some extent, representativeness among foreign-born. Statistics provided by SCB shows that foreign-born tends to vote to a lesser extent than those born in Sweden. Further, we aim to examine the implementation of two policy documents established at a national level concerning integration in contrast to policy documents established at a local level in each different municipality. Further, we aim to examine summaries of actions taken in response to the local integration programs, as well as personal interviews. Each municipality will be considered separately, but we thus seek to make a comparative study.

This study is made for Södra skog and is concerning how to minimize soil damage from planning to plantation. The purpose of the study is from the respondent?s perspectives; their own ideas and approaches. What emerged from the interviews is that the communication between the different organization levels can be improved. It is also important to prevent damage on the soil and to have in mind that the process of planning tracks to plantation continues for a long time and because of that, the soil condition meanwhile will change..

The purpose of this study is to examine some after-school teachers? perceptions about the outdoor stay at the after-school care centre in the schoolyard and in the leisure- environment.Five semi-structured interviews were conducted with the after-school teachers at five after-school care centres in the Stockholm area.In the theoretical part presents the leisure- governance and ongoing research on outdoor learning, research on the school playground and kindergarten local environment affects children in their development and learning, and after-school teachers? professional identity.The theoretical foundation is based on the phenomenographic approach.The questions are:? What is outdoor education according to the after-school teachers?? According to after-school teachers, what educational opportunities are provided by the schoolyard and the local environment?? How do the after-school teachers use the schoolyard and local environment?The result shows that outdoor education can be a knowledge invigorating complement to the indoor teaching and a way for the after-school centre to supplement the compulsory schoolday. The play outdoors can help to increase children's social development, creativity and imagination. The after-school teachers used the schoolyard and local environment for various purposes which may be due to different circumstances, knowledge and experience to carry out educational activities outdoors. But it may also depend on whether the after-school teacher focuses on the regular school day or in the afternoon at the after-school care centre..

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.

We live in an exciting society, characterized by continuous changes and challenges. The effects of the globalization are widespread. The continuous flow of people, capital and goods follows in the wake of advances in communications, transport and information technology, resulting in a changed situation for different stakeholders in the society. This situation leads to increased cooperation and exchange, but also increased competition. The primary means of collecting empirical data for this study was interviews and a document study.

During the 1920?s the town of Bollnäs had the ambition to expand. The expansion included a merger with Björkhamre and the colonization of unused areas, e.g. the area around Onbacken. The archaeologist Gustaf Hallström came to Bollnäs to investigate an ancient tomb located on Onbacken.

The responsibility to identify, protect, look after and develop cultural and historical values in our surroundings - urban as well as rural - falls on the local authorities. This essay focus on local preserve programs for cultural landscapes in Sweden?s municipalities. Programs for preserving cultural landscapes are important tools in the aim to reach a sustainable development of these values. The object of the essay is to delineate how the municipalities handle cultural landscapes in terms of how cultural and historical values is identified, how the landscape is divided and assessed and how different aspects of intangible and tangible values are taken into consideration.

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.