Denna rapport presenterar en undersökning av sex olika objekt-relationsmappningsramverk, nämligen Entity Framework, LINQ to SQL, NHibernate, Castle ActiveRecord, MyGeneration Doodads och Subsonic. Undersökningen redogör för styrkor och svagheter hos de olika ramverken samt diskuterar när respektive ramverk är lämpligt att använda.De ramverk som bedömdes vara mest intressanta var NHibernate och Entity Framework, då de erbjuder flexibel mappning mellan domänmodellen och det underliggande databasschemat samt god tillgång till dokumentation och litteratur.Undersökningen användes som grund för att besluta vilket av de aktuella ramverken som skulle användas vid en omskrivning av en existerande applikation för IT-konsultföretaget Sogeti. Det ramverk som ansågs mest lämpligt för applikationen var NHibernate..

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.

Open access (OA) is a publishing model aimed at increasingthe access to academic research results. The object of thisstudy was to contrast nine colleges and four fundingorganizations in Scandinavia with mandatory OA-policies,and to study how they put OA into practice.Inspired by the Open Access Spectrum (OAS), a tool used toappreciate the OA of academic journals, the aim was tograde the policy documents of the colleges using the OASmodel.The study also compares how the colleges implementtheir OA-policies as well as how, and if, the demands fromthe funding organizations are reflected in the policies of thecolleges.The findings show that the OAS is not a tool designed forgreen OA and that all the information needed for the scale tofunction was not found in the policy documents we studied.A selection of the colleges has some demands in theirpolicies, although most of them allow exceptions to be madefrom the mandatory policy. This is shown to be mainly aquestion of academic freedom, and copyright, or rather thanthe degree to which the scientist and the publisher can cometo an agreement on allowing the information to be accessiblethrough OA.The study proposes that the way to change this may be toincrease the demands on OA in the policies, and that the bestsolution might be in stipulations within the employmentcontracts between the individual colleges and scientist..

Testning är den aktivitet där man verifierar och validerar ett IT-systems krav och exekverar det i syfte att hitta fel. Testning kan utföras både manuellt och automatiserat, genom att utveckla ett system som exekverar testerna åt sig.I detta examensarbete beskriver jag hur jag designar och utvecklar en IT-artefakt som automatiskt kan exekvera tester av ett annat system..

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.

In the city of Kungälv, there are many important green areas without park lightning. This makes it unsafe to walk through the city's most attractive surroundings during many parts of the year. Partly in general and partly specifically for Kungälv, this paper shows that there are strong long-term arguments for making parks available by the use of lightning. This is not about lightening up the whole city, but finding the important green communication paths and parks. This paper also reflects upon how to lighten up these green communication paths and parks for best result. That is a question about creating good sight conditions ? safe and attractive parks which attracts people to use them. Offering a city's inhabitants good and attractive alternatives to using the car is an important task for city planers.

This thesis studies how the Swedish government articulates social exclusion within the spring budget of 2007. Through a discourse theoretical approach, inspired by Ernest Laclau and Chantal Mouffe, the empirical findings are reconstructed through the nodal point of labour and two chains of equivalence, based upon the duality between employment and unemployment. By viewing social exclusion as a phenomenon concerning discourse, identity and politics, this duality forms the basis of a deconstructive and hegemonic analysis.I argue that the term social exclusion is a powerful and flexible political concept in that it obscures ideological assumptions and objectives as well as draws attention away from alternative social concepts. Throughout the thesis social exclusion is stressed as a social category constituting the relation between individual and society. Hence I argue that it is of vital importance that the values underlying its usage are made explicit and that social exclusion as a floating signifier is made an object of academic analysis..

Theory of mind involves the ability to take another person?s perspective in thought, emotions and intentions.  There is today a lack of instruments to assess children?s development of Theory of Mind (ToM) in Swedish. ToM is considered by many scientists to be the basis for development of pragmatic competence. The relationship between these two abilities is complex and not fully resolved. Both abilities are important components for the development of social skills.    The purpose of this study was to compare 4 and 5-year olds ToM-ability measured with a Swedish version of Wellman and Liu?s ToM-scale, Sally Anne and Social Emotional Test with estimated pragmatic competence measured with the Children?s Communication Checklist (CCC).

The edge or the fringe of the city is often the first part of the city we encounter, and our perception of it will probably color the image we make in our minds of the city as a whole. Even though the fringe of the city is important to the image of the cityscape it has not very often been the direct object of attention either in planning, building or even in the heads of the masters, when big ideas were formed. More often than not the fringe seems like something that just happened over time due to separate landowners, businesses or actions of other financially strong operators. The aim of this essay is to try to describe the history of the city edge in Sweden, from the very first town in the 10th century until today?s expanding mosaic of different ideas and styles as well as to bring some clarity and order into some of the different ideas and ideals in the planning of the edge in different eras and to review how the edge has been shaped and used.

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.