It is a challenge to specify unambiguous distance (UD) in a phase-based ranging system with hopping frequencies (PRSHF). In this letter, we propose to characterize the UD in a PRSHF by the probability that it takes on its maximum value. We obtain a very simple and elegant expression of the probability with growth estimation techniques from analytic number theory. It is revealed that the UD in a...

Please note that technical editing may introduce minor changes to the text and/or graphics, which may alter content. The journal’s standard Terms & Conditions and the Ethical guidelines still apply. In no event shall the Royal Society of Chemistry be held responsible for any errors or omissions in this Accepted Manuscript or any consequences arising from the use of any information it contains. ...

The algorithm of solution of discrete periodic Riccati equation which arises, in particular, in problems of synthesis of system of stabilization of the hopping robot is offered. In this algorithm it is removed a number of restrictions on matrix coefficients of the equation which are peculiar to existing algorithms. It is essential, that this algorithm allows to use at the realization of procedu...

A new method is introduced allowing to solve exactly the reactions A+A→inert and A+A→A on the 1D lattice with synchronous diffusional dynamics (simultaneous hopping of all particles). Exact connections are found relating densities and certain correlation properties of these two reactions at all times. Asymptotic behavior at large times as well as scaling form describing the regime of low initia...

In this work, we have studied the invariants of motion of two SU (N) super-symmetric t-J models of 1/r 2 hopping and exchange in one dimension. The first model is defined on a lattice of equal spaced sites, and the second on a non-equal spacing lattice. Using the " exchange operator formalism " , we are able to construct all the invariants for the models, by mapping the systems to mixtures of f...

A mechanism called Eligibility Propagation is proposed to speed up the Time Hopping technique used for faster Reinforcement Learning in simulations. Eligibility Propagation provides for Time Hopping similar abilities to what eligibility traces provide for conventional Reinforcement Learning. It propagates values from one state to all of its temporal predecessors using a state transitions graph....

An F-TDMA (Frequency and Time Division Multiple Access) based mobile radio system using both Dynamic Channel Allocation (DCA) and Frequency Hopping (FH) is investigated in this work. This paper follows [1] and [2], where the same Authors proposed a new Interference Adaptive DCA algorithm that is suitably designed for a network implementing FH. The role played jointly by the Power Control and Ha...

Hölder continuity, |Nλ(E) − Nλ(E )| ≤ C|E − E|, with a constant C independent of the disorder strength λ is proved for the integrated density of states Nλ(E) associated to a discrete random operator H = Ho + λV consisting of a translation invariant hopping matrix Ho and i.i.d. single site potentials V with an absolutely continuous distribution, under a regularity assumption for the hopping term.