Banks have been some of the biggest operators on the market of business customers financing. When the Swedish Förmånsrättslagen was changed 2004 the banks became more restrictive to allow traditional bank loans. The change made it more difficult for customers to get their loans granted. For that reason customers had to find other forms of financing. Factoring is an alternative that means companies can mortage/sell their claim on customers to finance companies.

This project has been made in cooperation with Stora Enso Research Centre Falun (Research). Thebackground of the project is that Research has customers who demand a method to measure the quantityof varnish online in offset printing. The aim with the project is to investigate if any test method correlateswith the quantity of varnish and to improve the understanding of the variables in the varnishingunit. The goal with the project is to develop a functional method. Two printing trials have beenperformed.

This study was made in an attempt to give the forest research centre Mógilsá a producedtetratherm map and a better understanding of how topography and temperature influencethe growth of two tree species. The digital tetratherm map model, covering the northernpart of Iceland, was developed to investigate the correlation between tetratherm and thegrowth of Picea sitchensis and Larix (sukaczewii + sibirica). The study confirms theusefulness of digital terrain models in providing data for a lot of different factors and forthe tetratherm model. Hopefully will this tetratherm map be used in future studies.Secondly, investigations were made correlating the growth of the two species againsttopographic factors representing height above sea level, distance to the sea, slope andtopex. Thirdly, investigations were made comparing the aspect and the ground shape tothe growth.The growth rate of Larix had strong significant correlations to the tetratherm and thedistance to the sea- factors.

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 report examines the factors which may be a contributing cause to the problems that are present when ferritic stainless steel are eddy current tested in a warm condition. The work is carried out at Fagersta Stainless AB in Fagersta which manufactures stainless steel wire. In the rolling mill there is an eddy current equipment for detection of surface defects on the wire. The ferritic stainless steels cause a noise when testing and this noise complicates the detection of defects.Because of this, a study was made of how the noise related to factors such as steel grade, temperature, size and velocity. By observing the signal and with the possibilities to change the equipment settings the capability to let a signal filter reduce the noise level were evaluated.

The purpose of this thesis is to present a review of research themes and practice in the field of art image registration. The objectives of the review are twofold. The primary task is to distinguish which problems, in regard to theory and practice, that have been dealt with in the field of art image registration and the secondary task is to investigate which discursive, institutional and tool-related factors have had an impact on theoretical discussions and practice in the art image domain. The empirical content in the review is structured according to four epistemological viewpoints and is analyzed with a domain analytical approach. The result of the study is that two major problems are frequently discussed in the art image domain, namely lack of standardization and which discourse is the best suited for registration of art images.

The thesis aims to increase our understanding about parents reasoning about the elementary school choice by studying which factors parents perceive as important during the decision making process and also by giving meaning to Pierre Bourdieu?s concept of capital through the parents perspective. The empirical material comes from seven BNIM-interviews made with parents, which has been analyzed according to the thematic field analysis.The results show that the parents are not especially concerned about making an active school choice. Stability, closeness, friends, rumors, development and adaptability to the reality are the factors that are perceived as the most important in the decision making process. The school choice has a limited meaning as an investment in social capital, from Bourdieu?s perspective.

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.

In the beginning of the 1990s the responsibility for the schools shifted from the government to the local authorities. This started an era with a freedom of choice for students where they themselves could choose which school to go to. The new system also opened up the possibility for independent private schools to exist side by side with local authority held schools. The overall aim of this study is to determine the factors that affect the location of these independent schools and the geographical pattern these independent schools create. The study in this paper is based on materials from statistics and interviews.