Many pedigree dogs are suffering from inherited diseases or personality disorders caused by selective breeding. The Swedish lapphund is a breed that has been suffering from some loss of genetic variation due to the heavy use of only a few males. Concerns have arisen and crossbreeding has been discussed as a way to manage gene loss. Four breeds has been taken into consideration for this purpose; schipperke, finish lapphund, Norwegian buhund and Norwegian elkhound, black. These breeds has been tested theoretical by a comparison of mentality and health.

The purpose of this study is to describe melanotic tumours and the pathogenesis of these tumours. The focus of this study is on differences between benign and malignant tumours as well as the prognosis one may expect when diagnosing this disease. The mechanisms responsible for the occurrences of the tumours are not yet fully understood. It is believed that factors such as chronic trauma, infections, medications and hormones affect the cell mechanisms in some way. Determinants of the malignancy of the tumour are not completely known.

Med tankar från pedagogen Montessori och filosoferna Platon och Baudrillard har detta arbete behandlat frågor om datorn och dess betydelse för en grafiker. Frågeställningen formulerades efter hand och lydde tillslut: ?Hur kan materia te sig i digital form?? Forskningen resulterade i en hypotes för hur digital materia skulle födas i datorn: genom att blanda två uppsättningar av data, såsom två genuppsättningar tillsammans skapar en ny organism. Under produktionen utvecklades därmed en metod för hur en grafiker ska kunna skapa tillsammans med en dator. Syftet är att ge andra grafiker ett nytt sätt att se på digital grafik.

About 10 % of the adult women population in Sweden are treated annually for urinary tract infections. The increasing bacterial resistance towards antibiotics is classified by WHO (World Health Organization) and ECDC (European Centre for Disease Prevention and Control) as one of the greatest treats for human health in a global perspective. To find alternatives scientists are studying the possibility to use probiotics to reduce the frequency of recurring urinary tract infections. This literature study examines five randomized double blinded placebo controlled studies where different strains of Lactobacillus have been used as a prophylactic to women suffering from recurrent urinary tract infections and bacterial vaginosis. Overall the studies do not display enough promising results to recommend the use of probiotics as a prophylax or cure..

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 number of HIV- positive is increasing all over the world and it's very likely to meet these patients as a nurse. The interaction between the nurse and the patient is characterized by experience and knowledge and at the same time the nurse is expected to act professionally. The purpose of this literature review is to investigate the nurse's complex of problems regarding the treatment of the HIV- positive patient by exploring the attitudes against HIV among nurses and how the nurse can maintain the integrity of the HIV- positive patient. Antonovsky's salutoqenic model, sense of coherence, has been used as theoretical frame. From 14 articles five topics have been found that influence the nurse's attitudes against HIV-positive patients.

This study is a follow up of a pilot study made 2004, that evaluated feeding, exercise and weight as possible risk factors for developing any kind of diabetes in dogs. We have selected our material for a certain kind of DM that exists among Norwegian and Swedish elkhounds. These breeds are among the most common breeds affected by diabetes and this kind of DM almost exclusively affects intact bitches. We performed a case- control study where the owners were interviewed over the phone. The owners of a total of 48 case dogs and 58 control dogs were contacted. The questions for the cases focused on the time before the diagnosis and the questions for the control dogs focused on the dog´s adult life.

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.

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.