This final year project is dedicated to investigate the problem domain of system maintenance management. The purpose is to find problems in the system maintenance management of today. Whether there is any problem that can be elicitated in the requirements engineering?s phase that could help to obtain more maintenance management friendly systems and if it is not possible to obtain more maintenance management friendly, what else can be done?It has been learned that there are many problems today in the problem domain and the most great ones are the system documentation, stress and a systemknowledge lack among developers, system managers and system users.The requirements that have been found for this problem is good documentation, and use of simple solutions in the creating of the system..

Ett branschanpassat affärssystem är avsett för organisationer verksamma inom samma bransch. Syftet med denna typ av affärssystem är att ge högre passform än standardiserade affärssystem och vara billigare än skräddarsydda affärssystem. Det råder dock brist på kunskap om hur dessa ska utvecklas. Genom vår litteraturstudie presenteras en kravinsamlingsmodell med utgångspunkt i Requirements Engineering som ska ge stöd för utvecklare vid insamling av krav för branschanpassade affärssystem. Utöver det identifierades ett flertal aktiviteter relaterade till modellen.

The purpose of this paper is to create increased understanding of how pupils learn statistics. This includes gaining insight into pupils' use of their own experience and group experience to help to get a better understanding of statistical problem solving. The study's research questions are about how pupils learn to work with data in tables and diagram and how pupils learn to work with measures.The theoretical framework consists of two approaches to studying learning. One approach is based on pupils? cognitive conditions, called set-befores, and the pupils' previous experiences, called met-befores.

In this study we have examined how men and women are heard on Sveriges Televisions program Debatt. Debatt broadcast on Sveriges Televison which is a public service broadcaster. Through the use of a quantitative content analysis and a dialogical approach, we have documented how many men and women who speak, how they speak, how long they have the word and the subjects they will be heard in, in the program Debatt. We have investigated the ten last broadcast programs from the fallseason 2011. Every program is 45 minutes long and contains from two to three discussiontopics each time. By categorizing our survey and enter the result in four different tables, we found that the majority, 63%, of those that are heard are men.

The everyday work at a staffing agency and how its leaders deal with the problems that appears: A case study at Maxkompetens.The purpose of this paper is to increase the understanding of how leaders at a staffing company deal with the everyday problems that arise from a geographically dispersed workforce.The staffing industry has grown by 30-40 percent annually and has over the past 15 years been the fastest growing industry in Sweden. This shows that the interest and demand for the staffing industry and its activities are now rising at an increasingly faster pace. This is an industry that is operating under specific conditions and with a geographically dispersed workforce. This will make the leaders of a staffing company to an important link between the staffing leaders and the staffing personnel.The relationship between the staffing company's leaders and its personnel is important, but not completely trouble free. Difficulties arise in that the employees may be located in different places and at various client companies with the result that the leaders of the staffing company cannot have a daily personal contact with their geographically dispersed personnel.We have used a qualitative approach on our paper and our empirical methodology has been a case study with ethnography and interviews.

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 examine how investments are justified in the Swedish data center industry, with a focus on cooling equipment. This is achieved through semi-structured interviews with 20 different interviewees. These interviewees represent different facets of the industry and facilitate an understanding of which factors, such as: investment costs, operating costs, reliability, environmental impact and the influence of external and internal actors, come into play and to which degree they impact the investment decision-making process. The results show that primarily low operating cost in the form of low energy consumption is the driving factor when it comes to the procurement of new equipment. A lower environmental impact is a positive side-effect of lower energy consumption.

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.

Background: The Swedish population is aging [1] and malnutrition is a common problem among elderly people [2]. A method called food registration is used to monitor the patients? nutritional intake, with the purpose of reducing the risk of patients deteriorating in nutritional status during hospitalisation. However, the current method is not satisfactory and many food registration lists are incomplete. [3-6] Thus, patients do not receive a qualitative nutritional care since the assessment of the patients? nutritional status is based on incomplete documentation.Purpose: The purpose of this master thesis is to increase the quality in the nutrition monitoring process in the geriatric units B72 and B74 at Karolinska University Hospital in Huddinge, Sweden.

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.

Abstract Essay in political science, C-level, by Patrik Larsson, autumn semester 2007.Tutor: Susan Marton The battle over the agenda-Can media be regarded as an individual political actor? The purpose of this essay is to study to what extent media can be regarded to function as an individual political actor. In other words, do the media have more power over the political agenda than the politicians and do the media influence how the politicians make their decisions. This research is a case study and to be able to complete the intention of this study I have used Maxwell McCombs and Donald Shaws theory, the agenda-setting theory. From this theory I have used four aspects to analyse my material which has consisted of editorials from a Swedish newspaper, interpellations and debates that belong to the interpellations. The aspect I have worked with are, how the problem is defined, who is responsible for the problem, what values and which solutions are expressed.  I have used a qualitative text analysis as my methodological approach which means that the results of my study are my interpretation of the material. My conclusions are that the media in this case shouldn?t be regarded as an individual political actor because there is no tendency that shows that the media has influenced the government in their decisions concerning the real-estate tax.

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.