Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree

We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of $O(n\log \Delta)$ bits per node and $O(nD)$ respectively, where $\Delta$ is the highest degree of a node, $n$ is the number of nodes and $D$ is the diameter of the network. In contrast, our algorithm has a space complexity of $O(\log n)$ bits per node, which is optimal for silent-stabilizing spanning trees and runs in $O(n)$ time. In addition, our solution is modular since it utilizes the distributed verification algorithm as an independent subtask of the overall solution. It is possible to use the verification algorithm as a stand alone task or as a subtask in another algorithm. To demonstrate the simplicity of constructing efficient DFS algorithms using the modular approach, We also present a (non-sielnt) self-stabilizing DFS token circulation algorithm for general networks based on our silent-stabilizing DFS tree. The complexities of this token circulation algorithm are comparable to the known ones

Fast and compact self-stabilizing verification, computation, and fault detection of an MST

This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the time complexity significantly, while maintaining space optimality. As a result, we show that optimizing the memory size carries at most a small cost in terms of time, in the context of Minimum Spanning Tree (MST). That is, we present algorithms that are both time and space efficient for both constructing an MST and for verifying it.This involves several parts that may be considered contributions in themselves.First, we generalize the notion of local proofs, trading off the time complexity for memory efficiency. This adds a dimension to the study of distributed local proofs, which has been gaining attention recently. Specifically, we design a (self-stabilizing) proof labeling scheme which is memory optimal (i.e., $O(\log n)$ bits per node), and whose time complexity is $O(\log ^2 n)$ in synchronous networks, or $O(\Delta \log ^3 n)$ time in asynchronous ones, where $\Delta$ is the maximum degree of nodes. This answers an open problem posed by Awerbuch and Varghese (FOCS 1991). We also show that $\Omega(\log n)$ time is necessary, even in synchronous networks. Another property is that if $f$ faults occurred, then, within the requireddetection time above, they are detected by some node in the $O(f\log n)$ locality of each of the faults.Second, we show how to enhance a known transformer that makes input/output algorithms self-stabilizing. It now takes as input an efficient construction algorithm and an efficient self-stabilizing proof labeling scheme, and produces an efficient self-stabilizing algorithm. When used for MST, the transformer produces a memory optimal self-stabilizing algorithm, whose time complexity, namely, $O(n)$, is significantly better even than that of previous algorithms. (The time complexity of previous MST algorithms that used $\Omega(\log^2 n)$ memory bits per node was $O(n^2)$, and the time for optimal space algorithms was $O(n|E|)$.) Inherited from our proof labelling scheme, our self-stabilising MST construction algorithm also has the following two properties: (1) if faults occur after the construction ended, then they are detected by some nodes within $O(\log ^2 n)$ time in synchronous networks, or within $O(\Delta \log ^3 n)$ time in asynchronous ones, and (2) if $f$ faults occurred, then, within the required detection time above, they are detected within the $O(f\log n)$ locality of each of the faults. We also show how to improve the above two properties, at the expense of some increase in the memory

Snap-Stabilizing Committee Coordination

International audienceIn the committee coordination problem, a committee consists of a set of professors and committee meetingsare synchronized, so that each professor participates in at most one committee meeting at a time. Inthis paper, we propose two snap-stabilizing distributed algorithms for the committee coordination. Snapstabilizationis a versatile property which requires a distributed algorithm to efficiently tolerate transientfaults. Indeed, after a finite number of such faults, a snap-stabilizing algorithm immediately operates correctly,without any external intervention. We design snap-stabilizing committee coordination algorithmsenriched with some desirable properties related to concurrency, (weak) fairness, and a stronger synchronizationmechanism called 2-Phase Discussion. In our setting, all processes are identical and each processhas a unique identifier. The existing work in the literature has shown that (1) in general, fairness cannotbe achieved in committee coordination, and (2) it becomes feasible if each professor waits for meetingsinfinitely often. Nevertheless, we show that even under this latter assumption, it is impossible to implementa fair solution that allows maximal concurrency. Hence, we propose two orthogonal snap-stabilizingalgorithms, each satisfying 2-phase discussion, and either maximal concurrency or fairness. The algorithmthat implements fairness requires that every professor waits for meetings infinitely often. Moreover, forthis algorithm, we introduce and evaluate a new efficiency criterion called the degree of fair concurrency.This criterion shows that even if it does not satisfy maximal concurrency, our snap-stabilizing fair algorithmstill allows a high level of concurrency

Snap-Stabilization in Message-Passing Systems

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach, snap-stabilization guarantees that the effect of faults is contained immediately after faults cease to occur. Our contribution is twofold: we show that (1) snap-stabilization is impossible for a wide class of problems if we consider networks with finite yet unbounded channel capacity; (2) snap-stabilization becomes possible in the same setting if we assume bounded-capacity channels. We propose three snap-stabilizing protocols working in fully-connected networks. Our work opens exciting new research perspectives, as it enables the snap-stabilizing paradigm to be implemented in actual networks

Scalable string reconciliation by recursive content-dependent shingling

We consider the problem of reconciling similar strings in a distributed system. Specifically, we are interested in performing this reconciliation in an efficient manner, minimizing the communication cost. Our problem applies to several types of large-scale distributed networks, file synchronization utilities, and any system that manages the consistency of string encoded ordered data. We present the novel Recursive Content-Dependent Shingling (RCDS) protocol that can handle large strings and has the communication complexity that scales with the edit distance between the reconciling strings. Also, we provide analysis, experimental results, and comparisons to existing synchronization software such as the Rsync utility with an implementation of our protocol.2019-12-03T00:00:00

Dynamics of Disks and Warps

This chapter reviews theoretical work on the stellar dynamics of galaxy disks. All the known collective global instabilities are identified, and their mechanisms described in terms of local wave mechanics. A detailed discussion of warps and other bending waves is also given. The structure of bars in galaxies, and their effect on galaxy evolution, is now reasonably well understood, but there is still no convincing explanation for their origin and frequency. Spiral patterns have long presented a special challenge, and ideas and recent developments are reviewed. Other topics include scattering of disk stars and the survival of thin disks.Comment: Chapter accepted to appear in Planets, Stars and Stellar Systems, vol 5, ed G. Gilmore. 32 pages, 17 figures. Includes minor corrections made in proofs. Uses emulateapj.st

Investigation of biological macromolecules using atomic force microscope-based techniques

The atomic force microscope (AFM) provides a powerful instrument for investigating and manipulating biological samples down to the subnanometer scale. In contrast to other microscopy methods, AFM does not require labeling, staining, nor fixation of samples and allows the specimen to be fully hydrated in buffer solution during the experiments. Moreover, AFM clearly compares in resolution to other techniques. In general, the AFM can be operated in an imaging or a force spectroscopy mode. In the present work, advantage was taken of this versatility to investigate single biomolecules and biomolecular assemblies. A novel approach to investigate the visco-elastic behavior of biomolecules under force was established, using dextran as an example. While a molecule tethered between a solid support and the cantilever tip was stretched at a constant velocity, the thermally driven oscillation of the cantilever was recorded. Analysis of the cantilever Brownian noise provided information about the visco-elastic properties of dextran that corresponded well to parameters obtained by alternative methods. However, the approach presented here was easier to implement and less time-consuming than previously used methods. A computer controlled force-clamp system was set up, circumventing the need for custom built analogue electronics. A commercial PicoForce AFM was extended by two computers which hosted data acquisition hardware. While the first computer recorded data, the second computer drove the AFM bypassing the manufacturer's microscope control software. To do so, a software-based proportional-integral-differential (PID) controller was implemented on the second computer. It allowed the force applied to a molecule to be held constant over time. After tuning of the PID controller, response times obtained using that force-clamp setup were comparable to those of the recently reported analogue systems. The performance of the setup was demonstrated by force-clamp unfolding of a pentameric Ig25 construct and the membrane protein NhaA. In the latter case, short-lived unfolding intermediates that were populated for less than 10 ms, could be revealed. Conventional single-molecule dynamic force spectroscopy was used to unfold the serine:threonine antiporter SteT from Bacillus subtilis, an integral membrane protein. Unfolding force patterns revealed the unfolding barriers stabilizing structural segments of SteT. Ligand binding did not induce new unfolding barriers suggesting that weak interactions with multiple structural segments were involved. In contrast, ligand binding caused changes in the energy landscape of all structural segments, thus turning the protein from a brittle, rigid into a more stable, structurally flexible conformation. Functionally, rigidity in the ligand-free state was thought to facilitate specific ligand binding, while flexibility and increased stability were required for conformational changes associated with substrate translocation. These results support the working model for transmembrane transport proteins that provide alternate access of the binding site to either face of the membrane. Finally, high-resolution imaging was exploited to visualize the extracellular surface of Cx26 gap junction hemichannels (connexons). AFM topographs reveal pH-dependent structural changes of the extracellular connexon surface in presence of HEPES, an aminosulfonate compound. At low pH (< 6.5), connexons showed a narrow and shallow channel entrance, which represented the closed pore. Increasing pH values resulted in a gradual opening of the pore, which was reflected by increasing channel entrance widths and depths. At pH > 7.6 the pore was fully opened and the pore diameter and depth did not increase further. Importantly, coinciding with pore gating a slight rotation of the subunits was observed. In the absence of aminosulfonate compounds, such as HEPES, acidification did not affect pore diameters and depths, retaining the open state. Thus, the intracellular concentration of taurine, a naturally abundant aminosulfonate compound, might be used to tune gap junction sensitivity at low pH

An aesthetic for sustainable interactions in product-service systems?

Copyright @ 2012 Greenleaf PublishingEco-efficient Product-Service System (PSS) innovations represent a promising approach to sustainability. However the application of this concept is still very limited because its implementation and diffusion is hindered by several barriers (cultural, corporate and regulative ones). The paper investigates the barriers that affect the attractiveness and acceptation of eco-efficient PSS alternatives, and opens the debate on the aesthetic of eco-efficient PSS, and the way in which aesthetic could enhance some specific inner qualities of this kinds of innovations. Integrating insights from semiotics, the paper outlines some first research hypothesis on how the aesthetic elements of an eco-efficient PSS could facilitate user attraction, acceptation and satisfaction