Abstract
Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits the inherent security provided by random linear network coding and offers the advantage of reduced overhead in comparison to traditional end-to-end encryption of the entire data. Confidentiality is achieved by protecting (or "locking") the source coefficients required to decode the encoded data, without preventing intermediate nodes from running their standard network coding operations. Our scheme can be easily combined with existing techniques that counter active attacks.

Abstract
Discussion forums are presently one of the most important tools in assisting distance education. Web learning is accomplished by using these communication tools and, particularly, by the interactions that take place in these settings. Therefore, students' participations in a discussion forum, the frequency and the way they participate, the types of interactions that they create with their colleagues and with the professor, can and should be analyzed in order to fully understand the group and, consequently, allow a more efficient and student focused education. In this article, suggest graphical representations (the iGraph) of these interactions and by using these tools, we describe forum participation according to the centralization of information, the density and intensity of interactions, and yet the quality of the moderation.

Abstract
We present an architecture that allows the seamless configuration of computer labs to work as dedicated computing clusters during periods of user inactivity. The operation of the cluster is fully automated by making use of differentiated network booting and a job management system. We have prepared it to be plugged to a larger computational grid. We provide some preliminary performance results obtained.

Abstract
The general problem addressed in this paper is the rapid development of web interfaces to software systems using only their command line interface. This kind of system is frequently developed in environments that greatly differ from those where web interface will be implemented. In this setting it is also important to maintain a loose coupling between the web interface and the system it controls since the latter must be able to continue its normal development independently of the former. We propose a framework to develop web interfaces targeted to these systems whose main feature is the fact that it can be extended without requiring code programming. The hot spots of our framework are XML configuration files to define the interface data, how this data is mapped into the system's commands, and how commands output and the interaction state is mapped into web formatting languages. With this approach the web interface is kept separated from the system it controls, it is easy to define and modify, and is able to capture enough domain knowledge to be a real advantage for the novice or sporadic user. In this paper we present the proposed framework architecture, loosely inspired in the MVC pattern, its implementation on Java servlet containers, and its application to the AGILMAT system, a high-school mathematical problem generator developed using constrained grammars.

Abstract

Abstract
We present a process calculus that models the communication and computational aspects of sensor network applications. The calculus focuses on a basic set of primitives for programming sensor networks that support code deployment, communication and local processing, and provides a very expressive core-language. The calculus and its associated theory provide the tools to verify the robustness of sensor network applications and protocols. © 2007 IEEE.