Differences

This shows you the differences between two versions of the page.

--- teaching:mfe:is [2014/02/19 15:17]
ezimanyi [Capturing Semantic Web Data from Web Pages]
+++ teaching:mfe:is [2014/03/25 12:53]
svsummer [Master Thesis in Collaboration with Euranova]
@@ Line 104: / Line 104: @@
 Our laboratory performs collaborative research with Euranova R&D (http://euranova.eu/). The list of subjects proposed for this year by Euranova can be found
-{{:teaching:mfe:euranova_master_thesis_2013_2014.pdf|here}}.
+{{:teaching:mfe:mt2014_euranova.pdf|here}}
 These subject include topics on distributed graph processing, processing big data using Map/Reduce, cloud computing, and social networks.
@@ Line 110: / Line 110: @@
   * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]]
-===== Efficient computation of simulation for structural indexing  =====
-Simulation and bisimulation are  fundamental notions in computer science. They underlie many formal verification algorithms, and have recently been applied to the construction of indexing data structures for relational databases and the semantic web.
+===== Structural compression of relational and semantic web databases =====
-Essentially, a simulation or bisimulation is a relation on the nodes
+Recent research in database management systems at ULB has shown how to
-of a graph. Unfortunately, however, while efficient main-memory
+theoretically construct succinct (compressed) representations for
-algorithms for computing whether two nodes are simulating or bisimulating exist, these algorithms fail when no the input graphs are too large to fit in main memory.
+relational databases and semantic web databases. The advantage of
+these succinct representations is that they allow querying directly
+*on the succinct representation*, without needing to consult the
+underlying database.
-The goal of this thesis is to study, compare, and implement various
+The goal of this thesis is to study scalable algorithms for
-approaches to computing simulation in an external memory setting, for
+constructing the actual succinct representations. Some in-memory
-the explicit purpose of using the implementation to efficiently construct
+algorithms are already known, but given the large size of typical
-simulation-based indexes for large relational databases and the
+database, distributed and out-of-memory alternatives need to be found.
-semantic web.
-  * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
+  * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
+===== Comparision of Big Data Analysis tools =====
+===== Design and Implementation of a Curriculum Revision Tool ======
+Stijn Vansummeren (WIT)
+This MFE concers the analysis, design, and implementation of a
+software system that can assist in the revision of teaching curricula
+(also known as teaching programs).
+The primary targetted functionalities of the  software system are as
+follows:
+* It should allow to make different versions of the teaching programs, much in the same way as version control systems like GIT and subversion offer the possibility to make different "development branches" of a program's source code.
+* It should  allow an extensible means to check the modified program for inconsistentcies. (For example, if course X has course Y
+===== Structural compression of relational and semantic web databases =====
+Recent research in database management systems at ULB has shown how to
+theoretically construct succinct (compressed) representations for
+relational databases and semantic web databases. The advantage of
+these succinct representations is that they allow querying directly
+*on the succinct representation*, without needing to consult the
+underlying database.
+The goal of this thesis is to study scalable algorithms for
+constructing the actual succinct representations. Some in-memory
+algorithms are already known, but given the large size of typical
+database, distributed and out-of-memory alternatives need to be found.
+  * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
 ===== Aspects of Text Analytics and Information Extraction =====
@@ Line 178: / Line 216: @@
 \\
   * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
+  * Status: **already taken**
 ===== Distributed Structural Indexes for RDF Data =====
@@ Line 208: / Line 247: @@
-=====Foundations of Data Description Languages=====
-Recently, several small "domain specific languages" have been proposed
-to facilitate programming with ad hoc data (including PADS,
-DATASCRIPT,PACKETTYPES, Microsoft M Grammar). Ad hoc data is data
-other than data in well-behaved relational or XML formats.
-The above languages take as input a description of the data format to
-be dealt with, and automatically generate a large number of software
-tools (parsers, serializers, data transformers, error recognition,
-...) to process the ad-hoc data.
-The goal of this thesis is to study the programming language-theory
-foundations behind these languages, their commonalities and their
-differences. If possible, suggestions for further extensions to the
-languages should be formulated.
-  * References :
-      * http://datascript.sourceforge.net/
-      * http://www.padsproj.org/index.html
-\\
-  * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
-=====Capturing Semantic  Web Data from Web Pages=====
-The [[http://linkeddata.org/|Linked Open Data]] (LOD) initiative is aimed at extending the Web  by means of publishing various open datasets as RDF,  setting RDF links between data items from different data sources.  In spite of  the interest of organization in publishing their data, many of them are not willing to pay the price of devoting working hours or their employees for doing the hard work that preparing and updating these data requires. Therefore, a very interesting and practical problem that arises is how to produce LOD automatically from Web sites. This   problem can be tackled if selected and well-defined domains are chosen.
-In his thesis we propose to select a site of a broadcasting company, and, through intelligent crawling techniques capture data of interest and publish it as RDF data. In a second step, we propose to  use these data to pose queries that involve different nodes of the Web of linked  data.
-* Contacts :
-    * [[ezimanyi@ulb.ac.be|Esteban Zimányi]]
 =====Publishing and Using Spatio-temporal Data on the Semantic Web=====
@@ Line 252: / Line 256: @@
 by application providers, that can build attractive and useful applications, in particular, for devices like mobile phones, tablets, etc.
-The goals of this thesis are: (i) study the existing proposals for mapping spatio-temporal data into LOD; (ii) apply this mapping to a real-world case study (as was the case for the [[http://www.oscb.be/|Open Semantic Cloud for Brussels]] project; (iii) Based on the produced mapping, and using existing applications like the [[http://linkedgeodata.org/|Linked Geo Data project]], build applications that make use of LOD for example, to find out which cultural events are taking place at a given time at a given location.
+The goals of this thesis are: (1) study the existing proposals for mapping spatio-temporal data into LOD; (2) apply this mapping to a real-world case study (as was the case for the [[http://www.oscb.be/|Open Semantic Cloud for Brussels]] project; (3) Based on the produced mapping, and using existing applications like the [[http://linkedgeodata.org/|Linked Geo Data project]], build applications that make use of LOD for example, to find out which cultural events are taking place at a given time at a given location.
-    * Contact: [[ezimanyi@ulb.ac.be|Esteban Zimányi]] (CoDE)
+    * Contact: [[ezimanyi@ulb.ac.be|Esteban Zimányi]]
 =====Extending SPARQL for Spatio-temporal Data Support=====
@@ Line 265: / Line 269: @@
-   * Contact: [[ezimanyi@ulb.ac.be|Esteban Zimányi]] (CoDE)
+   * Contact: [[ezimanyi@ulb.ac.be|Esteban Zimányi]]