Förstainstansrättens dom i målet Microsoft mot Kommissionen har gett upphov tillmånga konkurrensrättsliga frågor, bl.a. gällande Microsofts tying av WindowsMedia Player till sitt operativsystem Windows. Denna uppsats för framförallt ettresonemang kring frågan om huruvida de ?traditionella? EG-rättsliga metodersom idag används vid bedömningen av kopplingsförbehåll (tying) är förlegade närdessa ska appliceras på en ?ny? produkt som mjukvara. En analys av konkurrensrättsligdoktrin och rättspraxis visar att Microsoftdomen i delen vad gäller tying ärkonsekvent gentemot den praxis som etablerats på området genom målen T-30/89Hilti AG mot Kommissionen samt C-333/94 P Tetra Pak International SA motKommissionen.

Title: School in Change : Good Grades = Good Democrat? Level: Final assignment for Bachelor Degree in Political Science Author: Marcos Castro Allende Supervisor: Per Strömblad Date: 2013 ? May Aim: The background to this study is a book published by Staffan. I Lindberg & Richard Svensson where they presented a hypothesis that the decline in trusting democracy within Swedish youth is a result of the deregulation of the education in Sweden. The aim of this study is to test this hypothesis and see if the declinne in democracy can be seen already before graduating from elementary school. Method: The method used in this study consist of a survey distributed to students at two elementary schools that differentiates in question of grades and social status. By comparing and analyzing the results of this survey with the claims of the hypothesis, former studies and Lipsets theory of the working-class authoritarism a conclusion is made of the hypothesis credibility. Result & Conclusions: The results showed that there may be a a difference trusting democracy between students with higher grades and those with lower grades.

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.

Bakgrund och problem: Under 2008 uppdaterade International Accounting Standards Board (IASB)regelverket för finansiella tillgångar med tillägg i IAS 39 och IFRS 7 vad gäller klassificering, värderingoch upplysning. Uppdateringen var en effekt av den finansiella krisen som drog in över Europa medfull kraft under den senare delen av 2008, vilken medförde inaktiva kapitalmarknader. I och medförändringarna gavs företagen möjlighet att omklassificera finansiella tillgångar värderade till verkligtvärde till upplupet anskaffningsvärde. Eftersom bankers tillgångar generellt består av en stor delfinansiella tillgångar ämnade författarna undersöka uppdateringarnas tillämpning inom banksektorn.Studiens problemformulering löd: Vilka samband kan identifieras mellan noterade banker inom EUvad gäller tillämpningen av tilläggen i IAS 39 och IFRS 7?Syfte: Att kartlägga vilka samband som fanns mellan de banker som valt att omklassificera och desom inte valt att omklassificera med inriktning på effekterna ur ett investerarperspektiv.Avgränsningar: Det är endast tillgångsvärdering inom IAS 39 som studerats, ty uppdateringarnabehandlade det området.

Denna uppsats är skriven inom ramen för ämnet Krigsvetenskap under författarens  studier på yrkesofficersprogrammet 2009 -2012 till nautisk officer. I studien beskrivs risker och metoder i samband med att ammunition omhändertas. Syftet är att belysa en problematik som ammunitionsröjare skulle kunna möta idag då de metoder som finns idag främst är avsedda för röjning på land.  De senaste åren visar en ökad frekvens av attacker utanför Somalias kust. I samband med den här typen av attacker finns chansen att behov av nya metoder också uppstår.

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.

According to the EC fuel regulations 2 % bio fuel has to be blended in all fuel by the year 2005, and 5.75 % by the year 2010, which means ethanol for gasoline driven vehicles, so there will be a substantial demand for ethanol. Brazil already has an established industry for producing ethanol and is the leading producer and exporter of fuel ethanol. My purpose with this paper is to investigate why Brazil decided to develop ethanol production on a large-scale operation and to find out today?s situation. Focus will mainly be on ethanol production with sugarcane as a feedstock.