No description available.

Modern applications generate a massive amount of data that is challenging to process or analyse. Graph algorithms have emerged as a solution for the analysis of this data because they can represent the entities participating in the generation of large scale datasets in terms of vertices and their relationships in terms of edges. Graph analysis algorithms are used for finding patterns within these relationships, aiming to extract information to be further analysed. The breadth-first search (BFS) is one of the main graph search algorithms used for graph analysis and its optimisation has been widely researched using different parallel computers. However, the BFS parallelisation has been shown to be chal- lenging because of its inherent characteristics, including irregular memory access patterns, data dependencies and workload imbalance, that limit its scalability. This thesis investigates the optimisation of the BFS on the Xeon Phi, which is a modern parallel architecture provided with an advanced vector processor using a self-created development framework integrated with the Graph 500 benchmark. As a result, optimised parallel versions of two high-level algorithms for BFS were created using vectorisation, starting with the conventional top-down BFS algorithm and, building on this, leading to the hybrid BFS algorithm. The best implementations resulted in speedups of 1.37x and 1.33x, for a one million vertices graph, compared to the state-of-the-art, respectively. The hybrid BFS algorithm can be further used by other graph analysis algorithms and the lessons learned from vectorisation can be applied to other algorithms targeting the existing and future models of the Xeon Phi and other advanced vector architectures.

A connected dominating set D is a set of vertices of a graph G=(V,E) such that every vertex in V-D is adjacent to at least one vertex in D and the subgraph induced by the set D is connected. The connected domination number is the minimum of the cardinalities of the connected dominating sets of G. The problem of finding a minimum connected dominating set D is known to be NP-hard. Many polynomial time algorithms that achieve some approximation factors have been provided earlier in finding a minimum connected dominating set. In this work, we present a survey on known properties of graph domination as well as some approximation algorithms. We implemented some of these algorithms and tested them with random graphs and compared their performance in finding a minimum connected dominating set D.

A large amount of on-line information resides on the invisible web - web pages generated dynamically from databases and other data sources hidden from current crawlers which retrieve content only from the publicly indexable Web. Specially, they ignore the tremendous amount of high quality content "hidden" behind search forms, and pages that require authorization or prior registration in large searchable electronic databases. To extracting data from the hidden web, it is necessary to find the search forms and fill them with appropriate information to retrieve maximum relevant information. To fulfill the complex challenges that arise when attempting to search hidden web i.e. lots of analysis of search forms as well as retrieved information also, it becomes eminent to design and implement a distributed web crawler that runs on a network of workstations to extract data from hidden web. We describe the software architecture of the distributed and scalable system and also present a number of novel techniques that went into its design and implementation to extract maximum relevant data from hidden web for achieving high performance.

I världen växer forskning på självgående fordon dagligen.Målet med detta projekt var att skapa ett självgåendefordon och utforska möjligheterna att använda infrarödareflektioner som navigeringsmetod och hur man kanuppnå distinkta mätvärden. Avhandlingen diskuterar ävenmöjligheterna att använda flera prototyper i en störreskala. Under projektets gång byggdes ett prototypfordonför att genomföra experimenten angående lämplighetenmed navigering via infrarött ljus. Tester med prototypenvisar att navigering via infrarött ljus är väldigt pålitligtunder kontrollerade omständigheter. Projektet utforskaräven hur hierarkisk mjukvaruarkitektur står sig mot heltlokal eller centraliserad mjukvaruarkitektur. / In the world, research on autonomous navigation vehicles(AGV) is growing by the day. The goal with this projectwas to create an AGV and explore the possibility of usinginfrared reflections as a navigational method and how toachieve distinct reflection measurements from a surface.The thesis also discusses the possibility of using severalunits on a larger scale. In the progress of the project, aprototype vehicle was built to conduct the experiments toidentify the suitability of infrared navigation. The testingof the prototype shows that navigation by IR can be veryreliable under controlled circumstances. The project alsoexplored how hierarchical software architecture stands incomparison to purely local or centralized software architecture.

This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It runs in linear-time, and is straightforward in its understanding, correctness, and implementation. It merely requires a collection of trees and simple traversals of these trees. The split-decomposition algorithm is similar in being straightforward in its understanding and correctness. An efficient implementation of the algorithm is described that uses the union-find data-structure. A novel charging argument is used to prove the running-time. The algorithm is the first to use the recent reformulation of split decomposition in terms of graph-labelled trees. This facilitates its extension to circle graph recognition. In particular, it allows us to efficiently apply a new lexicographic breadth-first search characterization of circle graphs developed in the thesis. Lexicographic breadth-first search is additionally responsible for the efficiency of the split decomposition algorithm, and contributes to the simplicity of the modular decomposition algorithm.

This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It runs in linear-time, and is straightforward in its understanding, correctness, and implementation. It merely requires a collection of trees and simple traversals of these trees. The split-decomposition algorithm is similar in being straightforward in its understanding and correctness. An efficient implementation of the algorithm is described that uses the union-find data-structure. A novel charging argument is used to prove the running-time. The algorithm is the first to use the recent reformulation of split decomposition in terms of graph-labelled trees. This facilitates its extension to circle graph recognition. In particular, it allows us to efficiently apply a new lexicographic breadth-first search characterization of circle graphs developed in the thesis. Lexicographic breadth-first search is additionally responsible for the efficiency of the split decomposition algorithm, and contributes to the simplicity of the modular decomposition algorithm.

In the world, research on autonomous navigation vehicles (AGV) is growing by the day. The goal with this project was to create an AGV and explore the possibility of using infrared reflections as a navigational method and how to achieve distinct reflection measurements from a surface. The thesis also discusses the possibility of using several units on a larger scale. In the progress of the project, a prototype vehicle was built to conduct the experiments to identify the suitability of infrared navigation. The testing of the prototype shows that navigation by IR can be very reliable under controlled circumstances. The project also explored how hierarchical software architecture stands in comparison to purely local or centralized software architecture. / I världen växer forskning på självgående fordon dagligen. Målet med detta projekt var att skapa ett självgående fordon och utforska möjligheterna att använda infraröda reflektioner som navigeringsmetod och hur man kan uppnå distinkta mätvärden. Avhandlingen diskuterar även möjligheterna att använda flera prototyper i en större skala. Under projektets gång byggdes ett prototypfordon för att genomföra experimenten angående lämpligheten med navigering via infrarött ljus. Tester med prototypen visar att navigering via infrarött ljus är väldigt pålitligt under kontrollerade omständigheter. Projektet utforskar även hur hierarkisk mjukvaruarkitektur står sig mot helt lokal eller centraliserad mjukvaruarkitektur.

No description available.

Nondeterministic finite automaton is an important tool, which is used to process strings in many different areas of programming. It is important to try to reduce its size for increasing programs' effectiveness. However, this problem is computationally hard, so we need to search for new techniques. Basics of finite automata are described in this work. Some methods for their reduction are then introduced. Usable reduction algorithms are described in greater detail. Then they are implemented and tested. The test results are finally evaluated.