This paper is a comparing study of the retrieval effectiveness of the search engines Google, Google Scholar and Scirus. The aim is to find out how good they are at retrieving relevant academic material in the research-field of Library and Information science. The thirty search questions where based on actual information needs collected from exams within the field of Library and Information Science. This method was used to prevent that none of the search engines were given an advantage because of construction of the information needs. The first twenty retrieved documents on the retrieval lists are examined for academic content and relevance.

The buying decision process describes how the consumer makes a purchase decision through a rational process (Markin, 1979) and an understanding for how consumers make a purchase decision can according to Sands et al. (2010) be obtained by increased knowledge for the information search process (the second part of the buying decision process) before a purchase. Today?s society offers great opportunity to obtain information (Rahim & Clemens, 2012; Bawden & Robinson, 2009) and by that there are in other words good opportunities for a rational acting by the consumers. However, there are factors working against that consumers act rationally and seek information prior to their purchases primarily in the form of the concept of information overload (Bawden & Robinson, 2009) which claims that consumers are limited in their information search because there is too much information but also other factors such as lack of time (Wood & Neal, 2009) and ability to find information (Slegers et al.

The main object for this thesis is to study how students in library and information science at Högskolan i Borås search and valuate documents in the process of writing a paper. The study is based on a series of interviews with 12 students. Our methodology is also based on studies of their final product. The goal of the study was to map out how the students make their decisions during their search process. We studied the students use of search words, relevance judgements and how their need for information changed trough out the writing of their paper.

The purpose of this thesis is to examine young people?s information needs whenthey are deciding on what upper secondary education to choose, why they usedInternet to find the information, and how they experienced their informationseeking. A qualitative study was made using interviews. The study?s respondentsconsisted of young people who are soon to be leaving elementary school, andyoung people who have just started their upper secondary education.

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.

`When one does not have what one wants, one must want what one has´: `I have had, you see, to resort more and more to very small, almost invisible pleasures, little extras....You´ve no idea how great one becomes with these little details, it´s incredible how one grows. ´ The aim of this master thesis is to find words and expressions that can accompany city phenomenas as well as the people wandering through the space which is defiened as city. Through this tentative search a new term was found namely Urban Settler Marks. This term started a journey and an attempt to theoretisize why people have a need for various spaces to put their Urban Settlers Marks onto. My focus was drawn to electrical boxes in the urban environment because of their ambigious nature.

Previous research has focused limited attention on how personality affects job search for university educated people in work and no studies have focused on the difference between active and passive job seekers. This survey-based study that examined university educated economists and engineers with 5-25 years of experience, showed that career ambition mediated active job search for the personality dimensions of openness, agreeableness and extraversion and also gave clear evidence that active job seekers have lower levels of job satisfaction, and higher levels of career ambition, agreeableness and extraversion, compared with passive job seekers. These findings provide a more nuanced picture of the impact of different recruitment strategies and provide a starting point for in-depth studies on passive job seekers.

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.

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.