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 CONSTANT IMPROVAL AND REFINEMENT OF THE MOBILE TECHNOLOGY HAVE MADE IT POSSIBLEto use video in settings where such use couldn't be motivated before, due to economicaland practical reasons. The purpose of the study was to identify and explore possiblechallenges in interorganizational use of video during emergency response work. Thiswas done by a case study of a system designed for the use of video in such situations.The study focused on operational challenges for the fire and rescue services and thehealthcare organisations, where the main challenges identified were intended to beanalysed and discussed in terms of design. The empirical results were gathered throughqualitative interviews with representatives from the fire and rescue services and thehealthcare organisations in Göteborg. This material made it clear that contextual aspectsof emergency response work lead to a couple of challenges connected to the use of videoin such situations.

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.

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.

Syftet med uppsatsen är att belysa möjligheter och begränsningar med olika tekniska system för att identifiera kontakter på stridsfältet, främst med avseende på att minska risken för vådabekämpningar. Uppsatsen skall också belysa om införande av tekniska system för identifiering av kontakter är den enskilt bästa metoden för att undvika vådabekämpningar. Syftet är att läsaren skall uppnå en förståelse för vad olika typer av system för identifiering kan bidra med för att minska risken för vådabekämpningar. Utöver detta belyses andra nackdelar och fördelar med de olika tekniska systemen förutom just inom området identifiering.Uppsatsen beskriver olika händelser där vådabekämpningar skett och kopplar dessa mot hur olika tekniska system eventuellt hade kunnat minska risken för att vådabekämpningen skulle ha skett. Uppsatsen beskriver också ett antal olika tekniska system för identifiering av kontakter på stridsfältet..

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.