Syftet med studien var att undersöka om det fanns ett samband mellan den upplevda stressen hos tjejer 18-19 år, och relationen till föräldrarna. Följande forskningsfrågor ställdes för att besvara studiens syfte; Hur ser relationen till föräldrarna ut, hur upplevs prestationskraven, vilka faktorer är det som stressar, samt hur omfattande är den upplevda stressen? Undersökningen var en kvantitativ studie där datainsamling gjordes med hjälp av en webbenkät. Webbenkäten gick ut till 232 tjejer varav 50 stycken svarade på enkäten vilket innebär ett bortfall på 78 %. Databearbetning av resultaten gjordes i statistikprogrammet Graphpad Prism 6 där testerna utgjordes av Mann-Whitney test samt Kruskal-Wallis test.

Bakgrund: Self-efficacy, en persons tilltro till sin förmåga, är en faktor som påverkar hälsobeteenden såsom fysisk aktivitet. Exercise Self-Efficacy Scale mäter denna egenskap genom självskattning, men har inte utvärderats för personer med schizofreni.Syfte: Att omarbeta Exercise Self-Efficacy Scale för personer med schizofreni.Metod: Deskriptiv design med psykometrisk prövning av den omarbetade Exercise Self-Efficacy Scale. Första delen av studien bestod av fokusgrupper med patienter och personal på en psykiatrisk öppenvårdsmottagning för patienter med psykossjukdom. Utifrån resultatet av dessa utvecklades Exercise Self-Efficacy Scale ? Schizophrenia Version.

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.

Hallsta paper mill uses large amounts of water during the pulp and paper making processes. The wastewater is treated in two separate activated sludge processes referred to as BIO 1 and BIO 2. The main aim is to reduce the organic substance content, measured as COD (Chemical Oxygen Demand) before the wastewater is released into the environment. Since the effluent produced is very rich in organic substances, the addition of nitrogen (N) and phosphorus (P) are necessary to give satisfactory treatment results. Problems with sludge bulking sometimes occur which lead to increased levels of suspended matter and nutrients in the effluent.

This essay examines a presupposed correlation between the way one look upon values and the way one look upon the will of the people in a theoretical democratic context. The more specific purpose is to test the following hypothesis: There is a reversed connection between the way one look upon values and the way one look upon the will of the people in a theoretical democratic context, that is; a strong claim of values give reason to a limited conception of the will of the people and a weak claim of values gives reason for a more unlimited conception of the will of the people.In order to test the hypothesis I examine three different conceptions of democracy, these are: pluralist democracy, deliberative democracy and constitutional democracy. I analyze the way they look upon values, there view of the will of the people and finally if there is a connection between the way they look upon values and the will of the people. Values should be understood in a metaethical context. In other words it is not values in the ?common? meaning, instead its how val-ues in them selves should be understood, and even more relevant, what we mean when we ex-press values.My conclusions are, first and foremost, that there is a correlation between the will of the people and values, according to the formulation of the hypothesis.

The most predominant method for forest harvesting in Sweden is the cut-to-length method based on two-machines, a harvester that fells trees and cut them in a predefined length, and a forwarder which transports logs to a landing area for further transport to a processing facility. New machine solutions have to be much gentler to the ground than today?s machines. To be able to develop a forestry machine that preserves the terrain requires a proper understanding of the interaction between tire and soil.The goal of the project is to contribute to the existing knowledge of forest machine tire-soil interaction and to develop a tire-soil model that enables dynamic simulations of forest machines operating in rough terrain. The modeling has especially been focused on the interaction between tires and soft ground.A comparison of theoretical data of different WES-based terrain interaction models and a comparison test data from a full scale field test is presented.

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 purpose of this study is to illustrate how some teachers in multicultural school environments reflecton and experience the educational work with national tests in the third grade for students who do not have Swedish as their native language. The research questions I have chosen to work with are:How do teachers experience working with national tests in groups of students where there are children with Swedish as a second language?How do the teachers reflect on the students linguistic preconditions relating to the national tests in these groups of students?What strategies in their teaching on national tests do the teachers use when it comes to students with Swedish as a second language?In this study I have chosen to use a qualitative interview method. Since the purpose of the study is to understand how teachers reflect on students with Swedish as a second language the obvious choice was to interview teachers who work in a multicultural school. In my thesis I have chosen to use sociocultural theory, Cummins four quadrant model and context for theoretical approach.

To assure good quality the software needs to be tested to find errors and to verify that the programme meets the customer?s expectations. Traditional methods are usually used in software development and means that a number of predetermined steps are followed. By using agile methods the development can more easily be adapted to the changes on the market. With these methods the testing is carried out continuously throughout the project.