Background: Traditional oral health education is seldom enough in order for dental care personnel to motivate their patients to good, long-lasting oral health care habits and there is a need for evaluation of other more efficient methods. One of these methods is motivational interviewing. An overview of its origin, definition, theoretical background and practical methods is given by way of introduction. Aim: The aim of the investigation was to review studies that had used motivational interviewing in order to obtain oral health, focusing on prevention and treatment of gingivitis, periodontitis and dental caries. Method: Systematic review. A search question was run through the databases ASSIA, ERIC, PsycINFO, Social Services Abstracts, Sociological Abstracts and PubMed. The articles were reviewed based on defined inclusion and exclusion criteria. Results: Five Publications (based on three studies) met the inclusion criteria.

What makes a Swede betake himself into the Chinese wilderness? How does the Rio Convention influence a plant collector? And who will crack the nut positioned 12 meters up in the crown of a tree? There are many secrets behind the act of collecting plants. In many regards, the documentation of the collection of plants for a Swedish purpose has been unsatisfactory. The focus of the Publications is on what plant species that have been found rather than information on how these plants have been collected. Only few results of experimental cultivation are available. There is no doubt that there exists knowledge that has not been publicised yet.

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.

Background: The construction industry is Sweden?s single most important industry branch with a significant influence on Sweden?s wealth. The political restrictions that once controlled the industry are today almost gone. This combined with an unbalanced supply and demand situation on the Swedish constructions market, caused by urbanisation, has led to increased pressure on the Swedish construction companies who now are forced to find new methods in their struggle to contain or increase their competitive advantage. Purpose: The purpose of this thesis is to survey: which strategic variables are of great importance in today?s Swedish construction industry with focus on the four main actors, JM, NCC, PEAB and Skanska.

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.

?Death in the pot.? The Fruit and Vegetable Preserving industry in East Scania during the 20th centuryA Company History.At the end of the twentieth century, only one of the six companies previously active in the Fruit and Vegetable Preserving Industry in East Scania survived as an independent company: Kiviks Musterier AB. Actual production remains at two sites only. The aim of this study is to determine the reasons for this development. The companies included in the investigation are AB Bjäre industrier, Gustaf Bong AB, Kiviks Musterier AB, AB Ruuthsbo konservindustrier, Th.

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.

?Death in the pot.? The Fruit and Vegetable Preserving industry in East Scania during the 20th century A Company History. At the end of the twentieth century, only one of the six companies previously active in the Fruit and Vegetable Preserving Industry in East Scania survived as an independent company: Kiviks Musterier AB. Actual production remains at two sites only. The aim of this study is to determine the reasons for this development. The companies included in the investigation are AB Bjäre industrier, Gustaf Bong AB, Kiviks Musterier AB, AB Ruuthsbo konservindustrier, Th.

Capital structure is without doubt one of the most frequently studied and controversial areas of modern financial theory, and will certainly continue to receive considerable attention from researchers worldwide. There is still no universal explanation of how an optimal capital structure would be designed for maximum appreciation, despite the development of several theories focusing on the subject. Equity and debt are the two main financing options that in combination explain the business's capital structure. The results of several research studies conducted in the subject has many times pointed out that there are specific factors that are directly related to the company's capital structure, and that there are clear sectoral differences in corporate debt. A study of the capital structure is considered important and interesting to implement due to the reasons above and the purpose of this study is to analyze and try to explain the similarities and differences between different industries in terms of how growth, profitability and size affect the debt level.

The purpose of this study is to gauge the current state of Swedish library and information science research. LIS is generally defined as a cross- or multidisciplinary subject, according to some coupled with heterogenity or dichotomy within the subject. In light of Jack Meadows?s description of the scientific community growth and scientific communication, the following two research questions are formulated as basis for the study: 1. What are the current themes, what range of theories and methods are used in our research material? 2.

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.