The Chinese government´s aim to be self-sufficient in food production in combination with the increased food consumption in China has put high pressure on the productivity within the Chinese agricultural sector (He j et al, 2010). In order to increase the productivity, modernization and adoption of new farming techniques are essential. The opportunity to adopt and import foreign technology has lately been possible in China, as more authority and decision rights have been given to the individual farmers and the country has opened up for foreign trade (Zheng, 2012 & Fan, 1991). A more open Chinese market enables new opportunities for foreign agricultural companies to expand their businesses by introducing their products to Chinese farmers. But to succeed with this strategy the Chinese farmers must be willing to adopt these, for them new innovations. Minimum tillage is a tillage practice used worldwide that is suitable in northern China where drought and erosion are the main problems in the crop production (pers.com., Arvidsson, 2012). Potential users? opinion of new innovations such as minimum tillage is closely related to adoption (Rogers, 2003).

The subject of this project focuses on how Landscape Architects by their profession can explore and directly make a difference in the cityscape. This paper documents the process of art - based research practice. The purpose of installing temporary activities is to encourage people in the city to discover, participate and invite people to be more playful in the city. My experience of interaction in public spaces comes primarily from the education within landscape architecture, from site-specific art installations I have performed in different cities and from observations of landscape architecture, street art and urban life in the cities of Vienna, Berlin and Linköping. It is fascinating and inspiring to see how the urban space can invite and allow visitors to participate and therefore feel invited to the open space. As a landscape architect I wish to create urban spaces that are useful and inspiring for their visitors. The projects main question: How can you make temporary landscapes that encourage outdoorinspired activities at selected locations in the city? is answered by practice based research, an approach in which theoretical research are developed through practical experiments in the designing- and implementation process.

Syftet med den här studien är att ta reda på vilka verksamheter som ingår i utomhusundervisningen i åk 1-6 i skolorna i Pargas, vilka möjligheter och vilka hinder lärarna upplever samt hur eleverna upplever utomhusundervisningen. Undersökningen riktar sig till samtliga klasslärare i Pargas stad. Utgående från att allt fler rapporter visar på barns och ungdomars stillasittande, försämrade hälsa och stressymptom behöver vi medvetet fundera på hur vi kan förändra skolans arbetsmetoder för att befrämja välmående och hälsa. Uppsatsen strävar till att ringa in vad utomhuspedagogik innebär, att ge en liten bakgrund samt redogöra för några, främst nordiska forskares syn på utomhusundervisning. Studien innefattar en lärarenkät, några lärarintervjuer samt belyser elevernas åsikter med hjälp av en elevenkät.

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 thesis is dealing with the programs of control regarding deceit and quality assurance within the Swedish social insurance administration in Skåne, the years 2002-2005. In 2005 the Swedish National Audit Office released a report regarding the lack of measures towards deceit and fraud, and the lack of quality in the data for decision making within the administration. The questions to be addressed are why the administration does not make up to the demands regarding quality and measures towards deceit that the government and The National Audit Office demands. The main source for data has been interviews with workers within the administration and annual reports from public authorities. To understand and be able to explain the problems within the administration the theory by Michael Lipsky regarding street-level bureaucrats is used.

Syfte: Undersöka hur fritidspedagoger arbetar med utomhuspedagogik och deras förhållningssätt till ämnet. Metod: Kvalitativa intervjuer genomfördes med åtta fritidspedagoger, fyra från landsbygden och fyra från staden. Resultat: Samtliga pedagoger fann ett personligt intresse för att vistas utomhus och detta syntes i deras verksamhet. Pedagogerna definierade Utomhuspedagogik som att vara utomhus och att bedriva verksamhet där. De anser att man lär sig lättare och på ett annat sätt utomhus.

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.