AbstractMatchmaking on an organisational level? about co-operation between municipal introduction-units and voluntary organisationsEssay in Political Science D, by Rebecka Johansson, spring 2006The aim of this study is to examine co-operation between municipal introduction-units, which work to integrate newly arrived immigrants and refuges, and voluntary organisations in Sweden. The essay is a comparative case study which examines three local authorities and the main questions are;- Do voluntary organisations constitute a functioning co-operation partner to the municipal introduction-units? Are there conditions for future co-operation?The answer to the questions is that there are no, or rarely any, co-operation between voluntary organisations and municipal introduction-units. It is difficult to judge whether there are conditions for future co-operation.

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.

Syftet är att få samt skapa förståelse för hur en kommun resonerar inför införskaffandet av tekniska hjälpmedel. Köpbeslutsprocessen för B2B utgör den teoretiska grunden. En kvalitativ undersökning i form av semistrukturerade telefonintervjuer genomfördes och totalt intervjuades elva respondenter. Slutsatsen är att på nämnd- och tjänstemannanivå finns ett tydligt intresse för ny teknik. Fördröjande faktorer för implementeringen av tekniska hjälpmedel är snarare personalens skepsis och ej anpassade förhandlingsdirektiv.

1990 Sweden ratified the UN Convention on the Rights of the Child, with 54 rights. The Convention on the Rights of the Child does not apply as law in Sweden. However, all countries that have ratified the convention, has an obligation to implement the convention in all decision making and practical management that includes children. The purpose of the study is to examine the implementation of the convention in relation to unaccompanied refugee children on a state, municipal and non-profit level by using three actors. The actors are the Swedish immigration service, Stockholm social service and the NGO Save the Children.

The common literature about strategic alliances offers a very fragmented picture. This thesis gives a theoretical overview on strategic alliances and builds the basis for the following examination of the different dimensions most strategic alliances have. The examination of the different dimensions is the crucial point of this thesis. Here the reader gets a detailed insight into the different dimensions and the implications they have on the design of a particular strategic alliance. This examination leads in the end to a more differentiated view on strategic alliances and the insight that no simple models exist, which give a sufficient basis for decision-making and understanding strategic alliances, today.

The purpose of this study is to analyse how the local governments have implanted the new public health policy, which Sweden adopted in April 2003. The new health policy stakes out a new direction for national public health policy. Instead of focusing on diseases the new public health policy focus in factors that determine health.Important factors to study are the role of central steering from the central government. The method used is a case study of three Swedish local governments. The main material used is interviews and different policy documents within the area of public health.The conclusion of the study shows that the local governments are fairly satisfied with the steering of public health policy by the central government.

Denna uppsats grundar sig på en kvalitativ ansats och beskriver en studie som behandlat beslutsfattande gällande IT i en organisation. Beslutsfattandet när det gäller IT påverkas av omgivning, teknologi samt uppfattningar om organisationens mål och metoder för att uppnå målen. Att uppnå målen är ingen trivial uppgift och är kantat av många problem. ITstyrning ses om en lösning på dessa problem med beslutsfattande om IT där den ska styras för att överensstämma med organisationens strategiska mål och avgöra vem som ska fatta dessa beslut. Syftet med studien var att beskriva beslutsfattandet och beslutsprocessen om IT i en organisation och våra centrala frågeställningar var hur fattar organisationen beslut om IT? och hur är beslutsfattandet om IT delegerat i organisationen? För att besvara dessa frågor utfördes en initial litteraturstudie där vi granskade teorier om organisationen och beslutsfattande i denna samt IT-styrning.

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 objective of this study was to investigate how the local newspaper readers felt about reading the local newspaper in a tablet device, such as the iPad. We wanted to study the attitudes from consumers towards tablets and if the traditional local newspaper can be substituted with a tablet device. We decided to use qualitative interviews as our method. The selection of respondents was based upon age, whether or not they had a subscription and if they owned a tablet device or not. We accomplished fifteen interviews with respondents living within the area where the newspapers of Barometern and Oskarshamnstidningen are spread. The study shows that the majority of the respondents who already had a subscription tended to lack interest in changing their traditional newspaper consumption. Their habits of reading the local news on paper were strong.

This essay inquires with the local authority´s rights versus obligations towards its members in agreement situations, where according to civil law compete with the according to public law.These situations become more and more common, since the public is often integrated in today´s trade and industery. Within this analyses there are statements made by HD about what is the applicable judgement concerning this complex area. HD´s different views and opinions have partly been critizesed by the auther..

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.