The purpose of this Master?s thesis is to study how well the online catalogue of The Music Library of Sweden works when ordinary users are searching for sheet music. The issues studied are: Why do the users fail to find the sheet music they are looking for? Do the users take advantage of the possibilities that the classification codes of the SAB system offer? If not, why?The source material of the study is 144 comments from a user questionnaire about the online catalogue and, in addition, the search log for one day (513 queries). The comments were sorted into seven groups depending on the type of information need, for example searches for certain instrumentation or genres and problems with spelling.

The advantage and the possibility of keeping track of a number of vehicles to make work practice more effective and smooth is today a favorable choice for Visual Units Logistics customers. We?ve been evaluating the software and trying to take it one step further and letting not only the individual user, but maybe, the company as a whole benefit from its advantages. This has been done by using methods like letting ourselves get to know the software, user case studies, workplace studies, interviews and future workshops. This resulted in a prototype introducing a new function designed with all collected data in mind trying to make the software, Visual Units Logistics, even more effective for the every day work practice of the user.

The following report is a constructive responsive evaluation of Svalövs communes unit for newly arrived refugees based on a qualitative user- and stakeholder model. The main purpose is to evaluate the units? quality from a user and stakeholder perspective. The main findings are that the users and stakeholders are satisfied with the quality of the units? services but request further social and structural participation.

The aim of this essay is to examine three separate Swedish public libraries and their respective websites on the grounds of the usability sciences. I firstly had to summarize the main properties of the usability-field in order to gain an extended knowledge of its purposes and possible usage for today?s library systems. I was then able to apply the extended knowledge in the examination of the three library websites and the purpose of determining whether or not they were designed according to the standards set by the usability-sciences.Usability is a rather new science that deals with the dissection and examination of computer-based systems, in order to find the key components that make systems user-friendlier. With user needs being the main focus of its research, usability tries to meet all the different needs of the modern user and construct systems that are less system-centered and more user-centered.

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.

In this thesis, input data for energy performance calculations on commercialpremises have been studied. In energy performance calculations, where internal heat gain parameters are unknown, template values that, in a reasonable way represent the activity in the room, are necessary. These values can be used as input data for whole-year calculations, or for calculations on shorter periods of time.The purpose of the Sveby project is to create standardized work practice in energy issues for the construction industry. The work in this thesis is conducted to correlate with the purpose of the Sveby project, with aims of contributing with information and guidelines for the continuing work with commercial premises.In this report, suggestions for template values for internal gains parameters, based on research and calculations in the field are presented. Suggestions on how these can be implemented in a user-friendly way for two energy performance calculation software are also given, VIP Energy and IDA ICE.

This thesis was developed as an assignment from Ludosity Interactive where the goal was to develop a copy of the Xbox Live Indie Games-marketplace from the Xbox 360. Ludosity Interactive had a necessity to easily test a game's attractiveness to potential customers using testing people from outside the company in a simulated Xbox Live Indie Games test environment; excluding this developed system there is no other way to do such an analysis without actually releasing the game on the Xbox Live Indie Games marketplace and then analyze the resulting sales from the product.The finished system had to be similar to the original system to the degree that a user could see past the interface itself and use the system just as he/she would have used the real marketplace. It also had to be easy to change and add games to the system so that Ludosity Interactive easily could show the games and the data that they deemed interesting for their tests. The final product was developed using C#, XNA and XML together with an Agileinspired development method in combination with Pivotal Tracker. This report describes how this product was developed..

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.

Boverket har huvudansvar för att skapa en portal för samhällsplanering som ska kunna förse kommuner, landsting, företag och privatpersoner med olika typer av kartinformation. Denna portal kallas Planeringsportalen och som ett led i dess utveckling hölls ett designmöte i april 2007. Inför mötet gjordes en analys av diverse förebilder för att beskriva de goda designlösningar som finns i genren WebGIS, enligt förlaga från Lundberg, Holmlid och Arvolas (2007) arbete. Uppsatsen beskriver hur dessa designlösningar kan användas i designen av Planeringsportalen tillsammans med en redogörelse för hur förebilder kan bidra till en bättre designprocess. Genren representeras i arbetet av webbplatserna Eniro, Norge digitalt, RATP samt Mapquest som alla studerats enligt ett formaliserat förfarande.

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.