1,721,009 research outputs found
The Multi-interval Ulam-Rényi Game
No full textWe try to help Paul and Pinocchio to deserve their trip to Venice where they are planning to continue a 50-year long competition in the 20 question game with lies
Boolean Routing on Chordal Rings
No full text. In this paper we consider the problem of routing messages in a network of processors configured as a chordal ring. In particular we refer to the Boolean Routing model, and we introduce a new routing function for unidirectional and bidirectional chordal rings with degree four. This function requires O(n log n) bits of storage and O(n) time to compute, in the worst case. We also study some relations between our technique and Interval Routing Schemes. 1 Introduction Solving a routing problem consists of defining a way in which entities that are physically separated can communicate. If the two entities that want to communicate are directly connected, the routing is straightforward, since the message is sent on the edge that connects the two. If the two entities are not directly connected a path between them has to be found. We model the network with a connected graph G = (V; E) where V is the set of the nodes, jV j = n, and E is the set of edges. For each node i, i = 1; : : : ; n, d i ..
Fault-tolerant support for reliable multicast in mobile wireless systems
No full textAbstract. In this paper we present a protocol for reliable multicast within a group of mobile hosts that communicate with a wired infrastructure by means of wireless technology. The protocol tolerates failures in the wired infrastructure, i.e., crashes of stationary hosts and partitions of wired links. The wireless coverage may be incomplete and message losses could occur even within cells, due to physical obstructions or to the high error rate of the wireless technology, for example. Movements of mobile hosts are accommodated efficiently because they do not trigger any interaction among stationary hosts (i.e., there is no notion of handoff). We evaluate by simulation the impact of fault-tolerance on the performance of the protocol in normal operating conditions, i.e., in the absence of failures. The results obtained show that the increase in the average latency experienced by messages is limited to few milliseconds.
Distance Routing: a New Compact Routing Technique on Series Parallel Networks
No full textWe consider the problem of routing messages on networks modeled by Series Parallel Graphs (SPGs), and we introduce a new technique, called Distance Routing (DR). We first present an algorithm that computes shortest path DR on directed SPGs, and we show how to apply to these networks the shortest path 1-Interval Routing, one of the most common compact routing techniques. We also compute and compare the complexities of these two techniques showing the strong advantage of DR especially in terms of time complexity. We then show how Distance Routing can be used to route on bidirectional SPGs, where no general shortest path 1-Interval Routing Scheme can be applied
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
- …
