Due to historically low prices for electricity in Sweden, many small-scale hydropowerplants were closed down. A small-scale power plant has more or less the samemaintenance costs as larger plants, but doesn?t generate as much income. Today?sincreasing price for electricity in combination with a desire for renewable energysources makes small-scale hydropower interesting again.

The main focus for this essay is to describe the relationship between human and nature through a material investigation that takes its shape through sculpture. With the help of a fairytale-like story the reader can share the creation of the sculpture and how my thoughts flow through the process that will result in an exam project. Rooted in earlier projects I discuss the crash between civilization and the wilderness as well as talking about the likeness of the creative process and child play. I also discuss the body's place in the forest and the loneliness that we humans created that has cut us off from the rest of the creatures and plants in the forest. My aim is that in the final piece I will create a fiction place where these can be joined together again.

In this thesis a method for evaluating investments in small scale hydro power is presented. An analysis of the future position that small scale hydro production will have on the Nordic electricity market is also carried out. This is done by an inventory of technology and economic and environmental aspects. The inventory is also a guide as to how the project should be implemented.Hydrolyzer is the name of the Excel tool developed to evaluate investments. The tool requests input data from the user and then evaluates the investment and generates a sensitivity analysis.

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.

BIOGAS POTENTIAL IN GRASSES FROM WETLANDSMarvin MartinsThe purpose of this study has been to survey wetlands that are suitable for mowing and to analyze the biogas potential in the harvested grasses. A preformed investigation showed that there are suitable wetlands, which can be harvestable, namely those mowed formerly in traditional haymaking. The practice of traditional haymaking is dying out in Sweden today but there are several good reasons why it should to be reconsidered. Nature- and cultural values are obvious, also the unutilized energy in the grass.The suitable types of wetland that were specifically studied were the productive wetlands; meadow marshes and wet meadows. These wetlands are represented in the Swedish meadow- and pasture inventory database; (TUVA) and the Swedish national wetland inventory (VMI).

Several radioactive nuclides were deposited in Sweden after the Chernobyl accident in 1986. The greatest attention was given to 137Cs because of its relative long physical half life of about 30 years. 137Cs will be present in nature for more than 100 years before it has vanished completely. When radiocaesium decays to a stable end product ionizing radiation is emitted, which can cause cancer in humans that has been exposed to a high radiation dose. Radiocaesium behaves like potassium and is easily taken up into biological systems.

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.

My essay is an attempt to describe how complicated it can be to follow the rules and maintain boundaries without obstructing the children in their creative development. The aim is to highlight my approach and emphasize the importance of growing up in a kindergarten with standards and values which may not always coincide with their own opinion.I begin my essay with two stories about Emil five years, defying the rule of not climb up the climbing frame roof and Emma for three years, who are keen to spin on the swing, but followour rule and refrain. I wonder what it is that drives some kids to go against the rules and stretch the limits while others do not have any problem doing that we decided? I also tell about the time I as a newly-qualified nanny was rebuked by a colleague when I acted "recklessly". I would handle the situation differently today? In the last story, I praise a child for being "mischievous", which makes me proud.

Chile and Santiago are struggling with heavy environmental problems as a consequence of urbanisation and industrialisation. In the Santiago region the air is seriously contaminated and most of the rivers are classified as heavily polluted.The aim of this thesis is to survey the industrial fluid waste situation in the Santiago region and to make suggestions on technological improvements or process changes. The purpose is also to study five different enterprises more closely and to give more detailed suggestions for improvement. Another purpose is to summarize relevant Chilean legislation.Information, provided by the supervisory authority, about the release of industrial wastewater to rivers has been analysed. Deep interviews have been made with authorities and consultants.

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.