The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

Observation of an optical phonon band in situ in TiO electrochemistry:A possible indicator of strongly trapped intermediates in the O evolution reaction

This Letter reports in situ Fourier transform infrared (FTIR) spectroscopic data on thermal TiO films fabricated by heating titanium plates in air at 475, 700 and 800 °C. The films were studied in the dark and under UV-irradiation in aqueous 0.1MNaClO in the presence and absence of 0.1 M Na(OOC) and at 10, 25 and 50 °C. The film fabricated at 800 °C showed a broad feature near 1580cm under UV-irradiation that was not observed in the dark, whilst the films fabricated at lower temperatures, 475 and 700 °C, showed no such feature. This feature appears to be associated with the accumulation of surface-mobile holes at the complex, porous film-electrolyte interface and the capacity of such holes to enhance the absorption cross-section of optical phonons characteristic of the rutile crystal form at and near the surface of the TiO/electrolyte interface. © 2001 Elsevier Science B.V.

Oxidized LDL and AGE-LDL in circulating immune complexes strongly predict progression of carotid artery IMT in type 1 diabetes

Over 90% of modified LDL in circulation is associated to specific antibodies circulating as part of immune complexes (IC); however, few studies have examined their relationship with cardiovascular disease.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

NFA decomposition and multiprocessing architecture for parallel regular expression processing

This work presents a novel algorithm for decomposing NFA automata into one-state-active modules for parallel execution on Multiprocessor Systems on Chip (MP-SoC). Furthermore, performance related studies based on a 16-PE system for Snort, Bro and Linux-L7 regular expressions are presented. ©2009 IEEE.

Evidence for a glassy state in strongly driven carbon

Here, we report results of an experiment creating a transient, highly correlated carbon state using a combination of optical and x-ray lasers. Scattered x-rays reveal a highly ordered state with an electrostatic energy significantly exceeding the thermal energy of the ions. Strong Coulomb forces are predicted to induce nucleation into a crystalline ion structure within a few picoseconds. However, we observe no evidence of such phase transition after several tens of picoseconds but strong indications for an over-correlated fluid state. The experiment suggests a much slower nucleation and points to an intermediate glassy state where the ions are frozen close to their original positions in the fluid.

Tangible applications for regular objects:An end-user model for pervasive computing at home

This paper describes an end-user model for a domestic pervasive computing platform formed by regular home objects. The platform does not rely on pre-planned infrastructure; instead, it exploits objects that are already available in the home and exposes their joint sensing, actuating and computing capabilities to home automation applications. We advocate an incremental process of the platform formation and introduce tangible, object-like artifacts for representing important platform functions. One of those artifacts, the application pill, is a tiny object with a minimal user interface, used to carry the application, as well as to start and stop its execution and provide hints about its operational status. We also emphasize streamlining the user's interaction with the platform. The user engages any UI-capable object of his choice to configure applications, while applications issue notifications and alerts exploiting whichever available objects can be used for that purpose. Finally, the paper briefly describes an actual implementation of the presented end-user model. © (2010) by International Academy, Research, and Industry Association (IARIA).

Low-energy behavior of strongly interacting bosons on a flat-band lattice above the critical filling factor

Bosons interacting repulsively on a lattice with a flat lowest band energy dispersion may, at sufficiently small filling factors, enter into a Wigner-crystal-like phase. This phase is a consequence of the dispersionless nature of the system, which in turn implies the occurrence of single-particle localized eigenstates. We investigate one of these systems-the sawtooth lattice-filled with strongly repulsive bosons at filling factors infinitesimally above the critical point where the crystal phase is no longer the ground state. We find, in the hard-core limit, that the crystal retains its structure in all but one of its cells, where it is broken. The broken cell corresponds to an exotic kind of repulsively bound state, which becomes delocalized. We investigate the excitation spectrum of the system analytically and find that the bound state behaves as a single particle hopping on an effective lattice with reduced periodicity, and is therefore gapless. Thus, the addition of a single particle to a flat-band system at critical filling is found to be enough to make kinetic behavior manifest.