Urban planning is not only a matter of architectural trends; it is first and foremost political. This thesis seeks to understand the links between political ideas and visions for the city and the physical structure of the city. The study aims to construct a model to help understand these links, a helpful tool in analysing a city, focusing on the one hand at the physical structure of what I call "The City as a Welfare Provider" and on the other hand at "The City as a Growth Engine". It also sets out to test this model in an empirical study of Stockholm and the soon-to-be built district of Norra Station in the same city.The analysis shows that Stockholm has ambitions to be a welfare provider to its citizens, but have also adopted to a discourse of interurban competition which stresses the importance for the city to enhance economical growth. What is interesting is that the physical structures promoted in the planning documents of Stockholm are nearly exclusively those associated with the model of "The City as a Growth Engine"..

Many media buyers annually spend money on advertising which will not be of benefit to their own brand; the fact that consumers confuse from which brand they have heard or seen commercials, comes as news to nobody. The phenomenon of media confusion has however earned much less attention. As a greater part of the total marketing budget is being spent on the media investments, on behalf of the actual advertising production, the more interesting it turns out to maximize the effects of the media expenses. The search for optimization is somewhat practised today by brand managers who are daringly adding a few more media channels to support their TV-campaigns. Buying ad space in TV is nevertheless much more expensive than the radio equivalent.

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 thesis presents a system which has been implemented to satisfy a need in theresearch on how speech planning interacts with syntactic and prosodic structure inspontaneous speech. The long-term purpose of the research is to provide models forautomatic parsing of spontaneous speech and for psycholinguistical modelling of speechproduction. Identification of inhalation pauses is an important step in the developmentof automatic methods for spontaneous speech parsing.Identification of inhalation pauses is considered to be a keyword-spotting speechrecognition problem. Hybrid HMM(Hidden Markov Models)/ANN(Artificial NeuralNetworks) approach is applied to this problem. Method gets 90,8% in Recall, 66,4% inPrecision and 76,7% in F-score.

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.

Nynas produces bitumen at two refineries in Sweden. The bitumen is shipped to seven depots along the swedish coast line, and from the depots special trucks handle the transportation to customers. Recently Nynas has transformed its supply chain and closed down a few depots. At the moment the company is considering a further reduction of the number of depots. In connection to these discussions an analyse of the companys distributionsystem and of possible changes is required.

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.

An old and well known problem in sawmilling is to determine which dimensions /products those are most profitable to produce. Existing optimization models maximize the value of the log. In other words, based upon the market prices of the dimensions the models calculate the best way to split the log. Yet there is a great uncertainty if the most well paid dimensions really are the most profitable to produce. The costs of the process from lumber to sawn products are hard to determine and are therefore often left out from the optimization process. In this study the economic contribution of different dimensions/products are analysed.

This thesis work has been performed at Volvo Aero Corporation in Trollhättan, at the department of ?hot structures? involving aircraft engine GP7000. The purpose with the study was to investigate the possibility to reduce size of the forging of flanges on the rear turbine frame when purchasing. Thereto examine the parameters that affect the flanges motion during the manufacturing process. The goal was to provide Volvo Aero with foundation to later bring in slimmed forgings.

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.