Lunds Tekniska Högskola

Denna sida på svenska This page in English

CS MSc Day January 13 Schedule!


Three MSc theses to be presented on January 13, 2017.

January 13 is the day for coordinated master thesis presentations in Computer Science at Lund University, Faculty of Engineering. Three MSc theses will be presented.

The presentations will take place in the E-building, room E:2116. A preliminary schedule follows.

Note to potential opponents: Register as opponent to the presentation of your choice by sending an email to the examiner for that presentation ( Do not forget to specify the presentation you register for! Note that the number of opponents may be limited (often to two), so you might be forced to choose another presentation if you register too late. Registrations are individual, just as the oppositions are! Further instructions are found on this page.




PRESENTERSFelix Åkerlund, Ragnar Mellbin
TITLEMulti-threaded execution of Cypher queries
EXAMINERFlavius Gruian
SUPERVISORSPer Andersson (LTH), Johan Svensson (Neo Technology)

In this paper we investigate parallel execution of queries in graph databases. We analyze different methods of parallelization, which query operations that are suitable for parallelization and if we can improve the execution time of a single query. We do this by designing and implementing a parallel runtime for the Cypher query language in the graph database Neo4j, but many of the design ideas and operators investigated are applicable to any graph database.

We focus on increasing performance for a select few operators, while still being fully integrated with Neo4j. We take much inspiration from a design called morsel-driven parallelism. This means that we strive to split the workload into many small pieces, “morsels”, and then hand these morsels to the threads executing the query. This is in contrast to a more classical parallelization approach, where you split the workload into a few big parts of equal size.


PRESENTERAlexander Wallin
TITLEEntity identification: solving the coreference problem
ABSTRACTThere are many commonly available tools for Natural Language Processing in Swedish; Part-of-Speech, NER and Dependency Parsing to name just a few. Many use annotated corpora for training, but for some NLP tasks such as coreference resolution the only commonly available data set, Suc-Core, is smaller than most test sets and therefore inappropriate to train a well balanced coreference solver. In this thesis we utilize machine annotation and statistical machine translation methods to transfer coreference information from English to Swedish and German to create large consistent training corpora. The generated corpora was used to train coreference solvers for the two languages and evaluated using the CoNLL 2012 Shared Task on the Suc-Core and Tüba D/Z hand annotated corpora.


PRESENTERSandra Fridälv
TITLEEvaluation of the test area when implementing the framework SAFe
SUPERVISORSChristin Lindholm (LTH), Annika Dahlberg (IKEA IT), Peter Johansson (IKEA IT)

This thesis work evaluates the implementation of the framework SAFe, Scaled Agile Framework, with a focus on the test and quality area. Today many companies implement SAFe in their organization to increase in productivity, quality and faster time to market. Companies that are going to implement SAFe do not know which challenges they could encounter during the implementation and how they should address these challenges.

This thesis work has identified the major and most common challenges in the test and quality area that a company could face when implementing SAFe. Another important aspect was to find out which are the largest changes in the test area when implementing SAFe, for example how to follow up on test and quality efficiently. The evaluation consisted of interviewing companies that have implemented SAFe and this have resulted in some best practices on how to work effectively with test and quality in SAFe.