In Sweden there are 1894 small-scale hydropower plants in operation, which together generate 4.3 TWh of electricity per year according to Swedish hydropower compound (SVKF, 2011). This corresponds to the annual consumption of about 860,000 Swedish households (based on an annual consumption of 5000 kWh). In the mid-1950s there were around 4000 small-scale hydropower plants in operation in Sweden before cheap fossil fuels and uranium competed with them, in the current situation only 1,894 of these are in use. If slumbering small hydropower plants once again would be taken into use and some new ones are built, we would be able to extract about 7 TWh of renewable electricity from these annually in Sweden, representing about 1.4 million households.The thesis intends to calculate and construct a hydroelectric power plant at the existing dam in Olofsfors and give suggestions on how the power station should run during the time that fish migration is greatest in Leduån.The turbine and generator to the station in Leduån at Olofsfors is designed by the height of the fall and the water flow through the dam. The turbine selected for the station is a CK-1000RM turbine with a 4-pole 250 kW generator from Cargo & power turbine Sweden AB, which is expected to deliver 1.2 GWh per year.

The purpose of this study was to investigate the possibility of streamlining the test process by utilizing pair programming. During the process, pair programming has been practiced as is defined by the Extreme programming (XP) software development methodology, with the other aspects of XP discarded. The focus of the testing itself has been toward unit testing. The methods applied has been with an experimental approach where 93 cases were attempted to be solved by either single programmers or pair programmers. What has been investigated in these experiments was the time needed to complete a case, how many test attempts were needed to solve the case, and how high a percentage of the cases were solved.

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.

Emission of nitrogen oxides as well as carbon monoxides is an inevitable result of combustion. A Swedish law "Law of environmental fee for emissions of nitrogen oxides as a result of energy production" (lagen om miljöavgift på utsläpp av kväveoxider vid energiproduktion (SFS 1990:613)) controls the emission of NOx from energy production by a system of fees. The system has resulted in a strong approach toward less emissions of NOx among the energy production plants. High emission levels, today exceeding 52 mg/MJsupplied fuel, leads to costs for energy production companies. This paper examines possibilities to reduce the emissions of NOx by optimization of the SNCR-technique in a biofuel fired heat and power plant.

Organtransplantation är för vissa svårt sjuka individer den enda möjliga behandlingen till ett fortsatt liv. För dessa individer är väntan på organtransplantation av lever, hjärta eller lunga ofta en oviss väntan på en livsviktig operation. Denna väntan innebär en förändring och begränsning i individens vardag och påverkar inte bara individen själv utan även närstående. Detta är en upplevelse få personer kan föreställa sig. Syftet är att beskriva upplevelsen hos vuxna individer som väntar på transplantation av livsviktiga organ; lever, hjärta och lunga.

One must consider cost effectiveness when deciding how resources within the health sector should be distributed. Quality adjusted life years (QALYs) are used to measure the value of different medical treatments. QALY is based on utility maximization theory, which suggests that a QALY is always a QALY regardless of who receives it. Therefore, a produced QALY is worth the same regardless of the age or the initial health of the patient. Previous research has shown that these assumptions do not seem to fit the real preferences of individuals.

There exist several known methods for calculation of radio coverage for ground-based systems. As far as we know there are no equivalent methods for the case of flying platforms when the altitudes and speeds are significantly different to those of ground-based systems. This thesis describes the theoretical concepts behind calculations of radio coverage for flying platforms. An investigation is made to sort out what is important and possible to employ in a model for simulations. A method is described and implemented in a program for evaluation of flying radio systems.

The purpose of my study was to visualize how teachers works with multilingual children in pre-school, the methods used to stimulate and develop primary and secondary language and how teachers does see second languages development with the help of the primary language. The study consists of qualitative methods in form of interviews which are made with four teachers who work within the pre-school. The findings during the collection of data (interviews) are going to be connected to the relevant literature on the subject I have chosen.The result showed that the concrete materials are used to stimulate and develop primary- as the secondary language and that the teachers have different opinions on secondary languages development with the help of primary language even if the primary language seems to be an important asset of all teachers that I interviewed..

Bakgrund: En viktig del i att jobba som sjuksköterska är att kunna förse patienter med god omvårdnad. Att jobba i en operationssal innebär att jobba enligt ett tidsschema där de olika yrkesgrupperna ofta jobbar parallellt med varandra för att uppnå hög effektivitet. Operationssjuksköterskor ansvarar för hygien och sterilitet under operation och mötet med en vaken patient blir ofta kort och intensivt. Man arbetar med en patient i gången vilket möjliggör ett personcentrerat vårdande. Syfte: syftet med studien var att beskriva operationssjuksköterskors upplevelser av patientkontakt.

Prostata cancer (PC) är den vanligaste cancerformen hos män i Sverige med 10 000 nya fall varje år. I Sverige opereras över 2000 män för PC årligen. Vanliga sidoeffekter efter operationen är impotens och inkontinens. Kunskap hos sjuksköterskor om hur inkontinens och impotens psykiskt påverkar proststata cancer patienter och hur patienter upplever dessa är liten. Bristande kunskap om detta kan innebära att många patienters problem inte uppmärksammas av vården i tid, som kan innebära stort lidande för dessa patienter.Syfte med studie är att belysa patientens upplevelse av att leva med dem två vanligaste komplikationer, impotens och urininkontinens, efter prostata operation.

This paper describes the evolutionary development of an information system for a small company. The company performs overhaul of forklifts and cleaning machines. The company has already an information system that handles the reports from these overhauls but it needs a supplementary tool that assist the chief planner to plan forthcoming overhauls.It should be able to display coming overhauls in a timetable and eventually print them, either to a PDF file or to a document. The timetables this function produces will help the chief planner and the assemblers to get a good overview of their day-to-day work.The tool needs to be intelligent in that way that it takes into consideration were in the country different assignments will be performed. So that time consuming travels over great distances can be avoided.

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.