— We introduce and discuss a novel link model that incorporates both uncertainty in the fading coefficients and the node distances for ad hoc networks with randomly placed nodes...
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
This paper describes adaptation to gradual changes of walking directions for gait identification. First, we propose a method of body tilt correction due to changes of walking dire...
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...