Abstract
Mass adoption of virtual world platforms for education and training implies efficient management of computational resources. In Second Life Grid and OpenSimulator, commonly used for this purpose, a key resource is the number of servers required to support educational spaces. Educational activities can take place at different altitudes over the same virtual land, for different classes. This way a single virtual world server can sustain several different educational spaces/classes, reducing the number of servers needed to make available different classrooms or other educational spaces. One issue whose importance is emphasized in such conditions is that of class privacy, bearing in mind that most privacy-management features of these platforms are land-based, not space-based. In this paper, we provide an overview of the issues to consider when planning privacy in these platforms and the methodologies that can be developed and implemented to ensure it at an adequate level, including the extra privacy possible in OpenSimulator regarding Second Life Grid. © 2010 IEEE.

Abstract
Completely non-malleable encryption schemes resist attacks which allow an adversary to tamper with both ciphertexts and public keys. In this paper we introduce two extractor-based properties that allow us to gain insight into the design of such schemes and to go beyond known feasibility results in this area. We formalise strong plaintext awareness and secret key awareness and prove their suitability in realising these goals. Strong plaintext awareness imposes that it is infeasible to construct a ciphertext under any public key without knowing the underlying message. Secret key awareness requires it to be infeasible to produce a new public key without knowing a corresponding secret key.

Abstract
In this paper we explore the relationship between the temporal and rhythmic structure of musical audio signals. Using automatically extracted rhythmic structure we present a rhythmically-aware method to combine note onset detection techniques. Our method uses top-down knowledge of repetitions of musical events to improve detection performance by modelling the temporal distribution of onset locations. Results on a publicly available database demonstrate that using musical knowledge in this way can lead to significant improvements by reducing the number of missed and spurious detections.

Abstract
This paper is on the problem of short-term hydro scheduling (STHS), particularly concerning a head-dependent hydro chain We propose a novel mixed-integer nonlinear programming (MINLP) approach, considering hydroelectric power generation as a nonlinear function of water discharge and of the head. As a new contribution to eat her studies, we model the on-off behavior of the hydro plants using integer variables, in order to avoid water discharges at forbidden areas Thus, an enhanced STHS is provided due to the more realistic modeling presented in this paper Our approach has been applied successfully to solve a test case based on one of the Portuguese cascaded hydro systems with a negligible computational time requirement. (C) 2010 Elsevier B V. All tights reserved.

Abstract
The knowledge of software developers materializes itself as software artifacts, that may be seen at two different levels (information and structure), which are difficult to change independently from each other. This work explores how the expression of software knowledge using adaptive software techniques, may support the creation of adaptive software artifacts, to improve the effectiveness of capturing knowledge under constant evolution. Some work already exists in the context of the Weaki Wiki, which will be extended into a full environment supporting the creation and evolution of software artifacts beyond their initial form. We intend to validate this work experimentally.

Abstract
We study relations among various notions of complete non-malleability, where an adversary can tamper with both ciphertexts and public-keys, and ciphertext indistinguishability. We follow the pattern of relations previously established for standard non-malleability. To this end, we propose a more convenient and conceptually simpler indistinguishability-based security model to analyse completely non-malleable schemes. Our model is based on strong decryption oracles, which provide decryptions under arbitrarily chosen public keys. We give the first precise definition of a strong decryption oracle, pointing out the subtleties in different approaches that can be taken. We construct the first efficient scheme, which is fully secure against strong chosen-ciphertext attacks, and therefore completely non-malleable, without random oracles.