%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.03",
%%%     date            = "01 October 2015",
%%%     time            = "19:39:26 MDT",
%%%     filename        = "lncs2008a.bib",
%%%                        University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "36314 676 3016 32121",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibTeX; bibliography; Lecture Notes in
%%%                        Computer Science",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of papers published in
%%%                        Lecture Notes in Computer Science
%%%                        (Springer-Verlag) for 2008.
%%%
%%%                        Bibliography entries below treat the series
%%%                        as a journal, rather than as conference
%%%                        proceedings.
%%%
%%%                        The companion bibliography lncs.bib lists
%%%                        just the individual volumes in the series,
%%%                        and the lncs19xy*.bib files list individual
%%%                        papers for year 19xy.  The large number of
%%%                        papers in this collection, and limitations
%%%                        in TeX and BibTeX, and in WWW HTTP transfer
%%%                        speeds, necessitate the splitting of the
%%%                        papers bibliographies into yearly files.
%%%
%%%                        At version 1.03, the year coverage looked
%%%                        like this:
%%%
%%%                             2008 (  19)
%%%
%%%                             Article:         12
%%%                             InProceedings:    4
%%%                             Proceedings:      3
%%%
%%%                             Total entries:   19
%%%
%%%                        This bibliography has been constructed
%%%                        primarily from the publisher Web site.
%%%                        Regrettably, final page numbers are not
%%%                        available at that source.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.  Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen as
%%%                        name:year:abbrev, where name is the family
%%%                        name of the first author or editor, year is a
%%%                        4-digit number, and abbrev is a 3-letter
%%%                        condensation of important title words.
%%%                        Citation labels were automatically generated
%%%                        by software developed for the BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, with the help of ``bibsort
%%%                        -byvolume''.  The bibsort utility is available
%%%                        from ftp.math.utah.edu in /pub/tex/bib.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\ifx \undefined \bbb \def \bbb #1{\mathbb{#1}} \fi" #
    "\ifx \undefined \circled \def \circled #1{(#1)}\fi" #
    "\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi" #
    "\ifx \undefined \mathcal \def \mathcal #1{{\cal #1}}\fi" #
    "\ifx \undefined \mathrm \def \mathrm #1{{\rm #1}}\fi" #
    "\ifx \undefined \ocirc  \def \ocirc #1{{\accent'27#1}}\fi" #
    "\ifx \undefined \reg \def \reg {\circled{R}}\fi" #
    "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi" #
    "\hyphenation{
        Ay-ka-nat
        Giun-chi-glia
        Lakh-neche
        Mal-er-ba
        Mart-el-li
        Reut-e-nau-er
        Thiel-sch-er
        }"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-SV                  = "Springer-Verlag Inc."}

@String{pub-SV:adr              = "New York, NY, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNAI                = "Lecture Notes in Artificial Intelligence"}

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Bibliography entries:

@Article{Auer:2008:VMM,
  author =       "Ekaterina Auer and Andreas Rauh and Eberhard P. Hofer
                 and Wolfram Luther",
  title =        "Validated Modeling of Mechanical Systems with
                 {SmartMOBILE}: Improvement of Performance by
                 {ValEncIA-IVP}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "1--27",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_1.pdf;
                 http://link.springer.com/content/pdf/bfm:978-3-540-85521-7/1.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Corliss:2008:ISL,
  author =       "George F. Corliss and R. Baker Kearfott and Ned
                 Nedialkov and John D. Pryce and Spencer Smith",
  title =        "Interval Subroutine Library Mission",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "28--43",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_2",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_2.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Dyllong:2008:CPE,
  author =       "Eva Dyllong",
  title =        "Convex Polyhedral Enclosures of Interval-Based
                 Hierarchical Object Representations",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "44--56",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_3",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_3.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Emiris:2008:RAN,
  author =       "Ioannis Z. Emiris and Bernard Mourrain and Elias P.
                 Tsigaridas",
  title =        "Real Algebraic Numbers: Complexity Analysis and
                 Experimentation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "57--82",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_4",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_4.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Kempken:2008:VMS,
  author =       "Sebastian Kempken and Wolfram Luther",
  title =        "Verified Methods in Stochastic Traffic Modelling",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "83--101",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_5",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_5.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Lambov:2008:IAU,
  author =       "Branimir Lambov",
  title =        "Interval Arithmetic Using {SSE-2}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "102--113",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_6",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_6.pdf;
                 http://www.springerlink.com/content/576312312g511037/",
  abstract =     "We present an implementation of double precision
                 interval arithmetic using the
                 single-instruction-multiple-data SSE-2 instruction and
                 register set extensions. The implementation is part of
                 a package for exact real arithmetic, which defines the
                 interval arithmetic variation that must be used:
                 incorrect operations such as division by zero cause
                 exceptions and loose evaluation of the operations is in
                 effect. The SSE-2 extensions are suitable for the job,
                 because they can be used to operate on a pair of double
                 precision numbers and include separate rounding mode
                 control and detection of the exceptional conditions.
                 The paper describes the ideas we use to fit interval
                 arithmetic to this set of instructions, shows a
                 performance comparison with other freely available
                 interval arithmetic packages, and discusses possible
                 very simple hardware extensions that can significantly
                 increase the performance of interval arithmetic.",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
  remark =       "Conference on Reliable Implementation of Real Number
                 Algorithms: Theory and Practice",
}

@Article{Lefevre:2008:WCE,
  author =       "Vincent Lef{\`e}vre and Damien Stehl{\'e} and Paul
                 Zimmermann",
  title =        "Worst Cases for the Exponential Function in the {IEEE
                 754r decimal64} Format",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "114--126",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_7",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 http://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_7.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
  remark =       "From the abstract: ``the worst case for $ |x| \geq 3
                 \times 10^{-11} $ is exp(9.407822313572878e-2) =
                 1.09864568206633850000000000000000278.''",
}

@Article{Michelucci:2008:RR,
  author =       "Dominique Michelucci and Jean Michel Moreau and Sebti
                 Foufou",
  title =        "Robustness and Randomness",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "127--148",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_8",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_8.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
  keywords =     "computational geometry algorithms; exact arithmetic;
                 interval arithmetic; probabilistic methods",
}

@Article{Miller:2008:TNS,
  author =       "Lance Edward Miller and Edward L. F. Moore and Thomas
                 J. Peters and Alexander Russell",
  title =        "Topological Neighborhoods for Spline Curves: Practice
                 \& Theory",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "149--161",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_9.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Shapiro:2008:HCT,
  author =       "Vadim Shapiro",
  title =        "Homotopy Conditions for Tolerant Geometric Queries",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "162--180",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_10",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_10.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Stewart:2008:TIW,
  author =       "Neil F. Stewart and Malika Zidani",
  title =        "Transfinite Interpolation for Well-Definition in Error
                 Analysis in Solid Modelling",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "181--192",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_11",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_11.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Yap:2008:TRC,
  author =       "Chee Yap",
  title =        "Theory of Real Computation According to {EGC}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "5045",
  pages =        "193--237",
  year =         "2008",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-85521-7_12",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Oct 1 11:29:36 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  URL =          "http://link.springer.com/content/pdf/10.1007/978-3-540-85521-7_12.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-540-85521-7",
  book-URL =     "http://www.springerlink.com/content/978-3-540-85521-7",
  fjournal =     "Lecture Notes in Computer Science",
}

@InProceedings{Bauckhage:2008:ITU,
  author =       "Christian Bauckhage",
  editor =       "Anonymous",
  booktitle =    "Proceedings of the 30th DAGM Symposium on Pattern
                 Recognition",
  title =        "Image Tagging Using {PageRank} over Bipartite Graphs",
  volume =       "5096",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "426--435",
  year =         "2008",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-69321-5_43",
  ISBN =         "3-540-69320-3",
  ISBN-13 =      "978-3-540-69320-8",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "????",
  bibdate =      "Sat May 8 18:33:10 MDT 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  series =       ser-LNCS,
  abstract =     "We consider the problem of automatic image tagging for
                 online services and explore a prototype-based approach
                 that applies ideas from manifold ranking. Since
                 algorithms for ranking on graphs or manifolds often
                 lack a way of dealing with out of sample data, they are
                 of limited use for pattern recognition. In this paper,
                 we therefore propose to consider diffusion processes
                 over bipartite graphs which allow for a dual treatment
                 of objects and features. As with Google's PageRank,
                 this leads to Markov processes over the prototypes. In
                 contrast to related methods, our model provides a
                 Bayesian interpretation of the transition matrix and
                 enables the ranking and consequently the classification
                 of unknown entities. By design, the method is tailored
                 to histogram features and we apply it to
                 histogram-based color image analysis. Experiments with
                 images downloaded from flickr.com illustrate object
                 localization in realistic scenes.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Litvak:2008:PRB,
  author =       "Nelly Litvak and Werner R. W. Scheinhardt and Yana
                 Volkovich",
  title =        "Probabilistic relation between in-degree and
                 {PageRank}",
  crossref =     "Aiello:2008:AMW",
  pages =        "72--83",
  year =         "2008",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-78808-9_7",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "68M10 (05C90 37A50 68P20)",
  MRnumber =     "MR2473494 (2010c:68014)",
  bibdate =      "Wed May 5 19:28:06 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  series =       ser-LNCS,
  ZMnumber =     "1142.68314",
  abstract =     "This paper presents a novel stochastic model that
                 explains the relation between power laws of In-Degree
                 and PageRank. PageRank is a popularity measure designed
                 by Google to rank Web pages. We model the relation
                 between PageRank and In-Degree through a stochastic
                 equation, which is inspired by the original definition
                 of PageRank. Using the theory of regular variation and
                 Tauberian theorems, we prove that the tail
                 distributions of PageRank and In-Degree differ only by
                 a multiplicative constant, for which we derive a
                 closed-form expression. Our analytical results are in
                 good agreement with Web data.",
  acknowledgement = ack-nhfb,
  keywords =     "Algorithms; Experimentation; In-Degree; PageRank;
                 Power law; Regular variation; Stochastic equation;
                 Theory; Verification; Web measurement",
}

@InProceedings{Wenyin:2008:EHO,
  author =       "L. Wenyin and A. Y. Fu and X. Deng",
  editor =       "Yanchun Zhang",
  booktitle =    "{Asia--Pacific web conference: Progress in WWW
                 research and development: APWeb 2008}",
  title =        "Exposing Homograph Obfuscation Intentions by Coloring
                 {Unicode} Strings",
  volume =       "4976",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "275--286",
  year =         "2008",
  ISBN =         "3-540-78848-4",
  ISBN-13 =      "978-3-540-78848-5",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "????",
  bibdate =      "Tue Jul 13 16:21:54 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{Yang:2008:APT,
  author =       "Shenggang Yang and Jianmin Zhao and Xueyan Zhang and
                 Limei Zhao",
  editor =       "Anonymous",
  booktitle =    "{Advances in Blended Learning: Second Workshop on
                 Blended Learning, WBL 2008, Jinhua, China, August
                 20--22, 2008. Revised Selected Papers}",
  title =        "Application of {PageRank} Technique in Collaborative
                 Learning",
  volume =       "????",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "102--109",
  year =         "2008",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-89962-4_11",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  bibdate =      "Sat May 8 18:33:09 MDT 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  series =       ser-LNCS,
  abstract =     "With the rapid development in web 2.0, lots of realm
                 communities provide free platforms for users to enrich
                 their knowledge through online communication, sharing
                 and socializing without boundaries. As an on-line
                 system may interact with thousands of users, it is
                 almost impossible for the field experts or teachers to
                 give instant help manually, which is not only
                 inefficient, but also human laborious. To cope with it,
                 an E-learning community should construct an efficiency
                 knowledge acquiring mechanism. To assure this
                 mechanism, this research applies PageRank-based
                 mechanism to rank knowledge items synthetically. The
                 system appraises the knowledge items provided by
                 learners based on their rank, other users remarks and
                 most importantly teachers' and realm experts' remarks,
                 thus picks out the KIs to the knowledge base. In return
                 the users' grade will be upgraded or degraded by their
                 KIs. Learners are served with knowledge that best
                 matches their needs and encouraged by each other. Thus
                 this study sets up an aspiring and aggressive
                 collaborative learning environment. Experiments results
                 have shown that the developed system.",
  acknowledgement = ack-nhfb,
  keywords =     "Collaborative/cooperative learning; fairness gene;
                 knowledge acquiring; PageRank",
}

%%% ====================================================================
%%% Cross-referenced entries must come last; they are sorted in volume
%%% order with ``bibsort --byseriesvolume'':

@Proceedings{Aiello:2008:AMW,
  editor =       "William Anthony Aiello and others",
  booktitle =    "{Algorithms and models for the web-graph: fourth
                 international workshop, WAW 2006, Banff, Canada,
                 November 30--December 1, 2006: revised papers}",
  title =        "{Algorithms and models for the web-graph: fourth
                 international workshop, WAW 2006, Banff, Canada,
                 November 30--December 1, 2006: revised papers}",
  volume =       "4936",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 165",
  year =         "2008",
  ISBN =         "3-540-78808-5, 3-540-78807-7",
  ISBN-13 =      "978-3-540-78808-9, 978-3-540-78807-2",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "QA76.9.A43 W39 2006",
  bibdate =      "Thu May 6 08:22:51 MDT 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  meetingname =  "WAW 2006 (2006: Banff, Alta.)",
  subject =      "computer algorithms; congresses; data mining; computer
                 science; data mining and knowledge discovery;
                 information systems applications (including Internet)",
}

@Proceedings{Bubak:2008:CSI,
  editor =       "Marian Bubak and Geert Dick van Albada and Jack
                 Dongarra and Peter M. A. Sloot",
  booktitle =    "{Computational science -- ICCS 2008. 8th international
                 conference, Krak{\'o}w, Poland, June 23--25, 2008.
                 Proceedings, Part III}",
  title =        "{Computational science -- ICCS 2008. 8th international
                 conference, Krak{\'o}w, Poland, June 23--25, 2008.
                 Proceedings, Part III}",
  volume =       "5103",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxviii + 758",
  year =         "2008",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-69389-5",
  bibdate =      "Sat Sep 4 17:11:23 2010",
  bibsource =    "ftp://ftp.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib",
  series =       ser-LNCS,
  ZMnumber =     "1139.68302",
  acknowledgement = ack-nhfb,
  classmath =    "68-06 (Proceedings of conferences (computer science))
                 00B25 (Proceedings of conferences of miscellaneous
                 specific interest)",
  remark =       "For the preceding conference see Zbl 1137.68307, Zbl
                 1137.68308, Zbl 1137.68309 and Zbl 1137.68310.",
}

@Proceedings{Buchmann:2008:PQC,
  editor =       "Johannes Buchmann and Jintai Ding",
  booktitle =    "{Post-Quantum Cryptography: Second International
                 Workshop, PQCrypto 2008 Cincinnati, OH, USA, October
                 17--19, 2008 Proceedings}",
  title =        "{Post-Quantum Cryptography: Second International
                 Workshop, PQCrypto 2008 Cincinnati, OH, USA, October
                 17--19, 2008 Proceedings}",
  volume =       "5299",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 231",
  year =         "2008",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-88403-3",
  ISBN =         "3-540-88403-3",
  ISBN-13 =      "978-3-540-88403-3",
  LCCN =         "????",
  bibdate =      "Thu Apr 21 17:24:28 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2008a.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  keywords =     "access control; AES; authentication; code-based
                 cryptography; cryptanalysis; cryptographic attacks;
                 cryptographic protocols; cryptography; cryptology;
                 cryptosystems; digital signatures; elliptic curves;
                 hash functions; map decomposition; McEliece
                 cryptosystem; Merkle signatures; multivariate
                 cryptography; pairing computation; post quantum
                 cryptography; provable security; public key
                 cryptography; quantum cryptography; rational
                 polynomials; ring signatures; RSA cryptosystems;
                 security analysis; side channel attacks; signature
                 schemes; stream ciphers; symmetric key cryptosystems",
  subject =      "Algorithm Analysis and Problem Complexity; Computer
                 Communication Networks; Computer Science; Computer
                 software; Data Encryption; Data encryption (Computer
                 science); Data protection; Information Systems;
                 Information Systems Applications; Management of
                 Computing and Information Systems; Systems and Data
                 Security",
  xxeditor =     "David Hutchison and Moni Naor and Doug Tygar and
                 Jintai Ding and Madhu Sudan and Takeo Kanade and Josef
                 Kittler and Moshe Y Vardi and C {Pandu Rangan} and
                 Gerhard Weikum and Jon M Kleinberg and John C Mitchell
                 and Oscar Nierstrasz and Bernhard Steffen and Johannes
                 Buchmann and Friedemann Mattern and Demetri
                 Terzopoulos",
}