It has now passed two years since the new site- and construction law, PBL, went into force. It replaced the previous PBL applicable since 1987, and it involves relatively large changes in many different areas of the construction sector. The ambitions of the new law are for instance to simplify and clarify the legal text, increase efficiency in the permitting processes and improve the quality of construction. To achieve this, a variety of changes was made. Some of the most important are: inserted deadline in the processing of building applications, extended assessment of building applications, revised rules about controlplan and quality manager, a certificate is required to start and end the project, an additional meeting is inserted and the construction management of the municipalities will have to do a mandatory visit at the work scene.

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.

Bakgrund: Skiftarbete är en vanlig arbetsmodell för sjuksköterskor runt om i världen. Skiftarbete är dock förknippat med negativa konsekvenser så som dygnsrytmsstörning och ohälsa. Det är därför viktigt att tydligare belysa hur skiftarbete påverkar sjuksköterskor och den vård som ges.Syfte: Att beskriva skiftarbetes konsekvenser på sjuksköterskor och deras arbete.Metod: En litteraturöversikt baserad på 14 kvantitativa studier hämtade från PubMed. Använda sökord var: shift work, nurse, patient safety och fatigue. Översikten har gjorts enligt Friberg (2012a), där likheter och teman skapats utifrån studiernas resultat.Resultat: Långa och snabbroterande skift kan bidra till utbrändhet, sömnsvårigheter, fatigue och ökad misstagsfrekvens.

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 study is to gain a deeper understanding of women's violence against men in intimate relationships, get an idea of ??what forms of expression that this type of violence has and to highlight the men's experiences of violence.There is little scientific research in the field in Sweden. Crime Prevention Council has determined that eight percent of all complaints involving domestic violence in 2010, reported by men over 18 years. You can only speculate on how large number of unreported cases is among abused men. The international studies highlight that the abused men feel ashamed of having been subjected to violence by a female partner.I have been based this essay on two theoretical premises, Per Isdal theory of "violence perspective" and Elaine Bergqvist's definition of the suppression technique.The study was conducted through a qualitative content analysis.

Keywords: ID-method, internet, security, digitzing, bank Background: The digitizing of our society continues to grow and more parts of our lives is spent on the internet. The banks are one of the institutions that is at the forefront of this development since they established themselves on a early basis. The banks meeting points have since this establishment moved from the regular bank office out on the internet. A problem that has occurred during this transfer is the possibility to positive ID a customer in a virtual world. It is essential to offer the customer methods to identify themselves that are both safe and easy to use.

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.

This study intends to examine why the Swedish children?s programme Bolibompa is produced the way it is during a larger catastrophe. Our intention was to find out how the editorial staff, in the children?s department in the public service television of Sweden (SVT),was handling the Estonia disaster, the September 11 attacks and the Asian Tsunami. To accomplish that, we first had to find out how the children?s programme looked during these catastrophes and also understand how the editorial staff was working with children?s programme during ordinary days.To achieve our purpose we have been interviewing five persons from SVT, who was involved in producing the children?s programme during these three catastrophes.

Membrane bioreactors (MBR) combined with biological phosphorous treatment (Bio-P) has been investigated if that could be an alternative to the future expansion with conventional active sludge treatment at Lundåkra wastewater treatment plant (WWTP) in the proximity of Landskrona, Sweden.The results showed that the surface demand in the biological treatment will be reduced with 67% with the MBR-alternative compared to a conventional activated sludge process. The nutrient removal in the MBR-solution was decreased or unchanged for nitrogen-, phosphorous- and organic parameters. However, the energy demand will increase with an estimated cost of approximately 1 million SEK annually. Moreover, the extra chemical consumption is estimated to cost 370 000 SEK annually.The disturbances caused by filamentous bacteria such as sludge dispersal could be resolved with MBR-technology because the membranes are not affected by these organisms. The Bio-P process combined with MBR-technology works if the wastewater recirculates from the membranes to an aerobic zone.In the proposal, there will be a new pre-treatment step, for instance hole screens.

Business Process Modelling Notation (BPMN) is a way to graphically draw a diagram of a business process. A BPMN diagram consists of several so-called flow objects. These are interconnected in the graph through sequence  flows. BPMN models are merely graphical representations of business process and there is a need to simulate these diagrams for different purposes. The simulation that now is available for BPMN is that the model is evaluated by checking if it is correct.

The Master Thesis has been carried out in cooperation with Silva Sweden AB and the objective was to develop a new product concept within the product category for everyday exercise. The purpose of the thesis was to use and analyze methods and tools which aid creativity and concept creation in order to make method recommendations for future projects.During the thesis a number of customer needs were identified, which in turn were translated into 20 concepts. On a concept decision meeting a pedometer-based concept was chosen for development. The new pedometer is in addition to counting steps also able to measure and calculate the user?s total climbed height during a day and present this graphically in comparison to famous monuments or distances.