As a part of the fight against the global warming the energy production needs to be more efficient and redirected towards sustainable options. One alternative is cogeneration, which means that electricity and heat is produced in one plant. The purpose with this survey is to examine if there are any commercial available combined heat and power techniques, based on combustion of solid moist biomass, which are suitable to small-scale applications. The technique must be able to produce between 2 and 10 MW thermal and the heat demand is a Swedish district-heating system. When already published reports had been studied, the Organic Rankine Cycle (ORC) was chosen as the most suitable technique.

Today Scania give a high priority to the continuous improvements on the quality of their vehicles. To follow up the flaws in product quality, which are recognized by the repairs at the local workshops, material requests are carried through to be able to analyze the defects at the plant in Södertälje ? in purpose to improve the product quality. The material requests are also carried through to compensate the workshop for their expenses and to check that they are working according to the company?s warranty manual.Due to local routines and different distribution structures at the different markets the lead times and the costs caused by the flow of material are hard to estimate.

The aim of this study is to understand which strategies helped women escape honourbased violence, by reading the autobiographies of seven women. Honourbased violence is a relatively new problem in Sweden, but it has existed for a long time. According to FN (2012) 5000 women are murdered every year in the name of honour. Honourbased violence is about maintaining the honour of the family. Womens sexuality is connected to men´s honour, and because of that they are not allowed to express it.

This thesis investigates the overall risks of flooding over the Design Basis Flooding Level (DBFL) at the Swedish nuclear power plants (Oskarshamn, Ringhals and Forsmark), using statistical data and methods, but also considers historical events which might affect the overall risk of flooding at the specified sites.Considering the nuclear accident which happened in Fukushima in conjuction with the earthquake and tsunami which struck eastern Japan on 11 March 2011, operators and licensors of nuclear power plants all over the world conducted reviews and investigations on the overall risks posed to the plants from external events. One important such event is extreme water level.One part of the thesis includes an extreme value analysis (using Generalized Extreme Value distribution and Generalized Pareto distribution) of water level data from SMHI (Sweden's Meteorological and Hydrological Institute) measured at stations close to the Swedish nuclear power plants. The results of the statistical studies indicate that considering the return period used in the thesis (100 000 years), the water levels at the Swedish nuclear power plants are not expected to exceed DBFL.The other part of the thesis consists of a historical study of extreme weather-related events. The results of this study indicate that no historical events seem to have occured which would indicate a higher risk of flooding than the one suggested by the statistical study. .

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 aim of this master?s thesis is to study librarians? views on children and young people as Internet users in Swedish libraries. It examines what types of problems and possibilities the librarians see with children?s and young people?s use of the Internet, how these problems might be solved, and what they think about regulations and filters. Qualitative interviews were conducted with nine librarians, and their statements were analysed with David Buckingham?s After the death of childhood as a theoretical foundation.

Background: Mental health problems among children and adolescents have increased. The school is an important arena for prevention of mental health problems. There is a huge demand for successful interventions. SEL is a method that aims to increase the social and emotional competence among children and adolescents. The program SET applies this method.

The purpose of my study is to find out how preschool teachers reason concerning their work withgender equality from outside of the curriculum. I propose the following questions: If there is apositive view over the relevance of gender equality from outside of the curriculum? Does thepreschool teachers think themselves to work with gender equality from outside of the curriculum?Does the preschool teachers have any thoughts on whether working with gender equality will have apositive or negative effect on the children? In what way does the preschool teachers reason on theirown meetings with boys and girls? The method chose to use is a qualitative study that is based oninterviews. I have interviewed four preschool teachers in a small society called Katrineholm. Afterthe interviews I have analyzed the material and split it into themes that has been processed.

Prisons are for many an unknown world, and few know about the prison culture which includes unwritten rules, power structures, interactions and relationships between inmates and correctional employees.While many think that Swedish prisons are too comfortable,inmates are facing extreme stress due to surveillance and detention, by depriving inmates their possibility to shape their own lives. When the inmates is deprived of control over their own life?s the penal system have great power to shape and to influence the inmates.The purpose of this paper is to investigate prisoners' experiences of treatment and exercise of power in prisons. Starting point is to examine what are the kinds of relationships between prison officers and inmates from a power perspective, if there is any difference between the closed and open prisons and how the inmates affected by the structures that exist.Based on my overall purpose, and with my informant´s stories which revealed a number of similar points, four main headings were developed; Mass media and society´s view, and unknown world, interaction between inmates and prison officers and consequences.Prison officers with the role as a contact persons as well and other staff which work close to the inmates play a significant role by supporting through motivational interviewing and can help the inmates to gain insight about their life situation and actions. My informant?s underlined that a good contact person can either help or discourage.Inmates who contributed with their experiences express that there is a big difference between open-and closed prisons.

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.