Abstract
Multi-agent system (MAS) is being pointed out as a suitable technology to develop systems that demand flexibility, robustness and re-configurability. Consequently, a significant effort has been noticed to apply MAS to industrial domains exhibiting these characteristics, like manufacturing and smart grids. In spite of the adequacy of the MAS principles to solve the industrial requirements, the truly deployment of MAS for industrial applications is far to be solved. This paper discusses the current challenges for the deployment of MAS in the context of industrial applications, mainly focusing the integration of agents with physical equipment and the ability to run agents directly in industrial or low cost controllers. An experimental MAS solution for a smart grid case study was deployed aiming to support the discussion.

Abstract
We propose a new cryptographic primitive called Delegatable Homomorphic Encryption (DHE). This allows a Trusted Authority to control/delegate the evaluation of circuits over encrypted data to untrusted workers/evaluators by issuing tokens. This primitive can be both seen as a public-key counterpart to Verifiable Computation, where input generation and output verification are performed by different entities, or as a generalisation of Fully Homomorphic Encryption enabling control over computations on encrypted data. Our primitive conies with a series of extra features: 1) there is a one-time setup procedure for all circuits; 2) senders do not need to be aware of the functions which will be evaluated on the encrypted data, nor do they need to register keys; 3) tokens are independent of senders and receiver; and 4) receivers are able to verify the correctness of computation given short auxiliary information on the input data and the function, independently of the complexity of the computed circuit. We give a modular construction of such a DHE scheme from three components: Fully Homomorphic Encryption (FHE), Functional Encryption (FE), and a (customised) MAC. As a stepping stone, we first define Verifiable Functional Encryption (VFE), and then show how one can build a secure DHE scheme from a VFE and an FHE scheme. We also show how to build the required VFE from a standard FE together with a MAC scheme. All our results hold in the standard model. Finally, we show how one can build a verifiable computation (VC) scheme generically from a DHE. As a corollary, we get the first VC scheme which remains verifiable even if the attacker can observe verification results.

Abstract
This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network. Such topological information may be useful as input to configure other algorithms. Previous approaches have been modular, progressing in sequential phases using building blocks such as BFS tree construction, thus incurring longer executions than strictly required. We present an algorithm that, by timely propagation of available estimations, achieves a faster convergence to the correct values. We show local criteria for detecting convergence in each node. The algorithm avoids the creation of BFS trees and simply manipulates sets of node ids and hop counts. For the worst scenario of variable start times, each node i with eccentricity ecc(i) can compute: the node eccentricity in diam(G)+ecc(i)+2 rounds; the diameter in 2 diam(G)+ecc(i)+ 2 rounds; and the radius in diam(G) + ecc(i) + 2 radius(G) rounds.

Abstract

Abstract
One of the major data mining tasks is to cluster similar data, because of its usefulness, providing means of summarizing large ammounts of raw data into handy information. Clustering data streams is particularly challenging, because of the constraints imposed when dealing with this kind of input. Here we report our work, in which it was investigated the use of WiSARD discriminators as primary data synthesizing units. An analysis of StreamWiSARD, a new sliding-window stream data clustering system, the benefits and the drawbacks of its use and a comparison to other approaches are all presented. © 2012 Springer-Verlag.

Abstract
The transistor is an electronic component that revolutionized the world of electronics, enabling the development and improvement of various systems and products in this area over the years. The paper transistor resulted from research conducted by a team coordinated by Elvira Fortunato. It is an ultra-small (nano) transistor, which is paper-based, a cheap and easily accessible material. This article intends, first, to determine the innovation model behind the paper transistor and, second, based on a survey of a sample of Portuguese firms in industries inclined to adopting the transistor, to understand its level of implementation and assess the determinants that may be influencing this process. A review of relevant literature and an interview with Elvira Fortunato, the key researcher, support the conclusion that the innovation model in question is the interactive one. In fact, since the project began, significant interaction took place between research institutions and industry, which continued throughout the development process. In the second phase of our work, a group of firms was surveyed, selected on the basis of the relevance of the technology on the activities they conduct. Only one firm from the five respondents said they knew of the paper transistor. The answers collected also indicated that there are three main determinants which explain why firms have failed to adopt this transistor: the expected profit, the existence of networks between firms and universities, and information. Thus, we conclude that there is a significant need for increased interaction between universities and firms, so as to promote a broader understanding of the stakeholders' needs, with the development of innovations in universities and research institutes based on adaptation to the business context.