The aim of this report was to quantify the accumulation of carbon dioxide (CO2) and methane (CH4) in ice-covered lakes in winter (October-March) during three consecutive years, and to assess whether the concentrations of DIC and CH4, as well as the ratio DIC:CH4 differs between years and between lakes affected by clearcutting and untreated reference lakes. Water- and gas samples were collected from four boreal lakes (two affected by clearcutting and two untreated reference lakes) located in Västerbottens inland in spring. The lakes were found to accumulate on average 91, 55, and 84 mgCm-2d-1 during winters 2012-2013, 2013-2014, and 2014-2015, mostly originating from CO2. The concentrations of DIC (autumn and spring) were higher in the affected clear-cut lakes compared to reference lakes for all years, including the reference year (2012-2013) before clear-cutting. No such difference was found for CH4 or the ratio DIC:CH4.

During the spring semester of 2012 did Petra Hollsten independently a thesis on reducing the environmental impact of capsule for coffee, tea and chocolate. The work was performed at Karlstad University, Faculty of Technology and Science under the Bachelor of Science program in innovation, technology and design. The project's scope is at 22.5 points.The employment for this project is the company Löfbergs Lila AB in Karlstad. Supervisor at the Principal has been Maria Herou Wallner and Sandra Lyxell, product managers. Supervisor at Karlstad University is Monica Jakobsson, lecturer and program leader for innovation and design engineering program.

The aim of the study was to investigate feeding routines, management, health and level of activity of riding horses in Sweden. This was obtained by a survey requesting information from owners who kept horses at a non-professional level. Owners to approximately 500 horses were contacted and the usable response of the survey was 56 %. The dominating breed in the study was Swedish warmblood (38 %). Fiftytwo percent of the horses were geldings, 45 % were mares and 3 % were stallions.

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 was to examine if users of digital music games may acquire skills from the games that may be of use in learning to play a real instrument, that is a non-digitally simulated instrument like an acoustic piano. We have used Gee?s theory regarding a possible interconnection between different semiotic domains, and how this connection may enable a transfer of skills between related domains. In this thesis we examine possible skill transfer between the domains ?digital games? and ?non-digital instruments?. To examine our question formulation we chose to conduct a pilot study from which we collected both quantitative and qualitative data.

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 purpose of this study is to investigate the motives underlying the consumption of alcohol among college students and if the motives differ between genders. The study is based on the following questions: What are the motives underlying alcohol consumption among students? Do these motives differ between men and women? Is there any connection between the motives for alcohol consumption and consumption? The study is a quantitative, empirical comparison study and the data presented is mainly descriptive. The study group consists of students from a university in central Sweden. After an exclusion of five students a total of 81 students participated in the survey, of which 55 were female and 26 were male.

Background: The relationship between advanced age, presence of illness and impaired functioning is well known. A large proportion of the elderly population has an extensive need of care and service and therefore need help from municipal care. Aging is a transition in life and also affects the person's identity and self image, making the person particularly vulnerable and challenging everyday safety. It is therefore of importance to gain knowledge about which factors at individual and organizational level that support a person-centered nursing care for the elderly so that caring responsibilities and staffing of nursing personnel may be scheduled based on need. Aim: This study aimed at describing dependency and care needs of elderly persons living in ordinary housing, sheltered housing and nursing homes.

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.