The use of Power Line Communication, PLC, as a communication solution for Automated Meter Reading, AMR, is popular by utilities in Sweden and other parts of the world due to demands of accurate and fast meter reading. However the use of the electrical grid as a communication medium is complex and sometimes problematic. This report handles some of the issues and problems that are important to understand when using the grid as a communications medium. Focus is mainly on investigating high frequency distortion in the Kristianstad power grid own by C4energi caused by a frequency converter. Measurements on site are done to investigate signal damping in the grid, different configurations for the frequency converter and signal strength of the PLC-system.

The use of Power Line Communication, PLC, as a communication solution for Automated Meter Reading, AMR, is popular by utilities in Sweden and other parts of the world due to demands of accurate and fast meter reading. However the use of the electrical grid as a communication medium is complex and sometimes problematic. This report handles some of the issues and problems that are important to understand when using the grid as a communications medium. Focus is mainly on investigating high frequency distortion in the Kristianstad power grid own by C4energi caused by a frequency converter. Measurements on site are done to investigate signal damping in the grid, different configurations for the frequency converter and signal strength of the PLC-system.

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 present study aims to investigate the phonological development of typically developing monolingual Swedish speaking children aged three to four years. The result could be used in the standardization of a new phonological test material for clinical speech and language pathology assessments. One-hundred and thirty four children aged three and four years (73 girls and 61 boys) were assessed with the new material. The children were tested in kindergartens in three communities in southeastern Sweden. Their assessments were audio recorded, transcribed phonetically and analyzed with Percentage Phonemes Correct (PPC) and Percentage of Words Correct (PWC).

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.

AbstractThe future of ethanol is depending on good solutions for the production. ENA energy power plant produces electrical power and district heating by heating biofuel. By building an integrated bioenergy plant surplus steam could be used to produce ethanol as fuel to vehicle.This would mean that ethanol is produced renewable energy and the energy for the process derives from the surplus of power.  ENA energy, MDH (the University of Mälardalen) and the energy authority has initiated a research project were different bioenergy combinations integrate with existing power plant.  As a part of the project which size an integrated factory should be to gain the best efficiency for the plant was investigated. Consideration will be taken to the cost of the production in order to be competitive to the price of imported ethanol.  Etanolens framtid vilar på bra lösningar för framställning.  I ENA energi kraftverk i Enköping produceras el och fjärrvärme genom eldning av biobränsle.  Genom att bygga ett integrerat bioenergikraftverk där skulle man kunna använda överskottsånga till att framställa etanol som fordonsbränsle.

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.