Differences

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

--- teaching:mfe:is [2016/04/07 13:11]
kgouda
+++ teaching:mfe:is [2016/04/15 15:51]
svsummer
@@ Line 15: / Line 15: @@
 <note>Please note that this list of subjects is **not exhaustive. Interested students are invited to propose original subjects.**</note>
+{{:teaching:mfe:euranova_thesis_2016.pdf|}}
 ===== Master Thesis in Collaboration with Euranova =====
-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
+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_thesis_2016.pdf|here}}
-{{:teaching:mfe:master_thesis_euranova_2015.pdf|here}}
 These subject include topics on distributed graph processing, processing big data using Map/Reduce, cloud computing, and social networks.
@@ Line 88: / Line 88: @@
 **Interested?**
   * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
+**Status**: available
+===== Développement d’un système de gestion de l’information pour un réseau de dépistage et de suivi des lésions précancéreuses et cancéreuses du col de l’utérus dans la Région de Cochabamba en Bolivie =====
+Full description available here:{{:teaching:mfe:mfe_u_bio-mechatronics_codepo_01.docx|}}
+**Interested?**
+  * Contact :   * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]]
 **Status**: available
@@ Line 123: / Line 132: @@
 In this master thesis project,  due to the hardness of graph edit distance (computing graph edit distance is known to be NP-hard problem), the student  will investigate the current approaches that deals with problem complexity while searching for similar (sub-)structures.  At the end, the student should be able to empirically analyze and contrast some of the interesting approaches.
+=====A Generic Similarity Measure For Symbolic Trajectories=====
+Moving object databases (MOD) are database systems that can store and manage moving object data. A moving object is a value that changes over time. It can be spatial (e.g., a car driving on the road network), or non-spatial (e.g., the temperature in Brussels). Using a variety of sensors, the changing values of moving objects can be recorded in digital formats. A MOD, then, helps storing and querying such data. There are two types of MOD. The first is the trajectory database, that manages the history of movement. The second type, in contrast, manages the stream of current movement and the prediction of the near future. This thesis belongs to the first type (trajectory databases). The research in this area mainly goes around proposing data persistency models and query operations for trajectory data.
+A sub-topic of MOD is the study of semantic trajectories. It is motivated by the fact that the semantic of the movement is lost during the observation process. You GPS logger, for instance, would record a sequence of (lon, lat, time) that describe your trajectory. It won't, however, store the purpose of your trip (work, leisure, …), the transportation mode (car, bus, on foot, …), and other semantics of your trip. Research works have accordingly emerged to extract semantics from the trajectory raw data, and to provide database persistency to semantic trajectories.
+Recently, Ralf Güting et al. published a model called “symbolic trajectories”, which can be viewed as a representation of semantic trajectories:
+Ralf Hartmut Güting, Fabio Valdés, and Maria Luisa Damiani. 2015. Symbolic Trajectories. ACM Trans. Spatial Algorithms Syst. 1, 2, Article 7 (July 2015), 51 pages.
+A symbolic trajectory is a very simple structure composed of a sequence of pairs (time interval, label). So, it is a time dependent label, where every label can tell something about the semantics of the moving object during its associated time interval. We think this model is promising because of its simplicity and genericness.
+The goal of this thesis is to implement a similarity operator for symbolic trajectories. There are three dimensions of similarity in symbolic trajectories: temporal similarity, value similarity, and semantic similarity. Such an operator should be flexible to express arbitrary combinations of them. It should accept a pair of semantic trajectories and return a numerical value that can be used for clustering or ranking objects based on their similarity. Symbolic trajectories are similar to time series, except that labels are annotated by time intervals, rather than time points. We think that the techniques of time series similarity can be adopted for symbolic trajectories. This thesis should assess that, and implement a similarity measure based on time series similarity. The implementation is required to be done as an extension to PostGIS. We have already implemented some temporal types and operations on top of PostGIS, where you can start from.
+**Deliverables** of the master thesis project
+  * Reporting on the state of art of semantic trajectory similarity measures.
+  * Reporting on the state of art in time series similarity measures.
+  * Assessing the application of time series similarity to symbolic trajectories.
+  * Implementing symbolic trajectories on top of PostGIS.
+  * Implementation and evaluating the proposed symbolic trajectory similarity operator.
+**Interested?**
+  * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]]
+**Status**: available
+=====Assessing Existing Communication Protocols In The Context Of DaaS =====
+Data-as-a-Service (DaaS) is an emerging cloud model. The main offering of DaaS is to allow data producers/owners to publish data services on the cloud. The idea of publishing data via a service interface is not new. SOA protocols have enabled this long ago. Yet, these protocols were not developed with the cloud and the big data in mind. This is probably why the term DaaS has emerged. It marks the need for protocols and tools that enable big data exchange.
+DaaS services need to exchange large amounts of data. Large here refers to large message size, large message count, or a combination of both. RESTful services, for instance, communicate over HTTP, which is not a good choice for communicating large messages/files. SOAP services are not bound to HTTP, but they introduce another overhead of requiring messages to be strictly formatted in XML. This is why researchers started to reconsider older protocols like the BitTorrent, and suggesting extension to existing protocols like the SOAP with Attachments.
+The topic of this thesis is to perform a comprehensive survey on the protocols data exchange, and assess their suitability for DaaS. A quantitative comparison of protocols need to be done, considering at least these two dimensions: (1) the protocol: SOAP, REST, BitTorrent, etc, and (2) the message: short inline, long inline, file. The assessment should be in terms of reliability, performance, and security.
+**Deliverables** of the master thesis project
+  * A report that reviews the state of art communication protocols.
+  * Propose a tool for DaaS developers to choose the best protocol/s based on their application needs. Such a tool might also provide means of automatically switching between protocols on certain thresholds.
+  * Experiments to assess the suitability of protocols for DaaS, and to compare between them. These experiments need to be repeatable, so that others can use them on their own datasets and configurations.
+**Interested?**
+  * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]]
+**Status**: available