A tough working climate and the lack of extrinsic motivation at workplaces within health care raise the question of what instead drives employees within this industry. A possible answer to this is Public Service Motivation (PSM) - a type of motivation that is based on the desire to do good for society and its individuals. In order to investigate this further we have performed a qualitative study consisting of ten interviews with people working with institutional care, where the purpose has been to identify the sources of motivation and determine the impact of PSM. The results show that the compassion dimension of PSM appears to be one of the most salient motivational factors. While the rest of the PSM dimensions fail to explain the level of motivation to the same extent as compassion, other factors are recognized, such as relatedness and aspects of the nature of the work itself.

The purpose of this paper is to explore what objects that can be seized and how the management of a seizure should be conducted. Ability to take enforcement against an individual should be carefully weighed against the rights and freedoms that exist. Seizure is one of the various restraints that exist, and the regulation on which they appear is mainly in the Code of Judicial Procedure, Chapter 27th. To be able to apply coercive measures, it is fundamental prerequisite that a criminal investigation is initiated, but there exist some significant exceptions to this. There are also rules about who has the right to provide for the seizure, the decision can be taken by a prosecutor, an investigator, a police officer or, in special cases, the court.

Syftet med detta arbete var att undersöka dirigentens repetitionsteknik, kommunikation och ledarskap med musikerna under repetition av nutida konstmusik med instrumental solistensemble respektive symfoniorkester med professionella musiker. Metoderna som användes var dels mitt konstnärliga arbete som dirigent genom repetitioner och konserter av nutida musik med solistensemblen Norrbotten NEO och Gävle Symfoniorkester, dels sju intervjuer med professionella dirigenter och musiker. Det konstnärliga arbetet dokumenterades med videoupptagning medan intervjuerna dokumenterades med ljudupptagning. Analyserna av respektive material skedde i efterhand och var huvudsakligen kvalitativa, även om kvantitativa inslag förekom.Resultatet visar att dirigenten bör ha tydlig slagteknik och gestik och tydligt reda ut komplicerade rytmer och instruera musikerna. I första hand ska dirigenten arbeta med de musikaliska parametrarna rytm/samtidighet, dynamik/balans och artikulation men det är viktigt att dirigenten också kan gestalta musiken och lyfta den till en högre nivå.Slutsatserna är: 1) ju mer okänd och komplex musik desto viktigare att förmedla en musikalisk helhet till den enskilde musikern och låta den förstå sin stämmas funktion i helheten; 2) ju färre musiker i ensemblen desto viktigare att dirigera med små slag och gester, gärna sittande, och att lyhört genom diskussioner med musikerna, ta del av deras kunskap och förslag till musikalisk gestaltning; 3) ju fler musiker i ensemblen utan specialkunskap i och intresse för nutida musik desto viktigare att inspirera och motivera den enskilde musikern.Skillnaderna mellan solistensemble och orkester kan ofta vara stora; det kan gälla såväl kunskap om och intresse för nutida musik som förväntningar på dirigentens kommunikation och ledarskap.

This essay aims to examine how science fiction literature is supported and made available for readers at four public libraries. Each library has its own opinion of what a public library?s role in society is, and that affects how literature acquisition and media exposure is done at that particular library. To explore this, the author uses a modified version of Elzinga and Andersson?s theory of traditionalism, pragmatism and emancipationism.

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.

Uppsatsens syfte var att studera industriellt köpbeteende för branschen för prefabricerade trähus. En teoretisk studie har därför genomförts där köpsituationer och dess påverkan på köpprocessen, köpbeslutsgruppen samt kriterier för val av leverantör studerats. Datainsamling har skett genom telefonintervjuer med tre av Sveriges fyra största byggföretag, intervjuerna har genomförts med personer med god kunskap när det gäller inköp av prefabricerade trähus på dessa företag. Resultatet av vår uppsats visar att den den vanligaste köpsituationen för företag som köper prefabricerade trähus är nya köp men att det även förekommer direkta återköp främst genom avrop på ramavtal. De personer som ingår i köpbeslutsgruppen är initiativtagare, användare, köpare, influerare, beslutsfattare och informationsbevakare, vilket överensstämmer med teorin.

The task to this thesis has been to create an application, Katana-databas 1.0, for analysing c-code. The generated output gets stored in a data structure which content in the end of the program run gets written in a textfile which gets used by Katana. It's a tool for reverse engineering, developed by Johan Kraft at Mälardalens institute.Katana-databas has got the following limitations. (1) It can only handle preprocessed files, meaning it doesn't contain any rows beginning with "#". (2) Only complete files can be handled.

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.