Abstract: Placing data as close as possible to computation is a common practice of data intensive systems, commonly referred to as the data locality problem. By analyzing existing production systems, we confirm the benefit of data locality and find that data have different popularity and varying correlation of accesses. We propose DARE, a distributed adaptive data replication algorithm that aids the scheduler to achieve better data locality. DARE solves two problems, how many replicas to allocate for each file and where to place them, using probabilistic sampling and a competitive aging algorithm independently at each node. It takes advantage of existing remote data accesses in the system and incurs no extra network usage. Using two mixed workload traces from Facebook, we show that DARE improves data locality by more than 7 times with the FIFO scheduler in Hadoop and achieves more than 85% data locality for the FAIR scheduler with delay scheduling. Turnaround time and job slowdown are reduced by 19% and 25%, respectively.

Abstract: Los sistemas de recomendación son ampliamente utilizados hoy en día gracias a su capacidad de analizar las preferencias de usuarios y sugerir ítems. No obstante, el uso de los recomendadores está limitado a un modelo basado en el usuario y no en su historial de preferencias, discriminando así el campo de aplicación, por ejemplo, a sistemas académicos donde sea primordial el estudio de las decisiones del estudiante a lo largo de su carrera. El presente
trabajo presenta un esfuerzo por adaptar filtros colaborativos basados en el usuario a filtros colaborativos basados en el historial del usuario. Con un conjunto de pruebas mediremos su efectividad utilizando dos algoritmos distintos de similaridad para recomendar materias a un estudiante en el sexto semestre de la carrera de Ingeniería en Electrónica y Telecomunicaciones ofertada por la FIEC – ESPOL. Los resultados muestran que es factible adaptar un recomendador a un modelo basado en el historial del usuario

Abstract: This paper presents a method for on-line human action recognition on video sequences. An analysis based on Mahalanobis distance is performed to identify the “idle” state, which defines the beginning and end of the person movement, for posterior patterns extraction based on Relative Wavelet Energy from sequences of invariant moments.

Abstract: This paper presents a novel model to estimate human activities – a human activity is defined by a set of human actions. The proposed approach is based on the usage of Recurrent Neural Networks (RNN) and Bayesian inference through the continuous monitoring of human actions and its surrounding environment. In the current work human activities are inferred considering not only visual analysis but also additional resources; external sources of information, such as context information, are incorporated to contribute to the activity estimation. The novelty of the proposed approach lies in the way the information is encoded, so that it can be later associated according to a predefined semantic structure. Hence, a pattern representing a given activity can be defined by a set of actions, plus contextual information or other kind of information that could be relevant to describe the activity. Experimental results with real data are provided showing the validity of the proposed approach.