På Storängen i Söderköping bygger Bygg GG i Norrköping i samarbete med G Gunnarsons Fastighets AB ett hus innehållande 14 ägarlägenheter. Då försäljningen av lägenheterna startade innan huset var färdigt bestod den största delen av säljunderlaget av ritningar och skisser.Syftet med examensarbetet var att utföra en visualisering av det blivande husets yttre i form av en digital 3d-modell samt att visa hur några av de blivande lägenheterna skulle komma att se ut. Då många av lägenheterna i huset liknar varandra togs beslutet att visualisera tre av husets lägenheter.Rapporten beskriver hur arbetet med att ta fram visualiseringen genomförts. Den ger även en inblick i visualiseringsprocessen samt de programvaror som använts för projektet.Projektet kan delas in i två delar. En exteriör del och en interiör del.I den exteriöra delen byggdes en 3d-modell av huset i 3d-programmet Google SketchUp som är ett lättanvänt program för att skapa digitala skisser och 3d-modeller.

This study investigated how banner ads, depending on its quality and placement,can capture a user's attention while searching for editorial content in an online newspaper. Furthermore, the user's search strategy was also studied to see whether it varied depending on the placement of an ad. An experiment was conducted where 20 subjects searched for articles in a Swedish online newspaper while their eye ovement was recorded with a headmounted eye?tracker. In each search task the online newspaper contained either a low quality ad or a high quality ad.

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.

My ambition with his exam is to study how young girls are being depicted in swedish novels of 2010. I have analyzed how the identity and the search for identity are produced in these books. To be able to make my analysis of these books I have used Maria Nikolajeva?s book Barnbokens byggklossar. From wich I have worked out a few questions that I have used my analysis in the portrayal of these girls.

The purpose of this thesis is to examine how academic librarians seek information for themselves and for others, and what differences exist. The terms self-generated and imposed information seeking is used to describe the two different types of information seeking. Step 2 ? define and understand the problem, step 3 ? choose a search system and step 4 ? formulate a query of Marchionini?s information-seeking model forms the basis of the theoretical framework, which is supplemented with Soergel and Katz. Qualitative interviews with eight academic librarians were conducted and analyzed in order to gather empirical facts.

The purpose of this thesis is to examine how academic librarians seek information for themselves and for others, and what differences exist. The terms self-generated and imposed information seeking is used to describe the two different types of information seeking. Step 2 ? define and understand the problem, step 3 ? choose a search system and step 4 ? formulate a query of Marchionini?s information-seeking model forms the basis of the theoretical framework, which is supplemented with Soergel and Katz. Qualitative interviews with eight academic librarians were conducted and analyzed in order to gather empirical facts.

The thesis concerns the use of classification schemes for organising resources in subject-based hierarchical search-services on the web. The aim is to investigate the different kinds of classification that are used, which fall into two groups: established respectively new classification schemes. This is attained by studying literature and the websites of each search-service. The prospects for using classification in a web-environment are discussed and divided into three major groups: browsing, control and cross-classification. One question at issue concerns how an established scheme manages to organise web-resources and whether this classification differs from the classification of new schemes and in what way.

This report deals with RFID systems and how to detect nearby tags with the Mifare standard using only a microcontroller and an antenna circuit.The aim was to investigate whether there was any possibility to continuously search for a nearby tag for a system operated with batteries without compromising   the lifespan of the battery. At this time the system would take too long time to wake up and look for a tag to give a satisfactory battery lifespan, which should be done a couple of times every second.The report has two issues, namely:Is it possible to direct the microprocessor to detect and identify a nearby tag after the Mifare standard?What hardware is required for this to be possible?As the research method to provide answers to the above questions an action research was used. This approach has meant that the group worked on information retrieval, examined existing solutions, tested their own solutions and documented the results.The group examined an existing solution that can search for nearby tags with minimal energy consumption. An antenna circuit was built that was connected to the processor.

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.

Användning av molntjänster har gjort forensiska undersökningar mer komplicerade. Däremot finns det goda förutsättningar om molnleverantörerna skapar tjänster för att få ut all information. Det skulle göra det enklare och mer tillförlitligt.Informationen som ska tas ut från molntjänsterna är svår att få ut på ett korrekt sätt. Undersökningen görs inte på en skrivskyddad kopia, utan i en miljö som riskerar att förändras. Det är då möjligt att ändringar görs under tiden datan hämtas ut, vilket inte alltid syns.

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.

  Befintliga studier har påvisat att genetiska algoritmer presterar bättre om de ges en bra startpopulation. I denna rapport presenteras en lokal sökalgoritm för att skapa en population med fokus på ?vehicle routing?-problem. Algoritmen använder sig av heuristik i en blandning av simulated annealing och tabu search för att skapa individerna till populationen. Utvärderingar av algoritmen på ett praktiskt problem visar att den ger en bra start jämfört med en slumpmässig startpopulation, vilket är vanligt att använda.

This is an examination of the Swedish unemployment insurance system and the effects it has on the Swedish long-term unemployment. A search model is explained to give an understanding to the incentives of the unemployed. Different mechanisms that create unemployment and that could create long-term unemployment are investigated, but primarily the unemployment insurance is in focus.The Swedish unemployment insurance has undergone several changes the last fifteen years that have improved its efficiency. The introduction of a finite duration of unemployment insurance entitlement was an important step and so was the decrease in the replacement ratio. Even so, I assess that there is still room for improvements of the incentives to search for work among the unemployed.

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 question whether controlled vocabulary or natural language free-text terms is the most effective search strategy has occupied researchers in LIS for many decades. This Masters thesis is an empirical study which aims to compare these two search strategies in LISA Library and Information Science Abstracts, an online bibliographic database. 22 topics from the discipline of Library and Information Science were constructed and out of each topic one query for each search strategy was formed. Queries in natural language were formed with terms from different sources, for example dictionaries, while queries in controlled vocabulary were built with terms from LISAs electronic thesaurus. The measures used in this study were precision, relative recall pooling method and overlap.