1,720,968 research outputs found
Knowledge management and routing in embodied agents networks
No full textCurrent work refers to the effort of our group to extend abilities and functionalities of embodied agents closely connected in a communication network. The capability to develop a collective and social intelligence in poor communication conditions, demands for an effective sharing of knowledge among the agents. The key is to optimize the communication and the information/knowledge flow from the source towards the target nodes. Alarm management, cooperative target recognition, shared learning, imitation learning all take advantage of an effective knowledge sharing management. Being the timing controlled by the external events, the challenge becomes to define the reaching limit of information and knowledge: This limit is critical for the best reaction of the system to the environmental solicitations. The Knowledge Horizon concept is the consequence: A spatial region and its relevant set of nodes/agents that is the limit of data propagation, determined by the communication channel, by the timing of external events and by the payload to be transferred. In this first stage of the work we propose a shortest path approach that, given an estimate of the delays on each arc of the communication network and an estimate of the dynamics of an external event, can determine both the set of nodes in the knowledge horizon and a multicast strategy to efficiently forward the information to it. © IFAC
Large and dense swarms: Simulation of a shortest path alarm propagation
No full textThis paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs) and describes the verification process of the derived algorithm results by means of two simulation tools realized by the authors. A collision-free communication protocol has been developed, tailored to a case where a single AUV needs to send a message to a specific subset of swarm members regarding a perceived danger. The protocol includes a handshaking procedure that creates a silence region before the transmission of the message obtained through specific acoustic tones out of the normal transmission frequencies or through optical signals. This region will include all members of the swarm involved in the alarm message and their neighbours, preventing collisions between them. The AUV sending messages to a target area computes a delay function on appropriate arcs and runs a Dijkstra-like algorithm obtaining a multicast tree. After an explanation of the whole building of this collision-free multicast tree, a simulation has been carried out assuming different scenarios relevant to swarm density, signal power of the modem and the geometrical configuration of the nodes. © 2015 Author(s). Licensee InTech
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
Full text linkWe introduce a family of reductions for removing proper and homogeneous pairs of cliques
from a graph G. This family generalizes some reductions presented in the literature, mostly in
the context of claw-free graphs. We show that these reductions can be embedded in a simple
algorithm that in at most jE(G)j steps builds a new graph G0
such that G0
has no proper and
homogeneous pairs of cliques, and G and G0
agree on the value of some relevant invariant (or
property)
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
