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.

This anthology covers subjects such as beeing involuntary sterile, adoption, coping with desease, death and anxiety. All chapters are based on observations and interviews analyzed with Grounded Theory. Our aim with the anthology is to tell the subjective story of individuals focusing on aspects such as crisis, conditions of living and identity. We chose to work from these aspects as we find the processes that creates and re-creates the identity and self-image in induviduals interesting. We also focus an society?s means for helping persons in crisis..

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 Roma people have many times, and for a long period of time been described in a negative way, as a group of people unlike every other. Both novels and encyclopedias has been a part of this misleading discourse and therefore contributed to large misunderstandings. Also scholarly research from Sweden, and elsewhere, has featured inaccurate representations of the Roma people and altogether this has created negative attitudes towards Roma people which are still today a considerable problem.However, the last few years positive changes has taken place and today the Roma people is an official minority group in Sweden which, among other things, has led to promising possibilities, especially in schools, for a deeper understanding of the Roma people in the future. Reading Roma literature I believe is an important part of this.Katarina Taikon and Hans Caldaras both consider themselves Roma. They also have in common that they want to give voice for the group of Roma that has lived in Sweden since mid-nineteenth century.

In this essay I examine how identity is created in William S. Burroughs two early novels Junky andQueer. The theoretic starting points are Lacans psychoanlytic concepts ?ideal ego?, ?egoideal? and the ?superego? and also queertheory as presented by Tiina Rosenberg in her book Queerfeministisk agenda.The examination contains an analysis of how Burroughs creates identity in both Junky and Queer with main focus on the second novel. I look at how the desire in the maincharacter Lee is described and what the desire is aimed at.

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 degree project has been implemented abroad in Brisbane, Australia. A literature study has beenperformed parallel to the practical work within the subject »Corporate identity through graphicaldesign«. In this study deeper research has been made concerning the establishment and manifestationof a corporate identity and its program. The knowledge given from this study has been put into practicethrough two larger projects.The first project was carried out at De Pasquale, advertising agency in Brisbane, where a corporateidentity program was designed for a new company. The company is a fitness centre, called KnockoutFitness, which specializes in different types of boxing training sessions such as Boxing, Thai Bow andBoxercise but also Aqua aerobics.

This study examines how the Swedish newspaper G?teborgs-Posten presented Swedish identity in relation to the country?s referendum and EU-membership. By investigating the usage of the Swedish identity, related to EU-membership, the ambition is to conclude whether the newspaper was positive towards EU-membership. The empirical base consists of articles produced by G?teborgs-Posten from the first of October 1994 to the last day of January 1995.

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.