Abstract
The exponential growth of data produced, the ever faster and ubiquitous connectivity, and the collaborative processing tools lead to a clear shift of data stores from local servers to the cloud. This migration occurring across different application domains and types of users|individual or corporate|raises two immediate challenges. First, outsourcing data introduces security risks, hence protection mechanisms must be put in place to provide guarantees such as privacy, confidentiality and integrity. Second, there is no \one-size-fits-all" solution that would provide the right level of safety or performance for all applications and users, and it is therefore necessary to provide mechanisms that can be tailored to the various deployment scenarios. In this paper, we address both challenges by introducing SafeFS, a modular architecture based on software-defined storage principles featuring stackable building blocks that can be combined to construct a secure distributed file system. SafeFS allows users to specialize their data store to their specific needs by choosing the combination of blocks that provide the best safety and performance tradeoffs. The file system is implemented in user space using FUSE and can access remote data stores. The provided building blocks notably include mechanisms based on encryption, replication, and coding. We implemented SafeFS and performed indepth evaluation across a range of workloads. Results reveal that while each layer has a cost, one can build safe yet efficient storage architectures. Furthermore, the different combinations of blocks sometimes yield surprising tradeoffs. © 2017 ACM.

Abstract
In this paper we present the INESC Key Detection (IKD) system which incorporates a novel method for dynamically biasing key mode estimation using the spatial displacement of beat-synchronous Tonal Interval Vectors (TIVs). We evaluate the performance of the IKD system at finding the global key on three annotated audio datasets and using three key-defining profiles. Results demonstrate the effectiveness of the mode bias in favoring either the major or minor mode, thus allowing users to fine tune this variable to improve correct key estimates on style-specific music datasets or to balance predictions across key modes on unknown input sources.

Abstract
A Fabry-Perot air bubble microcavity fabricated between a section of single mode fiber and a multimode fiber is proposed. The study of the microcavities growth with the number of applied arcs is performed. The sensors are tested for lateral load and strain, where sensitivities of 0.32 nm/N and 2.11 nm/N and of 4.49 pm/mu epsilon and 9.12 pm/mu epsilon are obtained for the 47 mu m and 161 mu m long cavities, respectively. The way of manufacturing using a standard fusion splicer and given that no oils or etching solutions are involved, emerges as an alternative to the previously developed air bubble based sensors.

Abstract
In movie/TV collaborative recommendation approaches, ratings users gave to already visited content are often used as the only input to build profiles. However, users might have rated equally the same movie but due to different reasons: either because of its genre, the crew or the director. In such cases, this rating is insufficient to represent in detail users' preferences and it is wrong to conclude that they share similar tastes. The work presented in this paper tries to solve this ambiguity by exploiting hidden semantics in metadata elements. The influence of each of the standard description elements (actors, directors and genre) in representing user's preferences is analyzed. Simulations were conducted using Movielens and Netflix datasets and different evaluation metrics were considered. The results demonstrate that the implemented approach yields significant advantages both in terms of improving performance, as well as in dealing with common limitations of standard collaborative algorithm.

Abstract
Nowadays using E-learning platforms such as Intelligent Tutoring Systems (ITS) that support users to learn subjects are quite common. Despite the availability and the advantages of these systems, they ignore the learners' time limitation for learning a subject. In this paper we propose RUTICO, that recommends successful learning paths with respect to a learner's knowledge background and under a time constraint. RUTICO, which is an example of Long Term goal Recommender Systems (LTRS), a.er locating a learner in the course graph, it utilizes a Depth-first search (DFS) algorithm to find all possible paths for a learner given a time restriction. RUTICO also estimates learning time and score for the paths and finally, it recommends a path with the maximum score that satisfies the learner time restriction. In order to evaluate the ability of RUTICO in estimating time and score for paths, we used the Mean Absolute Error and Error. Our results show that we are able to generate a learning path that maximizes a learner's score under a time restriction. © 2017 ACM.

Abstract
The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network.