Today's consumers are demanding more and more from companies and are no longer as easy to im-press as they used to be. It is now the consumers that hold an increasing amount of power over com-panies and not the other way around. This change in consumer behaviour has caused an identity crisis for traditional advertising, and companies are now searching for new ways of reaching their target audience. The purpose of this combined qualitative and quantitative case study is to examine possible risks and possibilities that a retailing company face when communicating through Facebook. Data has been collected through in-depth interviews with company representatives combined with a quantitative study of the company's Facebook followers in order to answer the questions of (1) which possibilities and risks a retailing company face through the use of a Facebook fanpage and (2) if there is a differ-ence in the attitude and behaviour of active respectively passive followers that may have been caused by a retailing company's marketing communication on Facebook.

This study was focused to highlight the problems that comes with being a minority on a workplace, in this case female sports journalist who are working in a male dominated sports field. The objective was to find out how the female sports journalist was experiencing working in such a domain, with focus on journalists who works on local news papers. The study also wanted to look on how these workplaces incorporated gender in their daily work.       In combination with gender theory, with concepts as masculine hegemony and power structures, I also choose to apply the american researcher Rosabeth M Kanters concept ?token?. With these aspects in mind I analyzed the five interviews that I carried out with female sports journalist with a qualitative data analysis.           The results of the study showed that the female sports journalist in some aspects were aware of the difficulties of being a woman in a male dominated area ? when they were talking about the profession at large.

The thesis was performed at Forsmarks Kraftgrupp AB in the department ofmechanical engineering, FTCM. Forsmark nuclear power plant has had problems with cracks in some of the controlrods which are placed in the reactor at Forsmark 3. To investigate the cause of this,material samples were taken from five of the damaged control rods. This sampling ofthe rods resulted too short rods to be transported in the shipping container to theinterim storage facility for used nuclear fuel in Oskarshamn. Control rods are crucial components in a nuclear reactor, regulating the reactoreffect by blocking or unblocking fuel rods. Control rods which have been in thereactor are always handled under water in order to protect against the radiation theyemit. The task was to design a control rod adapter that extends the control rod sotransport can be performed from Forsmark. The goal of the work was a complete setof blueprints so the control rod adapter can be manufactured and mounted on theshort control rods and then be transported to the interim storage facility. The work began with mapping of how control rods normally being handled from thereactor to the interim storage facility.

This study was conducted at a special school for children with autism and developmental disabilities. The study consists of three interviews where pedagogues have different experiences of working with children in need of special support. The aim is to get an idea of how teachers think about working with children autism, but above all to find out what methods and educational tools that are used, and why they are used to best motivate students to a rewarding education. Sense of coherence (SOC) is a central concept and a theoretical basis of the study relating to the student to create comprehensibility, manageability and meaningfulness in life. All of these three are essential for the student to find a predictable environment.From the result shows how schools and teachers use different methods and different tools, but both have a focus to help the student find motivation in the learning process.

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 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.

Ever since the nation-state has existed identity has been a big deal, it is told that identity is a tool needed to be able to receive consensus from the people concerned on a certain matter. As the European Union is continuously shaped and reshaped due to changing geographical borders, as a consequence of new member-states the aim to integrate the Union equally across its surface has not been an easy task to solve. A lack of trust from the inhabitants in the European Union is a fact, and therefore the main duty of the Union has become to rebuild the trust from beginning to end, creating a Union which easily can be identified with. Since the process of national identity relies upon an excluding-including process and the use of the Other, the identification process on an European level has indeed had fierce effects on the inhabitants within and outside the Union.One of many things that this essay aims at showing is how mythmaking has become a way used by the elite in the Union to integrate a European identity, the myths refer back to a Golden Age when Europe was prosperous and in bloom. Among other tools used to integrate and create a European identity we find such as; unity in diversity, a cultural inheritance based on common denominators such as Christianity and Latin traditions, symbols and a European citizenship.

AbstractThis study deals with NTA in preschool and the purpose of the study is to find out how the NTA project works out in practice. In the empirical study I have used questionnaires as a research method (Trost2001). Questionnaires have been sent to preschool teachers in the whole of Sweden to get as good a selection as possible. The responses received have been processed and analyzed. The results are reported below.The majority of the teachers thought it worked well to work with the NTA.

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.