Cultural places like museums have been looking for means to enrich the visitor experience during and after the visit. This paper reports on a proposal to contribute to this field presenting a system that automatically creates personalized memory videos of the visit, by identifying the paths of visitors in cultural spaces. The MixMyVisit project combines low-cost devices with NFC technology, allowing a simple way for identifying visitors’ paths, a bot for interaction with the visitor through a textual chat implemented in a social network, the ability for the visitor to share its own captured contents (photos or videos), a server-side video engine supported by ffmpeg components and an online responsive video editor. The features and main technical developments are presented on the paper. The results of an evaluation carried by two experts provide positive insights towards such a system and the team expects to get a final validation in a field trial to be carried out.

A bipartite graph G = (V,W,E) is convex if there exists an ordering of the vertices of W such that, for each v /spl isin/ V, the neighbors of v are consecutive in W. We describe a BSP/CGM algorithm for finding a maximum matching in a convex bipartite graph. For p processors, the algorithm runs in time O((|V|/p)lg(|V|/p)lgp) and it uses O(lgp) communication rounds.

Let G=(V,E) be an n-vertex connected graph with positive edge weights. A subgraph G′ = (V,E′) is a t-spanner of G if for all u, v ε V,the weighted distance between u and v in G′ is at most t times the weighted distance between u and v in G. We consider the problem of constructing sparse spanners, and the weight, defined as the sum of the edge weights in the spanner. In this paper, we concentrate on constructing spanners of small weight.