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 master's theses was carried out on assignment from Stockholm Vatten AB as a part of a project developing new waste water treatment techniques. The goal of the theisis has been to evaluate an anaerobic membrane bioreactor for treatment of waste water from Hammarby Sjöstad. The bioreactor has not been heated and the main interest has been to study the gas production, power consumption and the reduction of organic matter and nutrients.The system has been completed with a reverse osmosis unit and a total of four batch runs have been made with good results. The use of reverse osmosis allows nutrient in the waste water to be reintroduced into circulation as the reverse osmosis concentrate can be used as crop nutrient.The membrane unit is of VSEP ("Vibratory Shear Enhanced Processing") type and an extensive membrane test has been conducted. This so called L-test helped determine the most suitable type of membrane for the system to allow a higher ±ux and thus lower power consumption.

Bakgrund: Den 20:e april 2010 inträffade en explosion på BP:s oljeplattform Deepwater Horizon i Mexikanska Golfen. Explosionen uppstod på grund av metangas som under högt tryck expanderade på plattformen och sedan antändes. Detta ledde senare till att oljeplattformen sjönk och ett stort okontrollerat oljeläckage uppstod på cirka 1500 meters djup.          Att explosionen i den mexikanska golfen har påverkat BP negativt och varit mycket kostsamt för företaget är uppenbart, börskursen hade som mest sjunkit med cirka 60 procent. Det kan vara intressant att undersöka huruvida denna katastrof, utlöst av en enskild aktör, också har spridit sig över till andra aktörer i Olja & Gas sektorn.Syfte: Syftet med denna C-uppsats är att undersöka huruvida BP:s katastrof i den Mexikanska golfen har påverkat andra aktörer i samma sektor (Olja & Gas sektorn).Metod: Sekundärdata presenteras som en kvantitativ ansats i form av siffror och för att kunna dra slutsatserna använder vi oss av en deduktiv ansats.I denna studie tillämpas en metodikteknik i form av en eventstudie, där beräkningar av den abnorma och förväntade avkastningen baseras på marknadsmodellen. Vidare har två hypoteser testats, där syftet med Hypotes I är att pröva huruvida information om händelsen i den Mexikanska Golfen påverkar andra företag i samma sektor som BP.

The milk production per cow has increased considerably during the last 50 years and due to the breeding for higher milk production also brings decreased reproduction efficiency. In a Swedish study 1996 it was shown that on average only half of all estruses were detected. Every time a farmer fails to detect oestrus it costs the farmer about 1200 Swedish crones and the need of means of detecting oestrus is therofore large. With this study we wanted to investigate if heart rate respectively crystallisation of vaginal mucus (arborisation) could be useful means of detecting oestrus. We monitored two oestrus cycles in four heifers.

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.

Företag på NASDAQ OMXS Small Cap har sedan 2008 omfattats av svensk kod för bolagsstyrning, Koden. Kodens målgrupp är företagen men syftet är att främja investerares och aktieägares intressen. Det är således rimligt att ställa krav på att Kodens regler är av hög kvalité utifrån deras perspektiv. I studien undersöks vilka samband som existerar mellan reglerna i Koden angående styrelsen och Small Cap företagens lönsamhet, mätt som räntabilitet på totalt kapital. Sambanden används sedan för att avgöra om reglerna i Koden är korrekt utformade eller om de behöver modifieras.

Companies financed through borrowed capital are allowed a tax deduction for the costs re-lated to their borrowed capital. A similar tax relief for companies financed through share-holder?s equity does not exist, why these companies are taxed higher than companies fi-nanced by borrowed capital. The result is that there is an asymmetric tax treatment of companies depending on how they are financed.The autumn of 2012, the Swedish government presents a proposal for an investor deduc-tion which seeks to equalize the above mentioned asymmetry. The proposed investor de-duction is a tax relief for investments in shares in a startup- or small company equal to 50 percent of the acquisition cost of that investment.The venture capital deduction, which in this thesis is treated as an alternative to the inves-tor deduction, is an interest-free tax credit which significate that two-thirds of the acquisi-tion cost is deductible from taxation at the time of the acquisition.

As stocks have become a more common way for people to save their money, the range of financial information has had a substantial increase. To understand the assumptions that stock valuation and analysis are built upon, it is important for the reader to have an understanding for the models that are used by banks and institutions when recommendations are published.The cash flow model, which is the most commonly used stock valuation tool, is based on CAPM. This model describes the relationship between an assets return and its risk in relation to an index. The risk parameter is called the beta value and has grown to be the dominating risk factor within financial economics literature.The use of beta values has been widely discussed in the world of academics and some researchers claim that the degree of explanation brought about by the beta is so low that it should be discarded, others are faithful to the beta and believe that it still serves a purpose. As a result of this criticism other ways to calculate the beta have surfaced, models that take other factors of risk into consideration.

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.