This report deals with activities that from a CSR perspective are considered to create a shared value for a medium-sized construction company in Sweden. The CSR definition used in the report is the European Commission?s since it reflects the valuecreating aspects of CSR, in contrast to the traditional philanthropic aspect of CSR.Companies in the building construction industry have difficulties identifying activities that create value in society and in the company. The aim with the project is to, from a CSR perspective, identify and evaluate value creating activities in a building construction company. The activities will be evaluated with respect to competitiveness and how they can be implemented into an organization.

There have been, in some rare cases, difficulties with clamping of inserts with U-holesin their tool holder. According to the complaints, the inserts could not be properlyclamped or could fracture when clamped. A study has shown that variations inclamping behaviour are mainly depending by the position of the screw hole in the toolholder and the centering of the screw hole in the insert.The focus of this project has been the centering of screw hole in insert. It has beenshown that the screw holes are not always enough centered in the insert. Theproblem may occur after a certain step in the production, i.e.

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 objective of this study was to assess validity and reliability for five different owner-completed instruments evaluated to assess chronic musculoskeletal pain in cats. All of the instruments were questionnaires, three asking about behavioral changes, one about the degree of pain and one about quality of life. One of the instruments was written originally in Swedish, the other four instruments were translated into Swedish before use. Data available were records from 57 cats with no signs of pain and 11 cats with different pain-related diagnoses. The diagnoses were ensured by clinical examination including palpation and manipulation of joints, gait testing on a force-plate and X-ray scans. Instrument 1 was completed by 57 pain-free and 11 pain-affected cats.

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.

In recent years many cities have seen an increase in bicycle traffic. This is a development that benefits both the environment and the individual cyclist. When the need for bicycle parking is not met several problems arise such as an increase in bicycle thefts, jammed sidewalks and a decreased interest in using bicycles. My aim with this paper has been to answer the question of how to create parking facilities in an urban environment based on cyclists' needs. Through a literature survey, following the method "Trattmodellen" (the funnel model) the question has been answered and divided under the headings cyclist, bike, bicycle racks, bicycle garage and bicycle operators and hosts.

Background: Human beings have been living in the city of Gothenburg for thousands of years. The city was founded in the year 1621. During the years, it went from being an industrial city to later on, a city of events, education and business.Purpose: The purpose of this investigation is to find out what makes Gothenburg a good city for professional meetings and what should a good professional meeting include.Questions at issue:Why is the city of Gothenburg an attractive alterative for a business traveler?What makes Gothenburg a magnet for professional meetings?What elements should be included in the meeting?What can the meeting organizer do to achieve a wow-meeting?Method: The Authors have used a qualitative method where primary and secondary data have been useful. In this paper the authors have done personal, electronically and phone interviews to be able to answer the stating questions in the best possible way.

Septic tenosynovitis involving the digital sheath is a relatively common problem in the horse and the prognosis has been considered as poor. However, there are only few studies confirming this. The purpose of this study is to increase the knowledge about the prognosis for septic tenosynovitis in the digital sheath. The literature indicates that half or a bit more than half of the treated horses will return to previous use. The recommended treatment is debridement of the wound, lavage and sometimes application of drains and broadspectrum antibiotics. The prognosis is considered as worse when the infection is established.

Title: School in Change : Good Grades = Good Democrat? Level: Final assignment for Bachelor Degree in Political Science Author: Marcos Castro Allende Supervisor: Per Strömblad Date: 2013 ? May Aim: The background to this study is a book published by Staffan. I Lindberg & Richard Svensson where they presented a hypothesis that the decline in trusting democracy within Swedish youth is a result of the deregulation of the education in Sweden. The aim of this study is to test this hypothesis and see if the declinne in democracy can be seen already before graduating from elementary school. Method: The method used in this study consist of a survey distributed to students at two elementary schools that differentiates in question of grades and social status. By comparing and analyzing the results of this survey with the claims of the hypothesis, former studies and Lipsets theory of the working-class authoritarism a conclusion is made of the hypothesis credibility. Result & Conclusions: The results showed that there may be a a difference trusting democracy between students with higher grades and those with lower grades.

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.