Abstract

Abstract
The application of optimization algorithms to parameter driven simulations and agents has been thoroughly explored in literature. However, classical optimization algorithms do not take into account the fact that simulations normally have dynamic scenarios. This paper analyzes the possibility of using the classical optimization methods, combined with clustering techniques, in order to optimize parameter driven agents, in simulations having dynamic scenarios. This will be accomplished by optimizing the agents in several random static scenarios and clustering the optimum results of each of these optimizations in order to find a set of typical solutions for the agent parametrization problem. These typical solutions can then be used in dynamic scenario simulations as references that will help the agents adapt to scenario changes. The results of this approach show that, in some cases, it is possible to improve the outcome of simulations in dynamic environments while still using the classical methods developed for static scenarios.

Abstract
In this paper we describe our work on computational mind model for temperamental decision algorithms using Fuzzy Logic and an implementation of an emotional-behavioral multi-agent system for analysis and evaluation of different strategies based on temperamental behaviors. We describe our approach to emotional model using temperamental decision system based on theory about general types of superior nervous systems in humans and animals and we explain how we can apply Fuzzy Logic on temperamental decision system. We describe the simulation environment used in this work to test and evaluate the strategies. We have conducted a set of robotic experiments in order to test the performance of the system on its first implementation phase. The results achieved showed that the different set of temperamental characteristics influences significantly the performance of the agents and give us very positive feedback to proceed with this research and implementation in new directions.

Abstract
To improve their efficiency and competitiveness, organizations are increasingly interested in applications that support team work, usually know as groupware. Beside interoperability, familiarity with the application and users' mobility support, a feature that is of outmost importance in groupware is the notification of events produced by cooperative activities. Web Services have emerged recently to support the exchange of data in distributed environments using common Internet technologies and have been used mainly to build business-to-business applications. However, Web Services have capabilities that make them suitable to meet the requirements posed by groupware applications, a field where little work has been carried out. This article describes a model for developing cooperative applications based on Web Services technology and using asynchronous notification of events, and presents a brief description of the implementation of the support services for that model and of a prototype application that uses them.

Abstract
3G mobile and wireless communication networks elicit new ways of multimedia human interaction and communication, notably two-way high-quality audio communication. This is inline with both the consumer expectation of new audio experiences and functionalities, and with the motivation of Telecom Operators to offer consumers new services and communication modalities. In this paper we describe the design and optimization of a nioriophonic audio coder (Audio Communication Coder -ACC) that features low-delay coding (< 50 ms) and intrinsic error robustness, while minimizing complexity and achieving competitive coding gains and audio quality at bit rates around 32 kbit/s and higher. ACC source, perceptual and bandwidth extension tools are described and an emphasis is placed on ACC structural and operational features making it suitable for real-time, two-way audio communication. A few performance results are also presented. Audio demos are available at http://www.atc-labs.corn/acc/ .

Abstract
In this paper, we recover a graph interpretation of the mutual partition distance, proposed recently by Cardoso and Corte-Real. We deduce some properties of this measure, and establish a correspondence with the partition distance introduced by Almudevar and Field and Gusfield, and independently by Guigues. We also present some different formulations for the computation of the mutual partition distance. Finally, a comparison is made with similar measures.