In veterinary medicine, penicillin is the most used antibiotic in Sweden. Two dosage forms of penicillin are available in Sweden for use in horses, sodium benzylpenicillin (Na-pc) and procaine benzylpenicillin (proc-pc). Proc-pc is the most used dosage form and is used for intramuscular administration which allows horse owners to treat an animal at home under veterinary instruction. Na-pc is only approved for intravenous use in horses. Penicillin is normally well tolerated by horses but a serious, sometimes life-threatening, adverse reaction called penicillin shock may occur.

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.

Generally, the economic health of Swedish roundwood truck transport companies has not been good. Profitability is important for maintaining the stability in the transport business, which is a condition for long-term transport planning in the forestry sector. The scope of this study was to identify probable factors influencing the profitability of roundwood truck transport companies and quantify the influence of these factors on economic results. The study was carried out at a major roundwood truck transport organisation in mid-Sweden and was implemented in four steps. In the first step economic results from the haulage contractors were collected and a random sample was taken from accounted net margin for the account year 2005/2006. In the second step hauliers were interviewed to identify probable success factors. At the third step data for identified factors were gathered through a questionnaire.

It has now passed two years since the new site- and construction law, PBL, went into force. It replaced the previous PBL applicable since 1987, and it involves relatively large changes in many different areas of the construction sector. The ambitions of the new law are for instance to simplify and clarify the legal text, increase efficiency in the permitting processes and improve the quality of construction. To achieve this, a variety of changes was made. Some of the most important are: inserted deadline in the processing of building applications, extended assessment of building applications, revised rules about controlplan and quality manager, a certificate is required to start and end the project, an additional meeting is inserted and the construction management of the municipalities will have to do a mandatory visit at the work scene.

Denna studie utgår från barns perspektiv där barnens kommentarer, idéer och tankar om sin innemiljö på en förskoleavdelning är det centrala. Huvudfrågorna är: Vilka meningserbjudanden finns enligt barn i förskolans innemiljö? Vad begränsar deras handlingar? Meningserbjudande är ett begrepp som kommer inneha stor relevans i denna studie. Begreppet kommer ursprungligen från psykologen James J Gibson (Gibson, 1986; Balldin, 2006). Barnen var 17 stycken i åldrarna tre till fem år.

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.

Bakgrund: Skiftarbete är en vanlig arbetsmodell för sjuksköterskor runt om i världen. Skiftarbete är dock förknippat med negativa konsekvenser så som dygnsrytmsstörning och ohälsa. Det är därför viktigt att tydligare belysa hur skiftarbete påverkar sjuksköterskor och den vård som ges.Syfte: Att beskriva skiftarbetes konsekvenser på sjuksköterskor och deras arbete.Metod: En litteraturöversikt baserad på 14 kvantitativa studier hämtade från PubMed. Använda sökord var: shift work, nurse, patient safety och fatigue. Översikten har gjorts enligt Friberg (2012a), där likheter och teman skapats utifrån studiernas resultat.Resultat: Långa och snabbroterande skift kan bidra till utbrändhet, sömnsvårigheter, fatigue och ökad misstagsfrekvens.

AbstractObjective: To investigate the occurrence of and the risk factors for falls and to  investigate level of fall-related self-efficacy and health-related quality of life in people living in community living, 75 years or older within Uppsala and Västmanlands county. A further aim was to identify predictive risk factors for falls. Design: A cross-section study with a descriptive, comparative and correlative design based on a questionnaire was used. Participants: The participants were recruited from Uppsala and Västmanlands county. A random selection on 525 individuals was done, from a population based sample, in the detailed municipalities.

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.