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.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.

A Call to Arms

This month I’m using my column to issue a call to arms. No, it isn’t a call to arms for war, though it is going to be battle. It is a call to professional librarians who are interested in their jobs lasting more than a few more years. That sounds a bit hysterical but I don’t mean for it to. Yet is it hyperbolic? I don’t think so. We need to rethink, recast, redefine, and refresh our professional métier. I think the last twenty-four months make it imperative that we do so now

Marketing de relacionamento e operação de call center: análise comparada do posicionamento de operadoras de telefonia celular em São Paulo

O presente trabalho aborda o Marketing de Relacionamento, que vem conquistando destaque nas organizações em razão do crescente reconhecimento da relevância do conhecimento dos clientes e de suas necessidades. A partir dessa perspectiva, investigou-se as estratégias de Telemarketing de organizações de telefonia móvel celular do Estado de São Paulo, a fim de comparar a orientação e o posicionamento dessas empresas. O estudo também faz uma avaliação comparativa entre as organizações, tomando como base a relação entre Call Center, posicionamento, estratégias e objetivos corporativos. Quanto à metodologia adotada, optou-se por uma pesquisa qualitativa, de caráter exploratório, partindo-se da análise de conteúdo das entrevistas.