Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

Don't call me a Kaffir : Genreanalys och klassificering av kwaito

Genom en strukturerad genreanalys, enkätundersökning samt intervju med en DJ aktiv inom kwaito så tacklar denna uppsats uppgiften att klassificera kwaito som genre. Genom analysen så erhålls de strukturella särdrag som kan ses inom genren och detta testas mot enkätundersökningen som behandlar den allmänna uppfattningen om genren. Enkätundersökningen är i sig uppdelad i två segment vars indelning baseras på kulturella skillnader och den här uppsatsen vill belysa de båda antropologiska perspektiven etic och emic i form av en Sydafrikansk- och en icke-Sydafrikansk undersökningsgrupp. Syftet med undersökningen i den här uppsatsen är att öka förståelsen för kwaito som genre och på så vis öka förståelsen för klassificeringen av genrer. Men även huruvida detta återspeglas i enkätundersökningen. Särdragen presenteras i analysen och har anknytning till nutida forskningen. Det visar sig att perspektiven etic och emic har relevans på grund av de kulturellt bundna skillnaderna av uppfattning om genren. Den Sydafrikanska undersökningsgruppen ser tydligare kopplingar till de sociala och ideologiska aspekterna, och även house-musiken, av genren än vad den icke-Sydafrikanska.

CALL FOR PAPERS Sociologisk Forskning: Temanummer : Samhällsvetenskapliga perspektiv på neuropsykiatriska funktionsnedsättningar

Sociologisk Forsknings digitala arkiv

From the road network database to a graph for localization purposes

The problems of finding best facility locations require complete and accurate road network with the corresponding population data in a specific area. However the data obtained in road network databases usually do not fit in this usage. In this paper we propose our procedure of converting the road network database to a road graph which could be used in localization problems. The road network data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The population points are also processed in ordered to match with that graph. The reduction of the graph is done maintaining most of the accuracy for distance measures in the network.

Democratic Citizenship - A Conditioned Apprenticeship : A Call for Destabilisation of Democracy in Education

We live in times when the search for a citizenship education that can transcend national, ethnical and cultural borders is an important part of educational policy. In times of increased pressure by the European Union on its nation states to provide for nation-transcending democracy, this question becomes crucial for national policymaking in Europe. In this text, Swedish education policy will be taken as a case in point in order to shed light on how this question is being handled in this particular national policy setting. It is argued that the policy’s citizen fostering agenda tends to be counterproductive in the sense that it is still situated in national notions of the relationship between democracy and education, which tend to exclude certain individuals and groups of people on an age-related and (ethno) cultural basis. It is further argued that these excluding features can be related to educational ideas about socialisation. The aim of this text is underlined by suggesting a different way of framing democracy and democratic citizenship education: to increase the potential of education as regards the renewal of democracy and democratic citizenship.