HMS Networks AB develops, produces and sells communication technology for industrial automation. The product handles communication between a variety of protocols. The product treated in this project is an Anybus X-gateway Modbus-TCP Master/Client and this module is currently configured from a web-based interface. In doing so, the flexibility for handling protocols is limited to what the company chooses to add to the interface. Therefore the company had a request that the flexibility should be extended using a script language.

In this paper we explore the relations between context and feedback generated in three user-centered evaluations of a flash-based game. Whether it?s the social context, the physical context or the degree of intrusion from the evaluator, they all contribute to the quality of the feedback received. The selection of test subjects is a narrow process, which gives the above mentioned factors different meaning. Contextual factors have shown to influence the feedback given within both usability and user-experience.

The aim of this Masters thesis is to examine the user service discourses in the field of public libraries that can be identified in four Swedish library journals. Also which underlying causes that control the discourses and the consequences of them are examined. Questions in this study are: which discourses can be found, what characterises them, what kind of different discourses concerning technology in society control the user service discourses and what are the consequences of them. The theoretical starting-point is Ernesto Laclaus and Chantal Mouffes discourse theory. The method is text analytic.

This thesis has been performed at Scania CV AB Technical Centre in Södertälje and its aim hasbeen to study the causes and effects of deformations in the interface between the rear axlehousing ADA1100 and the central gear house R780 during operation. Design changes that wouldincrease the sealing capability of the studied interface are also suggested. Finite element (FE)and CAD software have been the primary tools in this study.Finite element (FE) simulations are used in the industry to predict and develop engineeringdesigns. The main motive for FE simulations has traditionally been to identify weak spots in thedesign, regarding high tensions and large deformations.The FE model is an aggregation of submodels and interface models that represents the rear axlehousing, suspension, central gear, central gear housing, wheels, bolts and weldings, and theirinteractions. The submodels have different material properties and they are connected withcontact interface models.Boundary conditions are defined on the bushings in front of the rear axle and on the air bellowsbehind the rear axle.

The aim of this master?s thesis is to examine how libraries can organize their collections in terms of library shelving and displays and to what extent these activities stem from a desire to create a user-friendly library. The thesis is based upon a case study of Arkenbiblioteket in Sweden and the material consists of a literature study and qualitative, semi-structured interviews with three librarians at Arkenbiblioteket. The theoretical framework consists of theories on information-seeking behavior, classification and displays. These theories form the basis of the analysis of the empirical material.The main reason for the changes in shelf arrangement at Arkenbiblioteket was a desire among the library staff to create a user-friendly library.

Due to a growing interest in communication in today?s society the demand for equipment that is used in communication networks increases while the competition between companies that produce this equipment grows. To meet the increasing demand and at the same time having a competitive product development many companies use some effective product design, such as the modular product design. When a modular product design is used it?s good to compare different module configurations for a certain product and to simplify these comparisons some tool can be used.

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 purpose of this essay is to perform an evaluation regarding retrieval performance of three web search engines. The search engines included are All the Web, Alta Vista and Google. These have been tested using ten queries within different subject areas chosen by the author. The first twenty hits for each question have been analyzed for relevancy. Relevancy is judged on a three-point scale; 0, 0,5 and 1 where 0 goes to irrelevant and inactive or duplicate documents, 0,5 point goes to partially relevant documents and 1 point goes to highly relevant documents.

Background: Nerve mobilisation is a controversial subject which has undergone great development in recent decades. Nerve mobilisation is based on a concept of both examination and treatment of the nervous system. Purpose: To study nerve mobilisation as a treatment in physical therapy with emphasis on evidence regarding the method. Method: A literature review. The search was made through the databases: PubMed/Medline, Academic search, PEDro and CINAHL/webspirs.

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 work was carried out on Termisk Systemteknisk?s office in Linköping. The aim was to create a computer system with infrared camera technology for quality control and temperature monitoring of manufacturing processes in industry. The system should be configurable such that it can be used on several different issues, including those where the real-time analysis of camera images is required.The developed system is based on an existing framework, Panola, to deal with measurement results and images in a database. The framework is built for the system continually check for new data , and the task was to create a foundation upon which to build systems that use the framework, but fully or partially utilize direct calls .

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.