相关论文: Self-Stabilizing Wavelets and r-Hops Coordination
In this letter a new solvable model of synchronization dynamics is introduced. It consists of a system of long range interacting tops with random precession frequencies. The model allows for an explicit study of orientational effects in…
We consider the problem of self-stabilizing leader election in the population model by Angluin, Aspnes, Diamadi, Fischer, and Peralta (JDistComp '06). The population model is a well-established and powerful model for asynchronous,…
The wavelet transform and related techniques are used to analyze singular and fractal signals. The normalized wavelet scalogram is introduced to detect singularities including jumps, cusps and other sharply changing points. The wavelet…
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to of its numerous applications in industry. However, in practice, task durations are subject to…
Synchronization problems of continuous and discrete singularly perturbed systems are studied in this paper with singular perturbations and time scales (SPaTS) technique. The dynamics of leader and followers are decomposed into pure-slow and…
Small spacecraft now have precise attitude control systems available commercially, allowing them to slew in 3 degrees of freedom, and capture images within short notice. When combined with appropriate software, this agility can…
Leader election is a fundamental problem in distributed computing, particularly within programmable matter systems, where coordination among simple computational entities is crucial for solving complex tasks. In these systems, particles…
The continuous wavelet transform has become a widely used tool in applied science during the last decade. In this article we discuss some generalizations coming from actions of closed subgroups of $\mathrm{GL}(n,\mathbb{R})$ acting on…
The problem of time synchronization in dense wireless networks is considered. Well established synchronization techniques suffer from an inherent scalability problem in that synchronization errors grow with an increasing number of hops…
We introduce a distributed algorithm for clock synchronization in sensor networks. Our algorithm assumes that nodes in the network only know their immediate neighborhoods and an upper bound on the network's diameter. Clock-synchronization…
The TrendLSW R package has been developed to provide users with a suite of wavelet-based techniques to analyse the statistical properties of nonstationary time series. The key components of the package are (a) two approaches for the…
The recent endeavors of the research community to unite efforts on the design and evaluation of congestion control algorithms have created a growing collection of congestion control schemes called Pantheon. However, the virtual network…
A snapshot object simulates the behavior of an array of single-writer/multi-reader shared registers that can be read atomically. Delporte-Gallet et al. proposed two fault-tolerant algorithms for snapshot objects in asynchronous crash-prone…
Dynamic scheduling problems are important optimisation problems with many real-world applications. Since in dynamic scheduling not all information is available at the start, such problems are usually solved by dispatching rules (DRs), which…
We study the self-stabilizing leader election problem in anonymous $n$-nodes networks. Achieving self-stabilization with low space memory complexity is particularly challenging, and designing space-optimal leader election algorithms remains…
This paper studies problems on locally stopping distributed consensus algorithms over networks where each node updates its state by interacting with its neighbors and decides by itself whether certain level of agreement has been achieved…
Clustering is a fundamental data processing task used for grouping records based on one or more features. In the vertically partitioned setting, data is distributed among entities, with each holding only a subset of those features. A key…
Clock synchronization is ubiquitous in wireless systems for communication, sensing and control. In this paper we design a scalable system in which an indefinite number of passively receiving wireless units can synchronize to a single master…
Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by…
Designing reconfiguration schemes for consensus protocols is challenging because subtle corner cases during reconfiguration could invalidate the correctness of the protocol. Thus, most systems that embed consensus protocols conservatively…