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.

Introduktion: Människan får idag inte motion i vardagen i samma utsträckning som förr och behöver därför söka denna på konstgjord väg. Musik påverkar människor i samband med fysisk aktivitet och kan fungera som en motivationsfaktor som hjälper utövaren att känna meningsfullhet med denna ?tillgjorda? träning. Särskilt vid submaximala arbeten, men även till viss del vid maximala, kan musik distrahera utövaren genom att ta bort fokus från kroppens utmattningssignaler. Musik kan även bidra till högre arbetsintensitet, samt till utförande av fysisk aktivitet under en längre tid.

Syfte och frågeställningar. Syftet med studien var att via ett maximalt och ett submaximalt cykelergometertest (Ekblom-Bak test) ta reda på maximal syreupptagningsförmåga hos relativt friska kvinnor och män i åldern 65 ? 78 år, samt att se hur väl det submaximala mätvärdet korrelerade med det direkt uppmätta maximala värdet. Målsättningen var också att jämföra testvärdena mellan två separata förtest och ett eftertest efter en 6 veckors träningsperiod. Frågeställningar: (1) Vilken maximal syreupptagningsförmåga har relativt friska kvinnor och män i åldern 65 ? 77 år? (2) Hur väl korrelerar det beräknade VO2max-värdet från det submaximala cykelergometertestet med direkt syreupptagningsmätning från ett maximalt cykelergometertest i den aktuella åldersgruppen.

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.

Syftet med studien var att undersöka sjuåriga flickors och deras mödraras attityder till mat/ätande samt att undersöka om det förekom ett samband mellan mödrars och döttrars attityder till mat/ätande. Studien var en delstudie ur IDA-projektet som hade en prospektiv longitudinell design. Flickor och deras mödrar rekryterades genom ett slumpmässigt stratifierat urval av skolor i Uppsala län. Sammanlagt 161 flickor och deras mödrar (n=133) deltog. För att bedöma attityder till mat/ätande har två självskattningsformulär använts, Children?s Eating Attitude test (ChEAT) för flickorna samt Eating Attitude Test (EAT) för mödrarna.

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.

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.