Bakgrund Det sker många matförgiftningar i Sverige varje år, kostnaden för matförgiftningar ligger runt 730 miljoner per år, vilket är en stor kostnad för skattebetalarna. Matförgiftningar är ett samlingsnamn för olika förgiftningar via mat. Grundförutsättningar för en säker livsmedelshantering är god personlig hygien, kontroll vid mottagning av varor och temperaturkontroller av livsmedlet. I en studie i USA var det 182 av 313 som hade blivit matförgiftade. 22 % av deltagarna trodde att det var på en plats utanför hemmet.

AbstractDancing and the body`s ability to express itself has been an interest of mine for a long time. For that reason I would like to find out more on how you as a pedagogue can work with dancing as a way to develop motoric activity. The purpose of my research is to find out how pree-school-pedagogue`s and sportsteacher`s are working with dancing, and also how children in a pree-school class apprehends the idea of dancing before and after a dancelesson.My question for this paper is:How can dancetutoring in pree-school develop children`s motoric activity?To find out the answer for this question I have also chosen to use relevant litterature within the subject. Since the examination covers only the answers from four pedagogue`s and six children I can not make a generell conclusion that covers all children or pree-schools.

Många sjöar är idag påverkade av mänsklig aktivitet, bland annat är 1 % av Sveriges sjöar eutrofierade, däribland Ekoln. Ekoln är en stor sjö i Uppsala län söder om Uppsala som länge varit eutrofierad. Fyrisån och Örsundaån är de största inflödena till Ekoln och Sävjaån är ett betydande biflöde till Fyrisån. Kungsängsverket är Uppsalas reningsverk och har sitt utlopp i Fyrisån och som ett led i att minska eutrofieringen byggdes fosforreningen ut 1972. Fosforhalterna i Ekoln sjönk och algblomningarna blev färre.

Thesis purpose: The aim of this paper is to extend the knowledge of what influences the purchase decision of functional food in the store. By applying the M-R model in a new setting - the dairy department in grocery retailing in Sweden - and adding variables related to health attitudes, the aim is to contribute to existing research concerning in-store purchase decision making and store environment as well as consumer attitudes. Methodology: This thesis employs a quantitative strategy with a deductive approach and data has been collected with questionnaires. Theoretical perspective: Environmental psychology serves as an overarching framework where, more specifically, certain aspects of store atmospherics and some variables concomitant to health attitudes provide the theoretical base. Empirical data: The empirical data consists of customer purchasing a functional food product, Proviva, and this is contrasted with a test group, Bravo.

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.

Symmetrisk Lupoid onychodystrofi, SLO, beskrevs för första gången på mitten av 90-talet. Sjukdomen karaktäriseras av att alla klor avlossas inom en kort tidsperiod utan att andra samtidiga systemiska fynd ses. Den bakomliggandeorsaken till sjukdomen är ännu inte känd, men eftersom liknande histologiska fynd som vid systemisk lupus erythematosus, SLE och kutan lupus erythematosus, LE, kan identifieras har en autoimmun bakgrund misstänkts.Hörnstenen i SLE-diagnostiken är ANA-test, för att påvisa cirkulerande antinukleära antikroppar. I enstaka studier har man tidigare hos vissa hundar med SLO kunnat påvisa ANA.Syftet med den här studien har varit att göra ANA-test på hundar med symmetrisk kloavlossning och SLO, samt att genom journalstudier beskriva hur sjukdomen ser ut i Sverige idag.Hundar provtagna och testade för ANA är sju bearded collies, fem riesenschnauzer, tre Rhodesian ridgeback och en toypudel samt tolv kontrollhundar av raserna bearded collie, riesenschnauzer och Rhodesian ridgeback. Samtliga hundar var negativa för ANA.

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.

I föreliggande studie har unga flickors attityder till ätande över tid studeras, samt sambandet mellan föräldrars attityder till mat och ätande och deras döttrars attityder. Detta gjordes genom frågeformulären Children´s Eating Attitudes Test (ChEAT) och Eating Attitudes Test (EAT), från IDA-projektet (Identification of Dieting in Adolescent girls) som delades ut i 40 olika skolor i Uppsala län år 1995 samt 2000. Resultatet visade att det var elva procent av 14åringarna som låg i riskzonen (riskbeteende = 16-72 p) för att utveckla ett stört ätbeteende, medan det inte var någon utav nioåringarna som låg i riskzonen (M 9år = 1,88 M 14 år = 4,35p=.001). Inget signifikant samband mellan varken mammans och flickornas ätbeteende eller pappans och flickornas ätbeteende kunde ses. För att problem med ätstörningar hos ungaflickor ska minska tycker författarna att det är viktigt att föräldrar informeras om hur tidigt deras barn blir medvetna om kroppsideal samt matfrågor.