Aiming at the problem of mutual interference between nodes and external malicious jamming in wireless communication networks, this paper proposes an intelligent anti-jamming algorithm based on distributed double Q-learning. First all, proposed is modeled as a time-frequency two-dimensional optimization problem. The decoupled relationship subframe channel used. Each node uses two According to au...

We present a square root algorithm in Fq which generalizes Atkins’s square root algorithm [6] for q ≡ 5 (mod 8) and Kong et al.’s algorithm [8] for q ≡ 9 (mod 16). Our algorithm precomputes a primitive 2-th root of unity ξ where s is the largest positive integer satisfying 2|q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square roo...

Let XP(/, //, [ ]) be the fragment of XPath 1.0, consisting of queries that involve only the child and descendant axes, and predicates without disjunction or negation (and no wildcard nodetests); these queries can be represented as tree patterns. We consider the problem of rewriting a query Q using a materialized view V , where Q,V ∈ XP(/, //, [ ]). We present more efficient algorithms for the ...

Let P be a simple polygon, and let Q be a set of points in P . We present an almostlinear time algorithm for computing a minimum cover of Q by disks that are contained in P . We then generalize the algorithm, so that it can compute a minimum cover of Q by homothets of any fixed compact convex set O of constant description complexity that are contained in P . This improves previous results of Ka...