At Sandvik Materials Technology, Argon gas is used as furnace atmosphere when heattreating hot rolled wire. Upon heating chromium steel wire, a rich oxidelayer forms on the wire surface. The abstract of this masters thesis is to enhance the understanding of the constitution of the oxidelayers and the influence of the furnace atmosphere. This will be achieved by performing a number of annealing experiments on laboratory level. Also, the aim is to understand the chemical reactions and physical mecanisms controlling the pickling process.

Syftet med den här uppsatsen är att jag vill dokumentera min kreativa process från första gången jag börja skriva nytt material, till att för första gången framföra det för en publik för att sedan utveckla till en hel (examens) konsert. Huvudfråga: hur fungerar min kreativa process och hur förhåller jag mig till den? Jag har använt mig av att skriva processdagbok under ett och ett halvt år. Jag har kommit fram till att jag i min kreativitet behöver vara strukturerad och ha ett visst mått av disciplin och rutiner och försöka hålla en distans mellan mig och mitt skapande och samtidigt våga vara öppen och driva processen framåt även om jag inte riktigt vet vad slutmålet blir.Min uppfattning om ordet kreativitet har också under arbetet med denna uppsats förändrats. Från att vara något abstrakt och mystiskt med en bild av att de som kallades kreativa var speciella människor, genier, som mer eller mindre hade en speciell gåva till en uppfattning om att kreativitet är en egenskap vi alla har som med rätt förutsättningar och sammanhang kan övas och utvecklas..

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.

Title: ?? Then came the realization that I was just like them. That I have a gambling addiction?? This is a qualitative study of four former gamblers and their experience of getting out of the gambling addiction. The study is about how individuals have overcome a gambling addiction.

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.

Colours have been proven to have both a great physical and psychological impact on human beings. This essay investigates the rebranding of 37 Health Care Centers, located in Norrbotten, Sweden, and how 10 interviewees have experienced the new choice of colour on the logotypes of these Health Care Centers.The theoretical framework used in this research process, consists of theories related to rebranding, the communication process, encoding/decoding and Goethe?s Theory of Colours.To gather information about how the 10 inhabitants have experienced the new choice of colour, a semistructured form of interview was used. In addition to these interviews, three people employed by Norrbotten County Council (NLL) were interviewed, to get to know more about the rebranding process and the message behind the chosen colours of the logotype.Results show that the inhabitants had an overall positive reaction to the new colour choices, but that younger target groups lacked information about the new logotype and the rebranding.Due to these results, recommendations were made that NLL should expand the quantity of media channels to reach these younger target groups, and thereby be able to attract more patients to their Health Care Centers. NLL would also profit from investigating the inhabitants experiences related to the new colour choices themselves, but in a larger scale, to achieve greater knowledge of how to proceed with colour choices in the future..

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.

During the milling of Sandvik Coromant?s world leading Drill with replaceable inserts,the CoroDrill880©, burrs appear around the milled surfaces. The burrs are removedusing different methods, one of which is deburring with special brushing machines thatare integrated into milling cells. The machines of the type Sinjet, use a Siemensguidance system. The deburring results are not satisfying and manual deburring isrequired afterwards.

Background: In our case study we have been studying a company that during the last seven years have tried to implement the control system Balanced Scorecard. They have during this period made three attempts. According to Kaplan and Norton, the creators of Balanced Scorecard, it should take about 16 weeks to implement a Balanced Scorecard. Purpose: Our purpose is to investigate which factors that influence the possibility to implement Balanced Scorecard. Method: We have conducted a case study where we have studied implementation at three levels in a company.

Background: Patients with cervical spinal cord injuries are often dependent on a mechanical ventilator due to the damage on the innervation to breathing musculature. During rehabilitation they have to be trained to regain own breathing. This unweaning process may give respiratory complications, which are main causes to morbidity and death. These respiratory complications are traditionally treated in an intensive care unit (ICU), which means that the patients have to return back to these emergency units.Aim: To investigate number, length and causes of returns to intensive care units and the length of the weaning process. Further, to compare if a multidisciplinary approach to the weaning process may reduce ICU returns and to shorten the weaning process.