This master's theses was carried out on assignment from Stockholm Vatten AB as a part of a project developing new waste water treatment techniques. The goal of the theisis has been to evaluate an anaerobic membrane bioreactor for treatment of waste water from Hammarby Sjöstad. The bioreactor has not been heated and the main interest has been to study the gas production, power consumption and the reduction of organic matter and nutrients.The system has been completed with a reverse osmosis unit and a total of four batch runs have been made with good results. The use of reverse osmosis allows nutrient in the waste water to be reintroduced into circulation as the reverse osmosis concentrate can be used as crop nutrient.The membrane unit is of VSEP ("Vibratory Shear Enhanced Processing") type and an extensive membrane test has been conducted. This so called L-test helped determine the most suitable type of membrane for the system to allow a higher ±ux and thus lower power consumption.

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.

?VeckoRevyn ? your best friend in good times and bad?? is a BA thesis based on a weekly lifestyle magazine, VeckoRevyn, with a female demographic aged 18-25. Issues of the magazine, published in 2009 and on, is analyzed and dissected to better understand and be able to get answers for the questions of issue. What is said in the magazine, and how does the message reach the audience? Furthermore, the message, as well as the tone used to convey it, is reviewed as part of the discussion about consequence.

This bachelor thesis in Landscape Architecture is about the planning and design of public spaces in small towns in Sweden. My opinion is that the small towns often are overlooked and my determination is to see if that is right. The purpose with this thesis in Landscape Architecture, with focus on a durable society is to find the central public places in small towns and evaluate their function. This thesis has a focus on good design of central public spaces, designed for the inhabitants of the small towns. A small town, which is the focus of this thesis, is defined to have 200-2000 inhabitants. The small towns, which often are built around industries or the railway, have since the nineteen seventies a problem with people leaving them for the cities in the urbanization. Currently there is also the opposite trend with people moving out from the cities, but to live on the country side, not in the small towns.

In this degree project I have tried to analyse thoughts about what?s important in the future work among students that are leaving the Land and animal husbandry programme. I have also asked employer to understand to what degree they knew about the coming employees thoughts about the future. The method was a questionnaire which was sent to 14 schools of Land and animal husbandry. The questionnaire was answered by students in their last schoolterm. I got 167 answers from students. 11 employer also were asked about their ideas conserning the students thoughts about their coming work. The questions where about wages, working environement, responsibility and further education. The questions were multiple choise.

All arable land in Sweden need a proper drainage for an effectively agriculture to take place. Of all arable land in Sweden, about 50% is naturally drained and 50% need artificial drainge. More than half of the tile drained area is in need of new drainage or renewed drainage. A good drainage improves farming and crop growth and increases the opportunity to achieve a high and safe harvest level. Future climate change and agriculture size rationalization will increase the need for good drainage. In this paper, two trials with three drainage distances, performed at Lanna experimental station, were analyzed using a mixed linear model.

In today´s labour market, men and women are segregated, both vertically and horizontally. Exceptions to the rule of gender segregation are few. There is, however, one managerial group where women and men are equal in numbers: school principals. In a short period of time, the distribution in terms of sex among principals in Sweden has changed dramatically. How does gender equality in numbers affect gender equality in a qualitative sense? That is the focus of this thesis.

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.