FMAP: Distributed cooperative multi-agent planning

This paper proposes FMAP (Forward Multi-Agent Planning), a fully-distributed multi-agent planning method that integrates planning and coordination. Although FMAP is specifically aimed at solving problems that require cooperation among agents, the flexibility of the domain-independent planning model allows FMAP to tackle multi-agent planning tasks of any type. In FMAP, agents jointly explore the plan space by building up refinement plans through a complete and flexible forward-chaining partial-order planner. The search is guided by h _{D T G} , a novel heuristic function that is based on the concepts of Domain Transition Graph and frontier state and is optimized to evaluate plans in distributed environments. Agents in FMAP apply an advanced privacy model that allows them to adequately keep private information while communicating only the data of the refinement plans that is relevant to each of the participating agents. Experimental results show that FMAP is a general-purpose approach that efficiently solves tightly-coupled domains that have specialized agents and cooperative goals as well as loosely-coupled problems. Specifically, the empirical evaluation shows that FMAP outperforms current MAP systems at solving complex planning tasks that are adapted from the International Planning Competition benchmarks.     

Coreference resolution: an empirical study based on SemEval-2010 shared Task 1

This paper presents an empirical evaluation of coreference resolution that covers several interrelated dimensions. The main goal is to complete the comparative analysis from the SemEval-2010 task on Coreference Resolution in Multiple Languages. To do so, the study restricts the number of languages and systems involved, but extends and deepens the analysis of the system outputs, including a more qualitative discussion. The paper compares three automatic coreference resolution systems for three languages (English, Catalan and Spanish) in four evaluation settings, and using four evaluation measures. Given that our main goal is not to provide a comparison between resolution algorithms, these are merely used as tools to shed light on the different conditions under which coreference resolution is evaluated. Although the dimensions are strongly interdependent, making it very difficult to extract general principles, the study reveals a series of interesting issues in relation to coreference resolution: the portability of systems across languages, the influence of the type and quality of input annotations, and the behavior of the scoring measures.     

Characterization of beta-adrenergic receptors of freshly isolated astrocytes and neurons from rat brain

The binding and characteristics of rat brain beta-adrenergic receptors (beta-AR) isolated from astrocytes and neurons were investigated. Equilibrium binding experiments demonstrated that beta-AR were more concentrated on astrocytes than on neurons isolated from forebrain, cerebral cortex and cerebellum. Inhibition experiments revealed that beta 1-AR and beta 2-AR were present in the two cell types. Isoproterenol revealed two interchangeable states of high and low affinity binding to both beta 1- and beta 2-AR in neurons. The high affinity binding sites were sensitive to guanylylimidodiphosphate (GppNHp). Similar results were found with other beta-AR agonists but not with salbutamol and salmeterol which recognized both affinity states of the neuronal beta 2-AR but only the low affinity state of beta 1-AR. In astrocytes only the low affinity state of beta-AR was observed.     

Policies regarding public availability of published research data in pediatrics journals

Scientometrics - Sharing research data is an increasingly necessary requirement for the advancement of science. The goal of this paper is twofold. First, to analyze the policies on openness in...     

Evidence for the existence of [3H]-trimetazidine binding sites involved in the regulation of the mitochondrial permeability transition pore

1. Trimetazidine is an anti-ischaemic drug effective in different experimental models but its mechanism of action is not fully understood. Data indicate that mitochondria could be the main target of this drug. The aim of this work was to investigate the binding of [3H]-trimetazidine on a purified preparation of rat liver mitochondria. 2. [3H]-trimetazidine binds to two populations of mitochondrial binding sites with Kd values of 0.96 and 84 microM. The total concentration of binding sites is 113 pmol mg(-1) protein. Trimetazidine binding sites are differently distributed. The high-affinity ones are located on the outer membranes and represent only a small part (4%) of total binding sites, whereas the low-affinity ones are located on the inner membranes and are more abundant (96%) with a Bmax=108 pmol mg(-1) protein. 3. Drug displacement studies with pharmacological markers for different mitochondrial targets showed that [3H]-trimetazidine binding sites are different from previously described mitochondrial sites. 4. The possible involvement of [3H]-trimetazidine binding sites in the regulation of the mitochondrial permeability transition pore (MTP), a voltage-dependent channel sensitive to cyclosporin A, was investigated with mitochondrial swelling experiments. Trimetazidine inhibited the mitochondrial swelling induced by Ca2+ plus tert-butylhydroperoxide (t-BH). This effect was concentration-dependent with an IC50 value of 200 microM. 5. Assuming that trimetazidine effectiveness may be related to its structure as an amphiphilic cation, we compared it with other compounds exhibiting the same chemical characteristic both for their ability to inhibit MTP opening and to displace [3H]-trimetazidine bound to mitochondria. Selected compounds were drugs known to interact with various biological membranes. 6. A strong correlation between swelling inhibition potency and low-affinity [3H]-trimetazidine binding sites was observed: r=0.907 (n=24; P<0.001). 7. These data suggest that mitochondrial sites labelled with [3H]-trimetazidine may be involved in the MTP inhibiton.     

A flexible coupling approach to multi-agent planning under incomplete information

Multi-agent planning (MAP) approaches are typically oriented at solving loosely coupled problems, being ineffective to deal with more complex, strongly related problems. In most cases, agents work under complete information, building complete knowledge bases. The present article introduces a general-purpose MAP framework designed to tackle problems of any coupling levels under incomplete information. Agents in our MAP model are partially unaware of the information managed by the rest of agents and share only the critical information that affects other agents, thus maintaining a distributed vision of the task. Agents solve MAP tasks through the adoption of an iterative refinement planning procedure that uses single-agent planning technology. In particular, agents will devise refinements through the partial-order planning paradigm, a flexible framework to build refinement plans leaving unsolved details that will be gradually completed by means of new refinements. Our proposal is supported with the implementation of a fully operative MAP system and we show various experiments when running our system over different types of MAP problems, from the most strongly related to the most loosely coupled.     

Planning in highly dynamic environments: an anytime approach for planning under time constraints

In this paper, we present a novel and domain-independent planner aimed at working in highly dynamic environments with time constraints. The planner follows the anytime principles: a first solution can be quickly computed and the quality of the final plan is improved as long as time is available. This way, the planner can provide either fast reactions or very good quality plans depending on the demands of the environment. As an on-line planner, it also offers important advantages: our planner allows the plan to start its execution before it is totally generated, unexpected events are efficiently tackled during execution, and sensing actions allow the acquisition of required information in partially observable domains. The planning algorithm is based on problem decomposition and relaxation techniques. The traditional relaxed planning graph has been adapted to this on-line framework by considering information about sensing actions and action costs. Results also show that our planner is competitive with other top-performing classical planners.     

Some improvements for image filtering using peer group techniques

An image pixel peer group is defined as the set of its neighbor pixels which are similar to it according to an appropriate distance or similarity measure. This concept has been successfully used to devise algorithms for detection and suppression of impulsive noise in gray-scale and color images. In this paper, we present a novel peer group-based approach intended to improve the trade-off between computational efficiency and filtering quality of previous peer group-based methods. We improve the computational efficiency by using a modification of a recent approach that can only be applied when the distance or similarity measure used fulfills the so-called triangular inequality property. The improvement of the filtering quality is achieved by the inclusion of a refinement stage in the noise detection. The proposed method performs according to the following steps: First, we partition the image into disjoint blocks and we perform a fast classification of the pixels into three types: non-corrupted, non-diagnosed and corrupted; second, we refine the initial findings by analyzing the non-diagnosed pixels and finally every pixel is classified either as corrupted or non-corrupted. Then, only corrupted pixels are replaced so that uncorrupted image data is preserved. Experimental results suggest that the proposed method is able to outperform state-of-the-art methods both in filtering quality and computational efficiency.