This paper aims to clarify how four customer magazines and digital versions of the magazines are being used by their target group. It focuses on the Ikea customer magazine specifically. After the analysis the conclusion is that out of the four companies customer magazines only one, Ikeas Live magazine, fully re-used the editorial content from the printed magazines on their digital platform. The interviewees were six readers of Ikeas customer magazine Live and two experts from a Stockholm based content firm. After the conducted interviews it became clear that none of the interviewees read the digital version of Ikeas magazine Live.

SVT is Sweden?s largest TV-network and broadcasts more then 22 000 hours of TV each year. SVT is a public service company where the basic idea is to reflect the world from different perspectives and news is very important for providing neutral and versatile information in a variety of areas. An important part of the flow of information is to continuously receive reports from all corners of the world around the clock. This places very high demands on the technology used and it is important that it function and develops to meet current and future growing needs.

This study aimed to investigate whether there was a correlation between an individual?s selfesteem and search for confirmation on social media. The study also sought to answer whether there were differences in self-esteem and search for confirmation from a gender perspective. In this study social media was defined as Instagram. The choice was founded on the basis that Instagram in the current situation is one of the world's largest social media that allows users to share their everydaylife in pictures, which are commented and ?liked? by other users.

The purpose of this Master's thesis is to examine whether a web-based library catalogue is to be considered user-friendly. We have examined this from a user-perspective by interviewing users of a web-based catalogue at a public library. In order to get a picture of the user-friendliness of a catalogue, the thesis is centred upon the following questions: How is a web-based catalogue used? What problems do the users experience? How is the catalogue perceived by its users? Since the producers of these catalogues now are taking into account the research upon human-computer interaction, we are also interested in finding out whether a web-based catalogue is more user-friendly than a more traditional OPAC. We do this by comparing the results of our examination with earlier studies of OPAC use.

The purpose of this thesis is to evaluate two pearl growing methods in ISI Web of Science. The methods tested are Find Related Records FRR, an automatic service that uses bibliographic coupling, and Author Keywords AK, where searches are performed using the two first keywords from this field. Both search methods were used on twenty initial documents and the first twenty hits were evaluated for relevance using a binary scale 0,1. The relevance criteria were based on specific information needs connected to every initial document. The measures used to evaluate the effectiveness of the search methods were Precision at DCV=10, P10, and Uninterpolated Average Precision AP.

Background: Approximately one in three Swedish people will receive a cancer diagnosis. Cancer primarily affects the elderly but also young people suffer. Young people are in a period of life that could put a strain of the ordinary when they are faced with choices and new challenges. The basic sense of security in everyday life is not so obvious and many suffer from, for example, stress and the feeling of being inadequate in relation to the requirements. It is relevant that the nurses can put themselves into what it is like to be young and afflicted with cancer, with the pressures of life itself and what the disease represents.

The aim of this thesis is to describe and critically investigate eight different evaluations of the retrieval effectiveness of webbased search engines. The questions to be answered in this investigation are: - What kind of relevance judgements have been used? - Which criteria have been used when judging the relevance of a document? - Which measures have been used? - How many queries have been used? - How were the queries constructed? - What document cut-off value has been used? - Has hypothes testing been applied? - What kind of webbased search engines have been included in the evaluations? The study showed that although the evaluations investigate the same phenomena, they are very different from each other in certain aspects. Generally the study showed that precision is the preferred measure in comparison to recall in the chosen evaluation even though all the included evaluations have constructed unique formulas for calculating precision. Some attempts to measure relative recall have been performed but they all suffer from different defects.

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.

This thesis was developed as an assignment from Ludosity Interactive where the goal was to develop a copy of the Xbox Live Indie Games-marketplace from the Xbox 360. Ludosity Interactive had a necessity to easily test a game's attractiveness to potential customers using testing people from outside the company in a simulated Xbox Live Indie Games test environment; excluding this developed system there is no other way to do such an analysis without actually releasing the game on the Xbox Live Indie Games marketplace and then analyze the resulting sales from the product.The finished system had to be similar to the original system to the degree that a user could see past the interface itself and use the system just as he/she would have used the real marketplace. It also had to be easy to change and add games to the system so that Ludosity Interactive easily could show the games and the data that they deemed interesting for their tests. The final product was developed using C#, XNA and XML together with an Agileinspired development method in combination with Pivotal Tracker. This report describes how this product was developed..

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.