Iterative Approximate Consensus in the presence of Byzantine Link Failures

This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free. Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain only a small amount of memory across iterations [22, 21, 23, 12]. However, to the best of our knowledge, we are the first to consider approximate consensus in the presence of Byzan- tine links. We extend our past work that provided exact characterization of graphs in which the iterative approximate consensus problem in the presence of Byzantine node failures is solvable [22, 21]. In particular, we prove a tight necessary and sufficient condition on the underlying com- munication graph for the existence of iterative approximate consensus algorithms under transient Byzantine link model. The condition answers (part of) the open problem stated in [16].Comment: arXiv admin note: text overlap with arXiv:1202.609

A Lightweight Content Replication Scheme for Mobile Ad Hoc Environments

The mobile, wireless, and self-organizing features of ad hoc networks pose many challenges with respect to continuous availability and accessibility of data. In such a dynamic environment, there are many advantages in replicating a data item so there are multiple copies, including reduced response times and higher data availability. Also, if done efficiently, replication can help reduce energy usage. In this paper, we propose the Expanding Ring replication strategy for pull-based information dissemination environments. One of our primary objectives is the development of a lightweight scheme for mobile nodes. We evaluate the performance of our scheme with respect to a number of parameters and compare it to a system without replication. Our results show a reduction in the average response times and the message processing overhead on nodes. The scheme also does well when both, the overall willingness of nodes to cache data and their individual caching capabilities vary

Oxidative stress causes ERK phosphorylation and cell death in cultured retinal pigment epithelium: Prevention of cell death by AG126 and 15-deoxy-delta 12, 14-PGJ(2)

BACKGROUND: The retina, which is exposed to both sunlight and very high levels of oxygen, is exceptionally rich in polyunsaturated fatty acids, which makes it a favorable environment for the generation of reactive oxygen species. The cytotoxic effects of hydrogen peroxide (H(2)O(2)) induced oxidative stress on retinal pigment epithelium were characterized in this study. METHODS: The MTT cell viability assay, Texas-Red phalloidin staining, immunohistochemistry and Western blot analysis were used to assess the effects of oxidative stress on primary human retinal pigment epithelial cell cultures and the ARPE-19 cell line. RESULTS: The treatment of retinal pigment epithelial cells with H(2)O(2 )caused a dose-dependent decrease of cellular viability, which was preceded by a significant cytoskeletal rearrangement, activation of the Extracellular signal-Regulated Kinase, lipid peroxidation and nuclear condensation. This cell death was prevented partially by the prostaglandin derivative, 15d-PGJ(2 )and by the protein kinase inhibitor, AG126. CONCLUSION: 15d-PGJ(2 )and AG126 may be useful pharmacological tools in the future capable of preventing oxidative stress induced RPE cell death in human ocular diseases

Antimicrobial activity of Ti-ZrN/Ag coatings for use in biomaterial applications

Severely broken bones often require external bone fixation pins to provide support but they can become infected. In order to reduce such infections, novel solutions are required. Titanium zirconium nitride (Ti-ZrN) and Ti-ZrN silver (Ti-ZrN/Ag) coatings were deposited onto stainless steel. Surface microtopography demonstrated that on the silver containing surfaces, Sa and Sv values demonstrated similar trends whilst the Ra, average height and RMS value and Sp values increased with increasing silver concentration. On the Ti-ZrN/Ag coatings, surface hydrophobicity followed the same trend as the Sa and Sv values. An increase in dead Staphylococcus aureus and Staphylococcus epidermidis cells was observed on the coatings with a higher silver concentration. Using CTC staining, a significant increase in S. aureus respiration on the silver containing surfaces was observed in comparison to the stainless steel control whilst against S. epidermidis, no significant difference in viable cells was observed across the surfaces. Cytotoxicity testing revealed that the TiZrN coatings, both with and without varying silver concentrations, did not possess a detrimental effect to a human monocyte cell line U937. This work demonstrated that such coatings have the potential to reduce the viability of bacteria that result in pin tract infections

A systolic algorithm for hidden surface removal

With the advent of VLSI it has become possible to map parallel algorithms for compute-bound problems directly on silicon. Systolic architecture is very good candidate for VLSI implementation because of its regular and simple design, and regular communication pattern. In this paper, a systolic algorithm and corresponding systolic architecture, a linear systolic array, for the scanline-based hidden surface removal problem in three-dimensional computer graphics have been proposed. The algorithm is based on the concept of sample spans or intervals. The worst case time taken by the algorithm is O(n), n being the number of segments in a scanline. The time taken by the algorithm for a given scene depends on the scene itself, and on an average considerable improvement over the worst case behaviour is expected. A pipeline scheme for handling the I/O process has also been proposed which is suitable for VLSI implementation of the algorithm