Circle formation of weak robots and Lyndon words

In this paper a discrete-time dynamic random graph process is studied that interleaves the birth of nodes and edges with the death of nodes. In this model, at each time step either a new node is added or an existing node is deleted. A node is added with probability p together with an edge incident on it. The node at the other end of this new edge is chosen based on a linear preferential attachment rule. A node (and all the edges incident on it) is deleted with probability q=1−p. The node to be deleted is chosen based on a probability distribution that favors small-degree nodes, in view of recent empirical findings. We analyze the degree distribution of this model and find that the expected fraction of nodes with degree k in the graph generated by this process decreases asymptotically as k−1−(2p/2p−1).     

一种支持自动部署的脚本语言的设计与实现

提出一种主计算平台下的应用编辑脚本语言ACSPT,基于此脚本语言,可构造基于自主计算平台的大规模分布式网络应用。     

Self-deployment of mobile sensors on a ring

Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so as to reach in a finite time a state of static equilibrium in which they uniformly cover the environment. We consider the self-deployment problem in a ring (e.g., a circular rim); in particular we investigate under what conditions the problem is solvable by a collection of identical sensors without a global coordinate system, however capable of determining the location (in their local coordinate system) of the other sensors within a fixed distance (called visibility radius). A self-deployment is exact   if within finite time the distance between any two consecutive sensors along the ring is the same, d$d$; it is ?$?$-approximate   if within finite time the distance between two consecutive sensors is between d−?$d-?$ and d+?$d+?$.