Abstract Background: Families with sick children are expressing the needs of accommodation near the hospital, in order to be close to their children and be together as a family.Aim: To investigate how parents experienced the hospitality and the environment at the Ronald McDonald House (RMH) in Uppsala and how they feel their children have experienced the stay.Method: Descriptive qualitative interview study. Five parents who lived with their family at RMH between 2013- 2014 have been interviewed with a semi-structured approach. A qualitative content analysis with an inductive approach according to Graneheim and Lundman (2003) was conducted on a manifest level.Results: RMH made the families? situation easier. RMH met their needs of a homelike environment where they could be themselves; be together and maintain everyday routines.

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.

Traumatic arthritis is a common cause of lameness in horses. One of different treatment alternatives of arthritis, is intra-articular injection with hyaluronan. As knowledge about pathophysiology of arthritis and function of hyaluronan is increasing, understanding grows about the mechanism of hyaluronan action in joints. Hyaluronan has, in addition to effects on viscosity, anti-inflammatory and analgesic effects. Extensive research and scientific studies have been made on exogenous hyaluronan.

The purpose of this study is to gain a better understanding of women who have been abused by their partners. The study also examines how violence takes shape in a relationship. Based on a qualitative text analysis of three autobiographies and one novel, we have obtained the material for this study. The three selected autobiographies are; "I have not told you everything" by Jessie Andersson, "The nightmare" by Maria Dahlén and "It would be a pleasure to kill you" by Magdalena Graaf and the novel "Hidden" by Liza Marklund. To gain a better understanding of this topic, we have used the following theories; the process of normalization of violence, gender and masculinity.

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.

Elitskon? is a new type of horseshoe for trotters. It is supposed to give the horse a trot that mimics the movement pattern of a horse trotting unshod. Many horses show a better trot unshod but this can only be used to a limited extent due to the great wear and tear of the hoof. The objective of this study was to evaluate whether the qualities of Elitskon? are similar to the unshod horse or the traditional aluminium horseshoe.

Itraconazole is a third generation azol, a fungicide which acts by inhibiting ergerosterol synthesis in the fungal cell membrane, and thereby disturbing fungal regeneration. It has proven to be less toxic, to have a broader spectrum of activity and to be more potent than its predecessor ketoconazole. Itraconazole is only available in therapheutics approved for human use. Pharmacokinetic studies has been performed in humans, dogs, cats and laboratory animals. Although itraconazole has been used tentatively with good effect against fungal infections in horses, no pharmacokinetic studies have yet been done.

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 purpose of this study was to examine knowledge within the social services. We narrowed the study down from general knowledge to scientifically produced knowledge and how the social workers relate to such knowledge. We aimed to see how the social workers perceive different knowledge and how they relate to the different sources of knowledge. We also examined the different factors that will enable and motivate social workers to stay updated with scientifically produced knowledge that is relevant to their work. We also examined what limits the ability or motivation for renewing ones knowledge.

Business Process Modelling Notation (BPMN) is a way to graphically draw a diagram of a business process. A BPMN diagram consists of several so-called flow objects. These are interconnected in the graph through sequence  flows. BPMN models are merely graphical representations of business process and there is a need to simulate these diagrams for different purposes. The simulation that now is available for BPMN is that the model is evaluated by checking if it is correct.

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.