The reliability of consecutive-type systems has been approached from different angles. We present a new method for deriving the generating functions and reliabilities of various consecutive-type systems. Our method, which is based on Feller’s run theory, is easy to implement, and leads to both recursive and non-recursive formulas for the reliability. The non-recursive expression is especially a...

Abstract The spread spectrum communication method has strong anti-noise and anti-fading capability, but it also brings the problem of low information transmission efficiency. paper proposes a multi-channel M-ary method, using recursive decoding algorithm to reduce bit error rate. In combination with channel equalization technique based on virtual time reversal mirror technique, scheme improves ...

A multi-agent coordinate ion is addressed in urban traffic control, which uses the recursive modeling method (RMM) that enables an agent to select its rational act ion by examining with other agents by modeling their decision making in a distributed multi-agent environment. Bayesian learning is used in conjunction with RMM for belief update. Based on this method, a multi-agent traffic control s...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...