Related papers: The Bloom Clock
The time ordering of two spacelike separated events is arbitrary, when all inertial frames are taken into account, but for three or more events it is not generally so. We determine the structure of possible time orderings, or chronologies,…
A quantum clock working as a control device is examined. The quality of the control process is characterized by the magnitude of deviation of perturbed state from unperturbed state of the controlled system. Uncertainty relations that relate…
Even in the absence of clocks, time bounds on the duration of actions enable the use of time for distributed coordination. This paper initiates an investigation of coordination in such a setting. A new communication structure called a…
Algorithms for the synchronisation of clocks across networks are both common and important within distributed systems. We here address not only the formal modelling of these algorithms, but also the formal verification of their behaviour.…
A new idea for a binary clock is presented. It displays the time using a triangular array of 15 bits. It is shown that such a geometric, triangular arrangement is only possible because our system of time divisions is based on a sexagesimal…
Multi-threaded programs are challenging to write. Developers often need to reason about a prohibitively large number of thread interleavings to reason about the behavior of software. A non-interference property like atomicity can reduce…
A possible mechanism of time is formulated by developing an idea of time replaced by quantum correlations, with the aid of modern quantum information theory. We invent a microscopic model, where correlations of a closed system are steadily…
In an apparently unexplored region of relativistic spacetime, a simple thought experiment demonstrates that conjoined Lorentz transformations predict a proper clock at rest will run backwards and that prediction violates the logical…
A filter is a widely used data structure for storing an approximation of a given set $S$ of elements from some universe $U$ (a countable set).It represents a superset $S'\supseteq S$ that is ''close to $S$'' in the sense that for $x\not\in…
The question how complex systems become more organized and efficient with time is open. Examples are, the formation of elementary particles from pure energy, the formation of atoms from particles, the formation of stars and galaxies, the…
Learned Bloom Filters, i.e., models induced from data via machine learning techniques and solving the approximate set membership problem, have recently been introduced with the aim of enhancing the performance of standard Bloom Filters,…
Time ordering may be defined by first defining the limit of no time ordering (NTO) in terms of a time average of an external interaction, V(t). Previously, time correlation was defined in terms of a similar limit called the independent time…
We demonstrate how one can distinguish a curved 4-dimensional spacetime from a flat one, when it is possible, relying only on the causality relations between events. It is known that it is possible only for spacetimes that are not…
We theoretically analyse an autonomous clock comprising a nanoelectromechanical system, which undergoes self-oscillations driven by electron tunnelling. The periodic mechanical motion behaves as the clockwork, similar to the swinging of a…
A long noted difficulty when assessing the reliability (or calibration) of forecasting systems is that reliability, in general, is a hypothesis not about a finite dimensional parameter but about an entire functional relationship. A…
Active atomic clocks are predicted to provide far better short-term stability and robustness against thermal fluctuations than typical feedback-based optical atomic clocks. However, continuous laser operation using an ensemble of clock…
Fault tree analysis is a technique widely used in risk and reliability analysis of complex engineering systems given its deductive nature and relatively simple interpretation. In a fault tree, events are usually represented by a binary…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
Circadian oscillation provides selection advantages through synchronization to the daylight cycle. However, a reliable clock must be designed through two conflicting properties: entrainability to synchronize internal time with periodic…
This paper examines synchronization of computer clocks connected via a data network and proposes a skewless algorithm to synchronize them. Unlike existing solutions, which either estimate and compensate the frequency difference (skew) among…