Name
Abstract | ||
|---|---|---|
A mobile user's movement log contains a large amount of moving information. This paper mainly discusses the round trip mode for moving patterns in movement log, and classifies in isomorphic way the round trips (cycle digraphs) into four types by the periodicity of a mobile user's movement. Utilizing adjacency matrix and its powers of a digraph, the paper provides a method of getting key nodes and length of a cycle sub-digraph in movement log. By those important characteristics, this paper proposes a novel partitioning digraph algorithm for location management to all the four type digraphs. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1142/S0129065704002145 | INTERNATIONAL JOURNAL OF NONLINEAR SCIENCES AND NUMERICAL SIMULATION |
Keywords | Field | DocType |
location area, digraph, round trip, mobile computing environment | Brute-force attack,Synchronization,Key exchange,Computer science,Cryptography,Neural cryptography,Cryptosystem,Theoretical computer science,Mutual information,Artificial neural network | Journal |
Volume | Issue | ISSN |
5 | 4 | 1565-1339 |
Citations | PageRank | References |
2 | 0.37 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiantao Zhou | 1 | 580 | 78.87 |
| Qinzhen Xu | 2 | 10 | 3.57 |
| Wenjiang Pei | 3 | 49 | 17.26 |
| Zhenya He | 4 | 207 | 38.98 |
| Harold Szu | 5 | 149 | 38.33 |