von Nasrullah Memon
Statistik und Sichtungsnachweis dieser Seite findet sich am Artikelende
| [1.] Nm/Fragment 114 01 - Diskussion Zuletzt bearbeitet: 2012-04-23 11:19:08 Hindemith | Chen 2006, Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung |
|
|
|
| Untersuchte Arbeit: Seite: 114, Zeilen: 1-12 |
Quelle: Chen 2006 Seite(n): 98-99, Zeilen: p.98,37-39 - p.99,1-8 |
|---|---|
| It is worthwhile to mention here, that a small-world network has a significantly larger clustering coefficient while the network has small average path length. The large clustering coefficient point outs that there is a high tendency for nodes to form communities and groups. On the other hand, scale-free networks are characterized by the power-law degree distribution, meaning that while a large number of nodes in the network have just a few links, a small fraction of the nodes have a large number of links. It is believed that scale-free networks evolve following the selforganizing principle, where growth and preferential attachment play a key role for the emergence of the power law degree distribution (Chen, Hsinchun, 2006). | [p. 98]
A small-world network has a significantly larger clustering coefficient than its random model counterpart while maintaining a relatively small average path [p. 99] length. The large clustering coefficient indicates that there is a high tendency for nodes to form communities and groups. Scale-free networks, on the other hand, are characterized by the power-law degree distribution, meaning that while a large number of nodes in the network have just a few links, a small fraction of the nodes have a large number of links. It is believed that scale-free networks evolve following the self-organizing principle, where growth and preferential attachment play a key role for the emergence of the power-law degree distribution. |
It is not clear that this paragraph is an - if you know the source - obvious citation. The reference "(Chen, Hsinchun, 2006)" indeed refers to one possible source at hand even though it is a multi authored paper (the wording is close to the one in Chen's book, which is presented here). Chen was one of the referees for this thesis, so one expects that he, at least, is - more or less - correctly cited. This is not the case. |
|
| [2.] Nm/Fragment 114 13 - Diskussion Zuletzt bearbeitet: 2012-04-23 11:19:01 Hindemith | Chen 2006, Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung |
|
|
|
| Untersuchte Arbeit: Seite: 114, Zeilen: 13-19 |
Quelle: Chen 2006 Seite(n): 98, Zeilen: 23-28 |
|---|---|
| Although the topological properties of these networks have been
discovered, the structures of terrorist networks are largely unknown due to the difficulty of collecting and accessing reliable data (Krebs, 2001). Do terrorist networks share the same topological properties with other types of networks? Do they follow the same organizing principle? How do they achieve efficiency under constant surveillance and threat from authorities? (Chen, Hsinchun, 2006). |
Although the topological properties of these networks have been discovered,
the structures of dark (covert, illegal) networks are largely unknown due to the difficulty of collecting and accessing reliable data (Krebs, 2001). Do dark networks share the same topological properties with other types of networks? Do they follow the same organizing principle? How do they achieve efficiency under constant surveillance and threat from authorities? |
Straight from the book of one of the referees, but the citation is not marked as such. The reference is to one of the papers of the referee, but the wording is nearly identical to what can be found in the book. |
|
| [3.] Nm/Fragment 114 20 - Diskussion Zuletzt bearbeitet: 2012-04-21 22:50:13 Hindemith | BauernOpfer, Fragment, Gesichtet, Krebs 2004, Nm, SMWFragment, Schutzlevel sysop |
|
|
|
| Untersuchte Arbeit: Seite: 114, Zeilen: 20-33 |
Quelle: Krebs 2004 Seite(n): 1 (internet version), Zeilen: 38-47 |
|---|---|
| This study applied the small-world network metrics of Watts & Strogatz (1998) to Figure 1.4 and tabulated in Table 3.1. One of the key metrics in the small-world model is the average path length, for individuals and for the network overall (Krebs, V., 2005). A good score for an individual means that he/she is close to all of the others in a network – they can reach others quickly without going through too many intermediaries. A good score for the whole network indicates that everyone can reach everyone else easily and quickly. The shorter the information paths for everyone, the quicker the information arrives and the less distorted it is when it arrives. Another benefit of multiple short paths is that most members of the network have good visibility into what is happening in other parts of the network – a greater awareness. They have a wide network horizon which is useful for combining key pieces of distributed [intelligence.] | We apply the small-world network metrics of Watts & Strogatz to Figures 1, 2, and 3 above. One of the key metrics in the small-world model is the average path length, for individuals and for the network overall. A good score for an individual means that he/she is close to all of the others in the network -- they can reach others quickly without going through too many intermediaries. A good score for the whole group indicates that everyone can reach everyone else easily and quickly. The shorter the information paths for everyone, the quicker the information arrives and the less distorted it is when it arrives. Another benefit of multiple short paths is that most members of the network have good visibility into what is happening in other parts of the network. They have a good network horizon which is useful for combining key pieces of distributed intelligence. |
Taken straight from the world wide web; the reference is given - still it is by no means clear that it mostly is a word-for-word citation. Note also that the copied text continues after the reference to the source. |
|
Letzte Bearbeitung dieser Seite: durch Benutzer:Hindemith, Zeitstempel: 20120423112949