A Message Passing Strategy for Decentralized Connectivity Maintenance in Agent Removal

In a multi-agent system, agents coordinate to achieve global tasks through local communications. Coordination usually requires sufficient information flow, which is usually depicted by the connectivity of the communication network. In a networked system, removal of some agents may cause a disconnection. In order to maintain connectivity in agent removal, one can design a robust network topology that tolerates a finite number of agent losses, and/or develop a control strategy that recovers connectivity. This paper proposes a decentralized control scheme based on a sequence of replacements, each of which occurs between an agent and one of its immediate neighbors. The replacements always end with an agent, whose relocation does not cause a disconnection. We show that such an agent can be reached by a local rule utilizing only some local information available in agents' immediate neighborhoods. As such, the proposed message passing strategy guarantees the connectivity maintenance in arbitrary agent removal. Furthermore, we significantly improve the optimality of the proposed scheme by incorporating $\delta$-criticality (i.e. the criticality of an agent in its $\delta$-neighborhood).Comment: 9 pages, 9 figure

Homotopy K3's with several symplectic structures

In this note we prove that, for any integer n, there exist a smooth 4-manifold, homotopic to a K3 surface, defined by applying the link surgery method of Fintushel-Stern to a certain 2-component graph link, which admits n inequivalent symplectic structures Keywords: Symplectic topology of 4-manifolds; Seiberg-Witten theoryComment: Version 2: a few minor corrections from version 1. Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol5/paper8.abs.htm

Advances in the numerical treatment of grain-boundary migration: Coupling with mass transport and mechanics

This work is based upon a coupled, lattice-based continuum formulation that was previously applied to problems involving strong coupling between mechanics and mass transport; e.g. diffusional creep and electromigration. Here we discuss an enhancement of this formulation to account for migrating grain boundaries. The level set method is used to model grain-boundary migration in an Eulerian framework where a grain boundary is represented as the zero level set of an evolving higher-dimensional function. This approach can easily be generalized to model other problems involving migrating interfaces; e.g. void evolution and free-surface morphology evolution. The level-set equation is recast in a remarkably simple form which obviates the need for spatial stabilization techniques. This simplified level-set formulation makes use of velocity extension and field re-initialization techniques. In addition, a least-squares smoothing technique is used to compute the local curvature of a grain boundary directly from the level-set field without resorting to higher-order interpolation. A notable feature is that the coupling between mass transport, mechanics and grain-boundary migration is fully accounted for. The complexities associated with this coupling are highlighted and the operator-split algorithm used to solve the coupled equations is described.Comment: 28 pages, 9 figures, LaTeX; Accepted for publication in Computer Methods in Applied Mechanics and Engineering. [Style and formatting modifications made, references added.