Mother of Perpetual Help Church of the Deaf, March 8, 1992

A newsletter published for Deaf Catholics in Omaha, N

The Cowl - v.25- n.20 - Dec 19, 1972

The Cowl - student newspaper of Providence College. Volume 25, Number 20 - December 19, 1972. 2 pages. Note: The volume number printed on the banner page of this issue (XXV) duplicates the volume number for 1962-63 academic year

Imperfect justice : Fritz Lang's Fury (1936) and cinema's use of the trial form

This essay examines Fritz Lang's portrayal and use of justice in his first Hollywood film, Fury (1936) a film in which the main character, Joe Wilson (played by Spencer Tracy) is mistakenly arrested for a crime he did not commit. Lang was one of many notable German émigrés who fled Nazi Germany for America and eventually Hollywood. He returned on several occasions to the theme of justice, which is my starting point for this article. Before analysing Fury in detail, in particular its final trial scene, the article compares the film briefly to other Lang films about the law such as Beyond a Reasonable Doubt. Lang's conception of justice differs from the dominant Hollywood view of the law, a realisation that is discussed in relation to other depictions of the law in Hollywood (such as Twelve Angry Men, To Kill a Mockingbird). In Lang's cinema, the law is not a fixed, stable and trustworthy institution, but rather one that is gullible and open to abuse. Lang places more faith in notions of personal moral justice, which win out in the end in Fury. This article also contextualises Fury and the work of Fritz Lang within existing discussions of the law and film, from which Lang is largely and notably absent

Cajun News from the Lafayette Catholic Deaf Center, December 1984

A newsletter published for Deaf Catholics in Lafayette, L

Clustering algorithm in initialization of multi-hop wireless sensor networks

In most application scenarios of wireless sensor networks (WSN), sensor nodes are usually deployed randomly and do not have any knowledge about the network environment or even their ID's at the initial stage of their operations. In this paper, we address the clustering problems with a newly deployed multi-hop WSN where most existing clustering algorithms can hardly be used due to the absence of MAC link connections among the nodes. We propose an effective clustering algorithm based on a random contention model without the prior knowledge of the network and the ID's of nodes. Computer simulations have been used to show the effectiveness of the algorithm with a relatively low complexity if compared with existing schemes

Lower bounds on systolic gossip

AbstractGossiping is an extensively investigated information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In this paper we provide an innovative and general lower bound technique relying on the novel notion of delay digraph of a gossiping protocol and on the use of matrix norm methods. Such a technique is very powerful and allows the determination of new and significantly improved lower bounds in many cases. In fact, we derive the first general lower bound on the gossiping time of systolic protocols, i.e., constituted by a periodic repetition of simple communication steps. In particular, given any network of n processors and any systolic period s, in the directed and the undirected half-duplex cases every s-systolic gossip protocol takes at least log(n)/log(1/λ)−O(loglog(n)) time steps, where λ is the unique solution between 0 and 1 of λ·p⌊s/2⌋(λ)·p⌈s/2⌉(λ)=1, with pi(λ)=1+λ2+⋯+λ2i−2 for any integer i>0. We then provide improved lower bounds in the directed and half-duplex cases for many well-known network topologies, such as Butterfly, de Bruijn, and Kautz graphs. All the results are extended also to the full-duplex case. Our technique is very general, as for s→∞ it allows the determination of improved results even for non-systolic protocols. In fact, for general networks, as a simple corollary it yields a lower bound only an O(loglog(n)) additive factor far from the general one independently proved in [Proc. 1st ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1989, p. 318; Topics in Combinatorics and Graph Theory (1990) 451; SIAM Journal on Computing 21(1) (1992) 111; Discrete Applied Mathematics 42 (1993) 75] for all graphs and any (non-systolic) gossip protocol. Moreover, for specific networks, it significantly improves with respect to the previously known results, even in the full-duplex case. Correspondingly, better lower bounds on the gossiping time of non-systolic protocols are determined in the directed, half-duplex and full-duplex cases for Butterfly, de Bruijn, and Kautz graphs. Even if in this paper we give only a limited number of examples, our technique has wide applicability and gives a general framework that often allows to get improved lower bounds on the gossiping time of systolic and non-systolic protocols in the directed, half-duplex and full-duplex cases

The National Deaf Cursillo Newsletter de Colores!, January-February 1988

A newsletter published for Deaf Catholics in Louisville, K

Graph- versus Vector-Based Analysis of a Consensus Protocol

The Paxos distributed consensus algorithm is a challenging case-study for standard, vector-based model checking techniques. Due to asynchronous communication, exhaustive analysis may generate very large state spaces already for small model instances. In this paper, we show the advantages of graph transformation as an alternative modelling technique. We model Paxos in a rich declarative transformation language, featuring (among other things) nested quantifiers, and we validate our model using the GROOVE model checker, a graph-based tool that exploits isomorphism as a natural way to prune the state space via symmetry reductions. We compare the results with those obtained by the standard model checker Spin on the basis of a vector-based encoding of the algorithm.Comment: In Proceedings GRAPHITE 2014, arXiv:1407.767

Book Review: Gabriela Mistral: The Audacious Traveler

Review of Gabriela Mistral: The Audacious Traveler, edited by Marjorie Agosí

A NOTE ON THE DIMENSIONALITY OF MODIFIED KNÖDEL GRAPHS

International audienceWe show that the edges of the modi ed Kn odel graph can be grouped into dimensions which are similar to the dimensions of hypercubes. In particular, routing, broadcasting and gossiping, can be done easily in modi ed Kn odel graphs using these dimensions