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 the end of the 80´s the area of system development moved into a new era. As a consequence many new methods and development models emerged which in many cases resulted in problems when choosing system development models and methods. As a result of these problems the today standardized modeling language UML (Unified Modeling Language) was created. UML is tailored to support many different types of projects. This is possible because of UML?s capacity to be adjusted and adapted to a specific company environment.The purpose of this bachelor thesis is to investigate how and why companies use UML and what experiences and opinions those who use UML have of using UML in practice.

This master thesis work was done by two students at Machine Design at KTH for Lesjöfors Stockholmsfjäder AB. The task was to develop a calculation program for gas springs. The program is going to ease the selection of gas springs for a given case of a lid that should be opened. The program is going to be used internal by sales people at Lesjöfors AB in Sweden and internationally. The program is therefore written in English.The program was developed in Microsoft Visual C# 2008 Express Edition.

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.

AbstractAs a developer of database-driven applications you will be faced with difficult choices, when it comes to choosing database, server and programming language. For the result to be satisfactory it requires the different techniques to interact well with each other and also fulfill performance expectations. This is even more important when the application is deployed to the cloud and the response time plays a major role.This paper evaluates different databases and their performance. To test the databases there was an application made in the server script language PHP or Hypertext Preprocessor and it was deployed to Windows Azure cloud platform. The test applications task is to call and load databases by controlled requests which creates, reads, updates and deletes data in an relatively large extent.The results shows that locale databases or databases in the same data center as the server generates the fastest response.

Leisure boats of today have a lot of electronics that needs battery power to work. In additionto that electric propulsion systems have gotten more popular lately, which further increasesthe demand for high battery capacity. The batteries used are mostly lead-acid batteries and toget the most out of the batteries it is important to treat them right. To optimize the electricsystem it is important to have knowledge of how the batteries and the electric motor are usedand which factors affect e.g. efficiency and recharging.A new electric drive that can replace old diesel engines is being developed and needs testingand evaluation.

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 describes an examination project made for the IT consultingcompany Sogeti. The purpose of the project was to develop and modify the translation tool Language Manager (LM) built by Sogeti to be used for translating applications. Employees at Sogeti considered some disadvantages with Language Manager, version 1.0 which among others was that language files for projects were saved at two locations. Partly in resource maps among with the source code of the applications and partly in a database. This was dual work for employees at Sogeti and it also caused redundancy inthe system.

This report describes a master thesis performed at SICS (Swedish Institute of Computer Science) and KTH (The Royal Institute of Technology) in Stockholm.Ajax stands for "Asynchronous JavaScript and XML" and it's not a programming language, but a suite of technologies used to develop web applications with more interactivity than the traditional web pages.Ajax applications can be adapted for mobile and constrained devices. This has been called Mobile Ajax. While the technique is the same, Mobile Ajax generally is considered to be a special case of Ajax, because it deals with problems specific to the mobile market.The purpose of this thesis has been to examine which possibilities and disadvantages has the Mobile Ajax from developers and users perspective. In addition we compare Mobile Ajax with Java Micro Edition (Java ME) and Flash Lite.This has been done through literature studies and development of a databased chat client (MAIM -Mobile Ajax Instant Messenger). The application sends and receives direct messages in real time between differently mobile devices.

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.

In 2011, I and fellow student at Gotland University created a multimedia game. To fit the time constraints a ?vertical slice? was created. This means a small sample of the game is taken which allows the user to understand how the game works, and at the same time, get a visual demonstration of how the game is designed. The goal of the project was to create a narrative for stadium games in which the backstory is told as players interact with their surroundings.

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 aim of this thesis is to explore possible differences between public and private companies? way to manage projects. In order to analyze the managerial aspects, we have studied the project of a new payment system implemented at the public-transport organization Upplands Lokaltrafik (UL). The project enables mobile payment by text message (SMS). Most theory concerning the management of projects is developed for private companies.