Nm2/438

< Nm2

32.151Seiten in
diesem Wiki
How Investigative Data Mining Can Help Intelligence Agencies to Discover Dependence of Nodes in Terrorist Networks

von Nasrullah Memon, David L. Hicks, Henrik Legind Larsen

vorherige Seite | zur Übersichtsseite | folgende Seite
Statistik und Sichtungsnachweis dieser Seite findet sich am Artikelende
 Zuletzt bearbeitet: 2014-01-11 23:59:56 Schumann Fragment, Freeman 1980, Gesichtet, Nm2, SMWFragment, Schutzlevel sysop, Verschleierung

 Typus Verschleierung Bearbeiter Hindemith Gesichtet
Untersuchte Arbeit:
Seite: 438, Zeilen: 12-14, 19-20
Quelle: Freeman 1980
Seite(n): 588, Zeilen: 1ff
Now we define dependence centrality as the degree to which a node, u, must depend upon another, v, to relay its messages along geodesics to and from all other reachable nodes in the network. Thus, for a network containing n nodes, the dependence centrality of u on v can be found by using: [...]

We can calculate the dependence centrality of each vertex on every other vertex in the network and arrange the results in a matrix [...]

Now we can define pair-dependency as the degree to which a point, pi, must depend upon another, pj, to relay its messages along geodesics to and from all other reachable points in the network. Thus, for a network containing n points, [...]

We can calculate the pair-dependencies of each point on every other point in the network and arrange the results in a matrix,

 Anmerkungen The notion of pair-dependency, which has been known for some time, is called "dependence centrality" in this paper (the used formula is a slight adaptation of the original formula). A source is not mentioned, although some text appears to have been taken from this paper. Sichter (Hindemith), WiseWoman

 Zuletzt bearbeitet: 2014-01-11 23:21:04 WiseWoman Fragment, Freeman 1980, Gesichtet, Nm2, SMWFragment, Schutzlevel sysop, Verschleierung

 Typus Verschleierung Bearbeiter Hindemith Gesichtet
Untersuchte Arbeit:
Seite: 438, Zeilen: 23-26
Quelle: Freeman 1980
Seite(n): 588, Zeilen: 10ff
Each entry in D is an index of the degree to which the node designated by the row of the matrix must depend on the vertex designated by the column to relay messages to and from others. Thus D captures the importance of each node as a gatekeeper with respect to each other node — facilating [sic] or perhaps inhibiting its communication. Each entry in D is an index of the degree to which the point designated by the row of the matrix must depend on the point designated by the column to relay messages to and from others. Thus D captures the importance of each point as a gatekeeper with respect to each other point — facilitating or perhaps inhibiting its communication.
 Anmerkungen Apart from the substitution "node"/"vertex" <--> "point" the text is identical. The source is not mentioned anywhere in the paper. Sichter (Hindemith), WiseWoman

vorherige Seite | zur Übersichtsseite | folgende Seite
Letzte Bearbeitung dieser Seite: durch Benutzer:Hindemith, Zeitstempel: 20140111211511