Abstract
In this paper we propose an incremental item-based collaborative filtering algorithm. It works with binary ratings (sometimes also called implicit ratings), as it; is typically the case in a Web environment. Our method is capable of incorporating new information in parallel with performing recommendation. New sessions and new users are used to update the similarity matrix as they appear. The proposed algorithm is compared with a non-incremental one, as well as with an incremental user-based approach, based oil an existing explicit, rating recommender. The use of techniques for working with sparse matrices oil these algorithms is also evaluated. All versions, implemented ill R, are evaluated on 5 datasets with various number of users and/or items. We observed that: Recall tends to improve when we continuously add information to the recommender model; the time spent for recommendation does not degrade; the time for updating the similarity matrix (necessary to the recommendation) is relatively low and motivates the use of the item-based incremental approach. Moreover we study how the number of items and users affects the user based and the item based approaches.

Abstract
People with autism spectrum disorder (ASD) find it difficult to recognize and respond to emotions conveyed by the face. Most existing methodologies to teach people with ASD to recognize expressions use still images, and do not take into account that facial expressions have movement. We propose a new approach that uses state of the art technology to solve the problem and to improve interactivity. It is based on an avatar-user interaction model with real time response, which builds upon the patient-therapist relationship: it is designed to be used by the therapist and the patient. The core technology behind it is based on a technique we have developed for real time facial synthesis of 3D characters.

Abstract
We propose a generic modelling technique that can be used to extend existing frameworks for theoretical security analysis in order to capture the use of timestamps. We apply this technique to two of the most popular models adopted in literature (Bellare-Rogaway and Canetti-Krawczyk). We analyse previous results obtained using these models in light of the proposed extensions, and demonstrate their application to a new class of protocols. In the timed CK model we concentrate on modular design and analysis of protocols, and propose a more efficient timed authenticator relying on timestamps. The structure of this new authenticator implies that an authentication mechanism standardised in ISO-9798 is secure. Finally, we use our timed extension to the BR model to establish the security of an efficient ISO protocol for key transport and unilateral entity authentication.

Abstract
We present a new method for generating input features for musical audio beat tracking systems. To emphasise periodic structure we derive a weighted linear combination of sub-band onset detection functions driven a measure of sub-band beat strength. Results demonstrate improved performance over existing state of the art models, in particular for musical excerpts with a steady tempo. ©2009 IEEE.

Abstract
The goal of this paper is to discuss the usage of distributed architecture for the Lego NXT robots. This platform is very interesting because it provides standard hardware for configurable mounting of several sensors and actuators. The presented work characterizes sensors and actuators and identifies limitations of the stand-alone architecture. In order to maximize usefulness and go beyond the identified limitations, a distributed computing architecture was developed that allows the Lego NXT to address complex missions. The distributed architecture makes use of two different programming environments. The described architecture was tested in a sample self localization task.

Abstract
Sensor networks can be viewed as a collection of tiny, low-cost devices programmed to sense the physical world and that communicate over radio links [12]. The devices are commonly called motes or smart dust [676], in allusion to their computational and sensing capabilities, as well as their increasingly small size. © 2009 Springer Berlin Heidelberg.