Lantmäteriet (the Swedish mapping, cadastral and land registration authority) has been laser scanning Sweden since 2009. From the laser scanned data a digital elevation model (DEM) in grid format, with a resolution of 2 m, is produced. This DEM is called GSD-Höjddata, grid 2+ and from its data and the laser point cloud itself (in the form of a las-file) contour lines can be extracted. Lantmäteriet has not yet done this, but plans to update the contour lines in their cartographic products exist. If this is to be done in a satisfactory way an evaluation of different Methods for it is needed.

The aim of this thesis was to answer a number of questions about the environmental consequences of aircraft de-icing. A further aim was to suggest how the environmental consequences due to the release of de-icing fluids can be measured and reduced.The main impact of the aircraft de-icing on the environment is due to the large oxygen demand for the degradation of glycol based de-icing fluids which are released in the environment. The effect of the increase in oxygen demand depends on where the degradation occurs in the ecosystem. In a sensitive ecosystem, the large demand of oxygen could provide an anaerobic environment which would be harmful for many types of organisms.In order to reduce the negative effects of the applied de-icing fluid, there is some type of collection system at every regular airport in Sweden. The Methods of collection can be divided into two general groups, hydrological isolation or vacuum sweeper trucks.

Cumulative effects are seldom treated in Swedish Environmental Impact Assessments (EIA). This report treats these questions and which procedures and Methods that can be used when assessing cumulative effects in EIA. This report is a literature study where also a case study is a part. The case study shows how existing Methods for cumulative effects can be used in practice. The report is concentrated on biology and treats cumulative effects on premises of biodiversity and roads. Cumulative effects include both direct and indirect effects.

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 purpose of this thesis is to investigate and analyze existing law concerning joint owner-ship in agriculture and forestry businesses. Joint ownership often arises through a succes-sion of ownership, therefore we will go through the most useful Methods.Even if the owners of agriculture and forestry businesses are getting older, the numbers of succession of ownerships are still low. A succession of ownership is important to plan and its time is demanding. Often it takes three to five years for the completion of a succession of ownership. Therefore, owners must start their planning in time and think about what is to come of their business.

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.

GE Healthcare wants to investigate whether additive manufacturing would be an alternative method in their workshops in the Umea? plant. Additive manufacturing is called 3D printing in everyday language and manufactures details by building them up layer by layer in an automated machine. The purpose of this work is therefore to investigate how mature additive manufacturing Methods are and how they could be used at GE.The work has been divided into three parts. The first section investigates how additive manufacturing would work in the production workshop at GE.

This thesis studies the negative impact that control signal saturation may have on a controlled system. Different Methods that are used to compensate for this problem are also studied and evaluated. Both sensitivity to disturbances and the effect the method has on the systems'ability to follow a reference signal will be examined. Stability will be discussed, but no conclusions whether the systems are stabilized or not can be drawn. Control signal saturation will lead to a slower behavior in general.

At present day there are several different Methods for measuring of paved surfaces.The most common Methods today are measuring with a total station, the GlobalNavigation Satellite System (GNSS) and terrestrial laser scanning (TLS). Recently thedevelopment of unmanned aerial vehicles, known as drones, has increasedexponentially and today there are several ways of using drones for measuring surfacesby photographing and laser scanning.This thesis contains a comparison between the Methods terrestrial laser scanning(TLS), and unmanned aerial vehicle photogrammetry (UAV). The measurements havebeen applied on two different test surfaces, one of asphalt and one of gravel. Thepurpose of the comparison is to investigate whether the airborne photogrammetry isequivalent accurate in its height levels as the terrestrial laser scanning. For thecomparison to be more extensive, these two Methods have not only been comparedin precision but also in the areas of ease of use and economy.The precision was analyzed by comparing the height levels in randomly placed controlpoints on the test surfaces.

The aim of the study was to investigate the students´ attitudes towards mathematics, their knowledge in the subject area they find the least interesting and whether laborative/practical working Methods could awaken their interest and curiosity. During our work, we have looked into previous studies regarding girls´ and boys´ attitude and performance in mathematics. We handed out surveys to students in grade 9 at a School with many people from other cultures and nationalities in Malmö in order to find the answers to our questions. The result showed that most of the students thought that the subject area "scaling" was the least interesting. The implemented action program was a laborative/practical task within the "scaling" area.

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.