This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:mfe:is [2015/04/22 19:42] svsummer [Master Thesis in Collaboration with Euranova] |
teaching:mfe:is [2015/09/14 13:41] svsummer [Design and Implementation of a Curriculum Revision Tool] |
||
|---|---|---|---|
| Line 24: | Line 24: | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| + | |||
| + | |||
| + | ===== Graph Indexing for Fast Subgraph Isomorphism Testing ===== | ||
| + | |||
| + | There is an increasing amount of scientific data, mostly from the bio-medical sciences, that can be represented as collections of graphs (chemical molecules, gene interaction networks, ...). A crucial operation when searching in this data is that of subgraph isomorphism testing: given a pattern P that one is interested in (also a graph) in and a collection D of graphs (e.g., chemical molecules), find all graphs in G that have P as a subgraph. Unfortunately, the subgraph isomorphism problem is computationally intractable. In ongoing research, to enable tractable processing of this problem, we aim to reduce the number of candidate graphs in D to which a subgraph isomorphism test needs to be executed. Specifically, we index the graphs in the collection D by means of decomposing them into graphs for which subgraph isomorphism *is* tractable. An associated algorithm that filters graphs that certainly cannot match P can then formulated based on ideas from information retrieval. | ||
| + | |||
| + | In this master thesis project, the student will emperically validate on real-world datasets the extent to which graphs can be decomposed into graphs for which subgraph isomorphism is tractable, and run experiments to validate the effectiveness of the proposed method in terms of filtering power. | ||
| + | |||
| + | **Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| + | |||
| + | **Status**: available | ||
| + | |||
| + | |||
| + | ===== Complex Event Processing for Security Analytics===== | ||
| + | |||
| + | As noted by [[http://home.deib.polimi.it/cugola/Papers/cep_survey.pdf|Cugola and Magara]], "an increasing number of distributed applications requires processing continuously flowing data ("events") from geographically distributed sources at unpredictable rates to obtain timely responses to complex queries. Examples of such applications come from the most disparate fields: from fraud detection to network intrusion detection systems, from wireless sensor networks to financial tickers, from traffic management to click-stream inspection." | ||
| + | |||
| + | These requirements have led to the development of a number of systems specifically designed to process information as a flow (or a set of flows) of continues data "events" according to a set of pre-deployed processing rules. Despite having a common goal, these systems differ in a wide range of aspects, including architecture, data models, rule and pattern languages, and processing mechanisms. In part, this is due to the fact that they were the result of the research efforts of different communities, each one bringing its own view of the problem and its background to the definition of a solution. | ||
| + | |||
| + | The master thesis is put forward in the context of the SPICES "Scalable Processing and mIning of Complex Events for Security-analytics" research project, funded by Innoviris. | ||
| + | The objective of this master thesis is to survey the existing systems and compare the strengths and weaknesses when they are applied specifically to the context detecting security breaches (network intrusion, fraud detection, ...), and help, as part of the research project, in the design & implementation of a new system that overcomes these weaknesses. | ||
| + | |||
| + | **Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| + | |||
| + | **Status**: already taken. | ||
| + | |||
| + | |||
| ===== Compiling SPARQL queries into machine code ===== | ===== Compiling SPARQL queries into machine code ===== | ||
| Line 77: | Line 104: | ||
| **Interested?** Contact: [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | **Interested?** Contact: [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| - | **Status**: available | + | **Status**: already taken |
| ===== Engineering a runtime system and compiler for AQL ===== | ===== Engineering a runtime system and compiler for AQL ===== | ||
| Line 181: | Line 208: | ||
| \\ | \\ | ||
| **Interested?** Contact : Stijn Vansummeren (stijn.vansummeren@ulb.ac.be), Frédéric Robert <frrobert@ulb.ac.be> | **Interested?** Contact : Stijn Vansummeren (stijn.vansummeren@ulb.ac.be), Frédéric Robert <frrobert@ulb.ac.be> | ||
| + | |||
| + | |||
| + | **Status?** Already taken | ||