Ana García-Fornes

An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems

The paper addresses the problem of jointly scheduling tasks with both hard and soft real time constraints. We present a new analysis applicable to systems scheduled using a priority preemptive dispatcher, with priorities assigned dynamically according to the EDF policy. Further, we present a new efficient online algorithm (the acceptor algorithm) for servicing aperiodic work load. The acceptor transforms a soft aperiodic task into a hard one by assigning a deadline. Once transformed, aperiodic tasks are handled in exactly the same way as periodic tasks with hard deadlines. The proposed algorithm is shown to be optimal in terms of providing the shortest aperiodic response time among fixed and dynamic priority schedulers. It always guarantees the proper execution of periodic hard tasks. The approach is composed of two parts: an offline analysis and a run time scheduler. The offline algorithm runs in pseudopolynomial time O(mn), where n is the number of hard periodic tasks and m is the hyperperiod/min deadline.

Open Challenges in Relationship-Based Privacy Mechanisms for Social Network Services

Social networking services (SNSs) such as Facebook and Twitter have experienced explosive growth during the few past years. Millions of users have created their profiles on these services because they experience great benefits in terms of friendship. SNSs can help people to maintain their friendships, organize their social lives, start new friendships, and meet others who share their hobbies and interests. However, all these benefits can be eclipsed by the privacy hazards that affect people in SNSs. People expose intimate information about their lives on SNSs, and this information affects the way others think about them. It is crucial that users be able to control how their information is distributed through the SNSs and decide who can access it. This article presents a list of privacy threats that can affect SNS users and what requirements privacy mechanisms should fulfill to prevent this threats. Then the article reviews current approaches and analyzes to what extent they cover the requirements.

A survey of privacy in multi-agent systems

Privacy has been a concern for humans long before the explosive growth of the Internet. The advances in information technologies have further increased these concerns. This is because the increasing power and sophistication of computer applications offers both tremendous opportunities for individuals, but also significant threats to personal privacy. Autonomous agents and multi-agent systems are examples of the level of sophistication of computer applications. Autonomous agents usually encapsulate personal information describing their principals, and therefore they play a crucial role in preserving privacy. Moreover, autonomous agents themselves can be used to increase the privacy of computer applications by taking advantage of the intrinsic features they provide, such as artificial intelligence, pro-activeness, autonomy, and the like. This article introduces the problem of preserving privacy in computer applications and its relation to autonomous agents and multi-agent systems. It also surveys privacy-related studies in the field of multi-agent systems and identifies open challenges to be addressed by future research.

Partial identities as a foundation for trust and reputation

This paper explores the relationships between the hard security concepts of identity and privacy on the one hand, and the soft security concepts of trust and reputation on the other hand. We specifically focus on two vulnerabilities that current trust and reputation systems have: the change of identity and multiple identities problems. As a result, we provide a privacy preserving solution to these vulnerabilities which integrates the explored relationships among identity, privacy, trust and reputation. We also provide a prototype of our solution to these vulnerabilities and an application scenario.

BFF: A tool for eliciting tie strength and user communities in social networking services

The use of social networking services (SNSs) such as Facebook has explosively grown in the last few years. Users see these SNSs as useful tools to find friends and interact with them. Moreover, SNSs allow their users to share photos, videos, and express their thoughts and feelings. However, users are usually concerned about their privacy when using SNSs. This is because the public image of a subject can be affected by photos or comments posted on a social network. In this way, recent studies demonstrate that users are demanding better mechanisms to protect their privacy. An appropriate approximation to solve this could be a privacy assistant software agent that automatically suggests a privacy policy for any item to be shared on a SNS. The first step for developing such an agent is to be able to elicit meaningful information that can lead to accurate privacy policy predictions. In particular, the information needed is user communities and the strength of users’ relationships, which, as suggested by recent empirical evidence, are the most important factors that drive disclosure in SNSs. Given the number of friends that users can have and the number of communities they may be involved on, it is infeasible that users are able to provide this information without the whole eliciting process becoming confusing and time consuming. In this work, we present a tool called Best Friend Forever (BFF) that automatically classifies the friends of a user in communities and assigns a value to the strength of the relationship ties to each one. We also present an experimental evaluation involving 38 subjects that showed that BFF can significantly alleviate the burden of eliciting communities and relationship strength.

Supporting Agent Organizations

Organizational Theory concepts have been adapted to improve, extend and facilitate Agent Organizations modeling. Thus, three basic organizational topologies from which other more complex organizations can be composed have been identified. Moreover, this organizational modeling has been implemented in a specific MAS platform (SPADE) making use of Multiuser Conference technology. We have also defined several services for SPADE that ease the implementation of organization dynamics, such as member access and agent interaction control.

Analyzing the schedulability of hard real-time artificial intelligence systems☆

Abstract This paper presents a prototype of the architecture known as the Architecture for Real-Time Intelligent Systems (ARTIS). Since the aim of this work is to have a tool for developing hard real-time intelligent systems, the theoretical fixed pre-emptive schedulability equations have been extended by including the prototypes exact timing factors. Some architectural design decisions, as well as the behaviour of an event-driven, non-preemptable, real-time kernel, are also presented, in order to include their effects in these schedulability equations.

A performance evaluation of three multiagent platforms

In the last few years, many researchers have focused on testing the performance of Multiagent Platforms. Results obtained show a lack of performance and scalability on current Multiagent Platforms, but the existing research does not tackle poor efficiency causes. This article is aimed not only at testing the performance of Multiagent Platforms but also the discovery of Multiagent Platform design decisions that can lead to these deficiencies. Therefore, we are able to understand to what extent the internal design of a Multiagent Platform affects its performance. The experiments performed are focused on the features involved in agent communication.

A temporal blackboard for a multi-agent environment

Abstract The multi-agent system paradigm emerges as an interesting approach in the Knowledge Based System (KBS) field, when distributed problem-solving techniques are required for solving problems that can be represented as a collection of groups of cooperating intelligent individuals. A key concept in the multi-agent systems is the interaction between agents. On the other hand time plays a crucial role in a wide range of KBS applications. Temporal reasoning and representations consists of formalizing the notion of time and providing means to represent and reason about the temporal aspects of knowledge. This paper presents a framework for agent communication based on the blackboard paradigm which is able to manage temporal information, and it provides its multiple access and coherence management protocols.

Tasks for agent-based negotiation teams: Analysis, review, and challenges

An agent-based negotiation team is a group of interdependent agents that join together as a single negotiation party due to their shared interests in the negotiation at hand. The reasons to employ an agent-based negotiation team may vary: (i) more computation and parallelization capabilities; (ii) unite agents with different expertise and skills whose joint work makes it possible to tackle complex negotiation domains; (iii) the necessity to represent different stakeholders or different preferences in the same party (e.g., organizations, countries, and married couple). The topic of agent-based negotiation teams has been recently introduced in multi-agent research. Therefore, it is necessary to identify good practices, challenges, and related research that may help in advancing the state-of-the-art in agent-based negotiation teams. For that reason, in this article we review the tasks to be carried out by agent-based negotiation teams. Each task is analyzed and related with current advances in different research areas. The analysis aims to identify special challenges that may arise due to the particularities of agent-based negotiation teams.