Related papers: Comments on "IEEE 1588 Clock Synchronization using…
This paper studies output synchronization problems for heterogeneous networks of continuous- or discrete-time right-invertible linear agents in presence of unknown, non-uniform and arbitrarily large input delay based on localized…
The vast majority of hardware architectures use a carefully timed reference signal to clock their computational logic. However, standard distribution solutions are not fault-tolerant. In this work, we present a simple grid structure as a…
The chaotic dynamics of fractional order systems begin to attract much attentions in recent years. In this brief report, we study the master-slave synchronization of fractional order chaotic systems. It is shown that fractional order…
Recently, the problem of multitasking scheduling has attracted a lot of attention in the service industries where workers frequently perform multiple tasks by switching from one task to another. Hall, Leung and Li (Discrete Applied…
This paper is devoted to the problem of time parallelization of assimilation methods applying on unbounded time domain. In this way, we present a general procedure to couple the Luenberger observer with time parallelization algorithm. Our…
We investigate synchronization in the presence of delay time modulation for application to communication. We have observed that the robust synchronization is established by a common delay signal and its threshold is presented using Lyapunov…
We propose a multi party quantum clock synchronization protocol that makes optimal use of the maximal multipartite entanglement of GHZ-type states. To realize the protocol, different versions of maximally entangled eigenstates of collective…
A new method of virtual unknown parameter is proposed to synchronize two different systems with unknown parameters and disturbance in finite time. Virtual unknown parameters are introduced in order to avoid the unknown parameters from…
We formulate an attention mechanism for continuous and ordered sequences that explicitly functions as an alignment model, which serves as the core of many sequence-to-sequence tasks. Standard scaled dot-product attention relies on…
We study the problem of clock synchronization in a networked system with arbitrary starts for all nodes. We consider a synchronous network of $n$ nodes, where each node has a local clock that is an integer counter. Eventually, clocks must…
Output feedback controlled synchronization problems for a class of nonlinear unstable systems under information constraints imposed by limited capacity of the communication channel are analyzed. A binary time-varying coder-decoder scheme is…
This tutorial, addressing physics teachers and undergraduate students, aims at clarifying some aspects of time in special relativity. In particular, time dilation is usually presented only as the well-known ratio of lab time over proper…
Recent studies show indication of the effectiveness of synchronization as a data assimilation tool for small or meso-scale forecast when less number of variables are observed frequently. Our main aim here is to understand the effects of…
Reordering poses a major challenge in machine translation (MT) between two languages with significant differences in word order. In this paper, we present a novel reordering approach utilizing sparse features based on dependency word pairs.…
We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by agents. Each job is associated with release time, deadline, and processing time such that it can be…
Two-way fiber-optic time transfer is a promising precise time synchronization technique with sub-nanosecond accuracy. However, asymmetric delay attack is a serious threat which cannot be prevent by any encryption method. In this paper, a…
Mutual localization stands as a foundational component within various domains of multi-robot systems. Nevertheless, in relative pose estimation, time synchronization is usually underappreciated and rarely addressed, although it…
This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later…
Synchronizing clocks in distributed systems is well-understood, both in terms of fault-tolerance in fully connected systems and the dependence of local and global worst-case skews (i.e., maximum clock difference between neighbors and…
While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we propose in this work mixed integer formulations. We consider a single machine scheduling problem that aims…