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.

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.

Design and use of mobile technology in distance language education : Matching learning practices with technologies-in-practice

This thesis focuses on the adaptation of formal education to people’s technology- use patterns, theirtechnology-in-practice, where the ubiquitous use of mobile technologies is central. The research question is: How can language learning practices occuring in informal learning environments be effectively integrated with formal education through the use of mobile technology? The study investigates the technical, pedagogical, social and cultural challenges involved in a design science approach. The thesis consists of four studies. The first study systematises MALL (mobile-assisted language learning) research. The second investigates Swedish and Chinese students’ attitudes towards the use of mobile technology in education. The third examines students’ use of technology in an online language course, with a specific focus on their learning practices in informal learning contexts and their understanding of how this use guides their learning. Based on the findings, a specifically designed MALL application was built and used in two courses. Study four analyses the app use in terms of students’ perceived level of self-regulation and structuration. The studies show that technology itself plays a very important role in reshaping peoples’ attitudes and that new learning methods are coconstructed in a sociotechnical system. Technology’s influence on student practices is equally strong across borders. Students’ established technologies-in-practice guide the ways they approach learning. Hence, designing effective online distance education involves three interrelated elements: technology, information, and social arrangements. This thesis contributes to mobile learning research by offering empirically and theoretically grounded insights that shift the focus from technology design to design of information systems.