A budget consists of figures showing how much a particular activity has access to during a given year. With a balanced scorecard, these figures and guidelines can be converted in to more easily understandable non-financial instructions for the employees. One of the most significant differences between the budget and the scorecard is that the budget focuses on short-term results while the scorecard focuses on long-term visions and goals. With a long-term thinking the leaders can  set more long-term goals and also make more well-planned investments which increases the possibility for the organization to evolve and become better in the long term. By combining the two instruments a good balance between short and long term perspectives can be achieved, which creates a more effective steeringIn the 1990s, many of the municipalities introduced needs budget, one of them was Gothenburgs municipality.

The aim of the study was to look at the differences in groups in Karlskrona Kommun in comparison to a larger population of work-groups in Sweden. The instrument used was the Team Diagnostic Survey developed by Ruth Wageman, J. Richard Hackman and Erin Lehman (2005) in order to diagnose the strengths and weaknesses in work-groups, as well as explore the group?s behaviours and effectiveness. The results show that there was a significant difference between the Karlskrona Kommun groups and the larger population of Swedish groups in the following areas: stable, clarity, challenge, diversity, whole task, resources and availability..

The purpose of this Bachelor thesis is to examine how user-friendly the OPAC of the Märsta public library is considered to be.Theoretical basis are HCI and Allwoods definition of usability. Issues are: Is the OPAC suited to its task? Is the OPAC user-friendly? How well does a user accept the OPAC? and What degree of competence is shown by users of the OPAC? The source material consists of six interviews in the form of .avi files. The method I have chosen is qualitative semi-structured interview form. The result is that, based on Carl Martin Allwood?s defini-tion and with exception for the using of help-resources, the usability of Märsta?s library OPAC can be considered less good..

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 study is a follow up of a pilot study made 2004, that evaluated feeding, exercise and weight as possible risk factors for developing any kind of diabetes in dogs. We have selected our material for a certain kind of DM that exists among Norwegian and Swedish elkhounds. These breeds are among the most common breeds affected by diabetes and this kind of DM almost exclusively affects intact bitches. We performed a case- control study where the owners were interviewed over the phone. The owners of a total of 48 case dogs and 58 control dogs were contacted. The questions for the cases focused on the time before the diagnosis and the questions for the control dogs focused on the dog´s adult life.

Cataloguing electronic documents makes new demands on libraries. This thesis discusses the metadata formats Dublin Core and MARC which are, individually or in combination, commonly used for object description in the digital library.The formats are studied with particular emphasis on characteristics such as underlying reasoning (ambitions during the development of the formats), flexibility (possibilities of expansion and adaption to new demands) and interoperability (cooperation between different metadata formats). The formats are dealt with in their context, i.e. we discuss what types of documents the formats are meant to describe, what environment they were originally created for, what functions they are meant to fill (to find, identify, select and acquire/obtain entities), and also how these factors are related. The Swedish projects SAFARI (which uses Dublin Core) and NetSök (which uses MARC) are presented briefly.

This paper addresses the need to review the modern presentation of textile archaeology in museums. It is time to look at textiles in archaeology with new eyes. The reality behind archaeological textilestudy is holistic, embracing many different aspects of society. The presentation of textiles has in my opinion become old-fashioned. I will show in my paper that Jonathan Adams? `seven constraints´ model, developed for research on ancient ships, can also be applied to textile research.

This paper addresses the need to review the modern presentation of textile archaeology in museums. It is time to look at textiles in archaeology with new eyes. The reality behind archaeological textilestudy is holistic, embracing many different aspects of society. The presentation of textiles has in my opinion become old-fashioned. I will show in my paper that Jonathan Adams? `seven constraints´ model, developed for research on ancient ships, can also be applied to textile research.

This paper addresses the need to review the modern presentation of textile archaeology in museums. It is time to look at textiles in archaeology with new eyes. The reality behind archaeological textilestudy is holistic, embracing many different aspects of society. The presentation of textiles has in my opinion become old-fashioned. I will show in my paper that Jonathan Adams? `seven constraints´ model, developed for research on ancient ships, can also be applied to textile research.

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.

Earth?s resources have been exploited unsustainably. If an entire conception of exploitationof natural resources does not change now, this will entail enormous costs in the future.This insight has lead to a recently increased interest in clean technologies among privateequity capitalists. In the fourth quarter of 2006 about 10 percent of all private equityinvestments made in the US market were placed in the cleantech industry. Despite a goodinvesting climate in Sweden, Swedish capitalists have shown little interest in cleantechinvestments.