Sök:

Sökresultat:

2324 Uppsatser om Local heritage - Sida 14 av 155

Från passiv till aktiv strategi - Näringspolitisk förändring och handlingskapacitet i industrikommunerna Bromölla och Östra Göinge

Since the 1980's economic policies has become an important issue in municipalities and more resources are put into projects that are intended to have a positive influence on the local economic growth. From a theoretical perspective of regime theory and a model of local political economy, concerning the strategies chosen by the actors involved designed by Jon Pierre, the discussion points to the fact that it is possible to affect the local development. The municipalities discussed and compared in this thesis, Bromölla and Östra Göinge, have similar prerequisite for growth mainly due to their dependence to large industrial companies.In order to fulfill the aim of the thesis and examine the change in economic policies over time and between the two municipalities a comparative method is used. The creation of local governing coalitions is emphasized which makes efforts and intentions of individual actors crucial for the success of the local economic policies. Bromölla started their more active efforts in the area of economic policies earlier than Östra Göinge and has also come a bit further in the process.

Bedömning av skada på naturmiljö och rennäring för den föreslagna fjällvägen mellan Borgafjäll och Saxnäs : - Väg- och transportforskningsinstitutets metod för bedömning av skada på bevarandeintressen

Assessment of impacts on nature and reindeer husbandry by the considered mountain road between Borgafjäll and Saxnäs- Swedish National Road and Transport Research Institutes method for assessment of damage to heritage assetsThere are plans regarding the building of a new road from Borgafjäll/Båtas to Saxnäs, and two road alternatives have been presented. The road has been localized to an area which is protected as a nature reserve and listed as a Nature 2000 area. This report aims to determine the effects on the Nature 2000 area and reindeer husbandry, and to be a source of knowledge for future environmental impact assessment in that project. In order to assess the impact on nature values and reindeer husbandry a method from the Swedish National Road and Transport Research Institute (VTI) has been used. A literature review has been made to prescribe the effects and consequences.

Gränsöverskridande natur-och kulturvård : Konflikt, motsättning och samarbete i den pyreneiska gränstrakten Monte Perdido

Transboundary protected areas are a fairly recent concept that have been increasing in popularity and are increasingly being integrated into large international organizations? environmental policy making. This essay examines the phenomena through the cooperation between two national parks, Parc National des Pyrénées in France and Parque Nacional Ordesa Monte Perdido in Spain. The theoretical framework used in this essay is based upon border theory, focusing on the different factors that influence the behavior of the border dweller and how the different social conceptions of nature influence the way it is managed. The results in this study result from researching published and private documents from the national parks and interviews carried out with staff from the park administrations from both countries.

Begravningsvapen i ett urval kyrkor. Restaurering i ett idéhistoriskt och etnologiskt perspektiv

Uppsats för avläggande av filosofie kandidatexamenKulturvård, Konservatorprogrammet15 hpInstitutionen för kulturvårdGöteborgs universitet2011.

Lillhagens sjukhus som immateriellt kulturarv - bärare av före detta patienters minnen och berättelser

Uppsats för avläggande av filosofie kandidatexamen iKulturvård, Bebyggelseantikvariskt program15 hpInstitutionen för kulturvårdGöteborgs universitet !2014:46.

Miljöutredning på förskolan Ollonborren i Trollhättan

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.

Automatisering av testprocess för WLAN-kort

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.

Utveckling och implementering av sekvenshanteringssystem åt leverantörer till bilindustrin

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.

Symbolbaserad interaktion i vården : ett komplement till VIPS

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.

IT som ett stöd för funktionshindrade : en studie av hjälpmedelsanpassning

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.

Miljökonsekvenser av biogasutvinning ur ekologiska vallgrödor

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.

En bortglömd guldålder? ? Tillgängliggörande av tidig svensk film till en bredare publik

Early Swedish films from the 1910?s and 1920?s are not only an important part of Sweden?s cultural heritage, but also an important part of the international film heritage. This period is often refereed to as the golden age of Swedish film history. Despite this fact, the possibility to watch Swedish films from this period is very small and the main purpose of this thesis is to examine why the availability of these films has such low priority in the Swedish film policy and at the Swedish Film Institute. With the use of policy analysis, I study governmental policies and policies from the Swedish Film Institute for early Swedish films and seek to identify the policy problem and its different parts.

Prissättning av mark : Lysekils kommun

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.

Praktisk framställning av biogas : konstruktion av en fungerande demonstrationsapparat

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.

Online-communities : hur ser communityanvändare på mIRC?

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.

<- Föregående sida 14 Nästa sida ->