Fandom

VroniPlag Wiki

Quelle:Nm2/Freeman 1980

< Quelle:Nm2

31.377Seiten in
diesem Wiki
Seite hinzufügen
Diskussion0

Störung durch Adblocker erkannt!


Wikia ist eine gebührenfreie Seite, die sich durch Werbung finanziert. Benutzer, die Adblocker einsetzen, haben eine modifizierte Ansicht der Seite.

Wikia ist nicht verfügbar, wenn du weitere Modifikationen in dem Adblocker-Programm gemacht hast. Wenn du sie entfernst, dann wird die Seite ohne Probleme geladen.

Angaben zur Quelle [Bearbeiten]

Autor     Linton C. Freeman
Titel    The gatekeeper, Pair-dependency and Structural Centrality
Zeitschrift    Quality and Quantity
Ort    Amsterdam
Verlag    Elsevier
Jahr    1980
Nummer    14
Seiten    585-592
DOI    10.1007/BF00184720
URL    http://moreno.ss.uci.edu/31.pdf

Literaturverz.   

no
Fußnoten    no
Fragmente    3


Fragmente der Quelle:
[1.] Nm2/Fragment 437 28 - Diskussion
Zuletzt bearbeitet: 2014-01-11 23:33:54 Hindemith
Fragment, Freeman 1980, Gesichtet, KeineWertung, Nm2, SMWFragment, Schutzlevel sysop

Typus
KeineWertung
Bearbeiter
Hindemith
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 437, Zeilen: 28-31
Quelle: Freeman 1980
Seite(n): 587, Zeilen: 17ff
Consider a network representing a symmetrical relation, “communicates with” for a set of nodes. When a pair of nodes (say, u and v) is linked by an edge so that they can communicate directly without intermediaries, they are said to be adjacent. A set of edges linking two or more modes [sic] (u, v, w) such that node u would like to communicate with w, using node v. Consider a graph representing the symmetrical relation, "communicates with" for a set of people. When a pair of points is linked by an edge so that they can communicate directly without intermediaries, they are said to be adjacent. A set of edges linking two or more points (p_i, p_j, p_k) such that p_i is adjacent to p_j and p_j is adjacent to p_k constitute a path from p_i to p_k.
Anmerkungen

Slightly adapted, but taken from Freeman (1980). The source is not given.

Sichter
(Hindemith), WiseWoman

[2.] Nm2/Fragment 438 12 - Diskussion
Zuletzt bearbeitet: 2014-01-11 23:59:56 Schumann
Fragment, Freeman 1980, Gesichtet, Nm2, SMWFragment, Schutzlevel sysop, Verschleierung

Typus
Verschleierung
Bearbeiter
Hindemith
Gesichtet
Yes.png
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

[3.] Nm2/Fragment 438 23 - Diskussion
Zuletzt bearbeitet: 2014-01-11 23:21:04 WiseWoman
Fragment, Freeman 1980, Gesichtet, Nm2, SMWFragment, Schutzlevel sysop, Verschleierung

Typus
Verschleierung
Bearbeiter
Hindemith
Gesichtet
Yes.png
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

Auch bei Fandom

Zufälliges Wiki