Each year, Heterobasidion spp. is a major cause of economic losses to forestry in the northernhemisphere, including Sweden. New results indicate that pre?commercial thinnings could be at riskfor Heterobasidion spp. infections.

The purpose of this study was to find out if motion movements, e.g. number of lying bouts and lying time with a registered activity monitoring sensor can detect an impending calving and thereby be used as a measure and an indicator for an upcoming calving. For this, automatically step sensors were used and were attached to one of the cows? hind leg. The sensor registered the individual step and movement activity of the cow.

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.

A majority of conducted studies connected to democratic socialization and the party-political education has primary affected students in higher education. In this study I intend to find out how primary school teachers handle controversial issues in social science connected to the political parties.  The Swedish Democrats are by many perceived as a controversial party and while the school?s mission is to educate students to think independently another mission implies that certain views are not to be uttered if they stand contrary to the basic democratic values. The aim of this study is to obtain knowledge in and about the teachers view on the dilemma between the more nurturing assignment versus the knowledge assignment and in connection to this how they approach the Swedish Democrats in the classroom. For further immersion the research treats the following questions:  How do teachers view their own role as intermediaries in democratic education?  How to teachers portray the Swedish democrats in education?The survey was conducted by using qualitative interviews.

Genom konstruktion och tillverkning av prototyper samt med hjälp av ljud- och flödesmätningar av dessa, tillsammans med standardmodellen, har vi lyckats förbättra flödet genom ventilen Al-db 450, producerad av Fresh AB i Gemla. För ljudmätningar har en testrigg konstruerats och tillverkats..

Kundrelationerna i svenska B2C-företag är inte lika goda som de var för 60 år sedan och de är inte lika goda som företagen skulle önska att de var. Forskningsfrågan och syftet med uppsatsen var därför att förklara vad som påverkar svenska B2C-företags beslut att utnyttja Radio Frequency Identification (RFID) som identifieringsteknik för att personliggöra kundrelationer inom sina lojalitetsprogram. Studien utfördes som en fallstudie då vi undersökte hur två stora svenska B2C-företag, IKEA Family och ICA, arbetade med lojalitetsprogram, identifieringstekniker och hur de ställde sig till alternativa identifieringstekniker gestaltat genom RFID. Studien utfördes med deduktiv ansats genom inledande teoriinsamling och därefter genom intervjuer med en intervjuperson på vardera företag. De slutsatser som sedermera kunde dras var att tillräcklig kunskap saknas kring RFID och dess potential, att det är en ekonomisk fråga och en stor investering för företag som inte brukar vara först att ta till sig ny teknik som dessutom inte är standardiserad samt att det skulle kunna kränka kundernas integritet och därmed ha motsatt effekt till lojalitetsprogrammens syfte..

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 goal of this thesis work is to enable an existing UHF radar to operate in the VHF band instead. In order to achieve this, new coherent local oscillators are required. Different options are suggested and one of them is implemented and analyzed..

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.

Comfort analyses regarding human induced vibrationsIt is not too common among civil engineers in Sweden to perform comfort analyses considering the vibrations caused by human activities. In addition, the Swedish standards lack requirements to be used for comfort analyses in design of floor-systems. The demand for large spans in combination with slender slabs, is today a reason to investigate the floor-system constructions, in order to prevent disturbing vibrations and oscillations.The purpose of this thesis is to create a guide for how a comfort analysis, considering vibrations, should be implemented. Göran Svedenbjörk who is an expert in structural dynamics has been interviewed where he presents his latest project Värtaterminalen and answers some questions about vibrations due to human activities.Floor-systems, consisting of concrete slabs supported by steel or concrete beams, have been investigated with simulations in the finite element program Abaqus. In the simulations, the influence of various factors on the natural frequency of floor-systems and the acceleration level caused by dynamic loads, is studied.