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 focus of the thesis is an information search technique called manual query expansion, which aims to improve the retrieval per-formance in a search system by adding terms to the search query. The study looks at the query expansions done by LIS students, and the eventual beneficial effects by using a search help during the search process. The empirical data have been collected thro-ugh an experiment, with an experiment group as well as a control group. The conclusion is that the students need more education in query expansion in order to be able to use it correctly. There are significant differences between the groups in several aspects, for example in the use of search terms, parentheses, and truncation.

Computerized methods for searching pictures are becoming more common. With these it ispossible to make powerful search requests using a combination of terms and search oncomprehensive descriptions of the pictures. The descriptions can encompass various aspectsof the content and allow different interpretations and levels of detail.This essay is about how you can examine and describe the content of a picture from manypoints of view. We have tried to identify differences in searching behaviour, and studiedsome methods for indexing of pictures. Our concepts are taken from the philosophy of artand from theories about the meaning of languages.In the future perhaps libraries can make pictures and illustrations in books available to thepublic, in a sophisticated system, for the purpose of providing visual documentation forstudy, research or other kinds of exploitation..

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 report examines the possibility of optimizing troubleshooting log files generated when constructing new Volvo trucks. Errors occur when CAD models are stored and managed by the versioning system PDMLink. By developing a new diagnostic tool, Log Search, the troubleshooting process is automated and thereby streamlines the current manual search..

Traditionally the content of fiction has not been described, analyzed, classified and/or indexed to the same extent as non-fiction. As a consequence, this lack of content analysis has resulted in unsatisfactory fiction retrieval in relation to users seeking and search behaviour. This fact is why this Master s thesis is written. The total of library users' seeking and search behaviour is investigated in order to suggest methods to improve user adapted fiction retrieval tools. Suggesting relevant fiction retrieval tools corresponding to users' seeking/search behaviour is another aim of the study.

In this essay, a search strategy for citation index is studied. The strategy, which is essentially a citation cycle, starts with documents retrieved by a subject search, wherefrom new documents are identified following the network of citations backwards and forwards in time. Based on the theory of polyrepresentation, the strategy exploits overlaps between cognitively different interpretations of the same documents in order to automatically select references seed documents used as a starting point for the forward chaining. The purpose of the investigation is to evaluate the retrieval effectiveness of the search strategy and to find out whether the strategy can be used to expand a subject search with the help of the network of references in order to retrieve new relevant documents. Two questions are formulated: 1a.

The purpose with this essay is to evaluate the retrieval performance between Googles basic search and the advanced search functions. A secondary purpose is to evaluate the differences between the binary relevance scale and a 4- point scale. The basic search is defined as a search with two terms combined with the Boolean operator AND. The advanced search is based on search functions that are adequate to compare to the basic search. They are categorized as AND-searches, OR-searches, AND and OR-searches, exact phrase, and depending on where the terms occur on the page.

The purpose of this thesis is to examine how novices set about when they search for information. Marchionini's information-seeking model is the theoretical starting point, which is supplemented by theories of other specialists within the field, such as Chowdhury; Harter; Large, Tedd and Hartley. As method a questionnaire survey was used. The questionnaire was sent to 96 students at IHM Business School in Gothenburg and 57 questionnaires were returned. The results show among other things that the majority of the students used highly interactive search strategies, and they did not plan their search before they carried out the search.

Within telecommunication and routing of tra?c in IP-networks a protocol named?Open Shortest Path First? (OSPF) is widely used. This means that a server dealswith the routing over a network with given weights by calculating shortest paths touse for routing. If we assume that a desired tra?c pattern is given the problem isto ?nd out if it is possible to set the weights so that the desired tra?c pattern is apart of a shortest path graph.

Today, one of the foremost tools used by the library staff is the library catalogue search tools. It has come to our understanding that some library staff are dissatisfied with how the search tools works. The aim of this study is to illuminate the library staff's negative experiences of the search tools, and to present a basis for future discussion and development. To our help we have used a quantitative survey which were sent to library staff that used one of the two largest integrated library systems in Sweden, BOOK-IT and Mikromarc. The questions regarded the library staff's perception of a number of features in the search tools.

The purpose of this paper is to compare the three search engines Web of Science, Google Scholar and MEDLINE in regards of recovery efficiency and the overlap of relevant documents when it comes to information searching for academic purposes. Furthermore, it raises the question whether freely available search engines and licensed search engines are interchangeable with each other. The empirical data in this study were collected through searches conducted in the three search engines Web of Science, Google Scholar and MEDLINE. Twenty search queries were used and the first twenty retrieved documents for each query were examined for relevance using previously designed criteria. The documents were scored by a binary relevancy scale and thereafter a precision value for each search engine was calculated.

The purpose of this Master?s thesis is to evaluate three general query-based web search engines. The search engines chosen are Google, Yahoo! and Live Search. The topics, which where transformed into twenty queries, are based on real users? information needs, taken from an ask-a-question service.

This thesis is a case study of the search function on the University of Uppsala?s web site. The search function in this study was chosen since it exists on a large and complex web site and there were apparent lacks in the old version of the search function. The thesis highlights some of the problems that can appear in the development of a search function on a local site. One interesting find is that one of the most difficult issues is organizational and not technical.