This bachelor?s thesis studies Carl Str?mbergs ?ppeltr?dg?rd, a private garden consisting of a large number of apple trees and varieties. The garden is located outside ?rebro, in N?rke, and is owned by a unit owner association whose goal is to preserve and determine the varieties. Through interviews, articles, site visits and documents from Carl Str?mberg, the purpose have been to get an understanding of who Carl Str?mberg was, how he collected the apple varieties and how that process was affected by the climate amongst apple growing and pomology during that time.

As the Swedish governments long term goals include a reduction of fossil fuel dependency, increasing pressure is placed upon energy companies to create and develop new solutions for renewable energy. The following case study was done in collaboration with the company Sydved Energileveranser AB and one of their contractors, Enarssons Skogsentreprenad AB. The objective of the study is to examine the bioenergy situation in region of Skåne and evaluate the potential solutions in the region for a forest-fuel assortment, based on a bioenergy-cutting-system. As a part of this study I have compared ordinary manual cuttings done with a chain saw and cuttings made using the new ?bio- energy cutting system?. The cuttings made under both systems were tested in areas near agricultural fields or pasture land in order to maintain an open landscape.

This report is the result of a thesis as been implemented during the spring term 2009 atthe University of Gävle.The company Bruks produces mobile chippers which are used for chipping loggingslash, roundwood and parts of trees. The chipper is powered by a separate diesel engineand the chipper can be assembled on trucks, trailers or some other carrier vehicles.When the chip has passed the chipper drum, the chip is collected in an integrated binwhich is mounted on the vehicles frame with dumping yokes. When these dumpingyokes were designed they were probably created with large material dimensions. Theaim with the degree project is hence to study the strengths of materials and, if possible,to suggest an arrangement that can decrease the total weight on the dumping yoke onBruks´ mobile chippers 805 CT.The CAD-program Pro/ENGINEER was used during the project for outlining the 2Ddrawings,as distributed of constructors on Bruks, to solid 3D-parts. The three-dimensionalassembly from Pro/ENGINEER was transferred to Pro/MECHANICA.

Roseroot (R. rosea L.) has gained more attention the last years, mainly because of its phy-topharmacologic properties. Even though many reports in roseroot have been published, only a few articles are dealt with the genetic diversity. The Nordic Genetic Resource Center has collected Roseroot material from Sweden, Greenland and Faroe Islands under different expeditions. The samples were analysed to study the genetic diversity study.

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 main purpose of this study is to investigate the productivity effects of multiple tree handling in thinnings. Other important elements have been to investigate in which extent multi-tree handling is used in stands with different stem volumes and the impact of collecting partially delimbed fuelwood assortments has on harvesting performance. The study is based on data from thinnings in Sydved and contractors' operating activities. Collection and compilation of operating schedules, number of stems and surveyed volumes from several contractors and a large number of executed orders underlying the results. Multiple tree handling is used to a much greater extent at lower average stem volumes. Prediction models for productivity of the multiple-tree handling harvesters in the study differ from the productivity models for single-tree handling. In the model developed in this study productivity is not as dependent of stem volume as reference models.

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.

Previously when I have made proposals for privately owned gardens, I have found it difficult to find strong, extensive designs and to work with room and space. Since this is the field within which I am going to work in the future I feel that I need more experience, reference material and ideas on how I, in an early stage of the working process, can work with and consider room and space. The aim of this project has therefore been to procure experience, reference material and ideas for design of a garden in relation to space. To procure experience and reference material I have, during the fall of 2008, made two incredible study tours to France and to Japan. I have interviewed the landscaping architect Maria Arborgh and studied literature. I have also used a garden outside of Gothenburg in which I have been able to try out different thoughts and ideas regarding shape that have appeared during the course of my work. My conclusions about landscaping are that you should first find the different functions in the garden. The next step is to find an overall theme or shape, use a small number of materials, build a room with sealing, walls and portals with the help of vertical elements e.g.

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 compare mass digitization and qualitative digitization, to see how the digitization process and the digitalized material differ. The study emanates from the mass digitization as it is performed at the National Library in Norway, and the qualitative digitization at the Royal Library in Sweden. The method used is document studies combined with mail interviews. The focus is upon the practical operation, to which counts: ?purpose & selection?, ?preparation, image capturing and processing?, ?metadata & text encoding?, ?quality assessment?, ?storage of digital originals and copies? and ?display?.

This study has taken place in two nature reserves in the municipality of Uppvidinge in the Kronoberg region in southern Sweden. These have been chosen by the County Administrative Board to be part of a bigger landscape of fire affected nature, and prescribed fire has been implemented in these. The areas are called Ösjöbol and Berga fly and have been burned 2012 and 2013 respectively. Non-burned areas have been inventoried as well. Vascular plants and mineral soil have been inventoried with the Hult-Sernander-Du Rietz scale of five levels. Issues emanate from the County Administrative Board?s goals for prescribed fire: how sticks and herbs were affected, how much soil was uncovered, how the structure and fire favoured species were affected, and how deciduous trees and spruces (Picea abies) were affected. The study shows that the soil increased, as well as the fire favoured species.

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.