Målet med Brunnsviken Brief Quality of Life Inventory (BBQ) är att skapa en kortfattad och lättadministrerad skattningsskala för självupplevd livskvalitet med goda psykometriska egenskaper vilken är gratis för alla att använda. I framtagningen av BBQ har data insamlad med Quality of Life Inventory (QOLI) i tidigare studier använts för att identifiera de livsområden med störst betydelse för självupplevd livskvalitet. I aktuell studie har normvärden tagits fram för den i studien ingående undersökningsgruppen bestående av 167 psykologistudenter. Studien har visat att BBQ har utmärkt reliabilitet (test-retest), 0,89. Vidare hade BBQ lika god validitet för undersökningsgruppen som QOLI.

Tidigare studier har visat att bristen på strukturell empowerment på vårdavdelning ofta leder till försämrad personalhälsa, sämre arbetsmiljö och mindre samarbete med kollegor samt högre grad av utmattningssymtom. Syftet med studien var att beskriva vårdpersonalens upplevelse av strukturell empowerment vid en akut kirurg- och ortopedavdelning, samt att undersöka om det finns några skillnader mellan sjuksköterskors och undersköterskors skattning av strukturell empowerment. Ytterligare ett syfte var att beskriva vårdpersonalens upplevelse av arbetstillfredsställelse samt att reliabilitetstesta ett instrument som mäter strukturell empowerment. Data gällande strukturell empowerment samlades in med instrumentet Condition of Work Effectiveness Questionnaire (CWEQ och CWEQ II) och data gällande arbetstillfredsställelse samlades in med en studiespecifik fråga. Femtioen enkäter delades ut, 43 personer svarade vid första mätningen och 39 personer vid andra mätningen.

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.

This thesis describes the redesign ofequipment designed for drying bags thatis used in Fresenius Kabis´manufacturing of their nutritionmedicine in Uppsala. The need of thistask arise during the start of thedevelopment of a new packaging line werethis equipment were meant to be used. Anevaluation of the bagdryers capacity andcapability was necessary.The work started with gathering ofinformation from suppliers of the usedcomponents and from the responsibleengineers for this equipment. Aneducation to learn how the equipmentworked and how to operate it were taken.That was followed by the creation of astudy plan were the tests were plannedto test different parameters effect onthe drying result and to see if thebagdryer managed to handle the bags ofthe correct format in the pace that theequipment should be designed for.The test results detected a need ofdesigning a unit with a function thatholds the bags in place while passingthrough the dryer in order to attainhigh quality results. The results werelater used for optimization of thedesign.

Många studier har påvisat en skillnad mellan förmågan att benämna verb respektive substantiv hos patienter med hjärnskada samt hos kontrollgrupper (Caramazza & Hills, 1991; Mätzig, Druks, Masterson &Vigliocco, 2009; Szekely et al., 2005). Samtidigt bedöms aktivitetsord utifrån vissa studier vara mer krävande att tolka, vilket kan vara en bidragande orsak till skillnader i benämningsförmåga (Liljeström et al., 2008; Mätzig et al., 2009).Action Naming Test (ANT) är ett verbbenämningstest utformat av Obler och Albert 1979 (Barth Ramsay, Nicholas, Au, Obler & Albert, 1999), vilket översattes till svenska och normerades av Lindahl och Oskarsson inom ramen för ett magisterarbete i logopedi (2011). I normeringen genererade vissa ord många felsvar och sågs som problematiska, och en reanalys av det insamlade materialet efterfrågades. Syftet med föreliggande studie är att genomföra en förnyad analys av insamlade data och ta fram en ny normering för ANT i en population svenska vuxna, efter exkludering av problematiska ord.I syfte att undersöka vilka ord som gav upphov till många felsvar och orsaker till detta, gjordes en ny genomgång av 120 tidigare insamlade testprotokoll, samt en felsvarsanalys baserad på Barth Ramsays och medarbetares utvecklade modell (1999). Efter genomgång av angivna svar, analys av felsvar och ordens användningsfrekvenser i svenska språket, exkluderades tolv ord.  Jämförelse av resultat mellan tre åldersgrupper (20-30år, 31-65år, 66-83år), två utbildningsnivåer (?12 år, ?13 år) och kön gjordes både före och efter borttagning av de tolvorden.

The current study aimed to test the public self-consciousness impact on creative performance. An experimental design was used in which 40 participants were randomly assigned to two groups, one of which was the experimental group and the other was the control group. A mirror was used in the experimental group to induce public self-consciousness among the participants while they performed creativity tests. A consequence test was used where the participant had to give suggestions for the given scenario "What would happen if everyone became blind?" which was then measured in the number of proposals (fluency).

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.