AimThe aim of the study was to develop a method for the survey of play movement demands and temporal patterns in order to enable a descriptive study of the defensive players in American Football. The overall aim was to  improve the understanding of how American Football is played to create opportunities for enhancement of current or developing new training methods to better suit football.MethodFifty plays from a Division 3 college football game on video from 2005 was divided into sequences of action for one player each from the defensive line, linebackers and defensive backs and analyzed with the video analyzing software cSwing. Every players sequence of action was recorded in a spreadsheet and noted on a scaled football field where distances were measured and together with time stamps from cSwing velocity was calculated.ResultsUsing this method it was possible to describe the play movement demands and temporal patterns which was the main task of the study. The defensive end worked on an average 4.61 seconds per play, the distance was 12.4 meters and average speed 2.5 m×s-1. The linebacker worked on an average 4.35 s per play, 13.7 m and at a mean speed of 3.0 m×s-1.

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.

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.

I have been inspired by the Do It Yourself movement. DIY builds on the creativity of the individual, one?s capacity for initiative and one?s desire to realise one?s ideas. I have been inspired by sheets of pattern paper used in the manufacture of clothing, and my line of furniture is based on two-dimensional patterns of furniture. The sections of the pieces of furniture are printed on and relate to a standard sheet of plywood.

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 following project has been made in collaboration with, Denator AB, a biotechnology enterprise. One-dimensional electrophoreses have been used to analyze protein contents of tissue samples. Tissue samples have been either treated according to the company´s newly developed tissue treatment technique or not treated at all and comparisons between these samples have been made. In order to see differences in protein patterns between samples more clearly, a conversion method has been developed where electrophoresis gel visual patterns are used to produce curves, similar to densitometer curves.Denator AB would like to know if the proteins in their treated samples will change visibly over 48 h when incubated at room temperature. This has been investigated using the above mentioned method.

AimThe aim of the study was to develop a method for the survey of play movement demands and temporal patterns in order to enable a descriptive study of the defensive players in American Football. The overall aim was to  improve the understanding of how American Football is played to create opportunities for enhancement of current or developing new training methods to better suit football.MethodFifty plays from a Division 3 college football game on video from 2005 was divided into sequences of action for one player each from the defensive line, linebackers and defensive backs and analyzed with the video analyzing software cSwing. Every players sequence of action was recorded in a spreadsheet and noted on a scaled football field where distances were measured and together with time stamps from cSwing velocity was calculated.ResultsUsing this method it was possible to describe the play movement demands and temporal patterns which was the main task of the study. The defensive end worked on an average 4.61 seconds per play, the distance was 12.4 meters and average speed 2.5 m×s-1. The linebacker worked on an average 4.35 s per play, 13.7 m and at a mean speed of 3.0 m×s-1.

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.

Launching and marketing a health food product is associated with larger problems than a launch of a traditional food product. There are several sales channels that can be used for a health food product, for example the product can be sold as a traditional food product, natural health food product or as a prescription drug. A smaller company can however experience problems while launching its product as a prescription drug because of the large costs associated with this particular sales channel. There is often no other alternative than to launch the product as a traditional food product, this can however create other problems because of the existing regulations on what can and cannot be mentioned in the marketing of a health food product. The limited amount of information about the product that can be enclosed together with it makes it hard for a company to differentiate and position it on the market.

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.