Bakgrund: Smärtor i ben är vanligt förekommande och neuropati (nervskada) är en orsak som troligen är underdiagnostiserad. Bimanuell (tvåhändig/tvåsidig) nervpalpation och känseltest med sporre har visat sig vara ganska tillförlitliga och enkla test för att hitta nervskada men har inte testats på friska individer.Syfte: Syftet var att undersöka om bimanuell nervpalpation i fossa poplitea framkallar smärta/obehag och om det finns skillnad mellan vänster och höger sida vid bimanuell undersökning med sporre på underben hos friska försökspersoner.Metod: Ett bimanuellt palpationstest av nervi tibialis och peroneus i fossa poplitea och även ett bimanuellt känseltest med sporre över dermatomen L4, L5 och S1 på underben genomfördes. Urvalet var ändamålsenligt och totalt deltog 37 försökspersoner. Åldersspannet var 20 till 57 och medianålder 23.Resultat: Vid palpationstestet hade intensiteten av smärta/obehag en median på 1 (variationsvidd 3) på den 11 gradiga skalan. En stor del skattade olika mellan sidorna i både palpationstestet (11 av 37) och känseltestet med sporre (25 av 37).

The Energy Market Inspectorate is implementing a new tariff regulation in Sweden. A small part of the new regulation concerns effectible operation costs and originally they where intended to be calculated using a modification of equivalent comparison standards, in Swedish Ekm. This thesis is intended to analyze if Fortums grid in Stockholm could be described correctly, using equivalent comparison standards. In Ekm every part of the distribution grid is designated a weighting in relation to 1 km 0.4kV over head line. These Ekm-measurements are intended to simplify comparison between different grid areas with different structure and geographical conditions.

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.

Konkurrensen på dagens varumarknad är hård, studier gjorda av bl. a. Robert G Cooper visar att en stor del av produktlanseringarna misslyckas. I denna hårda miljö har varumärket blivit ett allt viktigare konkurrensmedel och det som förmår att höja en produkt över en annan. Speciellt nya företag är hårt utsatta i denna miljö i och med att de ofta saknar de ekonomiska och organisatoriska resurser som de etablerade företagen innehar.

Syfte: Studiens syfte var att reliabilitetspröva stabiliteten för M-SES för patienter med långvarig smärta genom test-retest metoden. Syftet var även att undersöka samtidig validitet för M-SES, genom att utföra M-SES och SES mätt vid samma tillfälle.Metod: I studien undersöktes self-efficacy instrumentet M-SES på Uppsala Akademiska sjukhus, på avdelningarna för Smärtcentrum och Smärtrehabilitering. Frågeställningarna berörde vilken stabilitets reliabilitet mätt med test-retest som förelåg hos M-SES, samt vilken grad av samtidig validitet som förelåg för M-SES korrelerat med SES. Den slutliga undersökningsgruppen bestod i frågeställningen om stabilitets reliabilitet av 29 patienter (23 kvinnor, sex män), och i frågeställning om samtidig validitet av 22 patienter (17 kvinnor, fem män).Resultat: Vid prövning av stabilitets reliabilitet för M-SES visade resultatet en stark korrelation, med korrelationskoefficient 0,92 och p<0,05. Det förelåg även en god överrensstämmelse för test-retest undersökningen.

Bakgrunden till arbetet var att Länsstyrelsen i Västra Götaland såg att det fanns behov av ett tydligare och mer djurskyddsinriktat graderingssystem för renhetsbedömning av nötkreatur. Syftet med arbetet var att utforma ett graderingssystem för renhetsbedömning av nötkreatur anpassat för djurskyddskontrollanter. Detta genomfördes genom att studera befintlig litteratur samt att utföra intervjuer med djurskyddskontrollanter och en officiell veterinär på ett slakteri.Det har visat sig vara ett stort problem med smutsiga djur inom nötkreaturshållningen. En av orsakerna till detta är hög produktion, som gör att djuret måste äta mer kraftfoder och mindre grovfoder. Detta gör att avföringen blir lösare och lättare fastnar i pälsen.

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.

The aim of this master?s thesis is to examine which ideas about the public library that appear in a selection of municipal library plans and to examine if these ideas are unanimous. The comprehensive questions are: Which ideas about the public library appear in each municipal library plan? How do the ideas agree in the different municipal library plans? The sub questions are: Which judgements of reality appear in the different library plans concerning each municipality and its library needs? How do the municipalities define the concept of development and future demands in the municipality on the basis of the judgements of reality? Which recommendations do the judgements of reality give and how is the plan of action that is established in each library plan justified? Which fundamental views of reality, i. e.