The purpose of this thesis is to collect knowledge of techniques and materials for planning roofgardens. Gardens built on top of buildings is not a new phenomenon, already in the beginning of the century architects were experimenting with roofgardens. During the Modern Era roofgardens appeared as a part of the design and worked well together with flat roofs and the ideas of light, air and greenery. Today the most common kind of roofgarden is on a ground-level joist that hides parking or other underground functions. The most important difference between planning a roofgarden and a garden on the ground is the limitation of the load of the roofgarden. Plants, paving-material and equipment must be chosen with this in mind. A light and thin layer of soil demands plants with small needs for water and nutrition.

Forest as an investment alternative has become more and more popular over the last few years. Between the years 2004 and 2007 increased the price level on forest land with 70 percent in Jämtland. In this thesis a comparison has been conducted between forest in Jämtland and an investment in the stock market. The risk in the two investment alternatives has been included in the comparison. The thesis includes two different studies between the two alternatives.

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 main purpose of this bachelor thesis is to analyse the publication- and citation patterns of the articles concerning bibliometrics, informetrics, scientometrics, and webometrics which can be found on Web of Science, and give a brief description of how the definition of the four terms has developed. I have looked at how the number of published papers have developed over the years and to what extent they have been quoted by other researchers. I have also briefly adressed what other research fields are referring to articles published in the four areas. The material I looked at includes articles that can be found on Web of Science with one (or more) of the four terms as topic and are categorised under library- and information science starting with the first bibliometrics article which was published in 1969, and ending in 2013. The results show that the publications in all four fields are continuously increasing.

Corruption is widespread, and exists more or less in all countries in the world. It is today high on the international political agenda as a result of globalization and is seen as a serious impediment to development. In 2011, Sweden scored 9,3 out of 10 on the Transparency International corruption index which gave the country a 4th place of 182 on the list. This refers to a rather low corruption. Although Sweden is a country with low level of corruption that does not mean that it is completely corruption-free.

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 birth of a child marks a new era for the parents. It is the beginning of something that will never end, because they will always be the child´s parents. This study investigates what happens when an infant is born whit Downs syndrome (Ds), and thus does not resemble the child the parents had expected. The purpose of this literature study was to describe the information and the support that the parents of a newborn child with Ds think that they need. The literature search was made in the database of Medline (via Pub Med), Academic Search Elite and manual search.

The aim of the thesis is to illustrate how a group of community policing officers makes themselves relevant to their community, this in relation to wider organizational circumstances and exterior structures of society. Earlier research on the subject tells us that community policing can be proactive and crime preventing in such a way that the confidence and trust in the police is increased. Research is also making clear that proactive police work is hard to measure and evaluate, which is why my contribution to the field is to explore how this effects the way the police officers in Bergsjön, Gothenburg is making themselves relevant and the way that they see themselves as community policing officers. The relationship police ? community will be regarded as how someone treats their audience, attentive to its feedback, in order to get ones message out, in this case confidence and trust in the police, under influence of the audit society.To achieve the aim of the thesis, participating observation was chosen, to experience the police officers everyday work.

Rock groundwater has always caused major problems when tunnelling. Water leaking into tunnels can cause large problems, not only on the construction itself but also on the environment. A continuous water leakage can lead to a declining water supply, and geotechnical problems can occur as subsidence in the ground. Therefore it is of great importance to predict the consequences that can appear in the surroundings due to a declining groundwater surface.The aim of the study was to investigate different methods for predicting leakage and changes in groundwater level due to tunnelling excavations in rock. This thesis was performed by comparing mathematical methods, actual groundwater changes and results from preliminary investigations.Investigations were made for three railway tunnels planned by Botniabanan AB.

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.