The purpose of this Master?s thesis is to investigate how librarians solve difficult reference questions. The aim is to discuss the nature of reference work ? do librarians make conscious decisions regarding search strategies or do they rely principally on their instincts, or simply chance. The thesis is a qualitative study.

This paper is a literature study on search engine optimization (SEO) considering the leader of the search engine market: Google. There´s an introductory background description of Google and its methods of  crawling the Internet and indexing the web pages, along with a brief review of the famous PageRank algorithm. The purpose of this paper is to describe the major important methods for improved rankings on Google´s result lists. These methods could be categorized as on-page methods tied to the website to be optimized or off-page methods that are external to the website such as link development. Furthermore the most common unethical methods are described, known as ?black hat?, which is the secondary purpose of the text.

Purpose/Aim: The purpose of this thesis is to define and analyse how Swedish record companies work with digital musical content distributors. A more narrow aim is to show how the record companies and with the digital musical content distributors iTunes Music Store and Spotify create incentives for consumer?s to use legal digital music channels through the Internet. To further circle the core of the problem following questions have been asked: How does the record companies provide iTunes Music Store and Spotify with digital content and what is done by the record companies to retain control over the material? How do the record companies view digital musical sales and what incentives are given to consumers to buy music digitally? Finally, What position of power do iTunes Music Store and Spotify have on the digital content arena?Material/Method: The data collected for this thesis is retrieved through personal interviews with representatives from three of the four major record companies Universal Music, Warner Music and EMI and their Swedish branches.Main results: The consumer?s access to digital content through iTunes Music Store and Spotify is of the utmost importance and is a prerequisite.

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 study investigated how banner ads, depending on its quality and placement,can capture a user's attention while searching for editorial content in an online newspaper. Furthermore, the user's search strategy was also studied to see whether it varied depending on the placement of an ad. An experiment was conducted where 20 subjects searched for articles in a Swedish online newspaper while their eye ovement was recorded with a headmounted eye?tracker. In each search task the online newspaper contained either a low quality ad or a high quality ad.

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.

My ambition with his exam is to study how young girls are being depicted in swedish novels of 2010. I have analyzed how the identity and the search for identity are produced in these books. To be able to make my analysis of these books I have used Maria Nikolajeva?s book Barnbokens byggklossar. From wich I have worked out a few questions that I have used my analysis in the portrayal of these girls.

The purpose of this thesis is to examine how academic librarians seek information for themselves and for others, and what differences exist. The terms self-generated and imposed information seeking is used to describe the two different types of information seeking. Step 2 ? define and understand the problem, step 3 ? choose a search system and step 4 ? formulate a query of Marchionini?s information-seeking model forms the basis of the theoretical framework, which is supplemented with Soergel and Katz. Qualitative interviews with eight academic librarians were conducted and analyzed in order to gather empirical facts.

The purpose of this thesis is to examine how academic librarians seek information for themselves and for others, and what differences exist. The terms self-generated and imposed information seeking is used to describe the two different types of information seeking. Step 2 ? define and understand the problem, step 3 ? choose a search system and step 4 ? formulate a query of Marchionini?s information-seeking model forms the basis of the theoretical framework, which is supplemented with Soergel and Katz. Qualitative interviews with eight academic librarians were conducted and analyzed in order to gather empirical facts.

The thesis concerns the use of classification schemes for organising resources in subject-based hierarchical search-services on the web. The aim is to investigate the different kinds of classification that are used, which fall into two groups: established respectively new classification schemes. This is attained by studying literature and the websites of each search-service. The prospects for using classification in a web-environment are discussed and divided into three major groups: browsing, control and cross-classification. One question at issue concerns how an established scheme manages to organise web-resources and whether this classification differs from the classification of new schemes and in what way.

This report deals with RFID systems and how to detect nearby tags with the Mifare standard using only a microcontroller and an antenna circuit.The aim was to investigate whether there was any possibility to continuously search for a nearby tag for a system operated with batteries without compromising   the lifespan of the battery. At this time the system would take too long time to wake up and look for a tag to give a satisfactory battery lifespan, which should be done a couple of times every second.The report has two issues, namely:Is it possible to direct the microprocessor to detect and identify a nearby tag after the Mifare standard?What hardware is required for this to be possible?As the research method to provide answers to the above questions an action research was used. This approach has meant that the group worked on information retrieval, examined existing solutions, tested their own solutions and documented the results.The group examined an existing solution that can search for nearby tags with minimal energy consumption. An antenna circuit was built that was connected to the processor.

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.

  Befintliga studier har påvisat att genetiska algoritmer presterar bättre om de ges en bra startpopulation. I denna rapport presenteras en lokal sökalgoritm för att skapa en population med fokus på ?vehicle routing?-problem. Algoritmen använder sig av heuristik i en blandning av simulated annealing och tabu search för att skapa individerna till populationen. Utvärderingar av algoritmen på ett praktiskt problem visar att den ger en bra start jämfört med en slumpmässig startpopulation, vilket är vanligt att använda.

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.