ISS feedback control redesign for continuous stirred tank reactors

In this paper a new nonlinear feedback control law for continuous stirred tank reactors, obtained by exact Input/Output (I/O) linearization and Sontag's input‐to‐state stability feedback control redesign methods, is studied. By the new feedback control law, a significant attenuation of the disturbance effect is guaranteed, with evident improvement with respect to control laws obtained by the exact I/O linearization method. The performed simulations validate the theoretical results. Copyright © 2010 John Wiley & Sons, Ltd.     

2.5D Elastic graph matching

In this paper, we propose novel elastic graph matching (EGM) algorithms for face recognition assisted by the availability of 3D facial geometry. More specifically, we conceptually extend the EGM algorithm in order to exploit the 3D nature of human facial geometry for face recognition/verification. In order to achieve that, first we extend the matching module of the EGM algorithm in order to capitalize on the 2.5D facial data. Furthermore, we incorporate the 3D geometry into the multiscale analysis used and build a novel geodesic multiscale morphological pyramid of dilations/erosions in order to fill the graph jets. We show that the proposed advances significantly enhance the performance of EGM algorithms. We demonstrate the efficiency of the proposed advances in the face recognition/verification problem using photometric stereo.     

Requirement-based approach for groupware environments design

Groupware applications have special features that, if they were taken into account from the very beginning, could reasonably improve the quality of the system. Such features concern human-computer-human interactions, i.e. a further step in the human-computer interaction field: communication, collaboration, cooperation and coordination, time, space, and awareness are issues to be considered. This paper presents a novel approach to gather requirements for groupware applications. The proposal is based on a methodology that includes the use of templates to gather the information regarding the different types of requirements. The requirements templates have been extended to include new information to give account of specific features concerning groupware applications. The information gathered is managed in a CASE tool we have developed; then general and specific diagrams are automatic or semi-automatically generated.     

An information architecture for a performance management framework by collaborating SMEs

Recently, much attention has been given to performance management within collaborative environments resulting in a wide variety of performance measurement/management frameworks. However, practically all of these frameworks present a common gap regarding the information treatment needs that support these frameworks. This issue is even more important in the case of Small and Medium-sized Enterprises (SMEs) due to their special characteristics. For that purpose, this paper presents an approach called Global Performance Management (GPM) Framework composed of a methodology, an information architecture and a technological solution, focusing mainly on the information architecture. The methodology guides SMEs when defining, developing, deploying and operating the GPM framework. The information architecture consists of a set of elements that support the tasks of collection, treatment and analysis of the used information, which complement the methodology to build a real model for the GPM framework. Finally, the technological solution bridges the engineering and conceptual environment, with the real-world operational and executable environment, following the path defined by the methodology. The information architecture was applied to two European pilots, achieving satisfactory results, which are highlighted in the paper as well as the main barriers encountered and solutions provided.     

Cognitive,social and teaching presence in a virtual world and a text chat

Using a framework of cognitive, social, and teaching presence, the nature of learning experiences in a three-dimensional virtual world environment (Second Life) and a text-chat learning environment without visuals (TeachNet) were investigated. A mixed method of code frequencies, coherence graphs, interviews, and a survey was used. The results revealed that the TeachNet debates included more cognitive presence codes that indicate higher levels of cognitive processing than in SL debates. The teams were significantly different from each other in the collaboration style for developing arguments and in the ways to use utterances associated with cognitive, social, and teaching presences, and the groups’ collaboration style became more established with more experience with the tasks. The three critical factors–tool, tasks and group cohesion–that affect cognitive, teaching, and social presence are discussed.     

Repeated auctions for robust task execution by a robot team

We present empirical results of an auction-based algorithm for dynamic allocation of tasks to robots. The results have been obtained both in simulation and using real robots. A distinctive feature of our algorithm is its robustness to uncertainties and to robot malfunctions that happen during task execution, when unexpected obstacles, loss of communication, and other delays may prevent a robot from completing its allocated tasks. Therefore tasks not yet achieved are resubmitted for bids every time a task has been completed. This provides an opportunity to improve the allocation of the remaining tasks, enabling the robots to recover from failures and reducing the overall time for task completion.     

An enhanced exact procedure for the absolute robust shortest path problem

The aim of this paper is to investigate the use of heuristic information to efficiently solve to optimality the robust shortest path problem. Starting from the exact algorithm proposed by Murty and Her, we describe how this algorithm can be enhanced by using heuristic rules and evaluation functions to guide the search. The efficiency of the proposed enhanced approach is tested over a range of random generated instances. Our computational results indicate that the use of heuristic criteria is able to speed up considerably the search and that the enhanced exact solution method outperforms the state‐of‐the‐art algorithm proposed by Murty and Her in most of the instances.