Abstract
The research presented in this paper builds on previous work that lead to the definition of a family of semantic relatedness algorithms. These algorithms depend on a semantic graph and on a set of weights assigned to each type of arcs in the graph. The current objective of this research is to automatically tune the weights for a given graph in order to increase the proximity quality. The quality of a semantic relatedness method is usually measured against a benchmark data set. The results produced by a method are compared with those on the benchmark using a nonparametric measure of statistical dependence, such as the Spearman's rank correlation coefficient. The presented methodology works the other way round and uses this correlation coefficient to tune the proximity weights. The tuning process is controlled by a genetic algorithm using the Spearman's rank correlation coefficient as fitness function. This algorithm has its own set of parameters which also need to be tuned. Bootstrapping is a statistical method for generating samples that is used in this methodology to enable a large number of repetitions of a genetic algorithm, exploring the results of alternative parameter settings. This approach raises several technical challenges due to its computational complexity. This paper provides details on techniques used to speedup the process. The proposed approach was validated with the Word Net 2.1 and the Word Sim-353 data set. Several ranges of parameter values were tested and the obtained results are better than the state of the art methods for computing semantic relatedness using the Word Net 2.1, with the advantage of not requiring any domain knowledge of the semantic graph.

Abstract
In this work two erbium doped optical fiber laser configurations for magnetic field measurement are implemented and compared. The first laser is set-up in a loop configuration and requires only a single FBG (Fiber Bragg Grating), acting as mirror. A second laser employs a simpler linear cavity configuration but requires two FBGs with spectral overlap to form the laser cavity. A bulk magnetostrictive material made of Terfenol-D is attached to the laser FBGs enabling modulation of its operation wavelength by the magnetic field. Moreover, a passive interferometer was developed to demodulate the AC magnetic field information where the corresponding demodulation algorithms were software based. Both configurations are tested and compared with the results showing different sensitivities and resolutions. Better performance was accomplished with the double FBGs linear cavity configuration with a resolution of 0.05 mTRMS in the range of 8 to 16 mTRMS. For the same range the loop configuration attained a resolution of 0.48 mT(RMS).

Abstract
Many embedded multi-core systems incorporate both dataflow applications with timing constraints and traditional real-time applications. Applying real-time scheduling techniques on such systems provides real-time guarantees that all running applications will execute safely without violating their deadlines. However, to apply traditional real-time scheduling techniques on such mixed systems, a unified model to represent both types of applications running on the system is required. Several earlier works have addressed this problem and solutions have been proposed that address acyclic graphs, implicit-deadline models or are able to extract timing parameters considering specific scheduling algorithms. In this paper, we present an algorithm for extracting real-time parameters (offsets, deadlines and periods) that are independent of the schedulability analysis, other applications running in the system, and the specific platform. The proposed algorithm: 1) enables applying traditional real-time schedulers and analysis techniques on cyclic or acyclic Homogeneous Synchronous Dataflow (HSDF) applications with periodic sources, 2) captures overlapping iterations, which is a main characteristic of the execution of dataflow applications, 3) provides a method to assign offsets and individual deadlines for HSDF actors, and 4) is compatible with widely used deadline assignment techniques, such as NORM and PURE. The paper proves the correctness of the proposed algorithm through formal proofs and examples.

Abstract
This research studies motion segmentation based on dense optical flow fields for mobile robotic applications. The optical flow is usually represented in the Euclidean space however, finding the most suitable motion space is a relevant problem because techniques for motion analysis have distinct performances. Factors like the processing-time and the quality of the segmentation provide a quantitative evaluation of the clustering process. Therefore, this paper defines a methodology that evaluates and compares the advantage of clustering dense flow fields using different feature spaces, for instance, Euclidean and Polar space. The methodology resorts to conventional clustering techniques, Expectation-Maximization and K-means, as baseline methods. The experiments conducted during this paper proved that the K-means clustering is suitable for analyzing dense flow fields.

Abstract
In the early twenty-first century, social networks served only to let the world know our tastes, share our photos and share some thoughts. A decade later, these services are filled with an enormous amount of information. Now, the industry and the academia are exploring this information, in order to extract implicit patterns. TwitterJam is a tool that analyses the contents of the social network Twitter to extract events related to road traffic. To reach this goal, we started by analysing tweets to know those which really contains road traffic information. The second step was to gather official information to confirm the extracted information. With these two types of information (official and general), we correlated them in order to verify the credibility of public tweets. The correlation between the two types of information was done separately in two ways: the first one concerns the amount of tweets in a certain time of day and the second on the localization of these tweets. Two hypothesis were also devised concerning these correlations. The results were not perfect but where reasonable enough. We also analysed tools suitable for the visualization of data to decide what is the best strategy to follow. At the end we developed a web application that shows the results, to help the analysis of results.

Abstract
This paper presents a framework for simulator development for fixed horizon, rolling horizon and real time management models for their modelling and evaluation in ubiquitous production networks under conditions of dynamic environments for economic and environmental sustainability.