<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 17:22:55 BST</pubDate>


	<title>CiteULike: scis0000001 web</title>
	<description>CiteULike: scis0000001 web</description>


	<link>http://www.citeulike.org/user/scis0000001/tag/web</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/1261488"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/1229886"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/896246"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/950199"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/173238"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/595771"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/278013"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/885123"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/463024"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/1115"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/854216"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/845464"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/scis0000001/article/813762"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/scis0000001/article/1261488">
    <title>Precise Alias Analysis for Static Detection of Web Application Vulnerabilities</title>
    <link>http://www.citeulike.org/user/scis0000001/article/1261488</link>
    <description>&lt;i&gt;&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applications have grown as well. Since manual code reviews are time-consuming, errorprone and costly, the need for automated solutions has become evident.</description>
    <dc:title>Precise Alias Analysis for Static Detection of Web Application Vulnerabilities</dc:title>

    <dc:creator>Nenad Jovanovic</dc:creator>
    <dc:creator>Christopher Kruegel</dc:creator>
    <dc:creator>Engin Kirda</dc:creator>
    <dc:date>2007-04-27T23:26:15-00:00</dc:date>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/1229886">
    <title>Collective Phenomena in Hypertext Networks</title>
    <link>http://www.citeulike.org/user/scis0000001/article/1229886</link>
    <description>&lt;i&gt;(1997), pp. 220-221.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a coherent discourse. To access this collective behavior of nodes, a form of graph searching combined with some calculation of node positions is used. KEYWORDS: discourse semantic coherence, collective phenomena in populations of hypertext nodes, clusters of meaning formed by hypertext nodes, discourse macrostructure,...</description>
    <dc:title>Collective Phenomena in Hypertext Networks</dc:title>

    <dc:creator>Valery Chelnokov</dc:creator>
    <dc:creator>Victoria Zephyrova</dc:creator>
    <dc:source>(1997), pp. 220-221.</dc:source>
    <dc:date>2007-04-16T13:54:32-00:00</dc:date>
    <prism:publicationYear>1997</prism:publicationYear>
    <prism:startingPage>220</prism:startingPage>
    <prism:endingPage>221</prism:endingPage>
    <prism:category>sementics</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/896246">
    <title>An annotated bibliography on temporal and evolution aspects in the world wide web</title>
    <link>http://www.citeulike.org/user/scis0000001/article/896246</link>
    <description>&lt;i&gt;(2003)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Proc. of Natl' Conf. on Advanced Database Systems (SEBD '01), Venezia (June 2001), Italy, LCM Selecta, Milan, pp. 215--222, 2001.</description>
    <dc:title>An annotated bibliography on temporal and evolution aspects in the world wide web</dc:title>

    <dc:creator>F Grandi</dc:creator>
    <dc:source>(2003)</dc:source>
    <dc:date>2006-10-14T09:45:04-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>bibliography</prism:category>
    <prism:category>temporal</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/950199">
    <title>Efficient Delivery of Web Services</title>
    <link>http://www.citeulike.org/user/scis0000001/article/950199</link>
    <description>&lt;i&gt;(2004)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This dissertation addresses issues for the efficient access to Web databases and services. We propose a distributed ontology for a meaningful organization of and efficient access to Web databases. Next, we dedicate most of our work on presenting a comprehensive query infrastructure for the emerging concept of Web services. The core of this query infrastructure is to enable the e#cient delivery of Web services based on the concept of Quality of Web Service. Treating Web services as first class...</description>
    <dc:title>Efficient Delivery of Web Services</dc:title>

    <dc:creator>M Ouzzani</dc:creator>
    <dc:source>(2004)</dc:source>
    <dc:date>2006-11-17T14:40:46-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:category>service</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/173238">
    <title>Frequency of occurrence of numbers in the World Wide Web</title>
    <link>http://www.citeulike.org/user/scis0000001/article/173238</link>
    <description>&lt;i&gt;(26 April 2005)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The distribution of numbers in human documents is determined by a variety of diverse natural and human factors, whose relative significance can be evaluated by studying the numbers' frequency of occurrence. Although it has been studied since the 1880's, this subject remains poorly understood. Here, we obtain the detailed statistics of numbers in the World Wide Web, finding that their distribution is a heavy-tailed dependence which splits in a set of power-law ones. In particular, we find that the frequency of numbers associated to western calendar years shows an uneven behavior: 2004 represents a `singular critical' point, appearing with a strikingly high frequency; as we move away from it, the decreasing frequency allows us to compare the amounts of existing information on the past and on the future. Moreover, while powers of ten occur extremely often, allowing us to obtain statistics up to the huge 10^127, `non-round' numbers occur in a much more limited range, the variations of their frequencies being dramatically different from standard statistical fluctuations. These findings provide a view of the array of numbers used by humans as a highly non-equilibrium and inhomogeneous system, and shed a new light on an issue that, once fully investigated, could lead to a better understanding of many sociological and psychological phenomena.</description>
    <dc:title>Frequency of occurrence of numbers in the World Wide Web</dc:title>

    <dc:creator>S Dorogovtsev</dc:creator>
    <dc:creator>J Mendes</dc:creator>
    <dc:creator>J Oliveira</dc:creator>
    <dc:source>(26 April 2005)</dc:source>
    <dc:date>2005-04-28T06:43:31-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:category>benford-law</prism:category>
    <prism:category>numbers</prism:category>
    <prism:category>statistics</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/595771">
    <title>The link prediction problem for social networks</title>
    <link>http://www.citeulike.org/user/scis0000001/article/595771</link>
    <description>&lt;i&gt;(2003), pp. 556-559.&lt;/i&gt;</description>
    <dc:title>The link prediction problem for social networks</dc:title>

    <dc:creator>David Liben-Nowell</dc:creator>
    <dc:creator>Jon Kleinberg</dc:creator>
    <dc:identifier>doi:10.1145/956863.956972</dc:identifier>
    <dc:source>(2003), pp. 556-559.</dc:source>
    <dc:date>2006-04-23T02:24:22-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>556</prism:startingPage>
    <prism:endingPage>559</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>network</prism:category>
    <prism:category>prediction</prism:category>
    <prism:category>web</prism:category>
    <prism:category>web-graph</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/278013">
    <title>Link analysis in national Web domains</title>
    <link>http://www.citeulike.org/user/scis0000001/article/278013</link>
    <description>&lt;i&gt;(September 2005), pp. 15-18.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The Web can be seen as a graph in which every page is a node, and every hyper-link between two pages is an edge. This Web graph forms a scale-free network: a graph in which the distribution of the degree of the nodes is very skewed. This graph is also self-similar, in terms that a small part of the graph shares most properties with the entire graph. This paper compares the characteristics of several national Web domains, by studying the Web graph of large collections obtained using a Web crawler; the comparison unveils striking similarities between the Web graphs of very different countries.</description>
    <dc:title>Link analysis in national Web domains</dc:title>

    <dc:creator>Ricardo Baeza-Yates</dc:creator>
    <dc:creator>Carlos Castillo</dc:creator>
    <dc:source>(September 2005), pp. 15-18.</dc:source>
    <dc:date>2005-08-10T11:47:41-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:startingPage>15</prism:startingPage>
    <prism:endingPage>18</prism:endingPage>
    <prism:category>scale-free-network</prism:category>
    <prism:category>self-similar</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/885123">
    <title>Evolution of document networks.</title>
    <link>http://www.citeulike.org/user/scis0000001/article/885123</link>
    <description>&lt;i&gt;Proc Natl Acad Sci U S A, Vol. 101 Suppl 1 (6 April 2004), pp. 5261-5265.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;How does a network of documents grow without centralized control? This question is becoming crucial as we try to explain the emergent scale-free topology of the World Wide Web and use link analysis to identify important information resources. Existing models of growing information networks have focused on the structure of links but neglected the content of nodes. Here I show that the current models fail to reproduce a critical characteristic of information networks, namely the distribution of textual similarity among linked documents. I propose a more realistic model that generates links by using both popularity and content. This model yields remarkably accurate predictions of both degree and similarity distributions in networks of web pages and scientific literature.</description>
    <dc:title>Evolution of document networks.</dc:title>

    <dc:creator>F Menczer</dc:creator>
    <dc:identifier>doi:10.1073/pnas.0307554100</dc:identifier>
    <dc:source>Proc Natl Acad Sci U S A, Vol. 101 Suppl 1 (6 April 2004), pp. 5261-5265.</dc:source>
    <dc:date>2006-10-05T15:13:27-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Proc Natl Acad Sci U S A</prism:publicationName>
    <prism:issn>0027-8424</prism:issn>
    <prism:volume>101 Suppl 1</prism:volume>
    <prism:startingPage>5261</prism:startingPage>
    <prism:endingPage>5265</prism:endingPage>
    <prism:category>document</prism:category>
    <prism:category>evolution</prism:category>
    <prism:category>generator</prism:category>
    <prism:category>information-dynamics</prism:category>
    <prism:category>modeling</prism:category>
    <prism:category>network</prism:category>
    <prism:category>process</prism:category>
    <prism:category>sfn</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/463024">
    <title>The Shape of the Web and Its Implications for Searching the Web</title>
    <link>http://www.citeulike.org/user/scis0000001/article/463024</link>
    <description>&lt;i&gt;(MarchJanuary~--June~ 2000)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;With the rapid growth of the number of web pages, designing a search engine that can retrieve high quality information in response to a user query is a challenging task. Automated search engines that rely on keyword matching usually return too many low quality matches and they take a long time to run. It is argued in the literature that link-following search methods can substantially increase the search quality, provided that these methods use an accurate assumption about useful patterns in the ...</description>
    <dc:title>The Shape of the Web and Its Implications for Searching the Web</dc:title>

    <dc:creator>Kemal Efe</dc:creator>
    <dc:creator>Vijay Raghavan</dc:creator>
    <dc:creator>Henry Chu</dc:creator>
    <dc:creator>Adrienne Broadwater</dc:creator>
    <dc:creator>Levent Bolelli</dc:creator>
    <dc:creator>Seyda Ertekin</dc:creator>
    <dc:source>(MarchJanuary~--June~ 2000)</dc:source>
    <dc:date>2006-01-12T13:39:40-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publisher>Scuola Superiore Guglielmo Reiss Romoli</prism:publisher>
    <prism:category>ir</prism:category>
    <prism:category>searching</prism:category>
    <prism:category>shape</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/1115">
    <title>Authoritative sources in a hyperlinked environment</title>
    <link>http://www.citeulike.org/user/scis0000001/article/1115</link>
    <description>&lt;i&gt;Journal of the ACM, Vol. 46, No. 5. (1999), pp. 604-632.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;. The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of contexts on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics,...</description>
    <dc:title>Authoritative sources in a hyperlinked environment</dc:title>

    <dc:creator>Jon Kleinberg</dc:creator>
    <dc:source>Journal of the ACM, Vol. 46, No. 5. (1999), pp. 604-632.</dc:source>
    <dc:date>2004-11-29T10:40:48-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:publicationName>Journal of the ACM</prism:publicationName>
    <prism:volume>46</prism:volume>
    <prism:number>5</prism:number>
    <prism:startingPage>604</prism:startingPage>
    <prism:endingPage>632</prism:endingPage>
    <prism:category>ir</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/854216">
    <title>Methods for Sampling Pages Uniformly from the World Wide Web</title>
    <link>http://www.citeulike.org/user/scis0000001/article/854216</link>
    <description>&lt;i&gt;(2001), pp. 121-128.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We present two new algorithms for generating uniformly random samples of pages from the World Wide Web, building upon recent work by Henzinger et al. (Henzinger et al.</description>
    <dc:title>Methods for Sampling Pages Uniformly from the World Wide Web</dc:title>

    <dc:creator>Paat Rusmevichientong</dc:creator>
    <dc:creator>David Pennock</dc:creator>
    <dc:creator>Steve Lawrence</dc:creator>
    <dc:creator>Lee Giles</dc:creator>
    <dc:source>(2001), pp. 121-128.</dc:source>
    <dc:date>2006-09-22T09:29:02-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:startingPage>121</prism:startingPage>
    <prism:endingPage>128</prism:endingPage>
    <prism:category>sampling</prism:category>
    <prism:category>uniform</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/845464">
    <title>Self-similarity in the web</title>
    <link>http://www.citeulike.org/user/scis0000001/article/845464</link>
    <description>&lt;i&gt;ACM Trans. Inter. Tech., Vol. 2, No. 3. (August 2002), pp. 205-223.&lt;/i&gt;</description>
    <dc:title>Self-similarity in the web</dc:title>

    <dc:creator>Stephen Dill</dc:creator>
    <dc:creator>Ravi Kumar</dc:creator>
    <dc:creator>Kevin Mccurley</dc:creator>
    <dc:creator>Sridhar Rajagopalan</dc:creator>
    <dc:creator>D Sivakumar</dc:creator>
    <dc:creator>Andrew Tomkins</dc:creator>
    <dc:identifier>doi:10.1145/572326.572328</dc:identifier>
    <dc:source>ACM Trans. Inter. Tech., Vol. 2, No. 3. (August 2002), pp. 205-223.</dc:source>
    <dc:date>2006-09-15T14:25:20-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>ACM Trans. Inter. Tech.</prism:publicationName>
    <prism:issn>1533-5399</prism:issn>
    <prism:volume>2</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>205</prism:startingPage>
    <prism:endingPage>223</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>network</prism:category>
    <prism:category>self-similar</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/scis0000001/article/813762">
    <title>A Stochastic Model for the Evolution of the Web Allowing Link Deletion</title>
    <link>http://www.citeulike.org/user/scis0000001/article/813762</link>
    <description>&lt;i&gt;(25 Mar 2004)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Recently several authors have proposed stochastic evolutionary models for the growth of the web graph and other networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the &#8220;rich get richer&#8221; phenomenon. We present a generalisation of the basic model by allowing deletion of individual links and show that it also gives rise to a power-law distribution. We derive the mean-field equations for this stochastic model and show that by examining a snapshot of the distribution at the steady state of the model, we are able to tell whether any link deletion has taken place and estimate the link deletion probability. Our model enables us to gain some insight into the distribution of inlinks in the web graph, in particular it suggests a power-law exponent of approximately 2.15 rather than the widely published exponent of 2.1.</description>
    <dc:title>A Stochastic Model for the Evolution of the Web Allowing Link Deletion</dc:title>

    <dc:creator>Trevor Fenner</dc:creator>
    <dc:creator>Mark Levene</dc:creator>
    <dc:creator>George Loizou</dc:creator>
    <dc:source>(25 Mar 2004)</dc:source>
    <dc:date>2006-08-23T13:18:24-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:category>evolution</prism:category>
    <prism:category>network</prism:category>
    <prism:category>web</prism:category>
</item>



</rdf:RDF>

