15,975 research outputs found

    Finite-time Convergent Gossiping

    Full text link
    Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to analyzing and improving the asymptotic rate of convergence for gossip algorithms. In this work we study finite-time convergence of deterministic gossiping. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists an asymmetric gossip algorithm with finite-time convergence, independent of the number of nodes. For n=2mn=2^m nodes, we prove that a fastest convergence can be reached in nm=nlog2nnm=n\log_2 n node updates via symmetric gossiping. On the other hand, under asymmetric gossip among n=2m+rn=2^m+r nodes with 0r<2m0\leq r<2^m, it takes at least mn+2rmn+2r node updates for achieving finite-time convergence. It is also shown that the existence of finite-time convergent gossiping often imposes strong structural requirements on the underlying interaction graph. Finally, we apply our results to gossip algorithms in quantum networks, where the goal is to control the state of a quantum system via pairwise interactions. We show that finite-time convergence is never possible for such systems.Comment: IEEE/ACM Transactions on Networking, In Pres

    Alloying effect on the ideal tensile strength of ferromagnetic and paramagnetic bcc iron

    Get PDF
    Using \emph{ab initio} alloy theory formulated within the exact muffin-tin orbitals theory in combination with the coherent potential approximation, we investigate the ideal tensile strength (ITS) in the [001][001] direction of bcc ferro-/ferrimagnetic (FFM) and paramagnetic (PM) Fe1xMx_{1-x}M_{x} (M=M= Al, V, Cr, Mn, Co, or Ni) random alloys. The ITS of ferromagnetic (FM) Fe is calculated to be 12.612.6\,GPa, in agreement with available data, while the PM phase turns out to posses a significantly lower value of 0.70.7\,GPa. Alloyed to the FM matrix, we predict that V, Cr, and Co increase the ITS of Fe, while Al and Ni decrease it. Manganese yields a weak non-monotonic alloying behavior. In comparison to FM Fe, the alloying effect of Al and Co to PM Fe is reversed and the relative magnitude of the ITS can be altered more strongly for any of the solutes. All considered binaries are intrinsically brittle and fail by cleavage of the (001)(001) planes under uniaxial tensile loading in both magnetic phases. We show that the previously established ITS model based on structural energy differences proves successful in the PM Fe-alloys but is of limited use in the case of the FFM Fe-based alloys. The different performance is attributed to the specific interplay between magnetism and volume change in response to uniaxial tension. We establish a strong correlation between the compositional effect on the ITS and the one on the shear elastic constant CC' for the PM alloys and briefly discuss the relation between hardenability and the ITS.Comment: 6 figure

    Remote State Estimation with Smart Sensors over Markov Fading Channels

    Full text link
    We consider a fundamental remote state estimation problem of discrete-time linear time-invariant (LTI) systems. A smart sensor forwards its local state estimate to a remote estimator over a time-correlated MM-state Markov fading channel, where the packet drop probability is time-varying and depends on the current fading channel state. We establish a necessary and sufficient condition for mean-square stability of the remote estimation error covariance as ρ2(A)ρ(DM)<1\rho^2(\mathbf{A})\rho(\mathbf{DM})<1, where ρ()\rho(\cdot) denotes the spectral radius, A\mathbf{A} is the state transition matrix of the LTI system, D\mathbf{D} is a diagonal matrix containing the packet drop probabilities in different channel states, and M\mathbf{M} is the transition probability matrix of the Markov channel states. To derive this result, we propose a novel estimation-cycle based approach, and provide new element-wise bounds of matrix powers. The stability condition is verified by numerical results, and is shown more effective than existing sufficient conditions in the literature. We observe that the stability region in terms of the packet drop probabilities in different channel states can either be convex or concave depending on the transition probability matrix M\mathbf{M}. Our numerical results suggest that the stability conditions for remote estimation may coincide for setups with a smart sensor and with a conventional one (which sends raw measurements to the remote estimator), though the smart sensor setup achieves a better estimation performance.Comment: The paper has been accepted by IEEE Transactions on Automatic Control. Copyright may be transferred without notice, after which this version may no longer be accessibl

    Multi-armed Bandit Learning on a Graph

    Full text link
    The multi-armed bandit(MAB) problem is a simple yet powerful framework that has been extensively studied in the context of decision-making under uncertainty. In many real-world applications, such as robotic applications, selecting an arm corresponds to a physical action that constrains the choices of the next available arms (actions). Motivated by this, we study an extension of MAB called the graph bandit, where an agent travels over a graph trying to maximize the reward collected from different nodes. The graph defines the freedom of the agent in selecting the next available nodes at each step. We assume the graph structure is fully available, but the reward distributions are unknown. Built upon an offline graph-based planning algorithm and the principle of optimism, we design an online learning algorithm that balances long-term exploration-exploitation using the principle of optimism. We show that our proposed algorithm achieves O(STlog(T)+DSlogT)O(|S|\sqrt{T}\log(T)+D|S|\log T) learning regret, where S|S| is the number of nodes and DD is the diameter of the graph, which is superior compared to the best-known reinforcement learning algorithms under similar settings. Numerical experiments confirm that our algorithm outperforms several benchmarks. Finally, we present a synthetic robotic application modeled by the graph bandit framework, where a robot moves on a network of rural/suburban locations to provide high-speed internet access using our proposed algorithm
    corecore