This report examines the prerequisites for LEDs to replace other technologies indifferent applications. How does the different technologies for light generationwork and what are the advantages and disadvantages? The various technologieslimitations and characteristics provides the opportunities for the LEDs.This report describes a test-construction built to examine what practical arrangementscan be built with modern light emitting diodes, in order to showsome of the possibilities. The construction consists of three different applications,a high power lamp based on cold white LEDs, one based on warm whiteLEDs for the evaluation of the light characteristics and a RGB-LED based lampable to mix any colors quickly and seamlessly. The test construction also containsthe essential peripherals including control-electronics, optics and a custombuilt watercooling Solution.The potential for LEDs is huge but it is complicated to build LED based applicationsdue to the limitations which mainly includes the electronics and theneccesary cooling.

Abstract: The aim of this study is to investigate the attitudes towards the labour movement?s strategies, goals and organisational issues in Swedish Miners? Union?s (Gruvindustriarbetareförbundet, hereafter Gruv) paper, Gruvarbetaren 1917-1925.The theoretical starting point is Engels? view on the class state. This perspective turns the question of socialism and the way to get there into an issue of working class power over the state. Another theoretical perspective is the partition of the labour movement into a trade-unionistic branch, seeing unions as financial organisations of interest, and a pro-state one, considering unions as political organisations.During the period investigated Gruvarbetaren was quite radical and advocated a firm class struggle strategy towards employers. Since these were considered unreliable, class struggle was seen as the only way to better the conditions for the working class.

This thesis deals with an iterative user-centered IT-development project in a bank setting. The aim is to present a Solution for deployment of future Internet banking for small businesses. The project features a design of IT-related concepts and ideas with a strong emphasis on scenario-based design and the usage of patterns as a documentation tool.The project plan featured an iterative framework and was carried out by a group of designers in collaboration with a reference group representing the future users of the system. This group consisted of company managers and bank employees, all from the small town of Åtvidaberg in Sweden.The method used in the development process was Scrum. A total of three sprints were completed with user meetings at the end of every sprint.

Senior citizens require a healthy oral cavity and healthy teeth in order to eat, speak and preserve their well-being. With age we know that the incidence and prevalence of diseases and symptoms originating from the oral cavity are more common compared to younger age groups. Senior citizens are the fastest growing population on earth, thus the need of healthcare providers with knowledge and skills in oral healthcare are in great demand.  The purpose of this thesis is to identify oral healthcare interventions and educational interventions which have been shown to improve oral health of residents over 65 years of age.  A literature review was conducted in which 15 scientific articles were scrutinized. Databases used were PubMed, Cinahl and Scopus. The results imply that good oral healthcare not only improve the oral health of senior citizens, but also prevents the occurrence of other diseases such as pneumonia and  improve the overall quality of 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.

This master thesis investigates the possibilities of using GPS-information from trains to create a model of a railway system, register the routes of the the trains and predict how the trains will travel in the railway system.The thesis work was done at Icomera AB which is a company that specializes in internet connected vehicle Solutions.We describe how the GPS-information is sent from the trains in the form of samples and investigate limitations and possibilities with the available information. About three million samples from 83 SJ-trains were analysed and the samples were filtered with the intent of removing erroneous information. We here found that about 30 % of the samples from the trains were unreliable.A Solution for how the samples from the trains can be used to create a model of the railway system traveled by the trains is presented. We use a large set of historical samples and use cluster nodes and Hermite curves to generate a graph that represent the railway system with stations, nodes and the railway itself. A fully automatic Solution is not presented since it did not fit into the time frame of the thesis; instead we created a simple tool which can be used to manually finish the model of the railway system.Furthermore, we describe how the railway system and the samples from the train can be used to register the routes the trains travel.

The study aims to investigate the feasibility of small-scale electricity production with solar electricity systems, also known as PV (photovoltaic) systems, in Australia. Due to the global warming, sustainable energy has in recent years become an increasingly important issue, both internationally and in Australia. With one of the largest dependencies on fossil energy sources in the world, the country's abundant solar radiation is a possible Solution to this issue.Both the technical and the economic feasibility of small-scale PV systems were investigated. On the technological side, the electricity generation, distribution and consumption systems were studied. On the economical side, the parameters that drive the profitability of a PV investment were investigated.

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.