<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Then these page sets, their related ge-
We had made simulations of ranking web
of three page sets and two user locations.
tracted from our web page collection which
(considering only relations of geowords) is
First, random</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <volume>100</volume>
      <issue>500</issue>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>2. Cache algorithm should use prediction</title>
      <p>information of the owner’s behavior.
phase works for ecien t management of web
and active dynamic travel guide by
suggespage cache based on page priority ranking,
tion of closely related web pages to the user.
phase is during the travel in outdoors. This
the system works to support of surveying
status) into the mobile devices.
phases are considered in the system, planning
destination area by retrieving web pages,
defore the departure of a tour. In this phase,
web, and user environment parameters. Two
cision making of target spots and visiting
phase and retrieval-and-guide phase.
of geowords or keywords derived from the
On the other hand, retrieval-and-guide
cache management and a dynamic travel
Planning phase is performed at home
beguide, using metadata such as relationships
order, and storing metadata (relations, user
The system has functions of a web page</p>
    </sec>
    <sec id="sec-2">
      <title>The purpose of this algorithm is to rank</title>
      <p>G-G model has a graph structure shown in
into three groups. The rst group in the left
represent regional references of each of the
the pages p in cache P in the order of priority
side is a page cache P , which is the set of web
pages The second group in the center is pi.
tween and each . A pair with no G-G gU gj
There exist weighted G-G relations
bea geoword set G, called index of P . Each gj
relations (relations between geowords). We
Figure 2. Nodes in this graph are classied
relation.
paper.
is a single node, user’s current location.
web pages. The third group in the right side
We rst in troduce the model using only G-G
call this model G-G model in the later of the
relations is treated as a zero-weighted G-G</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Takakura</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kambayashi</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abrams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. R.</given-names>
            <surname>Standridge</surname>
          </string-name>
          , G. Abdulla,
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>puter</surname>
          </string-name>
          ,
          <volume>27</volume>
          (
          <issue>3</issue>
          ):
          <fpage>38</fpage>
          -
          <lpage>46</lpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.H.</given-names>
            <surname>Dunham</surname>
          </string-name>
          , \Using Seman-
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>neering</surname>
          </string-name>
          ,
          <volume>11</volume>
          (
          <issue>1</issue>
          ),
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>Verlag, LNCS 2121</source>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>113</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Wheery</surname>
          </string-name>
          , \Caching Strategies to Improve
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <source>the 4th International WWW Conference,</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>Annual International Conference on Mobile</mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>ating Systems</surname>
            <given-names>Concepts</given-names>
          </string-name>
          ,\ Addison Wesley,
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Lee</surname>
          </string-name>
          , \Semantic Caching
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>S.</given-names>
            <surname>Wiliams</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Fox</surname>
          </string-name>
          , \Caching Prox-
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>in Location-Dependent Query</surname>
          </string-name>
          Process-
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <source>\Caching on the World Wide Web,\ IEEE</source>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Reading</surname>
          </string-name>
          , MA, fourth edition,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Cheng</surname>
          </string-name>
          , Y. Kambayashi, \
          <article-title>LRU-SP: A size</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>tic Caching to Manage Location Depen-</mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>May</surname>
          </string-name>
          <year>2002</year>
          . (to appear)
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <article-title>dent Data in Mobile Computing," The 6th</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <surname>Computing</surname>
          </string-name>
          and Networking (MobiCom'00),
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Aggarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.L.</given-names>
            <surname>Wolf</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <given-names>Disk</given-names>
            <surname>System</surname>
          </string-name>
          <string-name>
            <surname>Performance</surname>
          </string-name>
          ,\ IEEE Com-
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <article-title>Transactions on knowledge and data engi-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <surname>August</surname>
          </string-name>
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <article-title>adjustable popularity-aware LRU replace-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <string-name>
            <surname>Spatial</surname>
          </string-name>
          and Temporal Databases, Springer-
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <string-name>
            <surname>COMPSAC</surname>
          </string-name>
          , IEEE CS Press, pp.
          <fpage>48</fpage>
          -
          <lpage>53</lpage>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <source>ies: Limitations and Potentials,\ Proc. of</source>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          <article-title>\Visual Query Processing for GIS with Web</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <string-name>
            <surname>Contents</surname>
          </string-name>
          ,
          <source>\ Proc. of the 6th IFIP</source>
          Work-
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Karedla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Love</surname>
          </string-name>
          , and
          <string-name>
            <surname>B. G.</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          <source>ing," The 7th International Symposium on</source>
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          <source>ing Conference on Visual Database Systems,</source>
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Silberschatz and P. B. Galvin</surname>
          </string-name>
          , \Oper-
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          <article-title>ment algorithm for Web Caching,\ IEEE</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>