%0 %0 Generic %A Alvarez-Hamelin, Jose Ignacio; Dall'Asta, Luca; Barrat, Alain & Vespignani, Alessandro %D 2005 %T k-core decomposition: a tool for the analysis of large scale Internet graphs %E %B %C %I %V %6 %N %P %& %Y %S %7 %8 %9 %? %! %Z %@ %( %) %* %L %M %1 %2 %3 misc %4 %# %$ %F alvarezhamelin-2005 %K analysis core decomposition graph kcore network toread %X %Z %U http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0511007 %+ %^ %0 %0 Conference Proceedings %A Desikan, Prasanna Kumar; Pathak, Nishith; Srivastava, Jaideep & Kumar, Vipin %D 2006 %T Divide and conquer approach for efficient pagerank computation %E %B ICWE '06: Proceedings of the 6th international conference on Web engineering %C New York, NY, USA %I ACM Press %V %6 %N %P 233--240 %& %Y %S %7 %8 July %9 %? %! %Z %@ 1-59593-352-2 %( %) %* %L %M %1 %2 %3 inproceedings %4 %# %$ %F 1145629 %K analysis network pagerank ranking toread %X %Z %U http://portal.acm.org/citation.cfm?doid=1145581.1145629 %+ %^ %0 %0 Book %A Koch, Jürgen Hartmut %D 2003 %T Unterstützung der Formierung und Analyse von virtuellen Communities %E %B Europäische Hochschulschriften %C Frankfurt am Main %I Peter Lang Publishing Group %V 41 %6 %N 39 %P %& %Y %S %7 %8 %9 %? %! %Z %@ 978-3-631-50288-4 %( %) %* %L %M %1 %2 %3 book %4 %# %$ %F koch2003unterstuetzung %K analysis community support toread %X Systeme, die den Informationsaustausch in Communities unterstützen, sind heute allgegenwärtig. Eine zielgerichtete Analyse solcher Communities ist allerdings nur schwer möglich, denn es gibt bislang kein Verfahren zur formalen Beschreibung virtueller Communities, auf dem aufbauend eine Analyse stattfinden könnte. Es wird ein Konzept vorgestellt, das die Brücke schlägt zwischen den natürlichsprachlichen Beschreibungen von virtuellen Communities in der Soziologie und der Psychologie, und einer formalen Beschreibung, wie sie für die zielgerichtete Software-Entwicklung nötig ist. Neben einem formalen Modell von virtuellen Communities wird ein komponentenbasierter Ansatz vorgestellt, der beschreibt, wie mit diesem Modell gezielt Unterstützungs- und Analysesysteme entwickelt werden können. %Z PhD Thesis (2002) %U %+ %^ %0 %0 Book %A MacKenzie, Donald %D 2001 %T Mechanizing Proof: Computing, Risk, and Trust %E %B %C %I The MIT Press %V %6 %N %P %& %Y %S %7 %8 October %9 %? %! %Z %@ 978-0-262-13393-7 %( %) %* %L %M %1 %2 %3 book %4 %# %$ %F MacKenzie %K computer computing history math proof risk toread trust %X Most aspects of our private and social lives -- our safety, the integrity of the financial system, the functioning of utilities and other services, and national security -- now depend on computing. But how can we know that this computing is trustworthy? In Mechanizing Proof, Donald MacKenzie addresses this key issue by investigating the interrelations of computing, risk, and mathematical proof over the last half century from the perspectives of history and sociology. His discussion draws on the technical literature of computer science and artificial intelligence and on extensive interviews with participants. MacKenzie argues that our culture now contains two ideals of proof: proof as traditionally conducted by human mathematicians, and formal, mechanized proof. He describes the systems constructed by those committed to the latter ideal and the many questions those systems raise about the nature of proof. He looks at the primary social influence on the development of automated proof -- the need to predict the behavior of the computer systems upon which human life and security depend -- and explores the involvement of powerful organizations such as the National Security Agency. He concludes that in mechanizing proof, and in pursuing dependable computer systems, we do not obviate the need for trust in our collective human judgment. %Z %U http://mitpress.mit.edu/catalog/item/default.asp?tid=8635&ttype=2 %+ %^