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 outset of this thesis is to raise questions on how we design for the mobile context and the capabilities of smartphones. Not only the presentation but also the use of input and interaction between a service and a user.This work evolves around sign up forms and answers the question: How does the sign up process affect the holistic perspective of a digital service regarding usability and user experience? This thesis consists of a case studies, and design experiments conducted on Twitter, Instagram and Randos sign up processes to explore if and how the usability, and the user experience could be affected and im- proved.This concluded some important aspects to be considered when designing sign up forms for a digital service.The usability, and the user experience is not only affected by user interaction, and the choice of input method but it?s also affected by which data the service is requesting, and more important; if that data is motivated to request by the service..

Att utforma interaktiva TV-tjänster skiljer sig på flera sätt från att designa för webb eller för vanliga PC-tillämpningar. Faktorer som lägre bildupplösning, längre avstånd mellan användare och skärm, och inte minst användandet av fjärrkontroll istället för tangentbord och mus gör att villkoren ser annorlunda ut än för PC-tillämpningar. I detta arbete beskrivs hur en videobutik för en set-top-box för digital-TV utformas via iterativ hifi-prototypning och utvärdering. Lärdomarna är tillämpbara på andra interaktiva TV-tillämpningar..

Syftet med denna uppsats är att identifiera den mest effektiva egenskapen av en text eller sida för att uppnå visuell hierarki, som är ett verktyg för att få det önskade flödet av uppmärksamhet i en sida eller webbsida genom att ge vissa element en viss vikt i kontrast, storlek och placering. Vi vill ge en möjlighet för vidare forskning snarare än att ge en slutsats som ger ett slutgiltigt svar på frågeställningarna. Det finns fler sätt att manipulera text för att uppnå önskad visuell hierarki men vi valde de vanligaste. Detta arbete är baserat på ett experiment som görs på 50 deltagare med ett onlinefrågeformulär och tre självgjorda bilder där vi kan utvärdera resultaten, jämföra dem med andra teorier och beräkna den mest effektiva uppmärksamhetsgivaren. Vi har också utvecklat en hypotes om vad resultatet kommer att visa.

The purpose of this thesis is to investigate how the metadata format Dublin Core is applied within five Swedish search engines. The objects of the investigation are Rättskällan, studera.nu, Svenska miljönätet, Svesök and the web catalogue of Uppsala University. Dublin Core is a flexible and adjustable format, which can be used in many different ways and in various projects depending on the target groups and objectives of the activity. We compare the differences and similarities between the five search engines concerning their usage of metadata in general and Dublin Core in particular. The material of the investigation consists of metadata records, which are collected by a robot and examined manually.

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 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 purpose of this thesis is to get an improved understanding of what the bases for relevance are, when people in real information need situations make relevance judgements. In order to meet this purpose, an investigation based on research literature is performed. Four types of relevance are investigated: topical or subject relevance, cognitive relevance or pertinence, situational relevance or utility, and socio-cognitive relevance. The investigation also deals with users relevance criteria identified in fourteen empirical studies, in which the users are adults and engaged in oral, textual, and multimedia information retrieval. Finally, the connections between the user criteria found and the types of relevance are discussed.

In this paper, a navigation support approach for speech-only interaction based on auditory icons for room-based designs is presented, i.e. naturally occurring sounds that have a natural mapping to the system's underlying design metaphor. In contrast to many recent investigations that have focused on multi-modal or augmented reality systems, this paper concerns a unimodal speech and sound-only system. An auditory icon based prototype system for buildings maintenance support using a room-based metaphor was developed. The design was evaluated in a comparison with earcons and no-sound designs.

Abstract In the contemporary world of information technology you find a multitude of applications and systems covering a broad spectrum of areas of need in different companies. One effect of this multitude of programs is the difficulty to make them exchange information with each other or to collaborate, since they are developed by different programming languages for different platforms, with different standards and different data formats. Our aim with this work is to describe how it is possible to tie these programs together to make them actually communicate with each other in order to exchange information, share their native methods and also to become a part of the overall business processes. In this integration task you will, among other things, find different levels of application integration such as data level, method level, application interface level and user interface level integration. Application integration also involves hardware components, called middleware, that facilitate the physical connection between applications.

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.